Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
From MaRDI portal
Publication:3582754
DOI10.1007/978-3-642-14623-7_10zbMath1280.94063OpenAlexW1521848494MaRDI QIDQ3582754
Vipul Goyal, Amit Sahai, Mohammad Mahmoody, Yuval Ishai
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_10
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (11)
Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Interactive Oracle Proofs ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Feasibility and infeasibility of secure computation with malicious PUFs ⋮ Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens ⋮ (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens ⋮ Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds ⋮ Zero-Knowledge Proofs of Proximity ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs
This page was built for publication: Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
