Efficient zero-knowledge proof for quadratic matrix relation over finite field with three or four witnesses

Yuan Tian; Yongda Pang; Xinke Tian

doi:10.1117/12.3009405

11 October 2023 Efficient zero-knowledge proof for quadratic matrix relation over finite field with three or four witnesses

Yuan Tian, Yongda Pang, Xinke Tian

Author Affiliations +

Proceedings Volume 12918, Fourth International Conference on Computer Science and Communication Technology (ICCSCT 2023); 129181F (2023) https://doi.org/10.1117/12.3009405
Event: International Conference on Computer Science and Communication Technology (ICCSCT 2023), 2023, Wuhan, China

Abstract

In large-scale private computing applications, various arithmetic relations appear as or can be reduced to matrix relations. In this paper, we establish the efficient zero-knowledge proof (ZKP) for the quadratic matrix relation over finite field Fp with three or four witness matrices. In private computing tasks, lots of arithmetic relations are instances or special cases of such form, particularly some matrix structural decomposition relations. Different from the widely applied vectorspecific method, our method is matrix-specific. The matrix equation is treated as a tensor equality and probabilisticequivalent reduction techniques are applied to reduce the non-linear matrix relation to simple vector relation. To the authors’ best knowledge, currently, there are no matrix-specific methods to ZKP for nonlinear matrix relations. Compared against the current general linearization (vector-specific) method, our method substantially outperforms it in all critical aspects, e.g., for n-by-t matrix witnesses the required size of common reference string (c.r.s.) can be compressed by a factor of 2nt and the number of rounds, group and field elements in messages are all decreased by a factor of ≈2 for large-size witnesses. Computational complexities are almost the same in both methods.

(2023) Published by SPIE. Downloading of the abstract is permitted for personal use only.

Citation Download Citation

Yuan Tian, Yongda Pang, and Xinke Tian "Efficient zero-knowledge proof for quadratic matrix relation over finite field with three or four witnesses", Proc. SPIE 12918, Fourth International Conference on Computer Science and Communication Technology (ICCSCT 2023), 129181F (11 October 2023); https://doi.org/10.1117/12.3009405

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
7 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Matrices

Stochastic processes

Computing systems

Data hiding

Computer simulations

Design and modelling

Digital Light Processing

Show All Keywords

Keywords/Phrases

Search In:

Publication Years