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

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.
AbstractList 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 Oechsner, Sabine
Lyubashevsky, Vadim
Baum, Carsten
Peikert, Chris
Damgård, Ivan
Author_xml – sequence: 1
  givenname: Carsten
  surname: Baum
  fullname: Baum, Carsten
– sequence: 2
  givenname: Ivan
  surname: Damgård
  fullname: Damgård, Ivan
– sequence: 3
  givenname: Vadim
  surname: Lyubashevsky
  fullname: Lyubashevsky, Vadim
  email: vad@zurich.ibm.com
– sequence: 4
  givenname: Sabine
  surname: Oechsner
  fullname: Oechsner, Sabine
– sequence: 5
  givenname: Chris
  surname: Peikert
  fullname: Peikert, Chris
BookMark eNpVkM1OwzAQhA0UiVD6BhzyAoa1N4ntC1JVlR-piANwtlJnjQIkrmL3_XELF047-ma12plLNhvDSIxdC7gRAOrWKM2RozDcaCGQg5VwwhYZY4ZHBqesEI0QHLEyZ_88iTNWAILkRlV4wRYxfgKABG006oLdPYeJyrX3vetpTOUqDEOfhixj6acwlK9p2ru0n6grN21KvaNyGeN-2KU-jPGKnfv2O9Lib87Z-_36bfXINy8PT6vlhkchdeI1eFEbU5EGEmR8Q42RrqO61oReKUn58W7bVk52jTMtaMo7SrVKZOU0zpn8vRt3Uz9-0GS3IXxFK8AeSrI5sUWbM9tjIfZQEv4AkjhXjw
ContentType Book Chapter
Copyright Springer Nature Switzerland AG 2018
Copyright_xml – notice: Springer Nature Switzerland AG 2018
DOI 10.1007/978-3-319-98113-0_20
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783319981130
3319981137
EISSN 1611-3349
Editor Catalano, Dario
De Prisco, Roberto
Editor_xml – sequence: 1
  givenname: Dario
  surname: Catalano
  fullname: Catalano, Dario
  email: catalano@dmi.unict.it
– sequence: 2
  givenname: Roberto
  surname: De Prisco
  fullname: De Prisco, Roberto
  email: robdep@unisa.it
EndPage 385
GroupedDBID -DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ABMNI
ACGFS
ADCXD
AEFIE
ALMA_UNASSIGNED_HOLDINGS
EJD
F5P
FEDTE
HVGLF
LAS
LDH
P2P
RIG
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-s128t-50f15994e80e1e9f6e692cde558e3f772e349dba4c2d6c9a08ef6e77a718efc83
ISBN 9783319981123
3319981129
ISSN 0302-9743
IngestDate Tue Jul 29 20:14:46 EDT 2025
IsPeerReviewed true
IsScholarly true
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-s128t-50f15994e80e1e9f6e692cde558e3f772e349dba4c2d6c9a08ef6e77a718efc83
Notes 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.
PageCount 18
ParticipantIDs springer_books_10_1007_978_3_319_98113_0_20
PublicationCentury 2000
PublicationDate 2018
PublicationDateYYYYMMDD 2018-01-01
PublicationDate_xml – year: 2018
  text: 2018
PublicationDecade 2010
PublicationPlace Cham
PublicationPlace_xml – name: Cham
PublicationSeriesSubtitle Security and Cryptology
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 11th International Conference, SCN 2018, Amalfi, Italy, September 5–7, 2018, Proceedings
PublicationTitle Security and Cryptography for Networks
PublicationYear 2018
Publisher Springer International Publishing
Publisher_xml – name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Mattern, Friedemann
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Steffen, Bernhard
Pandu Rangan, C.
Kanade, Takeo
Kittler, Josef
Weikum, Gerhard
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
– sequence: 9
  givenname: Bernhard
  surname: Steffen
  fullname: Steffen, Bernhard
– sequence: 10
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
– sequence: 11
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
– sequence: 12
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
SSID ssj0002089838
ssj0002792
Score 2.2469451
Snippet We present a practical construction of an additively homomorphic commitment scheme based on structured lattice assumptions, together with a zero-knowledge...
SourceID springer
SourceType Publisher
StartPage 368
Title More Efficient Commitments from Structured Lattice Assumptions
URI http://link.springer.com/10.1007/978-3-319-98113-0_20
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9tAEF6F9FJxANoiKFDtgRtyZWf9PFCpClSA0lwKiJu13h1DDkkq4iDBT-mv7czu-kHgAhcrWjuxM996dnZmvhnGDlUhhUqE8jTxt8IgLD2plPbSMkySuNRxZmp3_h7HZ1fhxU100-v962QtLaviu3p6lVfyHlRxDHElluwbkG1-FAfwM-KLR0QYjyvG73M3q-VwuM5zxv0_vH_8W7nq0yZzcGzTu1snuLQNjYe4ka1a-teJnN6aWHlkU9zPHzo5Oo9LXOPu4MH5V6-lnkwbpyyou0XdtUsWTXTe9Yaa3wM1bZ4YuiUpnemksmQ6w2f5Y6rWLin3fSQryr-jeYIzq3UfkgBhcTxyMY7xvDKpY0d1G4paK3XdFkG64rao3ZYrjs_W9_ZsnysEUQHRNBQd9ShQl-NuyA6BVd8xFWUUtgiqU8nCtu1xq7uwDYJeLBzdXBHiddHdhOfnA3-NrSVp1Gcffp5ejK4b_93ATzMTcXarPhVitBEr-1TEI6qfOrOVntp_0eFwvnbLF1F5Y-xcbrJ1IsBwYqag0LZYD2af2EYtd-7k_pn9IJR5gzLvoMwJZd6izB3KvIPyF3b16_RyeOa5dhzeAo2Yyov8Em3fLITUhwCyMgZ8kZWGKEpBlLhLAxS8LmSoBjpWmfRTwGuSRKL5A6VKxTbrz-Yz2GG8DDSe1z5-FXfoIs50gCuB1AAqkJCJXXZUCyCnF2yR19W1UVy5yFFcuRFXTuL6-qar99jHdj7usz6KAg7QsKyKbw7j_0wVcqc
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Security+and+Cryptography+for+Networks&rft.au=Baum%2C+Carsten&rft.au=Damg%C3%A5rd%2C+Ivan&rft.au=Lyubashevsky%2C+Vadim&rft.au=Oechsner%2C+Sabine&rft.atitle=More+Efficient+Commitments+from+Structured+Lattice+Assumptions&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2018-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319981123&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=368&rft.epage=385&rft_id=info:doi/10.1007%2F978-3-319-98113-0_20
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0302-9743&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0302-9743&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0302-9743&client=summon