scientific article; zbMATH DE number 1559565

zbMath0963.68192MaRDI QIDQ4527017

Gábor Tardos, Erez Petrank, Joe Kilian

Publication date: 28 February 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

locking systems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration ⋮ Spatial Isolation Implies Zero Knowledge Even in a Quantum World ⋮ ZK-PCPs from leakage-resilient secret sharing ⋮ Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier ⋮ Succinct arguments in the quantum random oracle model ⋮ Zero-Knowledge Proofs of Proximity ⋮ Fast Reed-Solomon Interactive Oracle Proofs of Proximity ⋮ Making the Best of a Leaky Situation: Zero-Knowledge PCPs from Leakage-Resilient Circuits ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ A General, Flexible and Efficient Proof of Inclusion and Exclusion ⋮ Statistical ZAPR arguments from bilinear maps ⋮ Computational Integrity with a Public Random String from Quasi-Linear PCPs