Efficiency lower bounds for commit-and-prove constructions

Christian Badertscher
Christian Badertscher
Chen-Da Liu Zhang
Chen-Da Liu Zhang

ISIT, pp. 1788-1792, 2017.

Cited by: 0|Bibtex|Views2|Links
EI

Abstract:

Commitment schemes that admit zero-knowledge proofs for relations among committed values are known as commit-and-prove functionalities or notarized envelopes. An important role in this context play equality proofs among commitments. They appear in various contexts of multi-party computation, circuit satisfiability or inclusion proofs. Usi...More

Code:

Data:

Your rating :
0

 

Tags
Comments