Analysis and Improvement of Lindell's UC-Secure Commitment Schemes

Abstract : In 2011, Lindell proposed an efficient commitment scheme, with a non-interactive opening algorithm, in the Universal Composability (UC) framework. He recently acknowledged a bug in its security analysis for the adaptive case. We analyze the proof of the original paper and propose a simple patch of the scheme. More interestingly, we then modify it and present a more efficient commitment scheme secure in the UC framework, with the same level of security as Lindell's protocol: adaptive corruptions, with erasures. The security is proven in the standard model (with a Common Reference String) under the classical Decisional Diffie-Hellman assumption. Our proposal is the most efficient UC-secure commitment proposed to date (in terms of computational workload and communication complexity).
Type de document :
Communication dans un congrès
Michael Jacobson and Michael Locasto and Payman Mohassel and Reihaneh Safavi-Naini. ACNS 2013 - 11th International Conference Applied Cryptography and Network Security, Jun 2013, Banff, Canada. Springer, 7954, pp.534-551, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38980-1_34〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00865612
Contributeur : Céline Chevalier <>
Soumis le : mardi 24 septembre 2013 - 16:02:29
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Lien texte intégral

Identifiants

Collections

Citation

Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud. Analysis and Improvement of Lindell's UC-Secure Commitment Schemes. Michael Jacobson and Michael Locasto and Payman Mohassel and Reihaneh Safavi-Naini. ACNS 2013 - 11th International Conference Applied Cryptography and Network Security, Jun 2013, Banff, Canada. Springer, 7954, pp.534-551, 2013, Lecture Notes in Computer Science. 〈10.1007/978-3-642-38980-1_34〉. 〈hal-00865612〉

Partager

Métriques

Consultations de la notice

380