Two protocols for delegation of computation

DOI10.1007/978-3-642-32284-6_3MaRDI QIDQ5200454zbMATH OpenOpenAlexFDO

Authors Ran Canetti, Ben Riva, Guy N. Rothblum

Publication date 6 November 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32284-6_3

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Refereed delegation of computation
• From secrecy to soundness: efficient verification via secure computation (extended abstract)
• Delegating computation: interactive proofs for muggles
• scientific article; zbMATH DE number 5485522
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency

Cited in

(13)

• The hunting of the SNARK
• Trusted computing with addition machines. II
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Succinct non-interactive arguments via linear interactive proofs
• Competing provers protocols for circuit evaluation
• Competing-provers protocols for circuit evaluation
• From secrecy to soundness: efficient verification via secure computation (extended abstract)
• Refereed delegation of computation
• Non-cooperative rational interactive proofs
• A simple protocol for verifiable delegation of quantum computation in one round
• DELEGATING COMPUTATION VIA NO-SIGNALING STRATEGIES
• An Efficient and Provably Secure Private Polynomial Evaluation Scheme
• Corrigimus, verificamus, vincimus: ensuring algorithmic accuracy in an age of uncertainty

This page was built for publication: Two protocols for delegation of computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5200454)