• What's new
• Archive
• Best Papers
• Videos
• Authors
• Coauthors
• By year
• By conference
• All Committees
• Most Committees
• Report errors
• Maps
• About

Jan Camenisch  Search web for home page

Program Committees

Publications

	year	title	booktitle	pages
1	2017	Chameleon-Hashes with Ephemeral Trapdoors - And Applications to Invisible Sanitizable Signatures	pkc	152-182
2	2016	Universal Composition with Responsive Environments	asiacrypt	online
3	2016	UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens	crypto	208-239
4	2016	Universally Composable Direct Anonymous Attestation	pkc	234-264
5	2015	Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions	pkc	283-307
6	2015	Two-Server Password-Authenticated Secret Sharing UC-Secure Against Transient Corruptions	eprint	6
7	2015	Computing on Authenticated Data	jofc	351-395
8	2015	Composable & Modular Anonymous Credentials: Definitions and Practical Constructions	eprint	580
9	2015	Composable and Modular Anonymous Credentials: Definitions and Practical Constructions	asiacrypt	262-288
10	2014	Memento: How to Reconstruct your Secrets from a Single Password in a Hostile Environment	eprint	429
11	2014	Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures	asiacrypt	551-572
12	2014	Memento: How to Reconstruct Your Secrets from a Single Password in a Hostile Environment	crypto	256-275
13	2014	Privacy-Preserving Auditing for Attribute-Based Credentials	eprint	468
14	2014	On the Impossibility of Structure-Preserving Deterministic Primitives	tcc	713-738
15	2012	Computing on Authenticated Data	tcc	1-20
16	2011	A Framework for Practical Universally Composable Zero-Knowledge Protocols	asiacrypt	449-467
17	2011	Structure Preserving CCA Secure Encryption and Applications	asiacrypt	89-106
18	2011	Oblivious Transfer with Hidden Access Control Lists	pkc	192
19	2010	Privacy-friendly Incentives and their Application to Wikipedia (Extended Version)	eprint	online
20	2010	Efficiency Limitations for Σ-Protocols for Group Homomorphisms	tcc	553-571
21	2010	Privacy-Enhancing Cryptography: From Theory into Practice	tcc	498
22	2010	Credential Authenticated Identification and Key Exchange	crypto	255-276
23	2010	Credential Authenticated Identification and Key Exchange	eprint	online
24	2009	On the Portability of Generalized Schnorr Proofs	eprint	online
25	2009	Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data	pkc	196-214
26	2009	An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials	pkc	481-500
27	2009	Randomizable Proofs and Delegatable Anonymous Credentials	crypto	108-125
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	2008	Simulatable Adaptive Oblivious Transfer	eprint	online
31	2008	Efficient Protocols for Set Membership and Range Proofs	asiacrypt	234-252
32	2008	Delegatable Anonymous Credentials	eprint	online
33	2008	An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials	eprint	online
34	2008	A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks	eprint	online
35	2008	Automatic Generation of Sound Zero-Knowledge Protocols	eprint	online
36	2007	Batch Verification of Short Signatures	eurocrypt	246-263
37	2007	Simulatable Adaptive Oblivious Transfer	eurocrypt	573-590
38	2007	Batch Verification of Short Signatures	eprint	online
39	2006	How to Win the Clone Wars: \\ Efficient Periodic n-Times Anonymous Authentication	eprint	online
40	2006	Remarks on "Analysis of One Popular Group Signature Scheme'' in Asiacrypt 2006	eprint	online
41	2005	Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order	pkc	online
42	2005	A Formal Treatment of Onion Routing	crypto	online
43	2005	Compact E-Cash	eprint	online
44	2005	Compact E-Cash	eurocrypt	online
45	2005	Practical Group Signatures without Random Oracles	eprint	online
46	2004	Signature Schemes and Anonymous Credentials from Bilinear Maps	crypto	online
47	2004	Direct Anonymous Attestation	eprint	online
48	2003	Practical Verifiable Encryption and Decryption of Discrete Logarithms	crypto	online
49	2002	Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials	crypto	online
50	2002	Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products	eprint	online
51	2002	Practical Verifiable Encryption and Decryption of Discrete Logarithms	eprint	online
52	2002	Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products	crypto	online
53	2001	Efficient Revocation of Anonymous Group Membership	eprint	online
54	2001	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation	eurocrypt	93-118
55	2001	An Identity Escrow Scheme with Appointed Verifiers	crypto	388-407
56	2001	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation	eprint	online
57	2000	Efficient Anonymous Fingerprinting with Group Signatures	asiacrypt	415-428
58	2000	Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes	asiacrypt	331-345
59	2000	Confirmer Signature Schemes Secure against Adaptive Adversaries	eurocrypt	243-258
60	2000	Optimistic Fair Secure Computation	crypto	93-111
61	2000	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme	crypto	255-270
62	1999	Verifiable Encryption and Applications to Group Signatures and Signature Sharing	eprint	online
63	1999	Separability and Efficiency for Generic Group Signature Schemes	crypto	413-430
64	1999	Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes	eurocrypt	107-122
65	1998	A Group Signature Scheme with Improved Efficiency	asiacrypt	160-174
66	1997	Efficient Group Signature Schemes for Large Groups (Extended Abstract)	crypto	410-424
67	1997	Efficient and Generalized Group Signatures	eurocrypt	465-479
68	1995	Fair Blind Signatures	eurocrypt	209-219
69	1994	Blind Signatures Based on the Discrete Logarithm Problem	eurocrypt	428-432

Coauthors of Jan Camenisch

1. Masayuki Abe (1)
2. Jae Hyun Ahn (2)
3. Joy Algesheimer (2)
4. Giuseppe Ateniese (3)
5. Endre Bangerter (3)
6. Mira Belenkiy (2)
7. Fabrice Benhamouda (1)
8. Dan Boneh (2)
9. Ernest F. Brickell (1)
10. Christian Cachin (1)
11. Nathalie Casati (2)
12. Rafik Chaabouni (1)
13. Nishanth Chandran (2)
14. Melissa Chase (2)
15. Liqun Chen (1)
16. Ivan Damgård (2)
17. David Derler (1)
18. Rafael Dowsley (1)
19. Manu Drijvers (1)
20. Maria Dubovitskaya (5)
21. Robert R. Enderlein (3)
22. Thomas Groß (3)
23. Kristiyan Haralambiev (3)
24. Peter Hladky (1)
25. Christian Hoertnagl (1)
26. Susan Hohenberger (8)
27. Marc Joye (2)
28. Ralf Küsters (1)
29. Aggelos Kiayias (2)
30. Markulf Kohlweiss (9)
31. Stephan Krenn (6)
32. Jorn Lapon (1)
33. Anja Lehmann (4)
34. Anna Lysyanskaya (14)
35. Vadim Lyubashevsky (1)
36. Ueli M. Maurer (1)
37. Breno de Medeiros (1)
38. Mira Meyerovich (1)
39. Markus Michels (4)
40. Vincent Naessens (1)
41. Gregory Neven (9)
42. Henrich Christopher Pöhls (1)
43. Michael Østergaard Pedersen (2)
44. Jean-Marc Piveteau (2)
45. Daniel Rausch (1)
46. Alfredo Rial (3)
47. Ahmad-Reza Sadeghi (1)
48. Kai Samelin (1)
49. Thomas Schneider (1)
50. Hovav Shacham (2)
51. Caroline Sheedy (1)
52. Abhi Shelat (5)
53. Victor Shoup (9)
54. Daniel Slamanig (1)
55. Claudio Soriente (2)
56. Markus Stadler (3)
57. Gene Tsudik (2)
58. Brent Waters (2)
59. Moti Yung (2)
60. Gregory M. Zaverucha (1)