Robust Encryption

  • Michel Abdalla
  • Mihir Bellare
  • Gregory Neven
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5978)

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 present various applications. Our work enables safer and simpler use of encryption.

Copyright information

© IFIP International Federation for Information Processing 2010

Authors and Affiliations

  • Michel Abdalla
    • 1
  • Mihir Bellare
    • 2
  • Gregory Neven
    • 3
    • 4
  1. 1.Departement d’InformatiqueÉcole normale supérieureParisFrance
  2. 2.Department of Computer Science & EngineeringUniversity of CaliforniaSan DiegoUSA
  3. 3.Department of Electrical EngineeringKatholieke Universiteit LeuvenBelgium
  4. 4.IBM ResearchZurichSwitzerland

Personalised recommendations