Strong cryptography from weak secrets: building efficient PKE and IBE from distributed passwords

  • Authors:
  • Xavier Boyen;Céline Chevalier;Georg Fuchsbauer;David Pointcheval

  • Affiliations:
  • Université de Liège, Belgium;Telecom ParisTech, Paris, France;École Normale Supérieure, CNRS-INRIA, Paris, France;École Normale Supérieure, CNRS-INRIA, Paris, France

  • Venue:
  • AFRICACRYPT'10 Proceedings of the Third international conference on Cryptology in Africa
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Distributed-password public-key cryptography (DPwPKC) allows the members of a group of people, each one holding a small secret password only, to help a leader to perform the private operation, associated to a public-key cryptosystem. Abdalla et al. recently defined this tool [1], with a practical construction. Unfortunately, the latter applied to the ElGamal decryption only, and relied on the DDH assumption, excluding any recent pairing-based cryptosystems. In this paper, we extend their techniques to support, and exploit, pairing-based properties: we take advantage of pairing-friendly groups to obtain efficient (simulation-sound) zero-knowledge proofs, whose security relies on the Decisional Linear assumption. As a consequence, we provide efficient protocols, secure in the standard model, for ElGamal decryption as in [1], but also for Linear decryption, as well as extraction of several identity-based cryptosystems [6,4]. Furthermore, we strenghten their security model by suppressing the useless testPwd queries in the functionality.