A cryptographic framework for the controlled release of certified data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3957 LNCS, Issue , 2006, Pages 20-50

  Bangerter, Endre ^a   Camenisch, Jan ^a   Lysyanskaya, Anna ^b   Blaze, Matt ^c   Crispo, Bruno ^c   Aura, Tuomas ^c   Christianson, Bruce ^c   Popescu, Bogdan ^c   Massacci, Fabio ^c   Eronen, Pasi ^c   Danezis, George ^c   Mayo, Bob ^c  

^a IBM RESEARCH ZURICH   (Switzerland)

^b Brown Univerity   (United States)

^c NONE

Author keywords

[No Author keywords available]

Indexed keywords

BIBLIOGRAPHIES; CRYPTOGRAPHY; DATA PRIVACY; INFORMATION RETRIEVAL; ONLINE SYSTEMS;

CERTIFIED DATA; CRYPTOGRAPHIC BUILDING BLOCKS;

DATA REDUCTION;

EID: 33749661564     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (50)

1. Portia project, website. crypto.stanford.edu/portia.
2. PRIME project, website. www.prime-project.eu.org.
3. N. Asokan, Victor Shoup, and Michael Waidner. Optimistic fair exchange of digital signatures. IEEE Journal on Selected Areas in Communications, 18(4):591-610, April 2000.
4. Giuseppe Ateniese, Jan Camenisch, Marc Joye, and Gene Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Mihir Bellare, editor, Advances in Cryptology - CRYPTO 2000, volume 1880 of LNCS, pages 255-270. Springer Verlag, 2000.
5. Niko Barić and Birgit Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Walter Fumy, editor, Advances in Cryptology EUROCRYPT '97, volume 1233 of LNCS, pages 480-494. Springer Verlag, 1997.
6. Mihir Bellare and Oded Goldreich. On defining proofs of knowledge. In Ernest F. Brickell, editor, Advances in Cryptology - CRYPTO '92, volume 740 of LNCS, pages 390-420. Springer-Verlag, 1992.
7. Dan Boneh and Matthew Franklin. Identity-based encryption from the Weil pairing. In Joe Kilian, editor, Advances in Cryptology - CRYPTO 2001, volume 2139 of LNCS, pages 213-229. Springer Verlag, 2001.
8. Dan Boneh and Alice Silverberg. Applications of multilinear forms to cryptography. In Topics in Algebraic and Noncommutative Geometry, Contemporary Mathematics, volume 324, pages 71-90. American Mathematical Society, 2003.
9. Stefan Brands. Untraceable off-line cash in wallets with observers. In Douglas R. Stinson, editor, Advances in Cryptology - CRYPTO '93, volume 773 of LNCS, pages 302-318, 1993.
10. Stefan Brands. Rethinking Public Key Infrastructure and Digital Certificates-Building in Privacy. PhD thesis, Eindhoven Institute of Technology, Eindhoven, The Netherlands, 1999.
11. Gilles Brassard, David Chaum, and Claude Crépeau. Minimum disclosure proofs of knowledge. Journal of Computer and System Sciences, 37(2):156-189, October 1988.
12. Ernie Brickell, Jan Camenisch, and Liqun Chen. Direct anonymous attestation. Technical Report Research Report RZ 3450, IBM Research Division, March 2004.
13. Jan Camenisch and Ivan Damgård. Verifiable encryption, group encryption, and their applications to group signatures and signature sharing schemes. In Tatsuaki Okamoto, editor, Advances in Cryptology - ASIACRYPT 2000, volume 1976 of LNCS, pages 331-345. Springer Verlag, 2000.
14. Jan Camenisch and Jens Groth. Group signatures: Better efficiency and new theoretical aspects. In submission.
15. Jan Camenisch and Anna Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. Technical Report Research Report RZ 3295, IBM Research Division, November 2000.
16. Jan Camenisch and Anna Lysyanskaya. Efficient non-transferable anonymous multi-show credential system with optional anonymity revocation. In Birgit Pfitzmann, editor, Advances in Cryptology - EUROCRYPT 2001, volume 2045 of LNCS, pages 93-118. Springer Verlag, 2001.
17. Jan Camenisch and Anna Lysyanskaya. A signature scheme with efficient protocols. In Stelvio Cimato, Clemente Galdi, and Giuseppe Persiano, editors, Security in Communication Networks, Third International Conference, SCN 2002, volume 2576 of LNCS, pages 268-289. Springer Verlag, 2003.
18. Jan Camenisch and Anna Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology - CRYPTO 2004 (to appear), LNCS. Springer Verlag, 2004.
19. Jan Camenisch and Markus Michels. A group signature scheme with improved efficiency. In Kazuo Ohta and Dinqyi Pei, editors, Advances in Cryptology - ASIACRYPT '98, volume 1514 of LNCS, pages 160-174. Springer Verlag, 1998.
20. Jan Camenisch and Markus Michels. Separability and efficiency for generic group signature schemes. In Michael Wiener, editor, Advances in Cryptology - CRYPTO '99, volume 1666 of LNCS, pages 413-430. Springer Verlag, 1999.
21. Jan Camenisch and Victor Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Dan Boneh, editor, Advances in Cryptology - CRYPTO 2003, volume 2729 of LNCS, pages 126-144, 2003.
22. Jan Camenisch and Markus Stadier. Efficient group signature schemes for large groups. In Burt Kaliski, editor, Advances in Cryptology - CRYPTO '97, volume 1296 of LNCS, pages 410-424. Springer Verlag, 1997.
23. Jan Camenisch and Els Van Herreweghen. Technical report.
24. Jan Leonhard Camenisch. Group Signature Schemes and Payment Systems Based on the Discrete Logarithm Problem. PhD thesis, ETH Zürich, 1998. Diss. ETH No. 12520, Hartung Gorre Verlag, Konstanz.
25. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
26. David Chaum. Blind signatures for untraceable payments. In David Chaum, Ronald L. Rivest, and Alan T. Sherman, editors, Advances in Cryptology - Proceedings of CRYPTO '82, pages 199-203. Plenum Press, 1983.
27. David Chaum. Security without identification: Transaction systems to make big brother obsolete. Communications of the ACM, 28(10):1030-1044, October 1985.
28. David Chaum and Jan-Hendrik Evertse. A secure and privacy-protecting protocol for transmitting personal information between organizations. In M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of LNCS, pages 118-167. Springer-Verlag, 1987.
29. David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In Shaft Goldwasser, editor, Advances in Cryptology - CRYPTO '88, volume 403 of LNCS, pages 319-327. Springer Verlag, 1990.
30. David Chaum and Eugène van Heyst. Group signatures. In Donald W. Davies, editor, Advances in Cryptology - EUROCRYPT '91, volume 547 of LNCS, pages 257-265. Springer-Verlag, 1991.
31. Ronald Cramer and Victor Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In Hugo Krawczyk, editor, Advances in Cryptology - CRYPTO '98, volume 1642 of LNCS, pages 13-25, Berlin, 1998. Springer Verlag.
32. Ronald Cramer and Victor Shoup. Signature schemes based on the strong RSA assumption. In Proc. 6th ACM Conference on Computer and Communications Security, pages 46-52. ACM press, November 1999.
33. Ivan Damgård and Eiichiro Fujisaki. An integer commitment scheme based on groups with hidden order. In Advances in Cryptology - ASIACRYPT 2002, volume 2501 of LNCS. Springer, 2002.
34. Ivan Damgård and Maciej Koprowski. Generic lower bounds for root extraction and signature schemes in general groups. In Lars Knudsen, editor, Advances in Cryptology - EUROCRYPT 2002, volume 2332 of LNCS, pages 256-271. Springer, 2002.
35. Ivan Bjerre Damgård. Payment systems and credential mechanism with provable security against abuse by individuals. In Shaft Goldwasser, editor, Advances in Cryptology - CRYPTO '88, volume 403 of LNCS, pages 328-335. Springer Verlag, 1990.
36. Amos Fiat and Adi Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Andrew M. Odlyzko, editor, Advances in Cryptology - CRYPTO '86, volume 263 of LNCS, pages 186-194. Springer Verlag, 1987.
37. Eiichiro Fujisaki and Tatsuaki Okamoto. Witness hiding protocols to confirm modular polynomial relations. In The 1997 Symposium on Cryptograpy and Information Security, Fukuoka, Japan, January 1997. The Institute of Electronics, Information and Communcation Engineers. SCSI97-33D.
38. Craig Gentry and Alice Silverberg. Hierarchical ID-based cryptography. In Yuliang Zheng, editor, Advances in Cryptology - ASIACRYPT 2002, volume 2501 of LNCS, pages 548-566. Springer Verlag, 2002.
39. Oded Goldreich. Foundations of Cryptography II: Basic Applications. Cambridge University Press, 2004.
40. Shafi Goldwasser, Silvio Micali, and Charles Rackoff. The knowledge complexity of interactive proof systems. In Proc. 27th Annual Symposium on Foundations of Computer Science, pages 291-304, 1985.
41. Shafi Goldwasser, Silvio Micali, and Ronald Rivest. A digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal on Computing, 17(2):281-308, April 1988.
42. Antoine Joux. A one-round protocol for tripartite Diffie-Hellman. In Proceedings of the ANTS-IV conference, volume 1838 of LNCS, pages 385-394. Springer-Verlag, 2000.
43. Anna Lysyanskaya. Signature schemes and applications to cryptographic protocol design. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 2002.
44. Anna Lysyanskaya. Signature Schemes and Applications to Cryptographic Protocol Design. PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, September 2002.
45. Anna Lysyanskaya, Ron Rivest, Amit Sahai, and Stefan Wolf. Pseudonym systems. In Howard Keys and Carlisle Adams, editors, Selected Areas in Cryptography, volume 1758 of LNCS. Springer Verlag, 1999.
46. Pascal Paillier. Public-key cryptosystems based on composite residuosity classes. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of LNCS, pages 223-239. Springer Verlag, 1999.
47. Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Joan Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576 of LNCS, pages 129-140. Springer Verlag, 1992.
48. David Pointcheval and Jacques Stern. Security proofs for signature schemes. In Ueli Maurer, editor, Advances in Cryptology - EUROCRYPT '96, volume 1070 of LNCS, pages 387-398. Springer Verlag, 1996.
49. Joseph Silverman. The Arithmetic of Elliptic Curves. Springer-Verlag, 1986.
50. Eric Verheul. Self-blindable credential certificates from the weil pairing. In Colin Boyd, editor, Advances in Cryptology - ASIACRYPT 2001, volume 2248 of LNCS, pages 533-551. Springer Verlag, 2001.