Interactive oracle proofs
From MaRDI portal
Recommendations
- Interactive oracle proofs with constant rate and query complexity
- A toolbox for barriers on interactive oracle proofs
- A PCP theorem for interactive proofs and applications
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- Linear-size constant-query IOPs for delegating computation
Cites work
- scientific article; zbMATH DE number 998060 (Why is no real title available?)
- scientific article; zbMATH DE number 4195165 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- scientific article; zbMATH DE number 1302862 (Why is no real title available?)
- scientific article; zbMATH DE number 708820 (Why is no real title available?)
- A transform for NIZK almost as efficient and general as the Fiat-Shamir transform without programmable random oracles
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Algebraic methods for interactive proof systems
- An efficient transform from sigma protocols to NIZK with a CRS and non-programmable random oracle
- Black-box non-black-box zero knowledge
- Communication-Efficient Non-interactive Proofs of Knowledge with Online Extractors
- Computationally Sound Proofs
- Constant rate PCPs for circuit-SAT with sublinear query complexity
- Constant-round interactive proofs for delegating computation
- Delegation for bounded space
- Does co-NP have short interactive proofs ?
- Fiat-Shamir for highly sound protocols is instantiable
- From obfuscation to the security of Fiat-Shamir for proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How to delegate computations
- IP = PSPACE
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Interactive Coding for Interactive Proofs
- Interactive PCP
- Interactive locking, zero-knowledge PCPs, and unconditional cryptography
- Interactive oracle proofs
- Magic functions
- Minimum disclosure proofs of knowledge
- Non-deterministic exponential time has two-prover interactive protocols
- On Efficient Zero-Knowledge PCPs
- On interactive proofs with a laconic prover
- On the Composition of Public-Coin Zero-Knowledge Protocols
- On the complexity of interactive proofs with bounded communication
- On the power of multi-prover interactive protocols
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy
- Polynomial-Space Approximation of No-Signaling Provers
- Probabilistic checking of proofs
- Probabilistically Checkable Arguments
- Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments
- Proof verification and the hardness of approximation problems
- Quadratic span programs and succinct NIZKs without PCPs
- Quasi-linear size zero knowledge from linear-algebraic PCPs
- Robust PSPs of proximity, shorter PSPs and applications to coding
- Security proofs for signature schemes
- Short PCPs with Polylog Query Complexity
- Short pairing-based non-interactive zero-knowledge arguments
- Small PCPs with low query complexity
- Succinct non-interactive arguments via linear interactive proofs
- The Knowledge Complexity of Interactive Proof Systems
- The random oracle methodology, revisited.
- Universal Arguments and their Applications
- Why ``Fiat-Shamir for proofs lacks a proof
- Zero knowledge in the random oracle model, revisited
Cited in
(only showing first 100 items - show all)- Universally composable non-interactive zero-knowledge from sigma protocols via a new straight-line compiler
- Space-lock puzzles and verifiable space-hard functions from root-finding in sparse polynomials
- From one-time to two-round reusable multi-signatures without nested forking
- Security bounds for proof-carrying data from straightline extractors
- scientific article; zbMATH DE number 7250164 (Why is no real title available?)
- Untangling the security of Kilian's protocol: upper and lower bounds
- Hamming weight proofs of proximity with one-sided error
- The brave new world of global generic groups and UC-secure zero-overhead SNARKs
- zkSNARKs in the ROM with unconditional UC-security
- The power of NAPs: compressing OR-proofs via collision-resistant hashing
- Interactive proofs for social graphs
- Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs
- On the (In)security of Kilian-based SNARGs
- Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- Fiat-Shamir security of FRI and related SNARKs
- Sigma protocols from verifiable secret sharing and their applications
- Interactive Coding for Interactive Proofs
- Brakedown: linear-time and field-agnostic SNARKs for R1CS
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Succinct arguments for RAM programs via projection codes
- Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- An algebraic framework for universal and updatable SNARKs
- Subquadratic SNARGs in the random oracle model
- Rogue-instance security for batch knowledge proofs
- No-signaling linear PCPs
- On black-box constructions of time and space efficient sublinear arguments from symmetric-key primitives
- Zero-knowledge proofs of proximity
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Parallelizable delegation from LWE
- Fiat-Shamir transformation of multi-round interactive proofs
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
- From polynomial IOP and commitments to non-malleable zkSNARKs
- Generalized special-sound interactive proofs and their knowledge soundness
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach
- Tight state-restoration soundness in the algebraic group model
- Plumo: an ultralight blockchain client
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Quantum rewinding for many-round protocols
- Flexible and efficient verifiable computation on encrypted data
- \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
- Does Fiat-Shamir require a cryptographic hash function?
- Proximity gaps for Reed-Solomon codes
- Local proofs approaching the witness length
- HyperPlonk: Plonk with linear-time prover and high-degree custom gates
- Spartan and bulletproofs are simulation-extractable (for free!)
- Witness-succinct universally-composable SNARKs
- Ligero: lightweight sublinear arguments without a trusted setup
- What makes Fiat-Shamir zkSNARKs (updatable SRS) simulation extractable?
- BooLigero: improved sublinear zero knowledge proofs for Boolean circuits
- SoK: communication across distributed ledgers
- MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)
- More efficient amortization of exact zero-knowledge proofs for LWE
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Nova: recursive zero-knowledge arguments from folding schemes
- The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
- Scalable and transparent proofs over all large fields, via elliptic curves. ECFFT. II
- Succinct vector, polynomial, and functional commitments from lattices
- On interactive oracle proofs for Boolean R1CS statements
- BrakingBase -- a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme
- On the security and privacy of CKKS-based homomorphic evaluation protocols
- IVC in the open-and-sign random oracle model
- Linear prover IOPs in log star rounds
- Linear-time accumulation schemes
- Relativized succinct arguments in the ROM do not exist
- Quantum interactive oracle proofs
- Quantum rewinding for IOP-based succinct arguments
- Universally composable succinct vector commitments and applications
- Folding schemes with selective verification
- Interactive oracle proofs
- Faster sounder succinct arguments and \textsf{IOP}s
- On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles
- BOIL: proof-carrying data from accumulation of correlated holographic IOPs
- Algebraic reductions of knowledge
- Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head
- Preprocessing succinct non-interactive arguments for rank-1 constraint satisfiability from holographic proofs
- Efficient isogeny proofs using generic techniques
- Study of arithmetization methods for STARKs
- Computational integrity with a public random string from quasi-linear PCPs
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier
- Interactive oracle proofs with constant rate and query complexity
- Fast Reed-Solomon interactive oracle proofs of proximity
- Asymptotically quasi-optimal cryptography
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model)
- Gemini: elastic SNARKs for diverse environments
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- SPARKs: succinct parallelizable arguments of knowledge
- Transparent SNARKs from DARK compilers
- Verifiable computation for approximate homomorphic encryption schemes
- Universally composable SNARKs with transparent setup without programmable random oracle
- Designated-verifier SNARGs with one group element
- \textsc{Arc}: accumulation for Reed-Solomon codes
- Straight-line knowledge extraction for multi-round protocols
- No-signaling linear PCPs
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
This page was built for publication: Interactive oracle proofs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181021)
