How to delegate computations
From MaRDI portal
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
Cites work
- Advances in Cryptology – CRYPTO 2004
- Answering \(n^{2+o(1)}\) counting queries with differential privacy is hard
- Bounds on the sample complexity for private learning and private data release
- Characterizing the sample complexity of private learners
- Collusion-secure fingerprinting for digital data
- Differential privacy and the fat-shattering dimension of linear queries
- Efficient algorithms for privately releasing marginals via convex relaxations
- Faster algorithms for privately releasing marginals
- Faster private release of marginals on small databases
- scientific article; zbMATH DE number 5485440 (Why is no real title available?)
- scientific article; zbMATH DE number 5485574 (Why is no real title available?)
- Interactive privacy via the median mechanism
- Iterative Constructions and Private Data Release
- Lower bounds in differential privacy
- New Efficient Attacks on Statistical Disclosure Control Mechanisms
- On the complexity of differentially private data release, efficient algorithms and hardness results
- On the geometry of differential privacy
- Our Data, Ourselves: Privacy Via Distributed Noise Generation
- Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
- The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
- Theory of Cryptography
Cited in
(55)- The hunting of the SNARK
- Succinct spooky free compilers are not black box sound
- Witness indistinguishability for any single-round argument with applications to access control
- Round-optimal black-box commit-and-prove with succinct communication
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Single-server private information retrieval with sublinear amortized time
- SNARGs for P from sub-exponential DDH and QR
- Incrementally verifiable computation via incremental PCPs
- Secure and efficient outsourcing computation on large-scale linear regressions
- Belief-invariant and quantum equilibria in games of incomplete information
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Rational sumchecks
- On the existence of extractable one-way functions
- Spooky Encryption and Its Applications
- Spooky interaction and its discontents: compilers for succinct two-message argument systems
- Incompressible functions, relative-error extractors, and the power of nondeterministic reductions
- Delegating computation: interactive proofs for muggles
- 3-message zero knowledge against human ignorance
- Delegating RAM computations with adaptive soundness and privacy
- Interactive oracle proofs
- Adaptive succinct garbled RAM or: how to delegate your database
- Delegating RAM Computations
- Bridging the gap between general probabilistic theories and the device-independent framework for nonlocality and contextuality
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- A hierarchy theorem for interactive proofs of proximity
- Constant-round interactive proofs for delegating computation
- How to Delegate Computations: The Power of No-Signaling Proofs
- Probabilistic checking against non-signaling strategies from linearity testing
- scientific article; zbMATH DE number 7250157 (Why is no real title available?)
- scientific article; zbMATH DE number 7250160 (Why is no real title available?)
- DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
- How to delegate computations publicly
- Delegation for bounded space
- No-signaling linear PCPs
- No-signaling linear PCPs
- Verifiably-Extractable OWFs and Their Applications to Subversion Zero-Knowledge
- Non-interactive publicly-verifiable delegation of committed programs
- 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
- Correlation intractability and SNARGs from sub-exponential DDH
- Boosting batch arguments and RAM delegation
- Quantum advantage from any non-local game
- On black-box knowledge-sound commit-and-prove SNARKs
- Locally verifiable distributed SNARGs
- On black-box verifiable outsourcing
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance
- Adaptively sound zero-knowledge SNARKs for UP
- Self-testing of a single quantum device under computational assumptions
- How to make rational arguments practical and extractable
- Quantum cryptography beyond quantum key distribution
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)
