Zero-Knowledge Proofs of Proximity
From MaRDI portal
Publication:4993282
DOI10.4230/LIPIcs.ITCS.2018.19zbMath1462.68046OpenAlexW2783323265MaRDI QIDQ4993282
Vinod Vaikuntanathan, Itay Berman, Ron D. Rothblum
Publication date: 15 June 2021
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2018/8357/pdf/LIPIcs-ITCS-2018-19.pdf/
Analysis of algorithms and problem complexity (68Q25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Randomized algorithms (68W20)
Related Items (2)
A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- A study of statistical zero-knowledge proofs (to appear)
- A language-dependent cryptographic primitive
- Property testing lower bounds via communication complexity
- Testing the expansion of a graph
- Quantifying knowledge complexity
- Zero knowledge protocols from succinct constraint detection
- Fast approximate probabilistically checkable proofs
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Enhancements of trapdoor permutations
- Regular Languages are Testable with a Constant Number of Queries
- Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
- From Private Simultaneous Messages to Zero-Information Arthur-Merlin Protocols and Back
- Zero knowledge with efficient provers
- Local zero knowledge
- Partial tests, universal tests and decomposability
- Non-Interactive Proofs of Proximity
- On Testing Expansion in Bounded-Degree Graphs
- Property testing and its connection to learning and approximation
- Interactive Oracle Proofs
- Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs
- Arguments of Proximity
- Interactive PCP
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
- The Knowledge Complexity of Interactive Proof Systems
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Foundations of Cryptography
- Robust Characterizations of Polynomials with Applications to Program Testing
- Testing Expansion in Bounded-Degree Graphs
- Constant-round interactive proofs for delegating computation
- Introduction to Property Testing
- Advances in Cryptology - CRYPTO 2003
- An Equivalence Between Zero Knowledge and Commitments
- Interactive proofs of proximity
- Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
- An Expansion Tester for Bounded Degree Graphs
- Property testing in bounded degree graphs
This page was built for publication: Zero-Knowledge Proofs of Proximity
