Verifying and decoding in constant depth

zbMATH Open1232.68056MaRDI QIDQ3549643FDOQ3549643

Authors: Dan Gutfreund, Alexander D. Healy, Tali Kaufman, Guy N. Rothblum, Shafi Goldwasser 

Publication date: 5 January 2009

Recommendations

• Constant-round interactive proofs for delegating computation
• Constant-round interactive proofs for delegating computation
• scientific article; zbMATH DE number 5485522
• Delegating computation: interactive proofs for muggles
• Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

zbMATH Keywords

error correcting codesinteractive proof systemscomputationally bounded receiverpotentially malicious sendersender-receiver setting

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Decoding (94B35)

Cited In (9)

• Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
• Theory of Cryptography
• Fine-grained secure computation
• Homomorphic evaluation of lattice-based symmetric encryption schemes
• Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
• Title not available (Why is that?)
• Range avoidance, remote point, and hard partial truth table via satisfying-pairs algorithms
• Title not available (Why is that?)
• Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization

This page was built for publication: Verifying and decoding in constant depth

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