scientific article; zbMATH DE number 5485479
From MaRDI portal
Publication:3549643
zbMATH Open1232.68056MaRDI QIDQ3549643FDOQ3549643
Dan Gutfreund, Alexander D. Healy, Tali Kaufman, Shafi Goldwasser, Guy N. Rothblum
Publication date: 5 January 2009
Title of this publication is not available (Why is that?)
error correcting codesinteractive proof systemscomputationally bounded receiverpotentially malicious sendersender-receiver setting
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Specification and verification (program logics, model checking, etc.) (68Q60) Decoding (94B35)
Cited In (8)
- Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
- Fine-grained secure computation
- Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification
- Title not available (Why is that?)
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes
- 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:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549643)
