Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems

DOI10.1007/978-3-662-53015-3_5zbMath1406.94049OpenAlexW2484147845MaRDI QIDQ2829945

Moni Naor, Cynthia Dwork, Guy N. Rothblum

Publication date: 9 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_5

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Single-server private information retrieval with sublinear amortized time ⋮ Incrementally verifiable computation via incremental PCPs ⋮ Optimal single-server private information retrieval

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive proof systems and alternating time-space complexity
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Succinct Randomized Encodings and their Applications
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments
• Probabilistically Checkable Arguments
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Polylogarithmic two-round argument systems
• Universal Arguments and their Applications
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Space-bounded probabilistic game automata
• Computationally Sound Proofs
• On the Circular Security of Bit-Encryption
• Candidate Multilinear Maps from Ideal Lattices
• Fully homomorphic encryption using ideal lattices
• How to use indistinguishability obfuscation
• How to delegate computations
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Advances in Cryptology - CRYPTO 2003
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$

This page was built for publication: Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems