Auditable privacy: On tamper-evident mix networks

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

Volumn 4107 LNCS, Issue , 2006, Pages 126-141

  Choi, Jong Youl ^a   Golle, Philippe ^b   Jakobsson, Markus ^c  

^a INDIANA UNIVERSITY   (United States)

^b PALO ALTO RESEARCH CENTER   (United States)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Covert channel; Malware; Mix network; Observer; Subliminal channel; Tamper evident

Indexed keywords

COMPUTER CRIME; COMPUTER NETWORKS; INFORMATION RETRIEVAL; SECURITY OF DATA; SERVERS;

COVERT CHANNELS; MALWARE; MIX NETWORKS; SUBLIMINAL CHANNELS; TAMPER EVIDENT;

DATA PRIVACY;

EID: 33750067964     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889663_9     Document Type: Conference Paper

References (32)

1. M. Abe. Mix-networks on permutation networks, In ASIACRYPT '99, LNCS 1716, Springer-Verlag, 1999. pp. 258-273.
2. D. Chaum. Secret Ballot Receipts: True Voter-Verifiable Elections. RSA CryptoBytes, Volume 7, No. 2, 2004.
3. J. Choi, P. Golle, and M. Jakobsson. Tamper-Evident Digital Signatures: Protecting Certification Authorities Against Malware. IACR ePrint report, No. 147, 2005.
4. Y. Desmedt. Subliminal-free authentication and signature. In Advances in Cryptology - Eurocrypt '88, LNCS 330. Springer-Verlag, 1988. pp. 23-33.
5. A. Fiat and A. Shamir. How to prove yourself: Practical Solution to Identification and Signature Problems. In Advances in Cryptology - Crypto'86, LNCS 26. Springer-Verlag, 1987. pp. 186-194.
6. P. Golle and M. Jakobsson. Reusable Anonymous Return Channels. In Proc. of the Workshop on Privacy in the Electronic Society(WPES) '03, ACM Press, 2003, pp. 94-100.
7. R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin. Secure Distributed Key Generation for Discrete-Log Based Cryptosystems. In Proc. of Eurocrypt '99, LNCS 1592, Springer-Verlag, 1999. pp. 295-310.
8. M. Jakobsson. A practical mix. In Proc. of Eurocrypt '98, LNCS 1403, Springer-Verlag, 1998. pp. 448-461.
9. A. Juels and J. Guajardo. RSA Key Generation with Verifiable Randomness. In Public Key Cryptography 2002, LNCS 2274, Springer-Verlag, 2002. pp. 357-374.
10. M. Jakobsson, A. Juels, and R, Rivest. Making mix nets robust for electronic voting by randomized partial checking. In Proc. of USENIX'02, pp. 339-353.
11. M. Jakobsson, T. Leighton, S. Micali, and M. Szydlo. Fractal Merkle Tree Representation and Traversal. In Proc. of RSA Cryptographers' Track 2003, 2003.
12. M. Jakobsson and M. Yung. Distributed "Magic Ink" Signatures. In Advances in Cryptology - Eurocrypt '97, LNCS 1233, Springer-Verlag, 1997. pp. 450-464.
13. C. Karlof, N. Sastry, and D. Wagner, Cryptographic Voting Protocols: A Systems Perspective. In USENIX Security '05, August 2005. pp. 33-50.
14. M. Lepinksi, S. Micali, and A. Shelat. Collusion-Free Protocols. In STOC '05, ACM Press, 2005.
15. R. Merkle. Secrecy, authentication, and public key systems. Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ., 1979.
16. M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. In K. Kim and T. Matsumoto, editors, ASIACRYPT '96, LNCS 1163, Springer-Verlag, 1996.
17. C. A. Neff. A verifiable secret shuffle and its application to e-voting. In Proc. of CCS '01. ACM Press, 2001. pp. 116-125
18. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In Proc. of ICICS '97, LNCS 1334, Springer-Verlag, 1997. pp. 440-444.
19. C. Park, K. Itho, and K. Kurosawa. All/Nothing Election Scheme and Anonymous Channel. In Proceeding of Eurocrypt '93, 1993.
20. D. Pointcheval and J. Stern. Security proofs for signature schemes. In Advances in Cryptology - Eurocrypt '96, LNCS 1070. Springer-Verlag, 1996. pp. 387-398.
21. Pedro A.D. Rezende. Electronic Voting Systems - Is Brazil Ahead of its Time?. RSA CryptoBytes, Volume 7, No. 2, 2004.
22. M. K. Reiter and X. Wang. Fragile Mixing. In Proc. of CCS '04, 2004. pp. 227-235
23. C. P. Schnorr. Efficient Signature Generation for Smart Cards. In Proc. of Crypto '89, 1989. pp. 239-252.
24. G. J. Simmons. The prisoners' problem and the subliminal channel. In Proc. of Crypto '83, 1983. pp. 51-67.
25. G. J. Simmons. The subliminal channel and digital signature. In Proc. of Eurocrypt '84, LNCS 209, Springer-Verlag, 1996. pp. 364-378.
26. M. E. Smid and D. K. Branstad. Response to comments on the NIST proposed Digital Signature Standard. In Proc. of Crypto '92, LNCS 740. Springer-Verlag, 1992. pp. 76-87.
27. M. Stadler, Publicly Verifiable Secret Sharing, In Advances in Cryptology - Eurocrypt '96, LNCS 1070, Springer-Verlag, 1996. pp. 190-199.
28. A. Young and M. Yung. The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? In Proc. of Crypto 1996, 1996. pp. 89-103.
29. A. Young and M. Yung. The prevalence of Kleptographic attacks on discrete-log based cryptosystems. In Proc. of Crypto '97, 1997. pp. 264-276.
30. A. Young and M. Yung. Kleptography: using cryptography against cryptography. In Proc. of Eurocrypt '97, LNCS 1233, Springer-Verlag, 1997. pp. 62-74.
31. A. Young and M. Yung. Auto-Recoverable and Auto-Certifiable Cryptosystems. In Advances in Cryptology - Eurocrypt '98, LNCS 1403, Springer-Verlag, 1998. pp. 119-133.
32. Y. Tsiounis and M. Yung. On the Security of ElGamal Based Encryption. In Proc. of PKC '98, LNCS 1431, Springer-Verlag, Feb. 1998. pp. 117-134