CN114697030A - Data verification method for multi-party secure computing participant - Google Patents
Data verification method for multi-party secure computing participant Download PDFInfo
- Publication number
- CN114697030A CN114697030A CN202210609713.2A CN202210609713A CN114697030A CN 114697030 A CN114697030 A CN 114697030A CN 202210609713 A CN202210609713 A CN 202210609713A CN 114697030 A CN114697030 A CN 114697030A
- Authority
- CN
- China
- Prior art keywords
- data
- participant
- participants
- verification
- sharing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
- H04L2209/46—Secure multiparty computation, e.g. millionaire problem
Abstract
The invention discloses a data verification method for a multi-party secure computation participant, which comprises the following steps: after each participant encrypts the private data according to a preset encryption method, sharing the encryption result to other participants except the participant; each participant determines data sharing certification information according to the encryption result and a predetermined data verification protocol; the data verification method of the multi-party secure computation participants determines the authenticity of private data used by each participant based on the data sharing certification information and verification operation, shares the private data after data splitting, requires each participant to compute the data through a common protocol to obtain a certification result, and verifies the certification result to obtain the participation computation behavior of each participant and the authenticity of the data, so that the data of each participant is effectively protected, and the computation result is prevented from being influenced by false computation of the participants.
Description
Technical Field
The invention relates to the technical field of data sharing, in particular to a data verification method for a multi-party secure computing participant.
Background
The multi-party secure computing technology is a computing technology which is participated by a plurality of participants, data is dispersed on the hands of the participants to carry out computation together, and the multi-party secure computing technology is characterized in that each participant does not know the data participating in the computation (except knowing own data), and intermediate results of the secure multi-party computation are all cryptographs which cannot be interpreted. The secure multi-party calculation can ensure that the local data is not interpreted by other parties but can enjoy the result of the final calculation.
If all participants are valid following the secure multiparty computation process, the entire process will be secure and valid. However, if a participant does not actually participate in the calculation, but instead generates a random number to participate in the calculation at a time, the more participants, the less noticeable such "burdening" the participant may be. And the result of the secure multi-party calculation is usually a plaintext only among the members, which keeps the security from the outside, and the more the participants are, the smaller the influence of the input of the random number on the obtained result is. When the participators are expanded enough, the counterfeiters can enjoy the calculation result in vain without paying any knowledge, data or even calculation power, and the users are worried.
If this is more and more the calculation results of the whole system will be affected and the calculation results will become meaningless. Therefore, in order to avoid the phenomenon, all the participants are guaranteed to provide effective data to participate in calculation according to the rule, and the scheme of the application is further provided.
Based on the discrete logarithm problem, which is a mathematical problem in NP, if for an integer b and an primitive root a of a prime d, a unique exponent e can be found, such that b = ae(mod d), then the exponent e is referred to as the discrete logarithm of the base a modulo d of b.
The scheme designs the proof by using the discrete logarithm problem, a plurality of zero knowledge proofs are designed based on the scheme, the most famous is a fiat-shamir zero knowledge proof scheme, the scheme uses the discrete logarithm problem as the basis of the scheme, the most important proof scheme is to proof the whole calculation process (four arithmetic operations) and not to proof and store the result. The scheme is more important to judge whether the final result is credible according to whether the calculation process conforms to the protocol. Since in the ciphertext space, we need a method to verify correctness in the ciphertext space, and most of the current technologies, such as block chaining, perform proof tracing in the plaintext space.
Disclosure of Invention
The application mainly aims to provide a data verification method for a multi-party secure computation participant, so as to solve the problem that the participant is difficult to be found because the participant provides false data for adding computation and obtains data of other participants in the related technology, and solve the problems of overlong verification time and low efficiency of a verification means in the prior art.
In order to achieve the above object, the present application provides a data verification method for multiple parties of secure computing, the method applying multiple parties, the method comprising the following steps:
after each participant encrypts the private data according to a preset encryption method, sharing the encryption result to other participants except the participant;
each participant determines data sharing certification information according to the encryption result and a predetermined data verification protocol;
and determining the authenticity of the private data used by each participant based on the data sharing certification information and the verification operation.
Further, the method for encrypting the private data by each participant according to the preset encryption method comprises the following steps:
each participant respectively obtains a plurality of different random numbers;
and splitting the private data according to a plurality of random numbers to obtain encrypted data.
Further, the method for each participant to respectively obtain a plurality of different random numbers comprises the following steps:
each participant numbers all participants including the participant;
acquiring the total number of participants, and generating a plurality of random numbers according to the total number of the participants;
the total number of random numbers is at least one item greater than the total number of participants.
Further, the method for splitting the private data according to the plurality of random numbers comprises the following steps:
the privacy data are split according to the random numbers, and the numerical values of all items except one item are ensured to be matched with the random numbers one by one;
and simultaneously, the number of the split items of the privacy data is equal to the total number of the participants, and all the encrypted data are numbered after the splitting is finished.
Further, the method for sharing the encryption result to other parties except the party comprises the following steps:
each participant acquires the serial number of the participant before sending the encrypted data;
and reserving the encrypted data with the same number as the participant, and sending the encrypted data with other numbers to the participant with the number.
Further, the method for determining the data sharing certification information by each participant according to the encryption result and a predetermined data verification protocol comprises the following steps:
after receiving the encrypted data, each participant calculates the obtained encrypted data according to the number and the private data of the participant according to a data verification protocol to obtain data sharing certification information;
during operation, the private data with the own number is not calculated.
Further, the data validation protocol includes performing one or more of an addition operation, a subtraction operation, a multiplication operation, and a division operation on the data.
Further, the method for calculating the data sharing certification information further includes the following steps:
performing modular operation on an operation result obtained by calculation of a data verification protocol and a pre-disclosed prime number, and constructing and obtaining certification data through a disclosed construction function;
and carrying out public sharing by taking the operation result and the certification data as data sharing certification information.
Further, the verifying operation includes:
carrying out modulo operation on the operation result disclosed by each participant and the prime number;
inputting a result obtained by the modular operation into the constructor to obtain verification information;
the authentication information is compared with the certification data published by each participant to determine the authenticity of the private data used by each participant.
Further, the verification comprises instant verification and delayed verification;
the instant verification is to verify the certificates sent by all the participants immediately after the operation is finished;
the deferred verification is the verification returned within a period of time after the operation is finished.
The invention has the advantages that: according to the data verification method for the multi-party secure computing participants, data are split and then shared, a common protocol is used for operation to obtain data certification results of all the participants, and the participants verify the certification results to obtain the authenticity of the data of the participants, so that the data of all the participants are effectively protected, and false data are prevented from affecting the computing results.
Drawings
FIG. 1 is a flow chart of a data verification method of a multi-party secure computing participant according to the present invention.
Fig. 2 is a schematic flow chart of a method for encrypting and sharing private data according to the present invention.
FIG. 3 is a flow chart illustrating a method of verification operation according to the present invention.
Detailed Description
In order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further described with the specific embodiments.
In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are used only for convenience in describing the present invention and for simplicity in description, and do not indicate or imply that the referenced devices or elements must have a particular orientation, be constructed and operated in a particular orientation, and thus, are not to be construed as limiting the present invention. Furthermore, the terms "first", "second", etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first," "second," etc. may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means two or more unless otherwise specified.
In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meaning of the above terms in the present invention can be understood by those of ordinary skill in the art through specific situations.
Fig. 1 schematically illustrates a data verification method for a multi-party secure computing participant according to an embodiment of the present disclosure, the method applies multiple participants, and as shown in fig. 1, the method includes the following steps:
s1: after encrypting the private data according to a preset encryption method, each participant shares the encryption result to other participants except the participant;
fig. 2 is a schematic flow chart of a method for encrypting and sharing private data according to the present invention, as shown in fig. 2, the method includes the following steps:
s101: each participant respectively obtains a plurality of different random numbers;
s102: before generating random numbers, firstly acquiring the total number of participants, and generating a plurality of random numbers according to the total number of the participants;
the total number of random numbers is at least one item greater than the total number of participants;
e.g. when the total number of participants istTime, gett-1 random number, numbered:r 2 -r t；
s103: each participant numbers all participants including the participant;
following the example, all participants are included from 1 totNumbering, wherein the numbering of the user is avoided from occurring at the head and the tail as much as possible;
s104: splitting the privacy data according to a plurality of random numbers to ensure that the numerical values of all items except one item are matched with the random numbers one by one;
it is also understood that the remaining part of the sum of the private data minus the random number is taken as one item, and the numerical values of the other items are taken as the random number;
s105: meanwhile, the number of split items of the private data is equal to the total number of the participants, and all encrypted data are numbered after the splitting is finished;
in the above example, the private data w is split into t parts:
；
ensure in addition tow 1Besides, othersw 2 -w t Numerical value of andr 2 -r t are equal, i.e. satisfy:
；
the method for sharing the encryption result to other participants except the user comprises the following steps:
s106: each participant acquires the serial number of the participant before sending the encrypted data;
s107: the encrypted data with the same number as the participant is reserved, and the encrypted data with other numbers are sent to the participant with the number;
e.g. the participating partiesmBefore sending the encrypted data, acquiring the number of the corresponding participant asnTherefore, it is necessary to convert the datam=m 1 +...+m n-1+m n+m n+1 +...+m tTo (1)nItem datam nHold, the data (a)m 1 ,...m n-1,m n+1 ,...m t) Sent to the participantsn，So that all the participants get the information aboutmSecret sharing of。
S2: each participant determines data sharing certification information according to the encryption result and a predetermined data verification protocol;
after each participant receives the encrypted data, the obtained encrypted data and the private data of the participant are operated according to the serial number and the data verification protocol to obtain data sharing certification information;
during operation, the private data with the own number is not calculated;
assume that this is numbered asjA plurality of;
the present party encrypts data asy[t]={y 1,...y j-1 ,y j,y j+1 ,...y t}，
The data of other participants is obtained asx[t-1]={x 1,...x j-1,x j+1 ,...x t}；
Omitting the present datay j To obtainy[t-1]={y 1,...y j-1 ,y j+1 ,...y t}；
If the number of the local side is 11, the received encrypted data of the other participants does not contain the data of the 11 th item, but the private data of the local side contains the data of the 11 th item, so that when the operation is performed according to the items, after the data of the 10 th item is calculated, the data of the 12 th item is directly calculated, and the data of the 11 th item of the local side is skipped;
performing modular operation on an operation result obtained by calculation of a data verification protocol and a pre-disclosed prime number, and constructing and obtaining certification data through a disclosed construction function;
the adopted data verification protocol comprises the steps of performing addition operation, subtraction operation, multiplication operation and division operation on data, selecting one, two or three of four operations after each participant makes an appointment according to the operation requirement, and definitely, when the operation types are more, the proved result is more accurate, and when the operation is less, the required operation time and the occupied memory space are less;
the encrypted data of the present embodiment is assumed to be:y[t-1]={y 1,...y t}；
the data of the other participants obtained are:x[t-1]={x 1,...x t}；
disclosed as being primeqBase numbers disclosed are g;
when the data verification protocol is an addition operation: (x + y)i=x i +y i ，
；
The operation result is ANDed withqPerforming mod operation;
for thex i，y iThe following proves:
mod q；
mod q；
the result obtained by the addition operation is passed
mod q、
mod q and
to construct
；
When the data validation protocol is a subtraction operation: (x-y)i=x i - y i ，
；
For thex i，y iThe following proves:
mod q；
mod q；
the result obtained by the subtraction is passed
mod q、
mod q and is
To construct
；
When the data validation protocol is a multiplication operation: (x y)i =
；
；
The above secret calculation results in the corresponding four arithmetic operations being performed also for the plaintext. When a participant has all secret shares, e.g., (x + y) is owned by one participant1；
Performing mod operation on the operation result and q;
proof of the results obtained for the multiplication:
mod q；
since the multiplication cannot pass
Construction, so sharing needs to be performed separately;
for any functionf（x i ) A certificate will be output:Prv（f（x i ）=res）=P；
i.e. for arbitraryf（x) All can be based on
Structure certification;
for example, calculate
Can be converted into:
outputting the result as a proof P after the operation is finished;
proof of sharding requires making any one of the parties involved in secure computations
Can construct corresponding proofs
mod q；
The function may be based onxDirectly find outf(x)But are known in the artyCannot reversely findxAnd the function can quickly construct a corresponding plaintext function through the ciphertext, namely, the function passes through the ciphertext
Can constructD x(DReal number) corresponding ciphertext;
the operation result and the certification data are used as data sharing certification information to carry out public sharing;
s3: determining the authenticity of the private data used by each participant based on the data sharing certification information and verification operation;
fig. 3 is a schematic flow chart of a method for verifying operation in the present invention, as shown in fig. 3, the method includes the following steps:
s301: carrying out modulo operation on the operation result disclosed by each participant and the prime number;
s302: inputting a result obtained by the modular operation into the constructor to obtain verification information;
s303: comparing the verification information with the certification data disclosed by each participant to determine the authenticity of the private data used by each participant;
at the time of verification:
the proving party obtaining disclosure
And
(ii) a Where f (.) is a published polynomial, the participant's protocol is to jointly compute the polynomial;
then according to
Information of and
construct out
And checking whether the self-constructed and the proving party send the same;
if equal, the sender can be proved to be actually calculated according to the protocol requirement
The calculation result shows that the participant uses real data to participate in calculation instead of the random number;
if the result is not true, the whole system is stopped, an error is thrown out, the calculation of the last time for verifying the result of the participant is required to be traced back, all previous calculation results are stored, and the whole system is terminated;
the verification comprises instant verification and delayed verification;
the instant verification is to verify the certificates sent by all the participants immediately after the operation is finished;
the deferred verification is the verification returned within a period of time after the operation is finished.
By adopting the method, the processes of construction certification and verification are more convenient and only need to be based onf(x)Construct out
And then comparing. And the scheme only requires for part of calculation results to prove, so that the calculation power can be saved, and a large amount of storage space can be saved.
Based on the above, in the multi-party secure computation process, the more the participants are, the more the data errors of a single party will have little influence on the whole, so that there may be a possibility that the participants adopt a 'false participation means' for the purpose of saving their own computing resources and protecting their own data, wherein the 'false participation means' is adopted for these purposes, i.e. the result output by the computation is a random number instead of adopting their real data in order to prevent the participants from 'false participation', and a proving process is added in the privacy computation to prove that the result computed and output by themselves is obtained by the computation of the present party;
meanwhile, the calculation efficiency of the proving step is lower than that of multi-party safe calculation, in order to prevent the calculation from being turned upside down, namely, the verification time is longer than the calculation time, the efficiency problem is considered, only partial data is used, each party proved by zero knowledge is strictly only partially trusted, but the verification probability can be ignored each time in the process of calculating for many times.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
The above description is only a preferred embodiment of the present application and is not intended to limit the present application, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, improvement and the like made within the spirit and principle of the present application shall be included in the protection scope of the present application.
Claims (8)
1. A data validation method for multiple parties involved in secure computing, the method employing multiple parties, comprising the steps of:
after encrypting the private data according to a preset encryption method, each participant shares the encryption result to other participants except the participant, wherein the encryption method comprises the following steps: each participant respectively obtains a plurality of different random numbers; splitting the private data according to a plurality of random numbers to obtain encrypted data;
each participant determines data sharing certification information according to the encryption result and a predetermined data verification protocol, wherein the method for determining the data sharing certification information comprises the following steps: after each participant receives the encrypted data; calculating the obtained encrypted data and the private data of the user according to the serial number and a data verification protocol to obtain data sharing certification information; during operation, the private data with the own number is not calculated;
and determining the authenticity of the private data used by each participant based on the data sharing certification information and the verification operation.
2. The method of claim 1, wherein the method comprises: the method for each participant to respectively obtain a plurality of different random numbers comprises the following steps:
each participant numbers all participants including the participant;
acquiring the total number of participants, and generating a plurality of random numbers according to the total number of the participants;
the total number of random numbers is at least one item greater than the total number of participants.
3. The method of claim 2, wherein the data validation method for the multi-party secure computing participants is as follows: the method for splitting the privacy data according to a plurality of random numbers comprises the following steps:
the privacy data are split according to the random numbers, and the numerical values of all items except one item are ensured to be matched with the random numbers one by one;
and simultaneously, the number of the split items of the privacy data is equal to the total number of the participants, and all the encrypted data are numbered after the splitting is finished.
4. The method of claim 3, wherein the data validation method for the multi-party secure computing participants is as follows: the method for sharing the encryption result to other participants except the user comprises the following steps:
each participant acquires the serial number of the participant before sending the encrypted data;
and reserving the encrypted data with the same number as the participant, and sending the encrypted data with other numbers to the participant with the number.
5. The method of claim 4, wherein the data validation method for the multi-party secure computing participants is as follows: the data validation protocol includes performing one or more of an addition operation, a subtraction operation, a multiplication operation, and a division operation on the data.
6. The method of claim 5, wherein the data validation method for the multi-party secure computing participants comprises: the calculation method of the data sharing certification information further comprises the following steps:
performing modular operation on an operation result obtained by calculation of a data verification protocol and a pre-disclosed prime number, and constructing and obtaining certification data through a disclosed construction function;
and carrying out public sharing by taking the operation result and the certification data as data sharing certification information.
7. The method of claim 6, wherein the data validation method for the multi-party secure computing participants comprises: the verification operation includes:
carrying out modulo operation on the operation result disclosed by each participant and the prime number;
inputting a result obtained by the modular operation into the constructor to obtain verification information;
the authentication information is compared with the certification data published by each participant to determine the authenticity of the private data used by each participant.
8. The method of claim 7, wherein the data validation method for the multi-party secure computing participants comprises: the verification comprises instant verification and delayed verification;
the instant verification is to verify the certificates sent by all the participants immediately after the operation is finished;
the deferred verification is the verification returned within a period of time after the operation is finished.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210609713.2A CN114697030B (en) | 2022-05-31 | 2022-05-31 | Data verification method for multi-party secure computing participant |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210609713.2A CN114697030B (en) | 2022-05-31 | 2022-05-31 | Data verification method for multi-party secure computing participant |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114697030A true CN114697030A (en) | 2022-07-01 |
| CN114697030B CN114697030B (en) | 2022-09-20 |
Family
ID=82131130
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210609713.2A Active CN114697030B (en) | 2022-05-31 | 2022-05-31 | Data verification method for multi-party secure computing participant |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114697030B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116248255A (en) * | 2023-05-12 | 2023-06-09 | 杭州大鱼网络科技有限公司 | Privacy protection method and system based on network security |
| CN116318684A (en) * | 2023-05-16 | 2023-06-23 | 蓝象智联(杭州)科技有限公司 | Multi-party PSI (program specific information) implementation system and method based on ECDH (ECDH) protocol |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109255247A (en) * | 2018-08-14 | 2019-01-22 | 阿里巴巴集团控股有限公司 | Secure calculation method and device, electronic equipment |
| CN111049825A (en) * | 2019-12-12 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Secure multi-party computing method and system based on trusted execution environment |
| US20200195437A1 (en) * | 2018-12-17 | 2020-06-18 | Insights Network | System and method for authenticating user identity |
| US20210167946A1 (en) * | 2018-04-17 | 2021-06-03 | B. G. Negev Technologies & Applications Ltd., At Ben-Gurion | One-Round Secure Multiparty Computation of Arithmetic Streams and Evaluation of Functions |
| CN113312641A (en) * | 2021-06-02 | 2021-08-27 | 杭州趣链科技有限公司 | Multipoint and multiparty data interaction method, system, electronic device and storage medium |
| CN113542413A (en) * | 2021-07-16 | 2021-10-22 | 北京数牍科技有限公司 | Trusted evidence based supervised privacy computing method and system and computer equipment |
| US20220069979A1 (en) * | 2020-09-02 | 2022-03-03 | Vmware, Inc. | Robust Input Verification for Secure Multi-Party Computation (MPC) with Clients |
| US20220085978A1 (en) * | 2020-09-11 | 2022-03-17 | Seagate Technology Llc | Privacy preserving secret sharing from novel combinatorial objects |
| CN114553593A (en) * | 2022-03-22 | 2022-05-27 | 杭州博盾习言科技有限公司 | Multi-party secure computation privacy intersection method, device, equipment and storage medium |
-
2022
- 2022-05-31 CN CN202210609713.2A patent/CN114697030B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20210167946A1 (en) * | 2018-04-17 | 2021-06-03 | B. G. Negev Technologies & Applications Ltd., At Ben-Gurion | One-Round Secure Multiparty Computation of Arithmetic Streams and Evaluation of Functions |
| CN109255247A (en) * | 2018-08-14 | 2019-01-22 | 阿里巴巴集团控股有限公司 | Secure calculation method and device, electronic equipment |
| US20200195437A1 (en) * | 2018-12-17 | 2020-06-18 | Insights Network | System and method for authenticating user identity |
| CN111049825A (en) * | 2019-12-12 | 2020-04-21 | 支付宝(杭州)信息技术有限公司 | Secure multi-party computing method and system based on trusted execution environment |
| US20220069979A1 (en) * | 2020-09-02 | 2022-03-03 | Vmware, Inc. | Robust Input Verification for Secure Multi-Party Computation (MPC) with Clients |
| US20220085978A1 (en) * | 2020-09-11 | 2022-03-17 | Seagate Technology Llc | Privacy preserving secret sharing from novel combinatorial objects |
| CN113312641A (en) * | 2021-06-02 | 2021-08-27 | 杭州趣链科技有限公司 | Multipoint and multiparty data interaction method, system, electronic device and storage medium |
| CN113542413A (en) * | 2021-07-16 | 2021-10-22 | 北京数牍科技有限公司 | Trusted evidence based supervised privacy computing method and system and computer equipment |
| CN114553593A (en) * | 2022-03-22 | 2022-05-27 | 杭州博盾习言科技有限公司 | Multi-party secure computation privacy intersection method, device, equipment and storage medium |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116248255A (en) * | 2023-05-12 | 2023-06-09 | 杭州大鱼网络科技有限公司 | Privacy protection method and system based on network security |
| CN116248255B (en) * | 2023-05-12 | 2023-08-01 | 杭州大鱼网络科技有限公司 | Privacy protection method and system based on network security |
| CN116318684A (en) * | 2023-05-16 | 2023-06-23 | 蓝象智联(杭州)科技有限公司 | Multi-party PSI (program specific information) implementation system and method based on ECDH (ECDH) protocol |
| CN116318684B (en) * | 2023-05-16 | 2023-10-20 | 蓝象智联(杭州)科技有限公司 | Multi-party PSI (program specific information) implementation system and method based on ECDH (ECDH) protocol |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114697030B (en) | 2022-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114697030B (en) | Data verification method for multi-party secure computing participant | |
| CN110971413B (en) | Random number generation method, random number generation device and storage medium | |
| JPWO2005071881A1 (en) | Mix net system | |
| CN103563288B (en) | Single-round password-based key exchange protocols | |
| CN109936455B (en) | Digital signature method, device and system | |
| US20100153728A1 (en) | Acceleration of key agreement protocols | |
| CN111989891A (en) | Data processing method, related device and block chain system | |
| CN107248909A (en) | It is a kind of based on SM2 algorithms without Credential-Security endorsement method | |
| JP4835831B2 (en) | Method and apparatus for computing a function from multiple inputs | |
| JP2004208263A (en) | Apparatus and method of blind signature based on individual identification information employing bilinear pairing | |
| WO2019110399A1 (en) | Two-party signature device and method | |
| CN107888385B (en) | RSA modulus generation method, RSA key generation method, computer device, and medium | |
| CN113779606A (en) | Information verification method and system for reducing privacy disclosure risk | |
| CN112632630A (en) | SM 2-based collaborative signature calculation method and device | |
| CN114070556A (en) | Threshold ring signature method and device, electronic equipment and readable storage medium | |
| CN112464155A (en) | Data processing method, multi-party security computing system and electronic equipment | |
| JP2010135928A (en) | Bit commitment verification system, bit commitment apparatus, verification apparatus, bit commitment verification method, bit commitment method, verification method, bit commitment program, verification program | |
| CN111245594B (en) | Homomorphic operation-based collaborative signature method and system | |
| CN112653554A (en) | Signature method, system, equipment and readable storage medium | |
| US9577828B2 (en) | Batch verification method and apparatus thereof | |
| CN116865970A (en) | Multiparty cooperative key generation and digital signature method and system based on national cryptographic algorithm | |
| CN111404685A (en) | Attribute-based signature method and system | |
| KR20240045231A (en) | Creation of digitally signed shares | |
| Su et al. | Secure blockchain-based electronic voting mechanism. | |
| EP3917076A1 (en) | A zero knowledge proof method for content engagement |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |