Interactive Coding for Interactive Proofs

DOI10.1007/978-3-662-49099-0_13zbMath1382.94068OpenAlexW2293295602MaRDI QIDQ2799101

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)

Related Items (1)

Interactive Oracle Proofs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Randomness in interactive proofs
• Towards deterministic tree code constructions
• List and Unique Coding for Interactive Communication in the Presence of Adversarial Noise
• Private interactive communication across an adversarial channel
• Coding for interactive communication
• Small-Bias Probability Spaces: Efficient Constructions and Applications
• An Efficient Parallel Repetition Theorem
• Parallel Repetition Theorems for Interactive Arguments
• Simple Constructions of Almost k-wise Independent Random Variables
• Deterministic coding for interactive communication
• Optimal error rates for interactive coding I
• Towards coding for maximum errors in interactive communication
• Efficient and Explicit Coding for Interactive Communication

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