More Efficient Commitments from Structured Lattice Assumptions
SCN, pp. 368-385, 2018.
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 possi...More
Full Text (Upload PDF)
PPT (Upload PPT)