More Efficient Commitments from Structured Lattice Assumptions

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

Full description

Saved in:
Bibliographic Details
Published inSecurity and Cryptography for Networks pp. 368 - 385
Main Authors Baum, Carsten, Damgård, Ivan, Lyubashevsky, Vadim, Oechsner, Sabine, Peikert, Chris
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing 2018
SeriesLecture Notes in Computer Science
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography: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.
ISBN:9783319981123
3319981129
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-98113-0_20