## CryptoDB

### Paper: Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes

Authors: Bodo M\"oller URL: http://eprint.iacr.org/2002/119 Search ePrint Search Google 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. To conceal as much information as possible when using variable (source routed) chains, all messages passed to mixes should be of the same length; thus, message length should not decrease when a mix transforms an input message into the corresponding output message directed at the next mix in the chain. Chaum described an implementation for such length-preserving mixes, but it is not secure against active attacks. We show how to build practical cryptographically secure length-preserving mixes. The conventional definition of security against chosen ciphertext attacks is not applicable to length-preserving mixes; we give an appropriate definition and show that our construction achieves provable security.
##### BibTeX
@misc{eprint-2002-11642,
title={Provably Secure Public-Key Encryption for Length-Preserving Chaumian Mixes},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / cryptographic remailers, chosen ciphertext attack security},
url={http://eprint.iacr.org/2002/119},
note={CT-RSA 2003 moeller@cdc.informatik.tu-darmstadt.de 12009 received 14 Aug 2002, last revised 18 Nov 2002},
author={Bodo M\"oller},
year=2002
}