Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations

DOI10.1007/978-3-319-40253-6_18zbMath1409.94907OpenAlexW2500780783MaRDI QIDQ2817469

Yu Yu, Kai Zhang, Haifeng Qian, Yuan Zhou, Xiang-Xue Li, Yu-Juan Sun

Publication date: 31 August 2016

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-40253-6_18

zbMATH Keywords

pseudorandom functionpublic verifiabilitystorage overheadbatch verifiable computation

Mathematics Subject Classification ID

Cryptography (94A60) Network protocols (68M12)

Related Items (1)

Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds

Uses Software

• Pinocchio

Cites Work

• Unnamed Item
• Unnamed Item
• Batch verifiable computation of outsourced functions
• (Leveled) fully homomorphic encryption without bootstrapping
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• 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
• Practical Homomorphic MACs for Arithmetic Circuits
• Verifiable Delegation of Computation over Large Datasets
• Memory Delegation
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

This page was built for publication: Batch Verifiable Computation with Public Verifiability for Outsourcing Polynomials and Matrix Computations