Jan Camenisch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Jan Camenisch has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Anja Lehmann
IBM Research – Zurich
5 shared publications Gregory Neven
IBM Research - Zurich
5 shared publications- Stephan Krenn
AIT Austrian Institute of Technology
5 shared publications - Gregory Neven
IBM Research – Zurich
4 shared publications Anja Lehmann
IBM Research – Zurich
3 shared publications- Maria Dubovitskaya
IBM Reseach - Zurich
3 shared publications
Latest Publications
- 15 August 2018
- Published by Springer Nature
- p. 3-22
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- 15 August 2018
- Published by Springer Nature
- p. 3-22
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 131-138
Privacy-preserving attribute-based credentials in cooperative intelligent transport systems
In Cooperative Intelligent Transport Systems (C-ITSs), vehicles broadcast their location and other information over dedicated short-range radio channels. This communication must be authenticated to protect the information against tampering, but at the same time must be anonymous to protect the location privacy of the driver. The most prominent C-ITS solutions today let vehicles either store large numbers of preloaded pseudonym certificates, or let them regularly fetch new pseudonyms from an online authority. More advanced solutions based on group signatures or anonymous credentials allow vehicles to generate arbitrarily many pseudonyms locally, without requiring further interaction. These solutions, however, are vulnerable to Sybil attacks, as the compromised key material of a single vehicle could be used to impersonate an arbitrary number of vehicles simultaneously. In this paper, we propose a new generic approach for C-ITS authentication based on privacy-preserving Attribute-Based Credential (ABC) that generates pseudonyms locally on the vehicle, but where only one valid pseudonym can be generated at any given time. The computational performance and signature sizes of current Privacy-ABC schemes makes them more useful for low-frequency warning messages than for high-frequency beaconing. We therefore see our approach rather as a conceptual framework that can direct further research into more efficient dedicated implementations.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 131-138
Privacy-preserving attribute-based credentials in cooperative intelligent transport systems
In Cooperative Intelligent Transport Systems (C-ITSs), vehicles broadcast their location and other information over dedicated short-range radio channels. This communication must be authenticated to protect the information against tampering, but at the same time must be anonymous to protect the location privacy of the driver. The most prominent C-ITS solutions today let vehicles either store large numbers of preloaded pseudonym certificates, or let them regularly fetch new pseudonyms from an online authority. More advanced solutions based on group signatures or anonymous credentials allow vehicles to generate arbitrarily many pseudonyms locally, without requiring further interaction. These solutions, however, are vulnerable to Sybil attacks, as the compromised key material of a single vehicle could be used to impersonate an arbitrary number of vehicles simultaneously. In this paper, we propose a new generic approach for C-ITS authentication based on privacy-preserving Attribute-Based Credential (ABC) that generates pseudonyms locally on the vehicle, but where only one valid pseudonym can be generated at any given time. The computational performance and signature sizes of current Privacy-ABC schemes makes them more useful for low-frequency warning messages than for high-frequency beaconing. We therefore see our approach rather as a conceptual framework that can direct further research into more efficient dedicated implementations.
- 31 May 2017
- Published by Springer Nature
- p. 437-452
Practical Strongly Invisible and Strongly Accountable Sanitizable Signatures
- 31 May 2017
- Published by Springer Nature
- p. 437-452
Practical Strongly Invisible and Strongly Accountable Sanitizable Signatures
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 269-284
Privacy-Preserving User-Auditable Pseudonym Systems
Personal information is often gathered and processed in a decentralized fashion. Examples include health records and governmental data bases. To protect the privacy of individuals, no unique user identifier should be used across the different databases. At the same time, the utility of the distributed information needs to be preserved which requires that it be nevertheless possible to link different records if they relate to the same user. Recently, Camenisch and Lehmann (CCS 15) have proposed a pseudonym scheme that addresses this problem by domain-specific pseudonyms. Although being unlinkable, these pseudonyms can be converted by a central authority (the converter). To protect the users' privacy, conversions are done blindly without the converter learning the pseudonyms or the identity of the user. Unfortunately, their scheme sacrifices a crucial privacy feature: transparency. Users are no longer able to inquire with the converter and audit the flow of their personal data. Indeed, such auditability appears to be diametral to the goal of blind pseudonym conversion. In this paper we address these seemingly conflicting requirements and provide a system where user-centric audits logs are created by the oblivious converter while maintaining all privacy properties. We prove our protocol to be UC-secure and give an efficient instantiation using novel building blocks.
- 1 April 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 269-284
Privacy-Preserving User-Auditable Pseudonym Systems
Personal information is often gathered and processed in a decentralized fashion. Examples include health records and governmental data bases. To protect the privacy of individuals, no unique user identifier should be used across the different databases. At the same time, the utility of the distributed information needs to be preserved which requires that it be nevertheless possible to link different records if they relate to the same user. Recently, Camenisch and Lehmann (CCS 15) have proposed a pseudonym scheme that addresses this problem by domain-specific pseudonyms. Although being unlinkable, these pseudonyms can be converted by a central authority (the converter). To protect the users' privacy, conversions are done blindly without the converter learning the pseudonyms or the identity of the user. Unfortunately, their scheme sacrifices a crucial privacy feature: transparency. Users are no longer able to inquire with the converter and audit the flow of their personal data. Indeed, such auditability appears to be diametral to the goal of blind pseudonym conversion. In this paper we address these seemingly conflicting requirements and provide a system where user-centric audits logs are created by the oblivious converter while maintaining all privacy properties. We prove our protocol to be UC-secure and give an efficient instantiation using novel building blocks.
- 21 July 2016
- Published by Springer Nature
- Vol. 2016, 208-239
UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
- 21 July 2016
- Published by Springer Nature
- Vol. 2016, 208-239
UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
- 18 February 2016
- Published by Springer Nature
- Vol. 2015, 234-264
Universally Composable Direct Anonymous Attestation
- 18 February 2016
- Published by Springer Nature
- Vol. 2015, 234-264
Universally Composable Direct Anonymous Attestation