Welcome to the resource topic for 2014/934
Title:
Efficient Generic Zero-Knowledge Proofs from Commitments
Authors: Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias
Abstract:Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel and efficient Zero-knowledge protocol for circuit satisfiability. We can prove knowledge of the AES-key which map a particular plaintext to a particular ciphertext in less than 4 seconds with a soundness error of 2^{-40}. Our protocol only requires a number of commitments proportional to the security parameter with a small constant (roughly 5).
ePrint: https://eprint.iacr.org/2014/934
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .