Title: Secure proof of the sum of all the elements of a matrix of finite field elements in zero-knowledge

Authors: Amalan Joseph Antony; Kunwar Singh

Addresses: Department of Computer Science and Engineering, National Institute of Technology, Tiruchirapalli, 620015, Tamil Nadu, India ' Department of Computer Science and Engineering, National Institute of Technology, Tiruchirapalli, 620015, Tamil Nadu, India

Abstract: Interactive zero-knowledge arguments for some fundamental linear algebraic operations have been formulated. Using those proofs for operations involving vectors or matrices requires certain reductions and additional communication rounds. In this paper, we explore the possibility of using various principles of discrete mathematics to formulate a method for a prover to securely prove to the verifier that he knows the sum of all the elements of a matrix, while both the sum and the original matrix remain unknown to the verifier.

Keywords: cryptography; matrix; Pedersen commitment; zero-knowledge proof; ZKP.

DOI: 10.1504/IJAHUC.2023.134602

International Journal of Ad Hoc and Ubiquitous Computing, 2023 Vol.44 No.2, pp.104 - 108

Received: 18 Jan 2023
Accepted: 10 May 2023
Published online: 30 Oct 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article