Cryptology ePrint Archive: Report 2013/238

Anonymity-preserving Public-Key Encryption: A Constructive Approach

Markulf Kohlweiss and Ueli Maurer and Cristina Onete and Björn Tackmann and Daniele Venturi

Abstract: A receiver-anonymous channel allows a sender to send a message to a receiver without an adversary learning for whom the message is intended. Wireless broadcast channels naturally provide receiver anonymity, as does multi-casting one message to a receiver population containing the intended receiver. While anonymity and confidentiality appear to be orthogonal properties, making anonymous communication confidential is more involved than one might expect, since the ciphertext might reveal which public key has been used to encrypt. To address this problem, public-key cryptosystems with enhanced security properties have been proposed.

This paper investigates constructions as well as limitations for preserving receiver anonymity when using public-key encryption (PKE). We use the constructive cryptography approach by Maurer and Renner and interpret cryptographic schemes as constructions of a certain ideal resource (e.g. a confidential anonymous channel) from given real resources (e.g. a broadcast channel). We define appropriate anonymous communication resources and show that a very natural resource can be constructed by using a PKE scheme which fulfills three properties that appear in cryptographic literature (IND-CCA, key-privacy, weak robustness). We also show that a desirable stronger variant, preventing the adversary from selective “trial-deliveries” of messages, is unfortunately unachievable by any PKE scheme, no matter how strong. The constructive approach makes the guarantees achieved by applying a cryptographic scheme explicit in the constructed (ideal) resource; this specifies the exact requirements for the applicability of a cryptographic scheme in a given context. It also allows to decide which of the existing security properties of such a cryptographic scheme are adequate for the considered scenario, and which are too weak or too strong. Here, we show that weak robustness is necessary but that so-called strong robustness is unnecessarily strong in that it does not construct a (natural) stronger resource.

Category / Keywords: public-key cryptography / key privacy, robust encryption, anonymity, constructive cryptography

Publication Info: An extended abstract of this paper appears at PETS 2013

Date: received 25 Apr 2013, last revised 13 Sep 2013

Contact author: bjoernt at inf ethz ch

Available format(s): PDF | BibTeX Citation

Version: 20130913:194735 (All versions of this report)

Short URL: ia.cr/2013/238

Discussion forum: Show discussion | Start new discussion