scientific article
From MaRDI portal
Publication:3549643
zbMath1232.68056MaRDI QIDQ3549643
Dan Gutfreund, Shafi Goldwasser, Alexander D. Healy, Tali Kaufman, Guy N. Rothblum
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
error correcting codesinteractive proof systemscomputationally bounded receiverpotentially malicious sendersender-receiver setting
Specification and verification (program logics, model checking, etc.) (68Q60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Decoding (94B35)
Related Items (6)
Fine-grained secure computation ⋮ Strong Average-Case Circuit Lower Bounds from Nontrivial Derandomization ⋮ Unnamed Item ⋮ Lower bounds on the query complexity of non-uniform and adaptive reductions showing hardness amplification ⋮ Homomorphic Evaluation of Lattice-Based Symmetric Encryption Schemes ⋮ Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification
This page was built for publication:
