Three Round Zero-Knowledge Using a Proof of Knowledge Assumption
We provide a proof of knowledge assumption that allows us to construct a three round zero-knowledge proof system for any language in NP.
Main Authors: | Lepinski, Matthew, Micali, Silvio |
---|---|
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149305 |
Similar Items
-
On the existence of 3-round zero-knowledge proofs
by: Lepinski, Matthew (Matthew Baker), 1978-
Published: (2014) -
3-round weak zero-knowledge proofs for [Nu] [Rho]
by: Lim, Dah-Yoh, 1978-
Published: (2005) -
More on Proofs of Knowledge
by: Halevi, Shai, et al.
Published: (2023) -
Zero-Knowledge Proofs of Proximity
by: Berman, Itay, et al.
Published: (2021) -
On deploying succinct zero-knowledge proofs
by: Virza, Madars
Published: (2018)