How to delegate computations publicly
From MaRDI portal
Publication:5212851
DOI10.1145/3313276.3316411zbMath1434.94070OpenAlexW2951723981MaRDI QIDQ5212851
Lisa Yang, Yael Tauman Kalai, Omer Paneth
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3313276.3316411
Related Items (24)
Non-interactive batch arguments for NP from standard assumptions ⋮ SNARGs for P from sub-exponential DDH and QR ⋮ Incrementally verifiable computation via incremental PCPs ⋮ Verifiable inner product computation on outsourced database for authenticated multi-user data sharing ⋮ Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge ⋮ On Valiant's conjecture. Impossibility of incrementally verifiable computation from random oracles ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Non-interactive publicly-verifiable delegation of committed programs ⋮ Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions ⋮ Parallelizable delegation from LWE ⋮ Non-interactive universal arguments ⋮ SNARGs for monotone policy batch NP ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Gentry-Wichs is tight: a falsifiable non-adaptively sound SNARG ⋮ Verifiable private information retrieval ⋮ Non-interactive zero-knowledge from non-interactive batch arguments ⋮ 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 ⋮ A compiler for multi-key homomorphic signatures for Turing machines ⋮ Outsourcing computation: the minimal refereed mechanism ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ Delegation with updatable unambiguous proofs and PPAD-hardness
This page was built for publication: How to delegate computations publicly
