Mix-networks on permutation networks

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

Volumn 1716, Issue , 1999, Pages 258-273

  Abe, Masayuki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC VOTING; SECURITY OF DATA;

ELECTRONIC ELECTION; ERROR PROBABILITIES; MIX NETWORKS; MIX SERVERS; MIX-NET; PERMUTATION NETWORK; ROUND COMPLEXITY;

CRYPTOGRAPHY;

EID: 84956854310     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_21     Document Type: Conference Paper

References (17)

1. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. In Advances in Cryptology — EUROCRYPT’98, LNCS 1403, pages 437–447. Springer-Verlag, 1998.
2. M. Abe. Robust threshold Cramer-Shoup cryptosystem. Proc. of the 1999 Symposium on Cryptography and Information Security, T1-1.3, 1999. (in Japanese).
3. M. Bellare, J. A. Garay, and T. Rabin. Fast batch verification for modular exponentiation and digital signatures. In Advances in Cryptology — EUROCRYPT’98, LNCS 1403, pages 236–250. Springer-Verlag, 1998.
4. R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. In Advances in Cryptology — EUROCRYPT’99, LNCS 1592, pages 90–106. Springer-Verlag, 1999.
5. D. L. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. Communications of the ACM, 24:84–88, 1981.
6. D. L. Chaum and T. P. Pedersen. Wallet databases with observers. In Advances in Cryptology — CRYPTO’92, LNCS 740, pages 89–105. Springer-Verlag, 1993.
7. R. Cramer, I. Damgárd, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Advances in Cryptology — CRYPTO’94, LNCS 839, pages 174–187. Springer-Verlag, 1994.
8. A. Fiat and A. Shamir. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology — CRYPTO’86, LNCS 263, pages 186–199. Springer-Verlag, 1986.
9. R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin. Secure distributed key generation for discrete-log based cryptosystems. In Advances in Cryptology — EURO-CRYPT’99, LNCS 1592, pages 259–310. Springer-Verlag, 1999.
10. M. Jakobsson. A practical mix. In Advances in Cryptology — EUROCRYPT’98, LNCS 1403, pages 448–461. Springer-Verlag, 1998.
11. M. Jakobsson. Flash mixing. PODC99, 1999.
12. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. In ICICS98, LNCS 1334, pages 440–444. Springer-Verlag, 1998.
13. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. In Advances in Cryptology — EUROCRYPT’93, LNCS 765, pages 248–259. Springer-Verlag, 1994.
14. T. P. Pedersen. A threshold cryptosystem without a trusted party. In Advances in Cryptology — EUROCRYPT’91, pages 522–526. Springer-Verlag, 1991.
15. K. Sako and J. Kilian. Receipt-free mix-type voting scheme — a practical solution to the implementation of a voting booth —. In Advances in Cryptology — EUROCRYPT’95, LNCS 921, pages 393–403. Springer-Verlag, 1995.
16. Y. Tsiounis and M. Yung. On the security of El Gamal based encryption. In First International Workshop on Practice and Theory in Public Key Cryptography – PKC’98, LNCS 1431, pages 117–134. Springer-Verlag, 1998.
17. A. Waksman. A permutation network. Journal of the Association for Computing Machinery, 15(1):159–163, January 1968.