scientific article

zbMath0973.68523MaRDI QIDQ2754165

S. Raj Rajagopalan, Sandeep N. Bhatt, Rafail Ostrovsky, William Aiello

Publication date: 9 December 2001

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

Mathematics Subject Classification ID

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

Related Items (16)

Succinct non-interactive arguments via linear interactive proofs ⋮ Single-server private information retrieval with sublinear amortized time ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ Succinct NP Proofs from an Extractability Assumption ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Optimal single-server private information retrieval ⋮ Multikey Fully Homomorphic Encryption and Applications ⋮ The hunting of the SNARK ⋮ Pipelined algorithms to detect cheating in long-term grid computations ⋮ No-signaling linear PCPs ⋮ No-signaling linear PCPs ⋮ Rational Sumchecks ⋮ Locally verifiable distributed SNARGs ⋮ Unnamed Item ⋮ Spooky Encryption and Its Applications ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems

This page was built for publication: