Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Efficient distributed zero-knowledge proof method based on Spark

A zero-knowledge proof and distributed technology, applied in the information field, can solve problems such as inability to handle large-scale calculations, limited single-machine memory, and long time, and achieve the effects of high degree of distribution, small memory dependence, and improved efficiency

Pending Publication Date: 2022-06-24
BEIJING UNIV OF TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the existing zkSTARK implementation can only run in a stand-alone environment, and there are the following problems: 1) limited by the computing resources of the stand-alone machine, it takes a long time to prove; 2) limited by the memory of the stand-alone machine, it cannot handle large-scale calculations

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Efficient distributed zero-knowledge proof method based on Spark
  • Efficient distributed zero-knowledge proof method based on Spark
  • Efficient distributed zero-knowledge proof method based on Spark

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0023] refer to figure 2 As shown, the present invention includes two types of distributed algorithm components: distributed merkle tree algorithm and distributed polynomial algorithm. SparkRDD key-value pairs are used to represent merkle trees, polynomials, and the evaluation results of polynomials at all points on a finite field. Merkle trees are represented as RDD([(node ​​index, node value)]), polynomial f(X) The representation is RDD([(the exponent of X, the coefficient of this term)]), and the representation of the polynomial evaluation result is RDD([(the value of the X coordinate, the value of the polynomial at this point)]). Next, the specific implementation of various distributed algorithms is introduced.

[0024] Algorithm 1. The specific implementation of the merkle tree construction in the distributed merkle tree algorithm is as follows:

[0025] a) The input is an RDD composed of leaf nodes;

[0026] b) Traverse the RDD and convert the original (key, value) ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses an efficient distributed zero-knowledge proof method based on Spark. The method comprises the steps of distributed calculation trajectory arithmetic intermediate form construction, distributed boundary constraint arithmetic intermediate form construction, distributed transfer constraint arithmetic intermediate form construction, distributed combination constraint arithmetic intermediate form construction and distributed proof generation. A system corresponding to the method is realized based on Python and PySpark, and runs on a Spark platform, so that the certification time required by a certification party can be effectively reduced, and the calculation scale which can be processed by the certification party can be improved, and therefore, the certification system has higher efficiency and usability. According to the data availability proving of the method, a proving party can efficiently prove that a certain output is obtained after calculation of some steps to a verifier under the condition that plaintext information of the data is not exposed. Limiting conditions which need to be met by adjacent intermediate values in the calculation trajectory are called transfer constraint conditions, and final public output is called boundary constraint conditions.

Description

technical field [0001] The invention relates to a distributed zero-knowledge proof method, in particular to an efficient distributed zero-knowledge proof method based on Spark, and belongs to the field of information technology. Background technique [0002] zkSTARK (Zero-Knowledge Scalable Transparent ARguments of Knowledge) is a zero-knowledge proof technology that enables users to share verified data or perform calculations with third parties without revealing the data or calculation methods to the third party. In simple terms, zero-knowledge proof technology can prove that something is true without having to reveal what it actually proves. For example, zkSTARKs allow Alice to verify Bob's banking information using zero-knowledge cryptographic proofs without requiring Bob to reveal confidential information to Alice. zkSTARK does not require trusted initialization by a third party, has higher security, and has scalable computing methods. However, the existing zkSTARK imp...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/32
CPCH04L9/3218H04L9/3239
Inventor 詹静赵江李永震
Owner BEIJING UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products