Succinct interactive oracle proofs: applications and limitations

DOI10.1007/978-3-031-15802-5_18MaRDI QIDQ6155266zbMATH OpenFDO

Authors Shafik Nassar, Ron D. Rothblum

Publication date 12 June 2023

Published in Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-15802-5_18

Mathematics Subject Classification ID

Artificial intelligence (68Txx) Cryptography (94A60)

Recommendations

• Interactive oracle proofs
• Interactive oracle proofs with constant rate and query complexity
• A toolbox for barriers on interactive oracle proofs
• On interactive oracle proofs for Boolean R1CS statements
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• scientific article; zbMATH DE number 66620
• On interactive proofs with a laconic prover
• scientific article; zbMATH DE number 1754603
• Interactive proofs with approximately commuting provers

Cites work

• A Pseudorandom Generator from any One-way Function
• Barriers for succinct arguments in the random oracle model
• Bit commitment using pseudorandomness
• Computational Complexity
• Computationally Sound Proofs
• Constant-round interactive proofs for delegating computation
• Delegating computation: interactive proofs for muggles
• Foundations of Cryptography
• From laconic zero-knowledge to public-key cryptography. Extended abstract
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 4037759 (Why is no real title available?)
• scientific article; zbMATH DE number 845842 (Why is no real title available?)
• scientific article; zbMATH DE number 4185024 (Why is no real title available?)
• scientific article; zbMATH DE number 7706036 (Why is no real title available?)
• Infeasibility of instance compression and succinct PCPs for NP
• Interactive oracle proofs
• Interactive PCP
• Non-interactive proofs of proximity
• Obfuscation of probabilistic circuits and applications
• On interactive proofs with a laconic prover
• On the complexity of interactive proofs with bounded communication
• On the randomness complexity of property testing
• Private vs. common random bits in communication complexity
• Probability Inequalities for Sums of Bounded Random Variables
• Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
• Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
• Zero-knowledge proofs from secure multiparty computation

Cited in

(9)

• Barriers for succinct arguments in the random oracle model
• On the virtue of succinct proofs
• On interactive oracle proofs for Boolean R1CS statements
• A toolbox for barriers on interactive oracle proofs
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• Zero-knowledge IOPs approaching witness length
• Rate-1 zero-knowledge proofs from one-way functions
• Local proofs approaching the witness length
• Blind zkSNARKs for private proof delegation and verifiable computation over encrypted data

This page was built for publication: Succinct interactive oracle proofs: applications and limitations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6155266)