Succinct interactive oracle proofs: applications and limitations
From MaRDI portal
Publication:6155266
DOI10.1007/978-3-031-15802-5_18MaRDI QIDQ6155266
Ron D. Rothblum, Shafik Nassar
Publication date: 12 June 2023
Published in: Advances in Cryptology – CRYPTO 2022 (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of interactive proofs with bounded communication
- Infeasibility of instance compression and succinct PCPs for NP
- On the randomness complexity of property testing
- From laconic zero-knowledge to public-key cryptography. Extended abstract
- Bit commitment using pseudorandomness
- Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs
- Private vs. common random bits in communication complexity
- On interactive proofs with a laconic prover
- Non-interactive proofs of proximity
- Barriers for succinct arguments in the random oracle model
- Delegating Computation
- Interactive Oracle Proofs
- Interactive PCP
- Zero-Knowledge Proofs from Secure Multiparty Computation
- Foundations of Cryptography
- A Pseudorandom Generator from any One-way Function
- Computationally Sound Proofs
- Constant-Round Interactive Proofs for Delegating Computation
- Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali
- Obfuscation of Probabilistic Circuits and Applications
- Probability Inequalities for Sums of Bounded Random Variables
- Computational Complexity
