Name
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-98113-0_20 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Homomorphic encryption,Lattice (order),Computer science,Computer network,Commitment scheme,Theoretical computer science | Conference | 11035 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.36 |
References | Authors | |
14 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carsten Baum | 1 | 52 | 9.67 |
| Ivan Damgård | 2 | 5851 | 431.52 |
| Vadim Lyubashevsky | 3 | 1174 | 59.91 |
| Sabine Oechsner | 4 | 7 | 1.79 |
| Chris Peikert | 5 | 3840 | 154.98 |