Jan Camenisch

Orcid: 0000-0001-6654-9459

Affiliations:
  • IBM Research Zurich, Switzerland


According to our database1, Jan Camenisch authored at least 179 papers between 1994 and 2021.

Collaborative distances:

Awards

ACM Fellow

ACM Fellow 2018, "For contributions to privacy-enhancing cryptographic protocols and leadership in their practical realization".

IEEE Fellow

IEEE Fellow 2013, "For contributions to privacy-enhancing cryptographic protocols".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Internet Computer Consensus.
IACR Cryptol. ePrint Arch., 2021

Concise UC Zero-Knowledge Proofs for Oblivious Updatable Databases.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

2020
Zone Encryption with Anonymous Authentication for V2V Communication.
IACR Cryptol. ePrint Arch., 2020

Short Threshold Dynamic Group Signatures.
IACR Cryptol. ePrint Arch., 2020

Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy.
IACR Cryptol. ePrint Arch., 2020

2019
On the Impossibility of Structure-Preserving Deterministic Primitives.
J. Cryptol., 2019

iUC: Flexible Universal Composability Made Simple.
IACR Cryptol. ePrint Arch., 2019

Efficient Fully Secure Leakage-Deterring Encryption.
IACR Cryptol. ePrint Arch., 2019

Multi-Protocol UC and its Use for Building Modular and Efficient Protocols.
IACR Cryptol. ePrint Arch., 2019

Fast Keyed-Verification Anonymous Credentials on Standard Smart Cards.
IACR Cryptol. ePrint Arch., 2019

Oblivious PRF on Committed Vector Inputs and Application to Deduplication of Encrypted Data.
IACR Cryptol. ePrint Arch., 2019

Password-Authenticated Public-Key Encryption.
IACR Cryptol. ePrint Arch., 2019

Privacy-preserving auditable token payments in a permissioned blockchain system.
IACR Cryptol. ePrint Arch., 2019

More efficient, provably-secure direct anonymous attestation from lattices.
Future Gener. Comput. Syst., 2019

Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042).
Dagstuhl Reports, 2019

2018
L-DAA: Lattice-Based Direct Anonymous Attestation.
IACR Cryptol. ePrint Arch., 2018

The Wonderful World of Global Random Oracles.
IACR Cryptol. ePrint Arch., 2018

Floppy-Sized Group Signatures from Lattices.
IACR Cryptol. ePrint Arch., 2018

2017
Privacy for Distributed Databases via (Un)linkable Pseudonyms.
IACR Cryptol. ePrint Arch., 2017

Anonymous Attestation with Subverted TPMs.
IACR Cryptol. ePrint Arch., 2017

Chameleon-Hashes with Ephemeral Trapdoors And Applications to Invisible Sanitizable Signatures.
IACR Cryptol. ePrint Arch., 2017

One TPM to Bind Them All: Fixing TPM 2.0 for Provably Secure Anonymous Attestation.
IACR Cryptol. ePrint Arch., 2017

Updatable Tokenization: Formal Definitions and Provably Secure Constructions.
IACR Cryptol. ePrint Arch., 2017

Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs.
IACR Cryptol. ePrint Arch., 2017

Practical Strongly Invisible and Strongly Accountable Sanitizable Signatures.
IACR Cryptol. ePrint Arch., 2017

Accumulators with Applications to Anonymity-Preserving Revocation.
IACR Cryptol. ePrint Arch., 2017

Privacy-preserving attribute-based credentials in cooperative intelligent transport systems.
Proceedings of the 2017 IEEE Vehicular Networking Conference, 2017

Directions in Security Research.
Proceedings of the 14th International Joint Conference on e-Business and Telecommunications (ICETE 2017), 2017

Privacy-Preserving User-Auditable Pseudonym Systems.
Proceedings of the 2017 IEEE European Symposium on Security and Privacy, 2017

UC-Secure Non-interactive Public-Key Encryption.
Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

Practical UC-Secure Delegatable Credentials with Attributes and Their Application to Blockchain.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Memory Erasability Amplification.
IACR Cryptol. ePrint Arch., 2016

Universal Composition with Responsive Environments.
IACR Cryptol. ePrint Arch., 2016

UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens.
IACR Cryptol. ePrint Arch., 2016

Anonymous Attestation Using the Strong Diffie Hellman Assumption Revisited.
IACR Cryptol. ePrint Arch., 2016

Scalable Revocation Scheme for Anonymous Credentials Based on n-times Unlinkable Proofs.
Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016

2015
Computing on Authenticated Data.
J. Cryptol., 2015

Virtual Smart Cards: How to Sign with a Password and a Server.
IACR Cryptol. ePrint Arch., 2015

Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions.
IACR Cryptol. ePrint Arch., 2015

Universally Composable Direct Anonymous Attestation.
IACR Cryptol. ePrint Arch., 2015

Composable & Modular Anonymous Credentials: Definitions and Practical Constructions.
IACR Cryptol. ePrint Arch., 2015

A Single Password for Everything?
ERCIM News, 2015

Strengthening Authentication with Privacy-Preserving Location Verification of Mobile Phones.
Proceedings of the 14th ACM Workshop on Privacy in the Electronic Society, 2015

Optimal Distributed Password Verification.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

(Un)linkable Pseudonyms for Governmental Databases.
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, 2015

Composable and Modular Anonymous Credentials: Definitions and Practical Constructions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2015 - 21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29, 2015

Recovering Lost Device-Bound Credentials.
Proceedings of the Applied Cryptography and Network Security, 2015

Further Challenges.
Proceedings of the Attribute-based Credentials for Trust: Identity in the Information Society, 2015

Cryptographic Protocols Underlying Privacy-ABCs.
Proceedings of the Attribute-based Credentials for Trust: Identity in the Information Society, 2015

An Architecture for Privacy-ABCs.
Proceedings of the Attribute-based Credentials for Trust: Identity in the Information Society, 2015

2014
Concepts and languages for privacy-preserving attribute-based authentication.
J. Inf. Secur. Appl., 2014

Privacy-Preserving Auditing for Attribute-Based Credentials.
IACR Cryptol. ePrint Arch., 2014

Memento: How to Reconstruct your Secrets from a Single Password in a Hostile Environment.
IACR Cryptol. ePrint Arch., 2014

Formal Treatment of Privacy-Enhancing Credential Systems.
IACR Cryptol. ePrint Arch., 2014

Integration of Data-Minimising Authentication into Authorisation Systems.
Proceedings of the Trust and Trustworthy Computing - 7th International Conference, 2014

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures.
Proceedings of the Advances in Cryptology - ASIACRYPT 2014, 2014

2013
Guest editors' introduction.
Math. Comput. Model., 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over Z<sub>n</sub>.
IACR Cryptol. ePrint Arch., 2013

Anonymously sharing Flickr pictures with facebook friends.
Proceedings of the 12th annual ACM Workshop on Privacy in the Electronic Society, 2013

Research Challenges to Secure the Future Internet.
Proceedings of the Secure Data Management - 10th VLDB Workshop, 2013

Concepts Around Privacy-Preserving Attribute-Based Credentials - Making Authentication with Anonymous Credentials Practical.
Proceedings of the Privacy and Identity Management for Emerging Services and Technologies, 2013

Concepts and Languages for Privacy-Preserving Attribute-Based Authentication.
Proceedings of the Policies and Research in Identity Management, 2013

Practical and Employable Protocols for UC-Secure Circuit Evaluation over ℤn.
Proceedings of the Computer Security - ESORICS 2013, 2013

Universally composable adaptive oblivious transfer (with access control) from standard assumptions.
Proceedings of the DIM'13, 2013

2012
Efficient Attributes for Anonymous Credentials.
ACM Trans. Inf. Syst. Secur., 2012

Batch Verification of Short Signatures.
J. Cryptol., 2012

Electronic Identities Need Private Credentials.
IEEE Secur. Priv., 2012

Fair Private Set Intersection with a Semi-trusted Arbiter.
IACR Cryptol. ePrint Arch., 2012

Fully Anonymous Attribute Tokens from Lattices.
IACR Cryptol. ePrint Arch., 2012

Practical Yet Universally Composable Two-Server Password-Authenticated Secret Sharing.
IACR Cryptol. ePrint Arch., 2012

Oblivious Transfer with Hidden Access Control from Attribute-Based Encryption.
IACR Cryptol. ePrint Arch., 2012

Privacy-Oriented Cryptography (Dagstuhl Seminar 12381).
Dagstuhl Reports, 2012

Information privacy?!
Comput. Networks, 2012

Efficient Structure-Preserving Signature Scheme from Standard Assumptions.
Proceedings of the Security and Cryptography for Networks - 8th International Conference, 2012

A calculus for privacy-friendly authentication.
Proceedings of the 17th ACM Symposium on Access Control Models and Technologies, 2012

Data-Minimizing Authentication Goes Mobile.
Proceedings of the Communications and Multimedia Security, 2012

2011
Further Privacy Mechanisms.
Proceedings of the Digital Privacy - PRIME - Privacy and Identity Management for Europe, 2011

Conclusion and Outlook.
Proceedings of the Digital Privacy - PRIME - Privacy and Identity Management for Europe, 2011

An Introduction to Privacy-Enhancing Identity Management.
Proceedings of the Digital Privacy - PRIME - Privacy and Identity Management for Europe, 2011

Pseudonyms and Private Credentials.
Proceedings of the Digital Privacy - PRIME - Privacy and Identity Management for Europe, 2011

A Framework for Practical Universally Composable Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2011

Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties.
IACR Cryptol. ePrint Arch., 2011

Recognizing Your Digital Friends.
Proceedings of the PASSAT/SocialCom 2011, Privacy, 2011

Oblivious Transfer with Hidden Access Control Policies.
Proceedings of the Public Key Cryptography - PKC 2011, 2011

Identity management tools for protecting online privacy.
Proceedings of the DIM'11, Proceedings of the 2013 ACM Workshop on Digital Identity Management, Chicago, IL, USA, 2011

A comprehensive framework enabling data-minimizing authentication.
Proceedings of the DIM'11, Proceedings of the 2013 ACM Workshop on Digital Identity Management, Chicago, IL, USA, 2011

Cryptographic primitives for building secure and privacy respecting protocols.
Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Structure Preserving CCA Secure Encryption and Applications.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

PrimeLife.
Proceedings of the Privacy and Identity Management for Life, 2011

Trustworthiness of Online Content.
Proceedings of the Privacy and Identity Management for Life, 2011

Open Source Contributions.
Proceedings of the Privacy and Identity Management for Life, 2011

PrimeLife's Legacy.
Proceedings of the Privacy and Identity Management for Life, 2011

Cryptographic Mechanisms for Privacy.
Proceedings of the Privacy and Identity Management for Life, 2011

2010
JCS special issue on EU-funded ICT research on Trust and Security.
J. Comput. Secur., 2010

Exploiting cryptography for privacy-enhanced access control: A result of the PRIME Project.
J. Comput. Secur., 2010

Encrypting Keys Securely.
IEEE Secur. Priv., 2010

Privacy-friendly Incentives and their Application to Wikipedia (Extended Version).
IACR Cryptol. ePrint Arch., 2010

Efficient Attributes for Anonymous Credentials (Extended Version).
IACR Cryptol. ePrint Arch., 2010

Credential Authenticated Identification and Key Exchange.
IACR Cryptol. ePrint Arch., 2010

Privacy-Enhancing Cryptography: From Theory into Practice.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Efficiency Limitations for Σ-Protocols for Group Homomorphisms.
Proceedings of the Theory of Cryptography, 7th Theory of Cryptography Conference, 2010

Solving Revocation with Efficient Update of Anonymous Credentials.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

Get Shorty via Group Signatures without Encryption.
Proceedings of the Security and Cryptography for Networks, 7th International Conference, 2010

A card requirements language enabling privacy-preserving access control.
Proceedings of the 15th ACM Symposium on Access Control Models and Technologies, 2010

Privacy-Friendly Incentives and Their Application to Wikipedia.
Proceedings of the Policies and Research in Identity Management, 2010

Mixing Identities with Ease.
Proceedings of the Policies and Research in Identity Management, 2010

A Formal Model of Identity Mixer.
Proceedings of the Formal Methods for Industrial Critical Systems, 2010

Unlinkable Priced Oblivious Transfer with Rechargeable Wallets.
Proceedings of the Financial Cryptography and Data Security, 14th International Conference, 2010

2009
Remarks on ''Analysis of one popular group signature scheme'' in Asiacrypt 2006.
Int. J. Appl. Cryptogr., 2009

On the Portability of Generalized Schnorr Proofs.
IACR Cryptol. ePrint Arch., 2009

Oblivious Transfer with Access Control.
IACR Cryptol. ePrint Arch., 2009

Efficiency Limitations for Sigma-Protocols for Group Homomorphisms.
IACR Cryptol. ePrint Arch., 2009

Saving On-Line Privacy.
Proceedings of the Privacy and Identity Management for Life, 2009

Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data.
Proceedings of the Public Key Cryptography, 2009

Private Intersection of Certified Sets.
Proceedings of the Financial Cryptography and Data Security, 2009

Randomizable Proofs and Delegatable Anonymous Credentials.
Proceedings of the Advances in Cryptology, 2009

Anonymous credentials on a standard java card.
Proceedings of the 2009 ACM Conference on Computer and Communications Security, 2009

2008
Simulatable Adaptive Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2008

A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks.
IACR Cryptol. ePrint Arch., 2008

Delegatable Anonymous Credentials.
IACR Cryptol. ePrint Arch., 2008

Automatic Generation of Sound Zero-Knowledge Protocols.
IACR Cryptol. ePrint Arch., 2008

Rethinking accountable privacy supporting services: extended abstract.
Proceedings of the 4th Workshop on Digital Identity Management, 2008

Efficient Protocols for Set Membership and Range Proofs.
Proceedings of the Advances in Cryptology, 2008

2007
User centricity: A taxonomy and open issues.
J. Comput. Secur., 2007

Endorsed E-Cash.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Federated Identity Management.
Proceedings of the Security, Privacy, and Trust in Modern Data Management, 2007

2006
How to Win the Clone Wars: Efficient Periodic n-Times Anonymous Authentication.
IACR Cryptol. ePrint Arch., 2006

Fine-grained forward-secure signature schemes without random oracles.
Discret. Appl. Math., 2006

Enhancing privacy of federated identity management protocols: anonymous credentials in WS-security.
Proceedings of the 2006 ACM Workshop on Privacy in the Electronic Society, 2006

A General Certification Framework with Applications to Privacy-Enhancing Certificate Infrastructures.
Proceedings of the Security and Privacy in Dynamic Environments, 2006

Anonymous Credentials: Opportunities and Challenges.
Proceedings of the Security and Privacy in Dynamic Environments, 2006

Protecting (Anonymous) Credentials with the Trusted Computing Group's TPM V1.2.
Proceedings of the Security and Privacy in Dynamic Environments, 2006

Balancing Accountability and Privacy Using E-Cash (Extended Abstract).
Proceedings of the Security and Cryptography for Networks, 5th International Conference, 2006

Securing user inputs for the web.
Proceedings of the 2006 Workshop on Digital Identity Management, 2006

How to win the clonewars: efficient periodic n-times anonymous authentication.
Proceedings of the 13th ACM Conference on Computer and Communications Security, 2006

2005
Compact E-Cash.
IACR Cryptol. ePrint Arch., 2005

Practical Group Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2005

Anonymous yet accountable access control.
Proceedings of the 2005 ACM Workshop on Privacy in the Electronic Society, 2005

Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order.
Proceedings of the Public Key Cryptography, 2005

Mix-Network with Stronger Security.
Proceedings of the Privacy Enhancing Technologies, 5th International Workshop, 2005

Privacy and identity management for everyone.
Proceedings of the 2005 Workshop on Digital Identity Management, 2005

A Formal Treatment of Onion Routing.
Proceedings of the Advances in Cryptology, 2005

Untraceable RFID tags via insubvertible encryption.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
Privacy-enhancing identity management.
Inf. Secur. Tech. Rep., 2004

Direct Anonymous Attestation.
IACR Cryptol. ePrint Arch., 2004

A Cryptographic Framework for the Controlled Release of Certified Data.
Proceedings of the Security Protocols, 2004

Efficient Blind Signatures Without Random Oracles.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Group Signatures: Better Efficiency and New Theoretical Aspects.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

Better Privacy for Trusted Computing Platforms: (Extended Abstract).
Proceedings of the Computer Security, 2004

Signature Schemes and Anonymous Credentials from Bilinear Maps.
Proceedings of the Advances in Cryptology, 2004

2002
Practical Verifiable Encryption and Decryption of Discrete Logarithms.
IACR Cryptol. ePrint Arch., 2002

Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products.
IACR Cryptol. ePrint Arch., 2002

A Signature Scheme with Efficient Protocols.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials.
Proceedings of the Advances in Cryptology, 2002

Design and implementation of the <i>idemix</i> anonymous credential system.
Proceedings of the 9th ACM Conference on Computer and Communications Security, 2002

2001
Efficient Revocation of Anonymous Group Membership.
IACR Cryptol. ePrint Arch., 2001

An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation.
IACR Cryptol. ePrint Arch., 2001

Cryptographic Security for Mobile Code.
Proceedings of the 2001 IEEE Symposium on Security and Privacy, 2001

An Identity Escrow Scheme with Appointed Verifiers.
Proceedings of the Advances in Cryptology, 2001

2000
One-Round Secure Computation and Secure Autonomous Mobile Agents.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

Confirmer Signature Schemes Secure against Adaptive Adversaries.
Proceedings of the Advances in Cryptology, 2000

Optimistic Fair Secure Computation.
Proceedings of the Advances in Cryptology, 2000

A Practical and Provably Secure Coalition-Resistant Group Signature Scheme.
Proceedings of the Advances in Cryptology, 2000

Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes.
Proceedings of the Advances in Cryptology, 2000

Efficient Anonymous Fingerprinting with Group Signatures.
Proceedings of the Advances in Cryptology, 2000

1999
Verifiable Encryption and Applications to Group Signatures and Signature Sharing.
IACR Cryptol. ePrint Arch., 1999

Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes.
Proceedings of the Advances in Cryptology, 1999

Separability and Efficiency for Generic Group Signature Schemes.
Proceedings of the Advances in Cryptology, 1999

1998
Group signature schemes and payment systems based on the discrete logarithm problem.
PhD thesis, 1998

A Group Signature Scheme with Improved Efficiency.
Proceedings of the Advances in Cryptology, 1998

1997
Digital Payment Systems With Passive Anonymity-Revoking Trustees.
J. Comput. Secur., 1997

Efficient and Generalized Group Signatures.
Proceedings of the Advances in Cryptology, 1997

Efficient Group Signature Schemes for Large Groups (Extended Abstract).
Proceedings of the Advances in Cryptology, 1997

1996
An Efficient Fair Payment System.
Proceedings of the CCS '96, 1996

1995
Faire anonyme Zahlungssysteme.
Proceedings of the GISI 95, 1995

Fair Blind Signatures.
Proceedings of the Advances in Cryptology, 1995

1994
Blind Signatures Based on the Discrete Logarithm Problem.
Proceedings of the Advances in Cryptology, 1994

An Efficient Electronic Payment System Protecting Privacy.
Proceedings of the Computer Security, 1994


  Loading...