Abstract
The round complexity of commitment schemes secure against man-in-the-middle attacks has been the focus of extensive research for about 25 years. The recent breakthrough of Goyal et al. [22] showed that 3 rounds are sufficient for (one-left, one-right) non-malleable commitments. This result matches a lower bound of [41]. The state of affairs leaves still open the intriguing problem of constructing 3-round concurrent non-malleable commitment schemes.
In this paper we solve the above open problem by showing how to transform any 3-round (one-left one-right) non-malleable commitment scheme (with some extractability property) in a 3-round concurrent non-malleable commitment scheme. Our transform makes use of complexity leveraging and when instantiated with the construction of [22] gives a 3-round concurrent non-malleable commitment scheme from one-way permutations secure w.r.t. subexponential-time adversaries.
We also show a 3-round arguments of knowledge and a 3-round identification scheme secure against concurrent man-in-the-middle attacks.
In this paper we solve the above open problem by showing how to transform any 3-round (one-left one-right) non-malleable commitment scheme (with some extractability property) in a 3-round concurrent non-malleable commitment scheme. Our transform makes use of complexity leveraging and when instantiated with the construction of [22] gives a 3-round concurrent non-malleable commitment scheme from one-way permutations secure w.r.t. subexponential-time adversaries.
We also show a 3-round arguments of knowledge and a 3-round identification scheme secure against concurrent man-in-the-middle attacks.
Original language | English |
---|---|
Title of host publication | Advances in Cryptology -- CRYPTO 2016 |
Editors | Matthew Robshaw, Jonathan Katz |
Place of Publication | Berlin, Heidelberg |
Publisher | Springer Berlin Heidelberg |
Pages | 270-299 |
Number of pages | 30 |
ISBN (Electronic) | 978-3-662-53015-3 |
ISBN (Print) | 978-3-662-53014-6 |
DOIs | |
Publication status | Published - 21 Jul 2016 |
Event | 36th Annual International Cryptology Conference - University of California, Santa Barbara, United States Duration: 14 Aug 2016 → 18 Aug 2016 https://www.iacr.org/conferences/crypto2016/ https://www.iacr.org/conferences/crypto2016/index.html |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer, Berlin, Heidelberg |
Volume | 9816 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 36th Annual International Cryptology Conference |
---|---|
Abbreviated title | CRYPTO 2016 |
Country/Territory | United States |
City | Santa Barbara |
Period | 14/08/16 → 18/08/16 |
Internet address |