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 proceedingConference contribution

Abstract / Description of output

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 languageEnglish
Title of host publicationSecurity and Cryptography for Networks
EditorsDario Catalano, Roberto De Prisco
Place of PublicationCham
PublisherSpringer International Publishing
Number of pages18
ISBN (Electronic)978-3-319-98113-0
Publication statusPublished - 3 Aug 2018
Event11th Conference on Security and Cryptography for Networks - Amalfi, Italy
Duration: 5 Sept 20187 Sept 2018

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th Conference on Security and Cryptography for Networks
Abbreviated titleSCN 2018
Internet address


Dive into the research topics of 'More Efficient Commitments from Structured Lattice Assumptions'. Together they form a unique fingerprint.

Cite this