Efficiency lower bounds for commit-and-prove constructions
ISIT, pp. 1788-1792, 2017.
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
Full Text (Upload PDF)
PPT (Upload PPT)