A length-invariant hybrid mix

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

Volumn 1976, Issue , 2000, Pages 178-191

  Ohkubo, Miyako ^a   Abe, Masayuki ^a  

^a NTT CORPORATION   (Japan)

Author keywords

Anonymous channel; Hybrid encryption; Hybrid mix; Mix net

Indexed keywords

SECURITY OF DATA;

ANONYMOUS CHANNEL; DECISION DIFFIE-HELLMAN PROBLEM; HYBRID ENCRYPTION; HYBRID MIX; INDISTINGUISHABILITY; MIX-NET; PUBLIC-KEY ENCRYPTION; SYMMETRIC ENCRYPTION SCHEMES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84937415944     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44448-3_14     Document Type: Conference Paper

References (25)

1. M. Abe. Mix-networks on permutation networks. Asiacrypt’99, LNCS 1716, pages 258–273. 1999.
2. M. Abe. Robust distributed multiplication without interaction. In M. Wiener, editor, in Cryptology—CRYPTO’99, LNCS 1666, pages 130–147. 1999.
3. M. Abe. Universally verifiable mix-net with verification work independent of the number of mix-servers. IEICE Trans. Fundamentals, E83-A(7):1431–1440, July 2000. Presented in Eurocrypt’98.
4. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. CRYPTO’98, LNCS 1462, pages 26–45. 1998.
5. M. Bellare and P. Rogaway. Random oracles are practical: a paradigm for designing efficient protocols. ACM CCCS, pages 62–73. 1993.
6. R. Canetti and S. Goldwasser. An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack. Eurocrypt’99, LNCS 1592, pages 90–106. 1999.
7. D. L. Chaum. Untraceable electronic mail, return address, and digital pseudonyms. Comm. of the ACM, 24:84–88, 1981.
8. R. Cramer and V. Shoup. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. CRYPTO’98, LNCS 1462, pages 13–25. 1998.
9. Y. Desmedt and K. Kurosawa. How to break a practical MIX and design a new one. Eurocrypt 2000, LNCS 1807, pages 557–572. 2000.
10. E. Fujisaki and T. Okamoto. Secure integration of asymmetric and symmetric encryption schemes. CRYPTO’99, LNCS 1666, pages 537–554. 1999.
11. H. Handschuh, Y. Tsiounis, and M. Yung. Decision oracles are equivalent to matching oracles. PKC’99, LNCS 1560, pages 276–289. 1999.
12. M. Jakobsson. A practical mix. Eurocrypt’98, LNCS 1403, pages 448–461. 1998.
13. M. Jakobsson. Flash mixing. PODC99, 1999.
14. A. Juels and M. Jakobsson. Millimix. Tech. Report 99-33, DIMACS, June 1999.
15. A. Menezes, P. Oorschot, and S. Vanstone. Handbook of Applied Cryptography. CRC Press, 1997.
16. M. Michels and P. Horster. Some remarks on a receipt-free and universally verifiable mix-type voting scheme. Asiacrypt’96, LNCS 1163, pages 125–132. 1996.
17. W. Ogata, K. Kurosawa, K. Sako, and K. Takatani. Fault tolerant anonymous channel. ICICS’98, LNCS 1334, pages 440–444. 1998.
18. C. Park, K. Itoh, and K. Kurosawa. Efficient anonymous channel and all/nothing election scheme. Eurocrypt’93, LNCS 765, pages 248–259. 1994.
19. B. Pfitzmann. Breaking an efficient anonymous channel. Eurocrypt’94, LNCS 950, pages 339–348. 1995.
20. B. Pfitzmann and A. Pfitzmann. How to break the direct RSA implementation of MIXes. Eurocrypt’89, LNCS 434, pages 373–381. 1989.
21. T. Saitoh. The efficient reductions between the decision Diffie-Hellman problem and related problems. In the joint meeting of SCI2000 and ISAS2000, July 2000. available from the author.
22. K. Sako and J. Kilian. Receipt-free mix-type voting scheme—a practical solution to the implementation of a voting booth—Eurocrypt’95, LNCS 921, pages 393–403. 1995.
23. V. Shoup. Using hash functions as a hedge against chosen ciphertext attack. Eurocrypt 2000, LNCS 1807, pages 275–288. 2000.
24. V. Shoup and R. Gennaro. Securing threshold cryptosystems against chosen ciphertext attack. Eurocrypt’98, LNCS 1403, pages 1–16. 1998.
25. Y. Tsiounis and M. Yung. On the security of El Gamal based encryption. PKC’98, LNCS 1431, pages 117–134. 1998.