Refereed delegation of computation
From MaRDI portal
Publication:385709
DOI10.1016/j.ic.2013.03.003zbMath1290.68013OpenAlexW2042489885MaRDI QIDQ385709
Ran Canetti, Guy N. Rothblum, Ben Riva
Publication date: 3 December 2013
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2013.03.003
Related Items (4)
Refereed delegation of computation ⋮ Financially backed covert security ⋮ Unnamed Item ⋮ Outsourcing computation: the minimal refereed mechanism
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Refereed delegation of computation
- Practical verified computation with streaming interactive proofs
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Secure Two-Party Computation with Low Communication
- Competing provers protocols for circuit evaluation
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Probabilistically Checkable Arguments
- Succinct NP Proofs from an Extractability Assumption
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- From Secrecy to Soundness: Efficient Verification via Secure Computation
- Universal Arguments and their Applications
- Probabilistic checking of proofs
- Algebraic methods for interactive proof systems
- Computationally Sound Proofs
- Verifiable Delegation of Computation over Large Datasets
- Memory Delegation
- Two Protocols for Delegation of Computation
- Theory of Cryptography
This page was built for publication: Refereed delegation of computation