Cryptology ePrint Archive: Report 2008/440

Robust Encryption

Michel Abdalla and Mihir Bellare and Gregory Neven

Abstract: We provide a provable-security treatment of ``robust'' encryption. Robustness means it is hard to produce a ciphertext that is valid for two different users. Robustness makes explicit a property that has been implicitly assumed in the past. We argue that it is an essential conjunct of anonymous encryption. We show that natural anonymity-preserving ways to achieve it, such as adding recipient identification information before encrypting, fail. We provide transforms that do achieve it, efficiently and provably. We assess the robustness of specific encryption schemes in the literature, providing simple patches for some that lack the property. We discuss applications including PEKS (Public-key Encryption with Keyword Search) and auctions. Overall our work enables safer and simpler use of encryption.

Category / Keywords: IBE, public-key encryption, searchable encryption, auctions, CCA security.

Publication Info: A preliminary version appeared in TCC 2010. This is the full version.

Date: received 13 Oct 2008, last revised 4 Mar 2010

Contact author: mihir at cs ucsd edu

Available format(s): PDF | BibTeX Citation

Version: 20100304:193324 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]