Sciweavers

Share
TCC
2016
Springer

On the Complexity of Additively Homomorphic UC Commitments

2 years 11 months ago
On the Complexity of Additively Homomorphic UC Commitments
We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. Our scheme is based on the non-homomorphic commitment scheme of Cascudo et al. presented at PKC 2015. However, we manage to add the additive homomorphic property, while at the same time reducing the constants. In fact, when opening a large enough batch of commitments we achieve an amortized communication complexity converging to the length of the message committed to, i.e., we achieve close to rate 1 as the commitment protocol by Garay et al. from Eurocrypt 2014. A main technical improvement over the scheme mentioned above, and other schemes based on using error correcting codes for UC commitment, we develop a new technique which allows to based the extraction property on erasure decoding as opposed to error correction. This allows to use a code with significantly smaller minimal distance and allows to use c...
Tore Kasper Frederiksen, Thomas P. Jakobsen, Jespe
Added 10 Apr 2016
Updated 10 Apr 2016
Type Journal
Year 2016
Where TCC
Authors Tore Kasper Frederiksen, Thomas P. Jakobsen, Jesper Buus Nielsen, Roberto Trifiletti
Comments (0)
books