Endorsed e-cash

Proceedings - IEEE Symposium on Security and Privacy

Volumn , Issue , 2007, Pages 101-115

  Camenisch, Jan ^a   Lysyanskaya, Anna ^b   Meyerovich, Mira ^b  

^a IBM   (Switzerland)

^b BROWN UNIVERSITY   (United States)

Author keywords

Digital signatures; E cash; Fair exchange; Threshold cryptography

Indexed keywords

DATA TRANSFER; ELECTRONIC DATA INTERCHANGE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

FAIR EXCHANGE; THRESHOLD CRYPTOGRAPHY;

ELECTRONIC COMMERCE;

EID: 34548777609     PISSN: 10816011     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SP.2007.15     Document Type: Conference Paper

References (43)

1. Alessandro Acquisti, Roger Dingledine, and Paul Syverson. On the economics of anonymity. Financial Cryptography, pages 84-102, 2003.
2. N. Asokan, Matthias Schunter, and Michael Waidner. Optimistic protocols for fair exchange. In Proc. 4th ACM Conference on Computer and Communications Security, pages 6-17. ACM press, 1997.
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. Dan Boneh and Xavier Boyen. Efficient selective-id secure identity based encryption without random oracles. In Advances in Cryptology - EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 223-238. Springer-Verlag, 2004.
5. Dan Boneh, Ben Lynn, and Hovav Shacham. Short signatures from the Weil pairing. In Colin Boyd, editor, Proceedings of ASIACRYPT2001, volume 2248 of Lecture Notes in Computer Science, pages 514-532. Springer-Verlag, 2001.
6. 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 Lecture Notes in Computer Science, pages 480-494. Springer Verlag, 1997.
7. Mihir Bellare and Adriana Palacio. Gq and schnorr identification schemes: Proofs of security against impersonation under active and concurrent attacks. In Moti Yung, editor, Advances in Cryptology - CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 162-177. Springer Verlag, 2002.
8. Stefan Brands. An efficient off-line electronic cash system based on the representation problem. Technical Report CS-R9323, CWI, April 1993.
9. Stefan Brands. Untraceable off-line cash in wallets with observers, manuscript, CWI, 1993.
10. Stefan Brands. Untraceable off-line cash in wallets with observers. In Douglas R. Stinson, editor, Advances in Cryptology - CRYPTO '93, volume 773 of Lecture Notes in Computer Science, pages 302-318, 1993.
11. David Chaum, Amos Fiat, and Moni Naor. Untraceable electronic cash. In Shafi Gold-wasser, editor, Advances in Cryptology - CRYPTO '88, volume 403 of Lecture Notes in Computer Science, pages 319-327. Springer Verlag, 1990.
12. David Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, February 1981.
13. 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.
14. David Chaum. Blind signature systems. In David Chaum, editor, Advances in Cryptology - CRYPTO '83, page 153. Plenum Press, 1984.
15. Jan Camenisch, Susan Hohenberger, Markulf Kohlweiss, Anna Lysysanskaya, and Mira Meyerovich. How to win the clone wars: Efficient periodic n-times anonymous authentication. In ACM CCS, pages 201-210, 2006.
16. Jan Camenisch, Susan Hohenberger, and Anna Lysysanskaya. Compact e-cash. In Ronald Cramer, editor, Advances in Cryptology - EUROCRYPT. Ines, 2005.
17. Jan Camenisch, Susan Hohenberger, and Anna Lysysanskaya. Balancing account-ability and privacy using e-cash. In Security and Cryptography for Networks - SCN. Ines, 2006.
18. Jan Camenisch and Anna Lysyanskaya. A signature scheme with efficient protocols. In Giuseppe Persiano, editor, Security in communication networks, volume 2576 of Lecture Notes in Computer Science, pages 268-289. Springer Verlag, 2002.
19. Jan Camenisch and Anna Lysyanskaya. Signature schemes and anonymous credentials from bilinear maps. In Advances in Cryptology -CRYPTO 2004, Lecture Notes in Computer Science. Springer Verlag, 2004.
20. Jan Camenisch and Anna Lysyanskaya. A formal treatment of onion routing. In Victor Shoup, editor, Advances in Cryptology - CRYPTO 2005, volume 3621 of Lecture Notes in Computer Science, pages 169-187. Springer-Verlag, August 2005.
21. Bram Cohen. Incentives build robustness in bittorrent. In Procceedings of the 1st Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, 2003.
22. David Chaum and Torben Pryds Pedersen. Transferred cash grows in size. In Rainer A. Rueppel, editor, Advances in Cryptology - EUROCRYPT '92, volume 658 of Lecture Notes in Computer Science, pages 390-407. Springer-Verlag, 1993.
23. Jan L. Camenisch, Jean-Marc Piveteau, and Markus A. Stadler. Blind signatures based on the discrete logaritm problem. In Alfredo De Santis, editor, Advances in Cryptology - EUROCRYPT '94, volume 950 of Lecture Notes in Computer Science, pages 428-432. Springer Verlag Berlin, 1994.
24. Jan Camenisch and Victor Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Dan Boneh, editor, Advances in Cryptology - CRYPTO 2003, Lecture Notes in Computer Science. Springer Verlag, 2003. To appear.
25. B. Cox, J. D. Tygar, and M. Sirbu. Netbill security and transaction protocol. In Proceedings of the First Usenix Workshop on Electronic Commerce, pages 77-88, 1995.
26. George Danezis, Roger Dingledine, and Nick Mathewson. Mixminion: Design of a type III anonymous remailer protocol. In IEEE Symposium on Security and Privacy. IEEE Computer Society Press, 2003.
27. Yevgeniy Dodis and Aleksandr Yampolskiy. A verifiable random function with short proofs and keys. In Proceedings of the Workshop on Theory and Practice in Public Key Cryptography, volume 3386 of Lecture Notes in Computer Science, pages 416-431, 2005.
28. Yair Frankel, Yiannis Tsiounis, and Moti Yung. "Indirect discourse proofs:" Achieving efficient fair off-line e-cash. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology - ASIACRYPT '96, volume 1163 of Lecture Notes in Computer Science, pages 286-300. Springer Verlag, 1996.
29. Matthew Franklin and Moti Yung. Towards provably secure efficient electronic cash. Technical Report TR CUSC-018-92, Columbia University, Dept. of Computer Science, April 1992. Also in: Proceedings of ICALP 93, Lund, Sweden, July 1993, volume 700 of LNCS, Springer Verlag.
30. Markus Jakobsson. Ripping coins for a fair exchange. In Advances in Cryptology - EUROCRYPT '95, volume 921, pages 220-230. Springer Verlag, 1995.
31. Hugo Krawczyk. Differential power analysis. In Michael J. Wiener, editor, Advances in Cryptology - CRYPTO '99, volume 1666 of Lecture Notes in Computer Science, pages 388-397. Springer Verlag, 1999.
32. Jim McCoy. Mojo nation responds, 2001.
33. Silvio Micali. Certified e-mail with invisible post offices. Presentation at the 1997 RSA Security Conference, 1997.
34. Shigeo Mitsunari, Ryuichi Sakai, and Masao Kasahara. A new traitor tracing. In IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E85-A, No. 2, pages 481-484, 2002.
35. Lan Nguyen and Rei Safavi-Naini. Dynamic k-times anonymous authentication. In Applied Cryptography and Network Security, volume 3531 of Lecture Notes in Computer Science, pages 318-333, New York, 2005.
36. Pascal Paillier. Public-key cryptosystems based on composite residuosity classes. In Jacques Stern, editor, Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 223-239. Springer Verlag, 1999.
37. Torben Pryds Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Joan Feigenbaum, editor, Advances in Cryptology - CRYPTO '91, volume 576 of Lecture Notes in Computer Science, pages 129-140. Springer Verlag, 1992.
38. Michael Reiter, XiaoFeng Want, and Matthew Wright. Building reliable mix networks with fair exchange. In Applied Cryptography and Network Security: Third International Conference, pages 378-392. Lecture Notes in Computer Science, June 2005.
39. Claus P. Schnorr. Efficient signature generation for smart cards. Journal of Cryptology, 4(3):239-252, 1991.
40. Markus Stadler, Jean-Marc Piveteau, and Jan Camenisch. Fair blind signatures. In Louis C. Guillou and Jean-Jacques Quisquater, editors, Advances in Cryptology - EUROCRYPT '95, volume 921 of Lecture Notes in Computer Science, pages 209-219. Springer Verlag, 1995.
41. Isamu Teranishi and Kazue Sako. k-times anonymous authentication with a constant proving cost. In Public Key Cryptography - PKC 2006, volume 3958 of Lecture Notes in Computer Science, pages 525-542, New York, NY, 2004.
42. Yiannis S. Tsiounis. Efficient Electonic Cash: New Notions and Techniques. PhD thesis, Northeastern University, Boston, Massachusetts, 1997.
43. Victor K. Wei. More compact e-cash with efficient coin tracing. Available at: http://eprint.iacr.org/2005/411, 2005.