scientific article; zbMATH DE number 1559565
From MaRDI portal
Publication:4527017
Recommendations
- Probabilistically checkable proofs of proximity with zero-knowledge
- Probabilistically checkable proofs and codes
- Zero knowledge with efficient provers
- scientific article; zbMATH DE number 94166
- Zero-Knowledge Proofs
- Zero‐Knowledge Proofs
- Zero-knowledge proofs from secure multiparty computation
- Composition of zero-knowledge proofs with efficient provers
- scientific article; zbMATH DE number 4197461
- On the concrete efficiency of probabilistically-checkable proofs
Cited in
(26)- Zero knowledge protocols from succinct constraint detection
- Statistical ZAPR arguments from bilinear maps
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration
- ZK-PCPs from leakage-resilient secret sharing
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Succinct arguments in the quantum random oracle model
- Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- A general, flexible and efficient proof of inclusion and exclusion
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Zero-Knowledge Proofs with Witness Elimination
- Provably Hard Zero-Way Functions
- Languages with efficient zero-knowledge PCPs are in SZK
- Zero-knowledge proofs of proximity
- Fast Reed-Solomon interactive oracle proofs of proximity
- Spatial Isolation Implies Zero Knowledge Even in a Quantum World
- Computational integrity with a public random string from quasi-linear PCPs
- On the concrete efficiency of probabilistically-checkable proofs
- Probabilistically checkable proofs of proximity with zero-knowledge
- scientific article; zbMATH DE number 4185024 (Why is no real title available?)
- Zero-knowledge IOPs approaching witness length
- Your reputation's safe with me: framing-free distributed zero-knowledge proofs
- How to share an NP statement or combiners for zero-knowledge proofs
- Query-reusable proof systems
- Untangling the security of Kilian's protocol: upper and lower bounds
- Universally composable succinct vector commitments and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4527017)
