Skip to Main content Skip to Navigation
Conference papers

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).
Document type :
Conference papers
Complete list of metadata
Contributor : Céline Chevalier Connect in order to contact the contributor
Submitted on : Tuesday, September 24, 2013 - 4:02:29 PM
Last modification on : Friday, June 24, 2022 - 4:13:01 AM

Links full text



Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud. Analysis and Improvement of Lindell's UC-Secure Commitment Schemes. ACNS 2013 - 11th International Conference Applied Cryptography and Network Security, Jun 2013, Banff, Canada. pp.534-551, ⟨10.1007/978-3-642-38980-1_34⟩. ⟨hal-00865612⟩



Record views