New publicly verifiable computation for batch matrix multiplication
type: Item
instance of: scholarly article
title: New publicly verifiable computation for batch matrix multiplication
zbMATH Open document ID: 1443.68060
author: Tao Jiang
author: Kuan-Ching Li
author: Aniello Castiglione
author: Xiaofeng Chen
author: Xiao-Yu Zhang
published in: Information Sciences
publication date: 2020-10-07T00:00:00Z
Mathematics Subject Classification ID: 68P27
Mathematics Subject Classification ID: 68M11
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7257056
zbMATH Keywords: publicly verifiable computation
zbMATH Keywords: public delegation
zbMATH Keywords: batch matrix multiplication
zbMATH Keywords: privacy protection
describes a project that uses: Pinocchio
MaRDI profile type: Publication
full work available at URL: j.ins.2017.11.063
OpenAlex ID: W2772035212
cites work: Verifiable Delegation of Computation over Large Datasets
cites work: Preconditioning techniques for large linear systems: A survey
cites work: Self-testing/correcting with applications to numerical problems
cites work: Verifiable Computation over Large Database with Incremental Updates
cites work: The lorentz transformation and absolute time
cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
cites work: Fully homomorphic encryption using ideal lattices
cites work: The Knowledge Complexity of Interactive Proof Systems
cites work: Q2724461
cites work: KDVEM: a \(k\)-degree anonymity with vertex and edge modification algorithm
cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
cites work: Secure Optimization Computation Outsourcing in Cloud Computing: A Case Study of Linear Programming
cites work: Verifiable Auditing for Outsourced Database in Cloud Computing
DOI: 10.1016/J.INS.2017.11.063
description: scientific article; zbMATH DE number 7257056