Dining cryptographers revisited

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

Volumn 3027, Issue , 2004, Pages 456-473

  Golle, Philippe ^a   Juels, Ari ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b RSA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEX NETWORKS; COMPUTER SYSTEM RECOVERY; DATA PRIVACY;

ANONYMITY; COMMUNICATION COMPLEXITY; CRYPTOGRAPHIC TECHNIQUES; DETECTION AND IDENTIFICATIONS; DINING CRYPTOGRAPHERS; MIX NETWORKS; MULTIPLE BROADCASTS; NON-INTERACTIVE;

CRYPTOGRAPHY;

EID: 35048865464     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24676-3_27     Document Type: Article

References (22)

1. L. von Ahn, A. Bortz and N. J. Hopper, k-anonymous message transmission. In Proc. of ACM CCS '03, pp. 122-130. ACM Press, 2003.
2. J. Bos and B. den Boer. Detection of disrupters in the DC protocol. In Proc. of Eurocrypt '89, pp. 320-327. LNCS 434.
3. P. Boucher, A. Shostack, and I. Goldberg. Freedom Systems 2.0 architecture. Zero Knowledge Systems, Inc. White Paper, December 2000. Available at http://freehaven.net/anonbib/
4. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. In Proc. of ACM CCS '93, pp. 62-73. ACM Press, 1993.
5. D. Boneh and M. Franklin. Identity based encryption from the Weil pairing. In SIAM J. of Computing, 32(3), pp. 586-615, 2003.
6. R. Canetti, S. Halevi, and J. Katz. A forward-secure public-key encryption scheme. In Proc. of Eurocrypt '03, pp. 255-271. LNCS 2656.
7. C. Cachin, K. Kursawe, F. Petzold, and V. Shoup. Secure and efficient asynchronous broadcast protocols. In Proc. of Crypto '01, pp. 524-541. LNCS 2139.
8. J. Camenisch and M. Stadier. Efficient group signature schemes for large groups. In Proc. of Crypto '97, pp. 410-424. LNCS 740.
9. R. Cramer, I. Damgaard, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. of Crypto '94, pp. 174-187. LNCS 839.
10. D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM, 24(2), pp. 84-88, 1981.
11. D. Chaum. The dining cryptographers problem: unconditional sender and recipient untraceability. In Journal of Cryptology, 1(1), pp. 65-75, 1988.
12. D. Chaum and H. van Antwerpen. Undeniable signatures. In Proc. of Crypto '89, pp. 212-216. LNCS 435.
13. G. Danezis, R. Dingledine and N. Mathewson. Mixminion: design of a type III anonymous remailer protocol. In IEEE Symposium on Security and Privacy 2003, pp. 2-15.
14. R. Dingledine. Anonymity bibliography. Available on the web at http://freehaven.net/anonbib/
15. A. Fiat and A. Shamir. How to prove yourself: practical solutions to identification and signature problems. In Proc. of Crypto '86, pp. 186-194. LNCS 263.
16. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Proc. of Eurocrypt '99, pp. 295-310. LNCS 1592.
17. D. Goldschlag, M. Reed and P. Syverson. Onion routing. In Communications of the ACM, 42(2), pp.'39-41. 1999.
18. M. Jakobsson, A. Juels and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc of USENIX'02.
19. M. Reiter and A. Rubin. Anonymous web transactions with Crowds. In Communications of the ACM, 42(2), pp. 32-38. 1999.
20. C. Schnorr. Efficient signature generation by smart cards. In Journal of Cryptology, 4(3), pp. 161-174. 1991.
21. M. Waidner and B. Pfitzmann. The Dining Cryptographers in the disco: unconditional sender and recipient untraceability with computationally secure serviceability. In Proc. of Eurocrypt '89, p. 690. LNCS 434.
22. M. Waidner. Unconditional sender and recipient untraceability in spite of active attacks. In Proc. of Eurocrypt'89, pp. 302-319. LNCS 434.