Reputable mix networks

Lecture Notes in Computer Science

Volumn 3424, Issue , 2005, Pages 51-62

  Golle, Philippe ^a  

^a PALO ALTO RESEARCH CENTER   (United States)

Author keywords

Anonymity; Mix Network; Privacy

Indexed keywords

CRYPTOGRAPHY; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; NETWORK PROTOCOLS;

DECRYPTION; MIX NETWORKS; RE-ENCRYPTION; REPUTABLE MIX;

COMPUTER NETWORKS;

EID: 24344492436     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11423409_4     Document Type: Conference Paper

References (23)

1. [BF01] D. Boneh and M. Franklin. Efficient generation of shared RSA keys. In Journal of the ACM (JACM), Vol. 48, Issue 4, pp. 702-722, July 2001.
2. [BG02] D. Boneh and P. Golle. Almost entirely correct mixing with applications to voting. In Proc. of the 9th ACM Conference on Computer and Communications Security, pp. 68-77. ACM Press, 2002.
3. [Cha81] D. Chaum. Untraceable electronic mail, return addresses, and digital pseudonyms. In Communications of the ACM, 24(2):84-88, 1981.
4. [Cha82] D. Chaum. Blind signatures for untraceable payments. In Proc. of Crypto '82, pp. 199-203. Plenum Press, N.Y., 1983.
5. [CFN88] D. Chaum, A. Fiat, M. Naor. Untraceable electronic cash. In Proc. of Crypto'88, pp. 319-327. Springer-Ver lag, LNCS 403.
6. [DDM03] G. Danezis, R. Dingledine and N. Mathewson. Mixminion: design of type III anonymous remailer protocol. In Proc. of the 2003 IEEE Symposium on Security and Privacy, pp. 2-15. On the web at http://mixminion.net/
7. [FH96] M. Frankling and S. Haber. Joint encryption and message-efficient secure computation. In Journal of Cryptology, pp. 217-232, Vol. 9, No. 4, Autumn 1996.
8. [FHP] The Free Haven Project. On the web at http://www.freehaven.net/anonbib/
9. [FS01] J. Furukawa and K. Sako. An efficient scheme for proving a shuffle. In Proc. of Crypto '01, pp. 368-387. Springer-Verlag, 2001. LNCS 2139.
10. [GJKR99] 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.
11. [GRS99] D. Goldschlag, M. Reed and P. Syverson. Onion routing for anonymous and private internet connections. In Communications of the ACM, 42(2):39-41, 1999.
12. [GJJS03] P. Golle, M. Jakobsson, A. Juels and P. Syverson. Universal re-encryption for mix networks. In Proc. of the 2004 RSA Conference, Cryptographer's track.
13. [GT96] C. Gulcu and G. Tsudik. Mixing E-mail with Babel. In Proc. of Network and Distributed Security Symposium - NDSS '96. IEEE, 1996.
14. [JJ01] M. Jakobsson and A. Juels. An optimally robust hybrid mix network. In Proc. of PODC '01, pp. 284-292. ACM Press, 2001.
15. [JJR02] M. Jakobsson, A. Juels and R. Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX'02.
16. [McC88] K. McCurley. A key distribution system equivalent to factoring. In Journal of Cryptology, pp. 95-105, Vol. 1, No. 2, Autumn 1988.
17. [Nef01] A. Neff. A verifiable secret shuffle and its application to E-Voting. In Proc. of ACM CCS'Ol, pp. 116-125. ACM Press, 2001.
18. [OKST97] W. Ogata, K. Kurosawa, K. Sako and K. Takatani. Fault tolerant anonymous channel. In Proc. of ICICS '97, pp. 440-444, 1997. LNCS 1334.
19. [Par96] S. Parekh. Prospects for remailers. First Monday, 1(2), August 1996. On the web at http://www.firstmonday.dk/issues/issue2/remailers/
20. [Ped91] T. Pedersen. A Threshold cryptosystem without a trusted party. In Proc. of Eurocrypt'91, pp. 522-526, 1991.
21. [PP89] B. Pfitzmann and A. Pfitzmann. How to break the direct RSA-implementation of mixes. In Proc. of Eurocrypt '89, pp. 373-381. Springer-Verlag, 1989. LNCS 434.
22. [Pfi94] B. Pfizmann. Breaking an Efficient Anonymous Channel. In Proc. of Eurocrypt'94, pp. 332-340. Springer-Verlag, LNCS 950.
23. [SK95] K. Sako and J. Kilian. Receipt-free mix-type voting scheme. In Proc. of Eurocrypt '95. Springer-Verlag, 1995. LNCS 921.