• 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	2012	Computing on Authenticated Data	tcc	1-20
2	2011	A Framework for Practical Universally Composable Zero-Knowledge Protocols	asiacrypt	449-467
3	2011	Structure Preserving CCA Secure Encryption and Applications	asiacrypt	89-106
4	2011	Oblivious Transfer with Hidden Access Control Lists	pkc	192
5	2010	Privacy-friendly Incentives and their Application to Wikipedia (Extended Version)	eprint	online
6	2010	Efficiency Limitations for Σ-Protocols for Group Homomorphisms	tcc	553-571
7	2010	Privacy-Enhancing Cryptography: From Theory into Practice	tcc	498
8	2010	Credential Authenticated Identification and Key Exchange	crypto	255-276
9	2010	Credential Authenticated Identification and Key Exchange	eprint	online
10	2009	On the Portability of Generalized Schnorr Proofs	eprint	online
11	2009	Blind and Anonymous Identity-Based Encryption and Authorised Private Searches on Public Key Encrypted Data	pkc	196-214
12	2009	An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials	pkc	481-500
13	2009	Randomizable Proofs and Delegatable Anonymous Credentials	crypto	108-125
14	2009	A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks	eurocrypt	351-368
15	2009	On the Portability of Generalized Schnorr Proofs	eurocrypt	425-442
16	2008	Simulatable Adaptive Oblivious Transfer	eprint	online
17	2008	Efficient Protocols for Set Membership and Range Proofs	asiacrypt	234-252
18	2008	Delegatable Anonymous Credentials	eprint	online
19	2008	An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials	eprint	online
20	2008	A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks	eprint	online
21	2008	Automatic Generation of Sound Zero-Knowledge Protocols	eprint	online
22	2007	Batch Verification of Short Signatures	eurocrypt	246-263
23	2007	Simulatable Adaptive Oblivious Transfer	eurocrypt	573-590
24	2007	Batch Verification of Short Signatures	eprint	online
25	2006	How to Win the Clone Wars: \\ Efficient Periodic n-Times Anonymous Authentication	eprint	online
26	2006	Remarks on "Analysis of One Popular Group Signature Scheme'' in Asiacrypt 2006	eprint	online
27	2005	Efficient Proofs of Knowledge of Discrete Logarithms and Representations in Groups with Hidden Order	pkc	online
28	2005	A Formal Treatment of Onion Routing	crypto	online
29	2005	Compact E-Cash	eprint	online
30	2005	Compact E-Cash	eurocrypt	online
31	2005	Practical Group Signatures without Random Oracles	eprint	online
32	2004	Signature Schemes and Anonymous Credentials from Bilinear Maps	crypto	online
33	2004	Direct Anonymous Attestation	eprint	online
34	2003	Practical Verifiable Encryption and Decryption of Discrete Logarithms	crypto	online
35	2002	Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials	crypto	online
36	2002	Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products	eprint	online
37	2002	Practical Verifiable Encryption and Decryption of Discrete Logarithms	eprint	online
38	2002	Efficient Computation Modulo a Shared Secret with Application to the Generation of Shared Safe-Prime Products	crypto	online
39	2001	Efficient Revocation of Anonymous Group Membership	eprint	online
40	2001	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation	eurocrypt	93-118
41	2001	An Identity Escrow Scheme with Appointed Verifiers	crypto	388-407
42	2001	An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation	eprint	online
43	2000	Efficient Anonymous Fingerprinting with Group Signatures	asiacrypt	415-428
44	2000	Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes	asiacrypt	331-345
45	2000	Confirmer Signature Schemes Secure against Adaptive Adversaries	eurocrypt	243-258
46	2000	Optimistic Fair Secure Computation	crypto	93-111
47	2000	A Practical and Provably Secure Coalition-Resistant Group Signature Scheme	crypto	255-270
48	1999	Verifiable Encryption and Applications to Group Signatures and Signature Sharing	eprint	online
49	1999	Separability and Efficiency for Generic Group Signature Schemes	crypto	413-430
50	1999	Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes	eurocrypt	107-122
51	1998	A Group Signature Scheme with Improved Efficiency	asiacrypt	160-174
52	1997	Efficient Group Signature Schemes for Large Groups (Extended Abstract)	crypto	410-424
53	1997	Efficient and Generalized Group Signatures	eurocrypt	465-479
54	1995	Fair Blind Signatures	eurocrypt	209-219
55	1994	Blind Signatures Based on the Discrete Logarithm Problem	eurocrypt	428-432