Spooky interaction and its discontents: compilers for succinct two-message argument systems

DOI10.1007/978-3-662-53015-3_5zbMATH Open1406.94049OpenAlexW2484147845MaRDI QIDQ2829945FDOQ2829945

Authors: Cynthia Dwork, Moni Naor, 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

Recommendations

• Polylogarithmic two-round argument systems
• Succinct arguments from multi-prover interactive proofs and their efficiency benefits
• Probabilistically Checkable Arguments
• Automata, Languages and Programming
• Succinct NP Proofs from an Extractability Assumption

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Fully homomorphic encryption using ideal lattices
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Universal Arguments and their Applications
• Advances in Cryptology - CRYPTO 2003
• The Knowledge Complexity of Interactive Proof Systems
• Interactive proof systems and alternating time-space complexity
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• How to delegate computations
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Title not available (Why is that?)
• How to use indistinguishability obfuscation
• Separating succinct non-interactive arguments from all falsifiable assumptions
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
• Short pairing-based non-interactive zero-knowledge arguments
• Probabilistically Checkable Arguments
• Title not available (Why is that?)
• Computationally Sound Proofs
• Space-bounded probabilistic game automata
• Candidate Multilinear Maps from Ideal Lattices
• On the circular security of bit-encryption
• Efficient fully homomorphic encryption from (standard) LWE
• Succinct randomized encodings and their applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Polylogarithmic two-round argument systems

Cited In (7)

• Optimal single-server private information retrieval
• Probabilistically Checkable Arguments
• Single-server private information retrieval with sublinear amortized time
• Succinct NP Proofs from an Extractability Assumption
• Incrementally verifiable computation via incremental PCPs
• Polylogarithmic two-round argument systems
• Succinct spooky free compilers are not black box sound

This page was built for publication: Spooky interaction and its discontents: compilers for succinct two-message argument systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829945)