Strong Cryptography from Weak Secrets - Building Efficient PKE and IBE from Distributed Passwords

Xavier Boyen 1 Céline Chevalier 2 Georg Fuchsbauer 3, 4 David Pointcheval 3, 4
1 Systems and Modeling Research Unit
2 Télécom ParisTech
3 LIENS - Laboratoire d'informatique de l'école normale supérieure
4 CASCADE - Construction and Analysis of Systems for Confidentiality and Authenticity of Data and Entities
DI-ENS - Département d'informatique de l'École normale supérieure, ENS Paris - École normale supérieure - Paris, INRIA Paris-Rocquencourt, CNRS : UMR 8548
Abstract : Modern multi-user communication systems, including popular instant messaging tools, social network platforms, and cooperative-work applications, offer flexible forms of communication and exchange of data. At any time point concurrent communication sessions involving different subsets of users can be invoked. The traditional tool for achieving security in a multi-party communication environment are group key exchange (GKE) protocols that provide participants with a secure group key for their subsequent communication. Yet, in communication scenarios where various user subsets may be involved in different sessions the deployment of classical GKE protocols has clear performance and scalability limitations as each new session should be preceded by a separate execution of the protocol. The motivation of this work is to study the possibility of designing more flexible GKE protocols allowing not only the computation of a group key for some initial set of users but also efficient derivation of independent secret keys for all potential subsets. In particular we improve and generalize the recently introduced GKE protocols enabling on-demand derivation of peer-to-peer keys (so called GKE+P protocols). We show how a group of users can agree on a secret group key while obtaining some additional information that they can use on-demand to efficiently compute independent secret keys for any possible subgroup. Our security analysis relies on the Gap Diffie-Hellman assumption and uses random oracles
Type de document :
Communication dans un congrès
Third African International Conference on Cryptology (AfricaCrypt '10), May 2010, Stellenbosch, South Africa. Springer, 6055, pp.297--315, 2010, LNCS
https://hal.inria.fr/inria-00539542
Contributeur : David Pointcheval <>
Soumis le : mercredi 24 novembre 2010 - 15:39:26
Dernière modification le : lundi 5 octobre 2015 - 16:56:29

Fichier

2010_africacryptA.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00539542, version 1

Collections

INRIA

Citation

Xavier Boyen, Céline Chevalier, Georg Fuchsbauer, David Pointcheval. Strong Cryptography from Weak Secrets - Building Efficient PKE and IBE from Distributed Passwords. Third African International Conference on Cryptology (AfricaCrypt '10), May 2010, Stellenbosch, South Africa. Springer, 6055, pp.297--315, 2010, LNCS. <inria-00539542>

Exporter

BibTeX | XML | endNote

Partager

Métriques

Consultation de
la notice

116

Téléchargement du document

46

Contact


archive-ouverte@inria.fr
  翻译：