Abstract. While 4-round constructions of zero-knowledge arguments are known based on the existence of one-way functions, constuctions of resettably-sound ...
We close this gap by demonstrating a 4- round resettably-sound zero-knowledge argument for NP based on the existence of one-way functions. Keywords. Signature ...
4-Round Resettably-Sound Zero Knowledge. Authors: Kai-Min Chung · Rafail Ostrovsky · Rafael Pass · Muthuramakrishnan Venkitasubramaniam · Ivan Visconti.
This paper focuses on zero-knowledge protocols for NP with low round complexity under the augmented black-box simulation technique, in which the simulator ...
Collection of papers read. Contribute to emintham/Papers development by creating an account on GitHub.
Duration: 23:47
Posted: Mar 12, 2014
Posted: Mar 12, 2014
Abstract. In FOCS 2001 Barak et al. conjectured the existence of zero-knowledge arguments that remain secure against resetting provers and resetting ...
We close this gap by demonstrating a 4-round resettably-sound zero-knowledge argument for NP based on the existence of one-way functions.
While 4-round constructions of zero-knowledge arguments are known based on the existence of one-way functions, constuctions of resettably-sound.
We close this gap by demonstrating a 4-round resettably-sound zero-knowledge argument for NP based on the existence of one-way functions. Original language ...