zkTaylor: Zero Knowledge Proofs for Machine Learning via Taylor Series Transformation

In order to enable more types of machine learning models to use zero-knowledge proofs to enhance their computational verifiability, this study proposes a zero-knowledge machine learning conversion method based on the Taylor series. Firstly, a polynomial expansion of structures with transcendental functions in ordinary machine learning models is performed using Taylor's formula. The corresponding arithmetic circuit descriptions are written in ZKP based on the converted model structures. Finally, the proof body is generated, which allows the verifier to verify the correctness of the results quickly. The basic experimental idea is also given, and the scheme's feasibility is verified, which can be done to provide a verification path for the model without seriously affecting its accuracy.

Authors

Institutions

Publication Details

Published
2024-12-20
DOI
https://doi.org/10.1145/3712623.3712646
Citations
1
Primary Topic
Numerical Methods and Algorithms
Type
article
Field-Weighted Citation Impact
0.36
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

zkTaylor: Zero Knowledge Proofs for Machine Learning via Taylor Series Transformation

K. Y. Liu, Yong-Sheng Zheng, Pan Dong, Jiren Ma et al.
1 citations
Numerical Methods and Algorithms
0.36
article

zkTaylor: Zero Knowledge Proofs for Machine Learning via Taylor Series Transformation

K. Y. Liu, Yong-Sheng Zheng, Pan Dong, Jiren Ma, Bingtao Li
article en
1 citations

Abstract

In order to enable more types of machine learning models to use zero-knowledge proofs to enhance their computational verifiability, this study proposes a zero-knowledge machine learning conversion method based on the Taylor series. Firstly, a polynomial expansion of structures with transcendental functions in ordinary machine learning models is performed using Taylor's formula. The corresponding arithmetic circuit descriptions are written in ZKP based on the converted model structures. Finally, the proof body is generated, which allows the verifier to verify the correctness of the results quickly. The basic experimental idea is also given, and the scheme's feasibility is verified, which can be done to provide a verification path for the model without seriously affecting its accuracy.

Zhengzhou University (CN)
Openalex Percentile: Top 32%
Numerical Methods and Algorithms
0.36
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.