Delegation for bounded space
From MaRDI portal
Publication:5495827
DOI10.1145/2488608.2488679zbMath1293.68176OpenAlexW2148634692MaRDI QIDQ5495827
Yael Tauman Kalai, Ran Raz, Ron D. Rothblum
Publication date: 7 August 2014
Published in: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2488608.2488679
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Cryptography (94A60)
Related Items (23)
A Hierarchy Theorem for Interactive Proofs of Proximity ⋮ Interactive Oracle Proofs ⋮ Single-server private information retrieval with sublinear amortized time ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Incrementally verifiable computation via incremental PCPs ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Optimal single-server private information retrieval ⋮ SNARGs for monotone policy batch NP ⋮ The hunting of the SNARK ⋮ Correlation intractability and SNARGs from sub-exponential DDH ⋮ Somewhere statistical soundness, post-quantum security, and SNARGs ⋮ Fully-succinct publicly verifiable delegation from constant-size assumptions ⋮ No-signaling linear PCPs ⋮ Unnamed Item ⋮ No-signaling linear PCPs ⋮ Rational Sumchecks ⋮ Three-Player Entangled XOR Games are NP-Hard to Approximate ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Unnamed Item ⋮ Spooky Encryption and Its Applications ⋮ Constant-Round Interactive Proofs for Delegating Computation ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness
This page was built for publication: Delegation for bounded space
