Batch verifiable computation of outsourced functions

DOI10.1007/S10623-015-0092-4MaRDI QIDQ887441zbMATH OpenOpenAlexFDO

Authors Liang Feng Zhang, Reihaneh Safavi-Naini

Publication date 26 October 2015

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-015-0092-4

zbMATH Keywords

delegation of computationbatch verificationstorage overhead

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Information theory (general) (94A15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Batch verifiable computation of polynomials on outsourced data
• Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Verifiable delegation of computation over large datasets

Cites work

• scientific article; zbMATH DE number 5485522 (Why is no real title available?)
• 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)
• Fully homomorphic message authenticators
• Homomorphic signatures for polynomial functions
• Homomorphic signatures with efficient verification for polynomial functions
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• Improved delegation of computation using fully homomorphic encryption
• Leveled fully homomorphic signatures from standard lattices
• Memory delegation
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Number-theoretic constructions of efficient pseudo-random functions
• Quadratic span programs and succinct NIZKs without PCPs
• Separating succinct non-interactive arguments from all falsifiable assumptions
• Signatures of correct computation
• Verifiable delegation of computation over large datasets

Cited in

(16)

• Signatures of correct computation
• Batch Computations Revisited: Combining Key Computations and Batch Verifications
• On black-box verifiable outsourcing
• Verifiable delegation of computation over large datasets
• Multi-server verifiable delegation of computations: unconditional security and practical efficiency
• On privacy-preserving biometric authentication
• Verifiable computation for randomized algorithm
• Verifiable computation with reduced informational costs and computational costs
• Proof-of-work certificates that can be efficiently computed in the cloud (invited talk)
• Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme
• Batch verifiable computation with public verifiability for outsourcing polynomials and matrix computations
• Delegation of computation with verification outsourcing: curious verifiers
• How to delegate and verify in public: verifiable computation from attribute-based encryption
• Memory delegation
• Refereed delegation of computation
• Batch verifiable computation of polynomials on outsourced data

This page was built for publication: Batch verifiable computation of outsourced functions

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