Refereed delegation of computation
From MaRDI portal
Recommendations
- Two protocols for delegation of computation
- Batch verifiable computation of outsourced functions
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Multi-server verifiable delegation of computations: unconditional security and practical efficiency
- Delegating computation: interactive proofs for muggles
Cites work
- scientific article; zbMATH DE number 1617943 (Why is no real title available?)
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 1559566 (Why is no real title available?)
- Algebraic methods for interactive proof systems
- Competing provers protocols for circuit evaluation
- Computationally Sound Proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Improved delegation of computation using fully homomorphic encryption
- Memory delegation
- Non-interactive verifiable computing: outsourcing computation to untrusted workers
- Practical verified computation with streaming interactive proofs
- Probabilistic checking of proofs
- Probabilistically Checkable Arguments
- Refereed delegation of computation
- Secure two-party computation with low communication
- Short pairing-based non-interactive zero-knowledge arguments
- Succinct NP Proofs from an Extractability Assumption
- Theory of Cryptography
- Two protocols for delegation of computation
- Universal Arguments and their Applications
- Verifiable delegation of computation over large datasets
Cited in
(12)- Two protocols for delegation of computation
- scientific article; zbMATH DE number 7525466 (Why is no real title available?)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server
- Outsourcing computation: the minimal refereed mechanism
- Financially backed covert security
- Verifiable computation for randomized algorithm
- From secrecy to soundness: efficient verification via secure computation (extended abstract)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
- Memory delegation
- Refereed delegation of computation
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
- Rational delegation computing protocol based on rational trust model
This page was built for publication: Refereed delegation of computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q385709)
