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

DOI10.1007/978-3-319-40253-6_18zbMATH Open1409.94907OpenAlexW2500780783MaRDI QIDQ2817469FDOQ2817469

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

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)

Cites Work

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

Cited In (2)

• Batch Computations Revisited: Combining Key Computations and Batch Verifications
• Outsourcing scalar products and matrix products on privacy-protected unencrypted data stored in untrusted clouds

Uses Software

• Pinocchio

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

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