Interactive Coding for Interactive Proofs

DOI10.1007/978-3-662-49099-0_13MaRDI QIDQ2799101zbMATH OpenOpenAlexFDO

Authors Allison Bishop, Yevgeniy Dodis

Publication date 8 April 2016

Published in Theory of Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49099-0_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 4106274
• scientific article; zbMATH DE number 66620
• A Framework for Interactive Proof
• Interactive oracle proofs
• A logic of interactive proofs
• A logic of interactive proofs
• Interactive and probabilistic proof-checking
• Algebraic methods for interactive proof systems
• On interactive proofs with a laconic prover
• scientific article; zbMATH DE number 1555928

Cites work

• An efficient parallel repetition theorem
• Coding for interactive communication
• Deterministic coding for interactive communication
• Efficient and Explicit Coding for Interactive Communication
• scientific article; zbMATH DE number 5485477 (Why is no real title available?)
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• scientific article; zbMATH DE number 1256711 (Why is no real title available?)
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Optimal error rates for interactive coding. I: Adaptivity and other settings
• Parallel repetition theorems for interactive arguments
• Private interactive communication across an adversarial channel
• Randomness in interactive proofs
• Simple Constructions of Almost k-wise Independent Random Variables
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• Towards coding for maximum errors in interactive communication
• Towards deterministic tree code constructions

Cited in

(5)

• Automation for interactive proof: first prototype
• IP = PSPACE using error-correcting codes
• Interactive oracle proofs
• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• Fast interactive coding against adversarial noise

This page was built for publication: Interactive Coding for Interactive Proofs

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