Verifiable computation for randomized algorithm

DOI10.1007/978-3-319-49890-4_6MaRDI QIDQ3179479zbMATH OpenOpenAlexFDO

Authors Muhua Liu, Ying Wu, Rui Xue

Publication date 21 December 2016

Published in Progress in Cryptology – INDOCRYPT 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-49890-4_6

zbMATH Keywords

randomized algorithmsverifiable computationindistinguishability obfuscation

Mathematics Subject Classification ID

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

Recommendations

• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Batch verifiable computation of outsourced functions
• Multi-client non-interactive verifiable computation
• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• Refereed delegation of computation

Cites work

• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Constrained verifiable random functions
• Delegatable homomorphic encryption with applications to secure outsourcing of computation
• From secrecy to soundness: efficient verification via secure computation (extended abstract)
• Functional encryption for randomized functionalities
• Functional encryption for randomized functionalities in the private-key setting from minimal assumptions
• Functional signatures and pseudorandom functions
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• Improved delegation of computation using fully homomorphic encryption
• Multi-client non-interactive verifiable computation
• Multi-client verifiable computation with stronger security guarantees
• Multi-input functional encryption
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• On the relationship between functional encryption, obfuscation, and fully homomorphic encryption
• Signatures of correct computation
• Verifiable delegation of computation over large datasets

This page was built for publication: Verifiable computation for randomized algorithm

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