Zero-Knowledge Proofs of Proximity
© Itay Berman, Ron D. Rothblum and Vinod Vaikuntanathan. Interactive proofs of proximity (IPPs) are interactive proofs in which the verifier runs in time sub-linear in the input length. Since the verifier cannot even read the entire input, following the property testing literature, we only require t...
Main Authors: | Berman, Itay, Rothblum, Ron D., Vaikuntananthan, Vinod |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137815 |
Similar Items
-
Non-interactive proofs of proximity
by: Gur, Tom, et al.
Published: (2018) -
Information theoretic advances in zero-knowledge
by: Berman, Itay.
Published: (2019) -
Fiat-Shamir via List-Recoverable Codes (or: Parallel Repetition of GMW Is Not Zero-Knowledge)
by: Holmgren, Justin, et al.
Published: (2022) -
On deploying succinct zero-knowledge proofs
by: Virza, Madars
Published: (2018) -
Non-interactive zero-knowledge functional proofs
by: Zeng, Gongxian, et al.
Published: (2023)