Provably secure public-key encryption for length-preserving Chaumian mixes

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

Volumn 2612, Issue , 2003, Pages 244-262

  Möller, Bodo ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CHAINS; PUBLIC KEY CRYPTOGRAPHY;

ACTIVE ATTACK; CHOSEN CIPHERTEXT ATTACK; MESSAGE LENGTH; PROVABLE SECURITY; PROVABLY SECURE; PUBLIC KEYS; PUBLIC-KEY ENCRYPTION;

CRYPTOGRAPHY;

EID: 35248844472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36563-x_17     Document Type: Article

References (20)

1. ABDALLA, M., BELLARE, M., AND ROGAWAY, P. DHAES: An encryption scheme based on the Diffie-Hellman problem. Submission to IEEE P1363a. http://grouper. ieee.org/groups/1363/P1363a/Encryption.html, 1998.
2. ABDALLA, M., BELLARE, M., AND ROGAWAY, P. The oracle Diffie-Hellman assumptions and an analysis of DHIES. In Progress in Oryptology - CT-RSA 2001 (2001), D. Naccache, Ed., vol. 2020 of Lecture Notes in Computer Science, pp. 143-158.
3. BELLARE, M., CANETTI, R., AND KRAWCZYK, H. Keying hash functions for message authentication. In Advances in Cryptology - CRYPTO '96 (1996), N. Koblitz, Ed., vol. 1109 of Lecture Notes in Computer Science, pp. 1-15.
4. BELLARE, M., DESAI, A., JOKIPII, E., AND ROGAWAY, P. A concrete security treatment of symmetric encryption. In 38th Annual Symposium on Foundations of Computer Science (FOCS '97) (1997), IEEE Computer Society, pp. 394-403.
5. BLACK, J., HALEVI, S., KRAWCZYK, H., KROVETZ, T., AND ROGAWAY, P. UMAC: Fast and secure message authentication. In Advances in Cryptology - CRYPTO '99 (1999), M. Wiener, Ed., vol. 1666 of Lecture Notes in Computer Science, pp. 216-233.
6. CHAUM, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24 (1981), 84-88.
7. COTTRELL, L. Mixmaster & remailer attacks. http://www.obscura.com/%7Eloki/remailer/remailer-essay.html, 1997.
8. CRAMER, R., AND SHOUP, V. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. Manuscript, http://shoup.net/papers/, 2001.
9. DIFFIE, W., AND HELLMAN, M. E. New directions in cryptography. IEEE Transactions on Information Theory 22, 6 (1976), 644-654.
10. GOLDWASSER, S., AND MICALI, S. Probabilistic encryption. Journal of Computer and System Sciences 28 (1984), 270-299.
11. JAKOBSSON, M., AND JUELS, A. An optimally robust hybrid mix network. In 20th Annual ACM Symposium on Principles of Distributed Computing (PODC 2001) (2001), ACM Press, pp. 284-292.
12. ~rogaway/umac/, 2000.
13. LIPMAA, H., ROGAWAY, P., AND WAGNER, D. Comments to NIST concerning AES modes of operation: CTR-mode encryption, http://csrc.nist.gov/ encryption/modes/workshopl/papers/lipmaa-ctr.pdf, 2000.
14. MILLER, V. S. Use of elliptic curves in cryptography. In Advances in Cryptology - CRYPTO '85 (1986), H. C. Williams, Ed., vol. 218 of Lecture Notes in Computer Science, pp. 417-428.
15. Mixmaster anonymous remailer software, http://sourceforge.net/projects/ mixmaster/.
16. ∼rowdenw/crypt/Mix/draft-moeller-v2-01.txt, 2000.
17. OHKUBO, M., AND ABE, M. A length-invariant hybrid mix. In Advances in Cryptology - ASIACRYPT 2000 (2000), T. Okamoto, Ed., vol. 1976 of Lecture Notes in Computer Science, pp. 178-191.
18. RACKOFF, C. W., AND SIMON, D. R. Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In Advances in Cryptology - CRYPTO '91 (1992), J. Feigenbaum, Ed., vol. 576 of Lecture Notes in Computer Science, pp. 433-444.
19. SHOUP, V. A proposal for an ISO standard for public key encryption. Version 2.1, December 20, 2001. http://shoup.net/papers/.
20. WEGMAN, M. N., AND CARTER, J. L. New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences 22 (1981), 265-279.