Batch verifiable computation of outsourced functions
From MaRDI portal
Publication:887441
DOI10.1007/s10623-015-0092-4zbMath1357.68052OpenAlexW813457708MaRDI QIDQ887441
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
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Information theory (general) (94A15) Information storage and retrieval of data (68P20)
Related Items (2)
On Privacy-Preserving Biometric Authentication ⋮ Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations
Cites Work
- Unnamed Item
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Fully Homomorphic Message Authenticators
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Homomorphic Signatures for Polynomial Functions
- Number-theoretic constructions of efficient pseudo-random functions
- 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
- Signatures of Correct Computation
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Verifiable Delegation of Computation over Large Datasets
- Memory Delegation
- Separating succinct non-interactive arguments from all falsifiable assumptions
This page was built for publication: Batch verifiable computation of outsourced functions
