How to delegate computations
From MaRDI portal
Publication:5259584
DOI10.1145/2591796.2591809zbMATH Open1315.68135OpenAlexW2023675273MaRDI QIDQ5259584FDOQ5259584
Authors: Yael Tauman Kalai, Ran Raz, Ron D. Rothblum 
Publication date: 26 June 2015
Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2591796.2591809
Recommendations
- How to Delegate Computations: The Power of No-Signaling Proofs
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Constant-round interactive proofs for delegating computation
- Constant-round interactive proofs for delegating computation
- How to delegate and verify in public: verifiable computation from attribute-based encryption
- Efficient Delegation of Zero-Knowledge Proofs of Knowledge in a Pairing-Friendly Setting
- Delegateable signatures based on non-interactive witness indistinguishable and non-interactive witness hiding proofs
- Distributed Provers with Applications to Undeniable Signatures
Formal languages and automata (68Q45) Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Cites Work
- Theory of Cryptography
- The geometry of differential privacy: the sparse and approximate cases
- On the geometry of differential privacy
- Interactive privacy via the median mechanism
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Lower bounds in differential privacy
- Iterative Constructions and Private Data Release
- Differential privacy and the fat-shattering dimension of linear queries
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- On the complexity of differentially private data release, efficient algorithms and hardness results
- Title not available (Why is that?)
- Collusion-secure fingerprinting for digital data
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- Bounds on the sample complexity for private learning and private data release
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Characterizing the sample complexity of private learners
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- Privately releasing conjunctions and the statistical query barrier
- Efficient algorithms for privately releasing marginals via convex relaxations
Cited In (52)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Adaptively sound zero-knowledge SNARKs for UP
- Title not available (Why is that?)
- Delegation with updatable unambiguous proofs and PPAD-hardness
- On black-box knowledge-sound commit-and-prove SNARKs
- Non-interactive universal arguments
- SNARGs for monotone policy batch NP
- No-signaling linear PCPs
- Delegating RAM Computations
- Title not available (Why is that?)
- Parallelizable delegation from LWE
- Locally verifiable distributed SNARGs
- On black-box verifiable outsourcing
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
- Delegating RAM computations with adaptive soundness and privacy
- Adaptive succinct garbled RAM or: how to delegate your database
- A hierarchy theorem for interactive proofs of proximity
- Witness indistinguishability for any single-round argument with applications to access control
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Belief-invariant and quantum equilibria in games of incomplete information
- Round-optimal black-box commit-and-prove with succinct communication
- Probabilistic checking against non-signaling strategies from linearity testing
- Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
- Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality
- Non-interactive publicly-verifiable delegation of committed programs
- Interactive oracle proofs
- Correlation intractability and SNARGs from sub-exponential DDH
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Secure and efficient outsourcing computation on large-scale linear regressions
- Delegation for bounded space
- Spooky Encryption and Its Applications
- How to delegate computations publicly
- 3-message zero knowledge against human ignorance
- No-signaling linear PCPs
- Single-server private information retrieval with sublinear amortized time
- SNARGs for P from sub-exponential DDH and QR
- Incrementally verifiable computation via incremental PCPs
- Constant-round interactive proofs for delegating computation
- Quantum cryptography beyond quantum key distribution
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Boosting batch arguments and RAM delegation
- Quantum advantage from any non-local game
- The hunting of the SNARK
- Somewhere statistical soundness, post-quantum security, and SNARGs
- On the existence of extractable one-way functions
- Succinct spooky free compilers are not black box sound
- Title not available (Why is that?)
- Rational sumchecks
- Delegating computation: interactive proofs for muggles
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
Uses Software
This page was built for publication: How to delegate computations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5259584)
