More efficient commitments from structured lattice assumptions

Carsten Baum; Ivan Damgård; Vadim Lyubashevsky; Sabine Oechsner; Chris Peikert

doi:10.1007/978-3-319-98113-0_20

More efficient commitments from structured lattice assumptions

Carsten Baum, Ivan Damgård, Vadim Lyubashevsky, Sabine Oechsner, Chris Peikert

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

Abstract

We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design improvement over the previous work of Benhamouda et al. in that it is not restricted to being statistically binding. While it is possible to instantiate our scheme to be statistically binding or statistically hiding, it is most efficient when both hiding and binding properties are only computational. This results in approximately a factor of 4 reduction in the size of the proof and a factor of 6 reduction in the size of the commitment over the aforementioned scheme.

Original language	English
Title of host publication	Security and Cryptography for Networks
Subtitle of host publication	11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings
Editors	Dario Catalano, Roberto De Prisco
Publisher	Springer Verlag
Pages	368-385
Number of pages	18
ISBN (Electronic)	9783319981130
ISBN (Print)	9783319981123
DOIs	https://doi.org/10.1007/978-3-319-98113-0_20
Publication status	Published - 2018
Externally published	Yes
Event	11th International Conference on Security and Cryptography for Networks, SCN 2018 - Amalfi, Italy Duration: 5 Sept 2018 → 7 Sept 2018

Publication series

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

Conference

Conference	11th International Conference on Security and Cryptography for Networks, SCN 2018
Country/Territory	Italy
City	Amalfi
Period	5/09/18 → 7/09/18

Funding

Full version of the paper available at https://eprint.iacr.org/2016/997. C. Baum—Supported by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office and COST Action IC1306. I. Damgård—Supported by the European Research Council (ERC) under the European Unions’s Horizon 2020 research and innovation programme under grant agreement No 669255 (MPCPRO). V. Lyubashevsky—Supported by the SNSF ERC Transfer Grant CRETP2-166734 – FELICITY. S. Oechsner—Supported by the European Research Council (ERC) under the European Unions’s Horizon 2020 research and innovation programme under grant agreement No 669255 (MPCPRO); the Danish Independent Research Council under Grant-ID DFF-6108-00169 (FoCC); the European Union’s Horizon 2020 research and innovation programme under grant agreement No 731583 (SODA). C. Peikert—Supported by the National Science Foundation under CAREER Award CCF-1054495 and CNS-1606362, the Alfred P. Sloan Foundation, and by a Google Research Award. The views expressed are those of the authors and do not necessarily reflect the official policy or position of the National Science Foundation, the Sloan Foundation, or Google.

Funders	Funder number
FoCC
National Science Foundation	CCF-1054495, CNS-1606362
Alfred P. Sloan Foundation
Google
Natur og Univers, Det Frie Forskningsråd	DFF-6108-00169
Horizon 2020 Framework Programme	669255, 731583
European Research Council

Access to Document

10.1007/978-3-319-98113-0_20

Persistent URL (handle)

Persistent link

Cite this

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S., & Peikert, C. (2018). More efficient commitments from structured lattice assumptions. In D. Catalano, & R. De Prisco (Eds.), Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings (pp. 368-385). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11035 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-98113-0_20

Baum, Carsten ; Damgård, Ivan ; Lyubashevsky, Vadim et al. / More efficient commitments from structured lattice assumptions. Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings. editor / Dario Catalano ; Roberto De Prisco. Springer Verlag, 2018. pp. 368-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{d7bd71c03fd14b78a386ac281ed9b603,

title = "More efficient commitments from structured lattice assumptions",

abstract = "We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design improvement over the previous work of Benhamouda et al. in that it is not restricted to being statistically binding. While it is possible to instantiate our scheme to be statistically binding or statistically hiding, it is most efficient when both hiding and binding properties are only computational. This results in approximately a factor of 4 reduction in the size of the proof and a factor of 6 reduction in the size of the commitment over the aforementioned scheme.",

author = "Carsten Baum and Ivan Damg{\aa}rd and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert",

year = "2018",

doi = "10.1007/978-3-319-98113-0\_20",

language = "English",

isbn = "9783319981123",

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

publisher = "Springer Verlag",

pages = "368--385",

editor = "Dario Catalano and \{De Prisco\}, Roberto",

booktitle = "Security and Cryptography for Networks",

note = "11th International Conference on Security and Cryptography for Networks, SCN 2018 ; Conference date: 05-09-2018 Through 07-09-2018",

}

Baum, C, Damgård, I, Lyubashevsky, V, Oechsner, S & Peikert, C 2018, More efficient commitments from structured lattice assumptions. in D Catalano & R De Prisco (eds), Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11035 LNCS, Springer Verlag, pp. 368-385, 11th International Conference on Security and Cryptography for Networks, SCN 2018, Amalfi, Italy, 5/09/18. https://doi.org/10.1007/978-3-319-98113-0_20

More efficient commitments from structured lattice assumptions. / Baum, Carsten; Damgård, Ivan; Lyubashevsky, Vadim et al.
Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings. ed. / Dario Catalano; Roberto De Prisco. Springer Verlag, 2018. p. 368-385 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11035 LNCS).

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

TY - GEN

T1 - More efficient commitments from structured lattice assumptions

AU - Baum, Carsten

AU - Damgård, Ivan

AU - Lyubashevsky, Vadim

AU - Oechsner, Sabine

AU - Peikert, Chris

PY - 2018

Y1 - 2018

N2 - We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design improvement over the previous work of Benhamouda et al. in that it is not restricted to being statistically binding. While it is possible to instantiate our scheme to be statistically binding or statistically hiding, it is most efficient when both hiding and binding properties are only computational. This results in approximately a factor of 4 reduction in the size of the proof and a factor of 6 reduction in the size of the commitment over the aforementioned scheme.

AB - We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge proof of opening knowledge. Our scheme is a design improvement over the previous work of Benhamouda et al. in that it is not restricted to being statistically binding. While it is possible to instantiate our scheme to be statistically binding or statistically hiding, it is most efficient when both hiding and binding properties are only computational. This results in approximately a factor of 4 reduction in the size of the proof and a factor of 6 reduction in the size of the commitment over the aforementioned scheme.

UR - https://www.scopus.com/pages/publications/85053597711

UR - https://www.scopus.com/inward/citedby.url?scp=85053597711&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-98113-0_20

DO - 10.1007/978-3-319-98113-0_20

M3 - Conference contribution

SN - 9783319981123

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

SP - 368

EP - 385

BT - Security and Cryptography for Networks

A2 - Catalano, Dario

A2 - De Prisco, Roberto

PB - Springer Verlag

T2 - 11th International Conference on Security and Cryptography for Networks, SCN 2018

Y2 - 5 September 2018 through 7 September 2018

ER -

Baum C, Damgård I, Lyubashevsky V, Oechsner S, Peikert C. More efficient commitments from structured lattice assumptions. In Catalano D, De Prisco R, editors, Security and Cryptography for Networks: 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings. Springer Verlag. 2018. p. 368-385. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). Epub 2018 Aug 3. doi: 10.1007/978-3-319-98113-0_20

More efficient commitments from structured lattice assumptions

Abstract

Publication series

Conference

Funding

Access to Document

Persistent URL (handle)

Other files and links

Fingerprint

Cite this