Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Jan Camenisch
Search web for home page
Program Committees
1
2018
Eurocrypt
pc
2
2015
Eurocrypt
pc
3
2013
Crypto
pc
4
2009
PKC
pc
5
2005
Crypto
pc
6
2004
Eurocrypt
pc chair
7
2004
Eurocrypt
general chair
8
2003
Crypto
pc
9
2001
Eurocrypt
pc
10
2001
Crypto
pc
Publications
year
title
booktitle
pages
1
2018
The Wonderful World of Global Random Oracles
eurocrypt
280-312
2
2017
Chameleon-Hashes with Ephemeral Trapdoors - And Applications to Invisible Sanitizable Signatures
pkc
152-182
3
2017
Anonymous Attestation with Subverted TPMs
crypto
427-461
4
2016
UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
crypto
208-239
5
2016
Universally Composable Direct Anonymous Attestation
pkc
234-264
6
2016
Universal Composition with Responsive Environments
asiacrypt
online
7
2015
Computing on Authenticated Data
jofc
351-395
8
2015
Composable & Modular Anonymous Credentials: Definitions and Practical Constructions
eprint
580
9
2015
Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions
eprint
6
10
2015
Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions
pkc
online
11
2015
Composable and Modular Anonymous Credentials: Definitions and Practical Constructions
asiacrypt
online
12
2014
Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment
crypto
online
13
2014
On the Impossibility of Structure-Preserving Deterministic Primitives
tcc
online
14
2014
Privacy-Preserving Auditing for Attribute-Based Credentials
eprint
468
15
2014
Memento: How to Reconstruct your Secrets from a Single Password in a Hostile Environment
eprint
429
16
2014
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
asiacrypt
online
17
2012
Computing on Authenticated Data
tcc
online
18
2011
Oblivious Transfer with Hidden Access Control Lists
pkc
online
19
2011
A Framework for Practical Universally Composable Zero-Knowledge Protocols
asiacrypt
online
20
2011
Structure Preserving CCA Secure Encryption and Applications
asiacrypt
online
21
2010
Efficiency Limitations for Σ-Protocols for Group Homomorphisms
tcc
online
22
2010
Privacy-Enhancing Cryptography: From Theory into Practice
tcc
online
23
2010
Credential Authenticated Identification and Key Exchange
crypto
online
24
2010
Credential Authenticated Identification and Key Exchange
eprint
online
25
2010
Privacy-friendly Incentives and their Application to Wikipedia (Extended Version)
eprint
online
26
2009
Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data
pkc
online
27
2009
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
pkc
online
28
2009
A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks
eurocrypt
351-368
29
2009
On the Portability of Generalized Schnorr Proofs
eurocrypt
425-442
30
2009
Randomizable Proofs and Delegatable Anonymous Credentials
crypto
online
31
2009
On the Portability of Generalized Schnorr Proofs
eprint
online
32
2008
Efficient Protocols for Set Membership and Range Proofs
asiacrypt
online
33
2008
Simulatable Adaptive Oblivious Transfer
eprint
online
34
2008
Delegatable Anonymous Credentials
eprint
online
35
2008
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
eprint
online
36
2008
A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks
eprint
online
37
2008
Automatic Generation of Sound Zero-Knowledge Protocols
eprint
online
38
2007
Batch Verification of Short Signatures
eurocrypt
online
39
2007
Simulatable Adaptive Oblivious Transfer
eurocrypt
online
40
2007
Batch Verification of Short Signatures
eprint
online
41
2006
Remarks on "Analysis of One Popular Group Signature Scheme'' in Asiacrypt 2006
eprint
online
42
2006
How to Win the Clone Wars: \\ Efficient Periodic n-Times Anonymous Authentication
eprint
online
43
2005
A Formal Treatment of Onion Routing
crypto
online
44
2005
Compact E-Cash
eurocrypt
online
45
2005
Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order
pkc
online
46
2005
Compact E-Cash
eprint
online
47
2005
Practical Group Signatures without Random Oracles
eprint
online
48
2004
Signature Schemes and Anonymous Credentials from Bilinear Maps
crypto
online
49
2004
Direct Anonymous Attestation
eprint
online
50
2003
Practical Verifiable Encryption and Decryption of Discrete Logarithms
crypto
online
51
2002
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
crypto
online
52
2002
Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials
crypto
online
53
2002
Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products
eprint
online
54
2002
Practical Verifiable Encryption and Decryption of Discrete Logarithms
eprint
online
55
2001
An Identity Escrow Scheme with Appointed Verifiers
crypto
online
56
2001
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
eurocrypt
online
57
2001
An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation
eprint
online
58
2001
Efficient Revocation of Anonymous Group Membership
eprint
online
59
2000
Efficient Anonymous Fingerprinting with Group Signatures
asiacrypt
415-428
60
2000
Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes
asiacrypt
331-345
61
2000
A Practical and Provably Secure Coalition-Resistant Group Signature Scheme
crypto
online
62
2000
Optimistic Fair Secure Computation
crypto
online
63
2000
Confirmer Signature Schemes Secure against Adaptive Adversaries
eurocrypt
online
64
1999
Separability and Efficiency for Generic Group Signature Schemes
crypto
413-430
65
1999
Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes
eurocrypt
107-122
66
1999
Verifiable Encryption and Applications to Group Signatures and Signature Sharing
eprint
online
67
1998
A Group Signature Scheme with Improved Efficiency
asiacrypt
160-174
68
1997
Efficient Group Signature Schemes for Large Groups (Extended Abstract)
crypto
410-424
69
1997
Efficient and Generalized Group Signatures
eurocrypt
465-479
70
1995
Fair Blind Signatures
eurocrypt
209-219
71
1994
Blind Signatures Based on the Discrete Logarithm Problem
eurocrypt
428-432
Coauthors of Jan Camenisch
Masayuki Abe (1)
Jae Hyun Ahn (2)
Joy Algesheimer (2)
Giuseppe Ateniese (3)
Endre Bangerter (3)
Mira Belenkiy (2)
Fabrice Benhamouda (1)
Dan Boneh (2)
Ernest F. Brickell (1)
Christian Cachin (1)
Nathalie Casati (2)
Rafik Chaabouni (1)
Nishanth Chandran (2)
Melissa Chase (2)
Liqun Chen (1)
Ivan Damgård (2)
David Derler (1)
Rafael Dowsley (1)
Manu Drijvers (3)
Maria Dubovitskaya (5)
Robert R. Enderlein (3)
Tommaso Gagliardoni (1)
Thomas Groß (3)
Kristiyan Haralambiev (3)
Peter Hladky (1)
Christian Hoertnagl (1)
Susan Hohenberger (8)
Marc Joye (2)
Aggelos Kiayias (2)
Markulf Kohlweiss (9)
Stephan Krenn (6)
Ralf Küsters (1)
Jorn Lapon (1)
Anja Lehmann (6)
Anna Lysyanskaya (14)
Vadim Lyubashevsky (1)
Ueli Maurer (1)
Breno de Medeiros (1)
Mira Meyerovich (1)
Markus Michels (4)
Vincent Naessens (1)
Gregory Neven (10)
Michael Østergaard Pedersen (2)
Jean-Marc Piveteau (2)
Henrich Christopher Pöhls (1)
Daniel Rausch (1)
Alfredo Rial (3)
Ahmad-Reza Sadeghi (1)
Kai Samelin (1)
Thomas Schneider (1)
Hovav Shacham (2)
Caroline Sheedy (1)
Abhi Shelat (5)
Victor Shoup (9)
Daniel Slamanig (1)
Claudio Soriente (2)
Markus Stadler (3)
Gene Tsudik (2)
Brent Waters (2)
Moti Yung (2)
Gregory M. Zaverucha (1)