Additively Homomorphic UC commitments with Optimal Amortized Overhead

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

We propose the first UC secure commitment scheme with (amortized) computational complexity linear in the size of the string committed to. After a preprocessing phase based on oblivious transfer, that only needs to be done once and for all, our scheme only requires a pseudorandom generator and a linear code with efficient encoding. We also construct an additively homomorphic version of our basic scheme using VSS. Furthermore we evaluate the concrete efficiency of our schemes and show that the amortized computational overhead is significantly lower than in the previous best constructions. In fact, our basic scheme has amortised concrete efficiency comparable with previous protocols in the Random Oracle Model even though it is constructed in the plain model.
Original languageEnglish
Title of host publication Public-Key Cryptography, PKC 2015 : 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30-April 1, 2015, Proceedings
Editors Jonathan Katz
Number of pages21
Publication year2015
ISBN (print)978-3-662-46446-5
ISBN (Electronic)978-3-662-46447-2
Publication statusPublished - 2015
EventInternational Conference on Practice and Theory in Public-Key Cryptography - Gaithersburg, United States
Duration: 30 Mar 20151 Apr 2015
Conference number: 18


ConferenceInternational Conference on Practice and Theory in Public-Key Cryptography
LandUnited States
SeriesLecture Notes in Computer Science

    Research areas

  • cryptographic protocols, universal composability, commitment, VSS, secret sharing, coding, asymptotics

See relations at Aarhus University Citationformats

ID: 85054057