See this document in CiteSeerX!

Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes (2002)  (Make Corrections)  (1 citation)
Bodo Möller



  Home/Search   Context   Related

 
View or download:
iacr.org/2002/119.pdf
informatik.tudarm...05.mixencrypt.pdf
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  iacr.org/curr/ (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: Mix chains as proposed by Chaum allow sending untraceable electronic e-mail without requiring trust in a single authority: messages are recursively public-key encrypted to multiple intermediates (mixes), each of which forwards the message after removing one layer of encryption. (Update)

Similar documents based on text:   More   All
3.6:   Provably Secure Public-Key Encryption for Length-Preserving.. - Möller (2003)   (Correct)
0.5:   Algorithms for Multi-Exponentiation - Möller (2001)   (Correct)
0.4:   Design and Analysis of Practical Public-Key Encryption Schemes .. - Cramer, Shoup (2001)   (Correct)

BibTeX entry:   (Update)

Bodo Moller. Provably secure public-key encryption for lengthpreserving chaumian mixes. In Marc Joye, editor, Topics in Cryptology CT-RSA 2003, volume 2612 of LNCS, pages 244--262, San Francisco, CA, USA, 13-17 April 2003. Springer-Verlag. http://citeseer.ist.psu.edu/moller02provably.html   More

@misc{ moller03provably,
  author = "B. Moller",
  title = "Provably secure public-key encryption for lengthpreserving chaumian mixes",
  text = "Bodo Moller. Provably secure public-key encryption for lengthpreserving
    chaumian mixes. In Marc Joye, editor, Topics in Cryptology CT-RSA 2003,
    volume 2612 of LNCS, pages 244--262, San Francisco, CA, USA, 13-17 April
    2003. Springer-Verlag.",
  year = "2003",
  url = "citeseer.ist.psu.edu/moller02provably.html" }
Citations (may not include all citations):
428   IEEE Transactions on Information Theory (context) - Diffie, Hellman - 1976
329   Untraceable electronic mail (context) - Chaum - 1981
228   Use of elliptic curves in cryptography (context) - Miller - 1986
189   Keying hash functions for message authentication - Bellare, Canetti et al. - 1996
159   A concrete security treatment of symmetric encryption (context) - Bellare, Desai et al. - 1997
114   Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1992
56   UMAC: Fast and secure message authentication - Black, Halevi et al. - 1999
54   A proposal for an ISO standard for public key encryption - Shoup - 2001
46   Design and analysis of practical public-key encryption schem.. - Cramer, Shoup - 2001
14   DHAES: An encryption scheme based on the Di#e-Hellman proble.. (context) - Abdalla, Bellare et al. - 1998
13   Comments to NIST concerning AES modes of operation: CTR-mode.. - Lipmaa, Rogaway et al. - 2000
4   UMAC: Message authentication code using universal hashing (context) - Krovetz, Black et al. - 2000
2   Eloki remailerremailer essay (context) - remailer, www et al. - 1997
http://sourceforge.net/projects/

Documents on the same site (http://eprint.iacr.org/curr/):   More
Cryptanalysis of Stream Cipher COS (2, 128) Mode I - Wu, Bao (2002)   (Correct)
Tree-based Group Key Agreement - Kim, Perrig, Tsudik (2002)   (Correct)
Generic Lower Bounds for Root Extraction and Signature.. - Damgård, Koprowski (2002)   (Correct)

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC