Secure proof of the sum of all the elements of a matrix of finite field elements in zero-knowledge
by Amalan Joseph Antony; Kunwar Singh
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 44, No. 2, 2023

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.

Online publication date: Mon, 30-Oct-2023

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com