Cryptography distributed calculation and step-by-step verification method with fault-tolerant function

Abstract

The invention discloses a fault tolerant cryptography distributed computing and multiple step testing method which belongs to the distributed computing field. The method comprises: 1) each member carries out the shared operation separately; 2) every member generates stochastic polynomial according to the required access structure and exchanges the datum induced from the stochastic polynomial; 3) every member generates combined stochastic polynomial by the received stochastic polynomial data together; 4) the result of step1) is re-shared by the combined stochastic polynomial and the re-shared result is distributed to every member; 5) each member further combines and reconstructs the receives re-shared data to gains the final result and a new re-share; 6) every member reconstructs the true result by exchanging the new re-share. The invention is a fault-tolerant and high efficient method with protocol safety, solves the problems of mass traffic and low efficiency in traditional algorithm and assures the continuity in secure computation.

Description

Technical field: [0001] The invention relates to a cryptographic distributed computing and step-by-step verification method with fault-tolerant functions, which provides an efficient support for the safe processing of data in a distributed system, especially multi-party safe data processing, and the method It has good fault tolerance; this method can be applied to fields such as fault-tolerant computing, distributed computing, and grid computing. Background technique: [0002] Distributed computing is a new computing method proposed in recent years. The so-called distributed computing means that it is not a single computer that participates in the calculation, but a network composed of multiple computers. These computers share information with each other and cooperate to complete computing tasks. Compared with other algorithms, distributed computing has the following advantages: the dynamic acquisition and sharing of data resources of different types and different regions; ...

AI Technical Summary

Problems solved by technology

[0012] At present, the proposed schemes are usually based on the theoretical research results of Boolean algebra. At present, there are no practical schemes and systems at home and abroad. The research is still mainly aimed at the operation security under passive adversary (eavesdropping) or equipment failure. The main problems include: no consideration of the continuity of calculation, no systematic method under active attack, failure to support calculation under general data sharing, high computational complexity, high communication cost, etc.

In particular, existing computing methods are based on Byzantine consensus agreements, and the communication volume between members is large. Moreover, these schemes are vulnerable to active attacks, such as data tampering, increased delay, non-faithful execution, etc.

Images