Analysis and improvement of Lindell's UC-secure commitment schemes

Olivier Blazy; Céline Chevalier; David Pointcheval; Damien Vergnaud

doi:10.1007/978-3-642-38980-1_34

Analysis and improvement of Lindell's UC-secure commitment schemes

Olivier Blazy, Céline Chevalier, David Pointcheval, Damien Vergnaud

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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).

Original language	English
Title of host publication	Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings
Pages	534-551
Number of pages	18
DOIs	https://doi.org/10.1007/978-3-642-38980-1_34
Publication status	Published - 12 Jul 2013
Externally published	Yes
Event	11th International Conference on Applied Cryptography and Network Security, ACNS 2013 - Banff, AB, Canada Duration: 25 Jun 2013 → 28 Jun 2013

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	7954 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	11th International Conference on Applied Cryptography and Network Security, ACNS 2013
Country/Territory	Canada
City	Banff, AB
Period	25/06/13 → 28/06/13

Access to Document

10.1007/978-3-642-38980-1_34

Cite this

Blazy, O., Chevalier, C., Pointcheval, D., & Vergnaud, D. (2013). Analysis and improvement of Lindell's UC-secure commitment schemes. In Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings (pp. 534-551). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7954 LNCS). https://doi.org/10.1007/978-3-642-38980-1_34

Blazy, Olivier ; Chevalier, Céline ; Pointcheval, David et al. / Analysis and improvement of Lindell's UC-secure commitment schemes. Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. pp. 534-551 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{5f85683c281240dbb5d17b7273d47ed0,

title = "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).",

author = "Olivier Blazy and C{\'e}line Chevalier and David Pointcheval and Damien Vergnaud",

year = "2013",

month = jul,

day = "12",

doi = "10.1007/978-3-642-38980-1\_34",

language = "English",

isbn = "9783642389795",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "534--551",

booktitle = "Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings",

note = "11th International Conference on Applied Cryptography and Network Security, ACNS 2013 ; Conference date: 25-06-2013 Through 28-06-2013",

}

Blazy, O, Chevalier, C, Pointcheval, D & Vergnaud, D 2013, Analysis and improvement of Lindell's UC-secure commitment schemes. in Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 7954 LNCS, pp. 534-551, 11th International Conference on Applied Cryptography and Network Security, ACNS 2013, Banff, AB, Canada, 25/06/13. https://doi.org/10.1007/978-3-642-38980-1_34

Analysis and improvement of Lindell's UC-secure commitment schemes. / Blazy, Olivier; Chevalier, Céline; Pointcheval, David et al.
Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. p. 534-551 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7954 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Analysis and improvement of Lindell's UC-secure commitment schemes

AU - Blazy, Olivier

AU - Chevalier, Céline

AU - Pointcheval, David

AU - Vergnaud, Damien

PY - 2013/7/12

Y1 - 2013/7/12

N2 - 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).

AB - 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).

U2 - 10.1007/978-3-642-38980-1_34

DO - 10.1007/978-3-642-38980-1_34

M3 - Conference contribution

AN - SCOPUS:84879851677

SN - 9783642389795

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 534

EP - 551

BT - Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings

T2 - 11th International Conference on Applied Cryptography and Network Security, ACNS 2013

Y2 - 25 June 2013 through 28 June 2013

ER -

Blazy O, Chevalier C, Pointcheval D, Vergnaud D. Analysis and improvement of Lindell's UC-secure commitment schemes. In Applied Cryptography and Network Security - 11th International Conference, ACNS 2013, Proceedings. 2013. p. 534-551. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-38980-1_34

Analysis and improvement of Lindell's UC-secure commitment schemes

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this