DeepAI AI Chat
Log In Sign Up

Prover efficient public verification of dense or sparse/structured matrix-vector multiplication

by   Jean-Guillaume Dumas, et al.
Laboratoire d'Informatique de Paris 6

With the emergence of cloud computing services, computationally weak devices (Clients) can delegate expensive tasks to more powerful entities (Servers). This raises the question of verifying a result at a lower cost than that of recomputing it. This verification can be private, between the Client and the Server, or public, when the result can be verified by any third party. We here present protocols for the verification of matrix-vector multiplications, that are secure against malicious Servers. The obtained algorithms are essentially optimal in the amortized model: the overhead for the Server is limited to a very small constant factor, even in the sparse or structured matrix case; and the computational time for the public Verifier is linear in the dimension. Our protocols combine probabilistic checks and cryptographic operations, but minimize the latter to preserve practical efficiency. Therefore our protocols are overall more than two orders of magnitude faster than existing ones.


page 1

page 2

page 3

page 4


Secure Consistency Verification for Untrusted Cloud Storage by Public Blockchains

This work presents ContractChecker, a Blockchain-based security protocol...

Practical and Scalable Security Verification of Secure Architectures

We present a new and practical framework for security verification of se...

Gazelle: A Low Latency Framework for Secure Neural Network Inference

The growing popularity of cloud-based machine learning raises a natural ...

Two-Server Private Information Retrieval with Optimized Download Rate and Result Verification

Private Information Retrieval (PIR) schemes allow a client to retrieve a...

Verification Protocols with Sub-Linear Communication for Polynomial Matrix Operations

We design and analyze new protocols to verify the correctness of various...

Practical and Verifiable Electronic Sortition

Existing verifiable e-sortition systems are impractical due to computati...

Polynomial modular product verification and its implications

Polynomial multiplication is known to have quasi-linear complexity in bo...