Paper 2014/829
Additively Homomorphic UC commitments with Optimal Amortized Overhead
Ignacio Cascudo, Ivan Damgård, Bernardo David, Irene Giacomelli, Jesper Buus Nielsen, and Roberto Trifiletti
Abstract
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.
Note: Full version of the paper appeared in PKC2015
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Published by the IACR in PKC 2015
- Keywords
- universal composabilitycommitmentVSSsecret sharingcodingasymptotics
- Contact author(s)
- giacomelli @ cs au dk
- History
- 2015-01-11: last of 2 revisions
- 2014-10-13: received
- See all versions
- Short URL
- https://ia.cr/2014/829
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/829,
author = {Ignacio Cascudo and Ivan Damgård and Bernardo David and Irene Giacomelli and Jesper Buus Nielsen and Roberto Trifiletti},
title = {Additively Homomorphic {UC} commitments with Optimal Amortized Overhead},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/829},
year = {2014},
url = {https://eprint.iacr.org/2014/829}
}
