You can also view these on my 🎓 Google Scholar profile.
Johannes Blömer, Henrik Bröcher, Jan Bobolz
On the impossibility of surviving (iterated) deletion of weakly dominated strategies in rational MPC
Preprinted [🔍 micro abstract] [📄 ePrint] Most known rational multi-party computation protocols are actually weakly dominated (and hence game-theoretically “insecure”).
Jan Bobolz, Fabian Eidens, Raphael Heitjohann, Jeremy Fell
Cryptimeleon: A Library for Fast Prototyping of Privacy-Preserving Cryptographic Schemes
Preprinted [🔍 micro abstract] [📄 ePrint] [🌍 website] [🐦 tweet] Explaining design decisions and some theory behind our prototyping library. Also contains an implementation-friendly view on Schnorr-style protocols.
Jan Bobolz, Fabian Eidens, Stephan Krenn, Sebastian Ramacher, Kai Samelin
Issuer-Hiding Attribute-Based Credentials
CANS 2021 [🔍 micro abstract] [📄 ePrint] [📺 presentation] Efficient construction of anonymous credentials. Allows verifiers to specify a list of acceptable issuers. The verifier does not learn who (from that list) issued the credential.
Jan Bobolz, Fabian Eidens, Stephan Krenn, Daniel Slamanig, Christoph Striecks
Privacy-Preserving Incentive Systems with Highly Efficient Point-Collection
AsiaCCS 2020 [🔍 micro abstract] [📄 ePrint] [📺 presentation] An anonymous point collection system, using blind signatures from structure-preserving signatures on equivalence classes for efficient and simple privacy-preserving additive updates. Also features offline double-spending protection, a secure retry mechanism, …
Johannes Blömer, Jan Bobolz, Denis Diemert, Fabian Eidens
Updatable Anonymous Credentials and Applications to Incentive Systems
CCS 2019 [🔍 micro abstract] [📄 ePrint] [📺 presentation] An anonymous credential system with a simple privacy-preserving mechanism to update attributes blindly. We use that to build a more efficient anonymous point collection system (updating the point count attribute). Features offline double-spending protection.
Johannes Blömer, Jan Bobolz
Delegatable Attribute-based Anonymous Credentials from Dynamically Malleable Signatures
ACNS 2018 [🔍 micro abstract] [📄 ePrint] [📺 presentation] A delegatable anonymous credential system that does not encode the delegation chain. Instead, uses dynamically malleable signatures that allows users to freely change some parts of the attribute vector, and delegate a lesser version of that capabililty to others.
Kai Bemmann, Johannes Blömer, Jan Bobolz, Henrik Bröcher, Denis Diemert, Fabian Eidens, Lukas Eilers, Jan Haltermann, Jakob Juhnke, Burhan Otour, Laurens Porzenheim, Simon Pukrop, Erik Schilling, Michael Schlichtig, Marcel Stienemeier
Fully-Featured Anonymous Credentials with Reputation System
SECPID (ARES workshop) 2018 [🔍 micro abstract] [📄 ePrint] [🐦 tweet] An anonymous credential system built by our student project group. We discuss features and note that typical anonymous reputation systems can be built generically from anonymous credentials.
Efficient Verifier-Local Revocation for Anonymous Credentials
Master’s Thesis. Paderborn University. 2015 [🔍 micro abstract] [📄 PDF] We build a basic accumulator-based ring signature and use it to generically augment any group signature scheme with verifier-local revocation. Also contains a (naive) security definition for anonymous credentials.
Security Proofs for Pairing-Based Cryptography in the Generic Group Model
Bachelor’s Thesis. Paderborn University. 2013 [🔍 micro abstract] [📄 PDF] We generalize the BBG uber assumption to work with expressions of the form and prove it in the generic group model.