More Efficient Commitments from Structured Lattice Assumptions

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

Paper 2016/997 Original: eprint.iacr.org/2016/997 ↗

More Efficient Commitments from Structured Lattice Assumptions

Carsten Baum

Ivan Damgård

Vadim Lyubashevsky

Sabine Oechsner

Chris Peikert

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.

Metadata

Available format(s): PDF
Publication info: Preprint.
History: 2018-06-21: last updated; 2016-10-20: published
Short URL: https://ia.cr/2016/997
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2016/997,
      author = {Carsten Baum and Ivan Damgård and Vadim Lyubashevsky and Sabine Oechsner and Chris Peikert},
      title = {More Efficient Commitments from Structured Lattice Assumptions},
      howpublished = {Cryptology {ePrint} Archive, Paper 2016/997},
      year = {2016},
      url = {https://eprint.iacr.org/2016/997}
}