Zero-knowledge proofs of proximity
From MaRDI portal
Recommendations
Cites work
- A language-dependent cryptographic primitive
- A study of statistical zero-knowledge proofs (to appear)
- Advances in Cryptology - CRYPTO 2003
- An Equivalence Between Zero Knowledge and Commitments
- An expansion tester for bounded degree graphs
- Arguments of proximity (extended abstract)
- Certifying permutations: Noninteractive zero-knowledge based on any trapdoor permutation
- Constant-round interactive proofs for delegating computation
- Enhancements of trapdoor permutations
- Fast approximate probabilistically checkable proofs
- Foundations of Cryptography
- From private simultaneous messages to zero-information Arthur-Merlin protocols and back
- scientific article; zbMATH DE number 1559565 (Why is no real title available?)
- scientific article; zbMATH DE number 1775425 (Why is no real title available?)
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Impossibility of succinct quantum proofs for collision-freeness
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Interactive oracle proofs
- Interactive PCP
- Interactive proofs of proximity: delegating computation in sublinear time
- Introduction to Property Testing
- Local zero knowledge
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Non-interactive proofs of proximity
- On testing expansion in bounded-degree graphs
- Partial tests, universal tests and decomposability
- Probabilistically checkable proofs of proximity with zero-knowledge
- Proofs of proximity for context-free languages and read-once branching programs
- Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems
- Property testing and its connection to learning and approximation
- Property testing in bounded degree graphs
- Property testing lower bounds via communication complexity
- Quantifying knowledge complexity
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Regular languages are testable with a constant number of queries
- Robust Characterizations of Polynomials with Applications to Program Testing
- Strong locally testable codes with relaxed local decoders
- Testing Expansion in Bounded-Degree Graphs
- Testing the expansion of a graph
- The Knowledge Complexity of Interactive Proof Systems
- Zero knowledge protocols from succinct constraint detection
- Zero knowledge with efficient provers
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Zero-knowledge proofs from secure multiparty computation
Cited in
(10)- Non-interactive proofs of proximity
- Optimal Proximity Proofs Revisited
- Non-interactive proofs of proximity
- Arguments of proximity (extended abstract)
- scientific article; zbMATH DE number 7250162 (Why is no real title available?)
- Probabilistically checkable proofs of proximity with zero-knowledge
- Card-based zero-knowledge proof for the nearest neighbor property: zero-knowledge proof of ABC end view
- A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Verification
- Distribution-free proofs of proximity
- Streaming zero-knowledge proofs
This page was built for publication: Zero-knowledge proofs of proximity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993282)
