conference paper Open access
On the Complexity of Additively Homomorphic UC Commitments
Tore Kasper Frederiksena, Thomas Pelle Jakobsena, Jesper Buus Nielsena, Roberto Trifilettia✉
- aDepartment of Computer Science, Aarhus University, Aarhus, Denmark
- ✉Corresponding author
Lecture notes in computer scienceSpringer Science+Business Media2015-12-18 35 citations39 references
Looking for the full paper…
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
No abstract is available from our sources. Use “Read paper” to view it.
TL;DRThis work presents a new constant round additively homomorphic commitment scheme with amortized computational and communication complexity linear in the size of the string committed to and proves its scheme secure in the Universal Composability UC framework against a static and malicious adversary corrupting any number of parties. (Semantic Scholar)