CN117527447A - Secret sharing method and system for multiparty secure computation - Google Patents

Secret sharing method and system for multiparty secure computation Download PDF

Info

Publication number
CN117527447A
CN117527447A CN202410014353.0A CN202410014353A CN117527447A CN 117527447 A CN117527447 A CN 117527447A CN 202410014353 A CN202410014353 A CN 202410014353A CN 117527447 A CN117527447 A CN 117527447A
Authority
CN
China
Prior art keywords
computer
secret information
decryption
password
vector
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
Application number
CN202410014353.0A
Other languages
Chinese (zh)
Other versions
CN117527447B (en
Inventor
陈颖
黄佑君
高立超
洪笑梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xiamen Id Check Network Technology Co ltd
Original Assignee
Xiamen Id Check Network Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Xiamen Id Check Network Technology Co ltd filed Critical Xiamen Id Check Network Technology Co ltd
Priority to CN202410014353.0A priority Critical patent/CN117527447B/en
Publication of CN117527447A publication Critical patent/CN117527447A/en
Application granted granted Critical
Publication of CN117527447B publication Critical patent/CN117527447B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
    • G06F21/45—Structures or tools for the administration of authentication
    • G06F21/46—Structures or tools for the administration of authentication by designing passwords or checking the strength of passwords
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
    • 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/14—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using a plurality of keys or algorithms
    • 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/40—Network security protocols
    • 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

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • General Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Storage Device Security (AREA)

Abstract

The invention provides a secret sharing method and a secret sharing system for multiparty secure computation, which relate to the technical field of encryption information processing, wherein the method comprises the following steps: when the ith computer in the computing cluster shares secret information with the appointed computer, determining the serial number of the appointed computer in the computing cluster; splitting the secret information to obtain a secret information paragraph; obtaining paragraph password vectors according to the number and serial numbers of the specified computers and preset passwords; obtaining a password matrix according to the paragraph password vector; obtaining a password of a designated computer according to the password matrix; encrypting the secret information through a password to obtain encrypted secret information; broadcasting secret information in a bus of the computing cluster, and sending a preset password to a designated computer; the computer obtains a preset password and secret information, and decrypts the secret information to obtain a decryption result; and when the decryption result is successful, obtaining the secret information. According to the invention, the security of secret information sharing can be improved.

Description

Secret sharing method and system for multiparty secure computation
Technical Field
The invention relates to the technical field of encryption information processing, in particular to a secret sharing method and system for multiparty secure computation.
Background
In the related art, CN114548418A discloses a secret sharing-based transverse federal IV algorithm, a distributed transverse federal IV feature screening method, in which data security is further increased by using secret sharing, firstly, an initiator node unifies a grouping mode and implements grouping, and simultaneously synchronizes the grouping mode with other participants, so that the participants implement grouping, and the tags are summed up in the grouping; each party performs secret slicing on the labels and the results, and then sends the slicing results to each party for privacy summation; and finally summarizing the values to the initiator, and calculating woe and iv values by the initiator. The method solves the problem that the calculation speed is influenced by carrying out encryption protection on the tag data based on the homomorphic encryption technology; meanwhile, the practical scene calculation limitation of a large amount of data is broken through; the method solves the problem that all parties can not calculate the library locally under the condition of similar service but lower overlap ratio of owned users, and can also finish the execution process of the calculation function to realize the feature screening of the data.
CN116187433a discloses a federal quasi-newton training method, device and storage medium based on secret sharing, wherein the federal quasi-newton training method based on secret sharing comprises: initializing a hessian matrix to obtain hessian matrix fragments, and sending the hessian matrix fragments and the super-parameter fragments corresponding to the participants; based on the hessian matrix segmentation and the super-parametric segmentation, and by using the acquired initiator data segmentation, the participant data segmentation, the initiator model parameter segmentation, the participant model parameter segmentation and the initiator label segmentation, the updated global model parameter segmentation is obtained by using a random quasi-Newton method through iteration of a preset iteration round number so as to complete training of the model. The method aims at solving the problems that in the prior art, a reliable third party is needed to calculate a Hemson matrix based on a homomorphic encryption scheme of the Federal quasi-Newton method; based on the secret sharing scheme, the method is used for approximately calculating the hessian matrix and is limited to a logistic regression algorithm, so that the application range is narrow and the model precision is damaged.
Based on the above related technology, the technical problem of secret information sharing between the secret sharer and the designated participant can be solved, however, when the computer masses exist non-designated participants, the related technology cannot ensure the security and the privacy of the secret information when the secret information is shared to a part of designated computers in the computing cluster, that is, cannot ensure that the non-designated computers in the computing cluster cannot view the secret information.
The information disclosed in the background section of this application is only for enhancement of understanding of the general background of this application and should not be taken as an acknowledgement or any form of suggestion that this information forms the prior art already known to a person skilled in the art.
Disclosure of Invention
The invention provides a secret sharing method and a secret sharing system for multiparty secure computation, which can encrypt secret information through a paragraph password vector, a serial number of a designated computer, a preset password and a password matrix, and solve the technical problem that the security and the privacy of the secret information can not be ensured when the computer in a computing cluster with a non-designated computer shares the secret information.
According to a first aspect of the present invention, there is provided a secret sharing method of multiparty secure computation, comprising: when the ith computer in the computing cluster appoints the computer shared secret information to the computing cluster, determining the sequence number of the appointed computer in the computing cluster, wherein i is less than or equal to N, N is the total number of computers in the computing cluster, and i and N are both positive integers; splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers; obtaining a paragraph cipher vector of each secret information paragraph according to the number of the appointed computers, the serial numbers of the appointed computers and preset ciphers set for the secret information paragraphs, wherein the digits of the preset ciphers are equal to those of the secret information paragraphs The number is the same; obtaining a password matrix according to the paragraph password vector of each secret information paragraph; obtaining the password of each appointed computer according to the password matrix; encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer; broadcasting encrypted secret information corresponding to each appointed computer in a bus of a computing cluster, and sending the preset password to the appointed computer; the computer in the computing cluster acquires the preset passwords and the encrypted secret information corresponding to each appointed computer, and decrypts the encrypted secret information corresponding to each appointed computer according to the serial number of the computer and the preset passwords to obtain a decryption result; under the condition that the decryption result is that the decryption is successful, the secret information is obtained; obtaining a paragraph password vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers and preset passwords set for the secret information paragraphs, wherein the paragraph password vector comprises the following components: according to the formulaObtaining a paragraph cipher vector +. >Wherein->Designating the serial number of the computer for 1 st, +.>Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
According to the invention, according to the respective secretObtaining a cipher matrix from a paragraph cipher vector of a secret information paragraph, including: according to the formulaA cryptographic matrix P is obtained.
According to the invention, the password matrix is used for obtaining the password of each appointed computer, and the method comprises the following steps: acquiring a j-th row vector of the password matrix; and forming the numbers of all elements in the row vector into the password of the j appointed computer.
According to the invention, the encrypted secret information corresponding to each appointed computer is decrypted according to the serial number of the computer and the preset password to obtain a decryption result, which comprises the following steps: determining the number of the secret information paragraphs according to the number of bits of the preset password; obtaining a decryption vector corresponding to the serial number of the computer according to the number of the secret information paragraphs and the serial number of the computer; transmitting the decryption vector to an i-th computer; determining, by an i-th computer, a decryption security score from the decryption vector and the cryptographic matrix; and under the condition that the decryption security score is higher than a preset security threshold, determining that the decryption result is successful in decryption.
According to the present invention, according to the number of the secret information paragraphs and the serial number of the computer, a decryption vector corresponding to the serial number of the computer is obtained, including: according to the formulaObtaining a decryption vector corresponding to the serial number x of the computer>Wherein->And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
According to the invention, determining, by an ith computer, a decryption security score from the decryption vector and the cryptographic matrix, comprises: decomposing the elements with the values greater than or equal to 10 in the decryption vector to obtain the data of each data bit of each element in the decryption vector; according to the data of each data bit of each element in the decryption vector, obtaining a decomposition decryption vector; decomposing elements greater than or equal to 10 in each row vector of the password matrix to obtain data of each data bit of each element in each row vector of the password matrix; according to the data of each data bit of each element in each row vector, obtaining a decomposition row vector corresponding to each row vector; and determining a decryption security score according to the decomposed row vector corresponding to each row vector and the decomposed decryption vector.
According to the present invention, determining a decryption security score from a decomposed row vector corresponding to each row vector and the decomposed decryption vector includes: according to the formulaDetermining decryption Security score +.>Wherein Y is a decomposition row vector corresponding to the Y-th row vector +.>X is a decomposed decryption vector of decryption vectors corresponding to serial number X of the computer +.>Data volume of-> ，/>For a matrix of Y rows and X columns, +.>Is a matrix of X rows and Y columns, s is the number of steps, u is any positive integer, and at +.>Wherein s and u are each less than or equal to Y-X, in +.>Wherein s and u are each less than or equal to X-Y, -/->Indicating +.>Otherwise, let(s)>M is the number of secret information paragraphs, y is less than or equal to m, y and m are positive integers, and if is a conditional function.
According to the present invention, in the case that the decryption result is that the decryption is successful, the obtaining of the secret information includes: and if the decryption result is that the decryption is successful, the ith computer sends the password of the appointed computer corresponding to the decryption security score to the computer which is successful in decryption, and the encrypted secret information of the appointed computer corresponding to the decryption security score is decrypted, so that the secret information is obtained.
According to a second aspect of the present invention, there is provided a secret sharing system of multiparty secure computing, comprising: the serial number module is used for determining the serial number of the appointed computer in the computing cluster when the ith computer in the computing cluster appoints the computer shared secret information to the computing cluster, wherein i is less than or equal to N, N is the total number of the computers in the computing cluster, and i and N are both positive integers; the secret information paragraph module is used for splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers; a paragraph cipher vector module for obtaining a paragraph cipher vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers, and the preset cipher set for the secret information paragraph, wherein the digits of the preset cipher are equal to the secret information paragraphThe number of falls is the same; the password matrix module is used for obtaining a password matrix according to the paragraph password vector of each secret information paragraph; the password module is used for obtaining the password of each appointed computer according to the password matrix; the encryption module is used for encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer; the broadcasting module is used for broadcasting the encrypted secret information corresponding to each appointed computer in the bus of the computing cluster and sending the preset password to the appointed computer; the decryption module is used for acquiring the preset passwords and the encrypted secret information corresponding to each appointed computer by the computers in the computing cluster, and decrypting the encrypted secret information corresponding to each appointed computer according to the serial numbers of the computers and the preset passwords to obtain a decryption result; the result module is used for obtaining the secret information under the condition that the decryption result is that the decryption is successful; obtaining a paragraph password vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers and preset passwords set for the secret information paragraphs, wherein the paragraph password vector comprises the following components: according to the formula Obtaining a paragraph cipher vector +.>Wherein->Designating the serial number of the computer for 1 st, +.>Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>The kth bit of the preset passwordM is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
The technical effects are as follows: according to the invention, the paragraph cipher vectors of a plurality of secret information paragraphs are obtained through the serial numbers of the designated computers and the preset cipher, so that a cipher matrix is formed, and the cipher of each designated computer is obtained based on the cipher matrix, so that secret information is encrypted respectively through the cipher of each computer, when a non-designated computer exists in a computing cluster, the encryption can be carried out through the serial numbers of the designated computers, even if the non-designated computer can acquire the encrypted information, the decryption can not be carried out through the serial numbers of the non-designated computer, and therefore, when the non-designated computer exists in the computing cluster, the security and the privacy of the secret information are improved. When the paragraph password vector is determined, the paragraph password vector can be determined according to the serial number of the appointed computer, the preset password and the number of the paragraphs referring to the secret information, and the serial number of the appointed computer is referred to when the paragraph password vector is generated, so that the password is related to the serial number of the appointed computer when the password is finally generated, the unspecified computer is difficult to decrypt through the serial number of the unspecified computer, and the secret information sharing confidentiality is improved. When the decryption vector is determined, the decryption vector corresponding to the serial number of the computer can be determined according to the number of the secret information paragraphs and the serial number of the computer, so that the secret information can be prevented from being decrypted when the unspecified computer receives the secret information in broadcasting, the computer with the serial number which is inconsistent with the specified computer can not decrypt the encrypted secret information, and the privacy of information sharing is ensured. When determining the decryption security score, if the data quantity in the decomposed row vector is inconsistent with the data quantity in the decomposed decryption vector, a new vector with consistent data quantity can be obtained through interception, further cosine similarity calculation can be performed, the similarity maximum value is used as the decryption security score, and therefore in the decryption process, the difference of the row vector and the decryption vector in the data quantity is considered, and a preset security threshold can be set to avoid the problem that the row vector cannot be matched due to calculation errors such as decimal numbers, so that the decomposed decryption vector of the decryption vector calculated by the appointed computer based on the own sequence number can be successfully matched, and the accuracy and the security of the decryption security score are improved.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the invention as claimed. Other features and aspects of the present invention will become apparent from the following detailed description of exemplary embodiments, which proceeds with reference to the accompanying drawings.
Drawings
In order to more clearly illustrate the embodiments of the invention or the solutions of the prior art, the drawings which are necessary for the description of the embodiments or the prior art will be briefly described below, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other embodiments may be obtained from these drawings without inventive effort to a person skilled in the art,
FIG. 1 schematically illustrates a flow diagram of a secret sharing method of multiparty secure computing in accordance with an embodiment of the invention;
fig. 2 schematically illustrates a block diagram of a secret sharing system for multiparty secure computing in accordance with an embodiment of the invention.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The technical scheme of the invention is described in detail below by specific examples. The following embodiments may be combined with each other, and some embodiments may not be repeated for the same or similar concepts or processes.
Fig. 1 schematically shows a flow diagram of a secret sharing method of multiparty secure computing, according to an embodiment of the invention, the method comprising:
step S101, when an ith computer in a computing cluster designates computer shared secret information in the computing cluster, determining the sequence number of the designated computer in the computing cluster, wherein i is less than or equal to N, N is the total number of computers in the computing cluster, and i and N are both positive integers;
step S102, splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers;
step S103, obtaining a paragraph cipher vector of each secret information paragraph according to the number of the appointed computers, the serial numbers of the appointed computers and preset ciphers set for the secret information paragraphs, wherein the number of digits of the preset ciphers is the same as the number of the secret information paragraphs;
Step S104, obtaining a password matrix according to the paragraph password vector of each secret information paragraph;
step S105, obtaining the password of each appointed computer according to the password matrix;
step S106, encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer;
step S107, broadcasting the encrypted secret information corresponding to each appointed computer in a bus of a computing cluster, and sending the preset password to the appointed computer;
step S108, the computers in the computing cluster acquire the preset passwords and the encrypted secret information corresponding to each appointed computer, and decrypt the encrypted secret information corresponding to each appointed computer according to the serial numbers of the computers and the preset passwords to acquire decryption results;
step S109, obtaining the secret information when the decryption result is that the decryption is successful.
According to the secret sharing method for multiparty secure computation of the embodiment of the invention, the paragraph cipher vectors of a plurality of secret information paragraphs are obtained through the serial numbers of the designated computers and the preset cipher, so that a cipher matrix is formed, the cipher of each designated computer is obtained based on the cipher matrix, and thus secret information is encrypted respectively through the cipher of each computer, when a non-designated computer exists in a computing cluster, the secret information can be encrypted through the serial numbers of the designated computers, so that even if the non-designated computer can obtain encrypted information, decryption can not be carried out through the serial numbers of the non-designated computer, and therefore, when the non-designated computer exists in the computing cluster, the security and privacy of the secret information are improved.
According to one embodiment of the present invention, in step S101, when an ith computer in a computing cluster designates a computer in the computing cluster with shared secret information, a sequence number of the designated computer in the computing cluster is determined, where i is equal to or less than N, N is a total number of computers in the computing cluster, and i and N are both positive integers.
In the example, the computing cluster is a parallel distributed system of computers communicatively coupled to each other. For example, when the 5 th computer in the cluster needs to share secret information with the designated computers in the cluster, such as the 1 st and 10 th computers, and other computers in the computing cluster need to ensure confidentiality of the shared information, the serial numbers of the two shared computers in the cluster can be determined to be 1 and 10, so that the password required for encryption can be generated based on the serial numbers of the designated computers.
According to one embodiment of the present invention, in step S102, the secret information is split according to the number of designated computers, and a plurality of secret information paragraphs are obtained, where the number of secret information paragraphs is the same as the number of designated computers.
For example, the number of designated computers is 2, and the secret information is split according to the number of designated computers to obtain two pieces of secret information, wherein the number of pieces of secret information is the same as the number of designated computers.
According to one embodiment of the present invention, in step S103, a paragraph cipher vector of each secret information paragraph is obtained according to the number of the specified computers, the serial numbers of the specified computers, and a preset cipher set for the secret information paragraph, wherein the number of digits of the preset cipher is the same as the number of the secret information paragraphs.
For example, the number of designated computers is 2, the secret information is split to obtain two secret information paragraphs, preset passwords are set for the two secret information paragraphs, the preset passwords are respectively 20 and 35, the secret level of the preset passwords is low, and the number of digits of the preset passwords is the same as the number of the secret information paragraphs.
According to one embodiment of the present invention, obtaining a paragraph password vector for each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers, and a preset password set for the secret information paragraph includes: obtaining a paragraph cipher vector for a kth secret information paragraph according to equation (1) ，
（1）
Wherein,designating the serial number of the computer for 1 st, +.>Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
In accordance with one embodiment of the present invention,for the kth bit of the preset code, each bit of the preset code represents a datum,/->For the serial number of the designated computer to be shared, let k=2, assuming the number of pieces of secret information to be 3>、/>、/>1, 2, 3, respectively, < ->The values of the elements in each paragraph password vector are in a linear relationship with the serial numbers of the designated computers, and the first element in each paragraph password vector corresponds to the first designated computer in the computing cluster, the second element corresponds to the second designated computer, and so on. And encrypting the secret information paragraphs according to the serial numbers of the appointed computers, the preset passwords and the number of the secret information paragraphs by utilizing the relation, and finally obtaining m multiplied by 1 paragraph password vectors.
In this way, the paragraph password vector can be determined according to the serial number of the appointed computer, the preset password and the number of the paragraphs referring to the secret information, and the serial number of the appointed computer is referred to when the paragraph password vector is generated, so that the password is related to the serial number of the appointed computer when the password is finally generated, the unspecified computer is difficult to decrypt through the serial number of the unspecified computer, and the secret information sharing confidentiality is improved.
According to one embodiment of the present invention, in step S104, a cryptographic matrix is obtained from the paragraph cipher vector of each secret information paragraph.
For example, the paragraph cipher vector of the secret information paragraph is a column vector, the cipher matrix is a square matrix, and the obtained paragraph cipher vectors of the secret information paragraphs are combined to obtain the cipher matrix.
According to one embodiment of the invention, obtaining a cryptographic matrix from a paragraph cryptographic vector of each paragraph of secret information comprises: the cryptographic matrix P is obtained according to equation (2).
（2）
According to one embodiment of the invention, the paragraph cipher vector is a 4 x 1 column vector,combining the 4 paragraph cipher vectors to obtain a 4×4 cipher matrix, each row of the cipher matrix corresponding to each specified computer (i.e., each row of elements is an element determined by using the serial number of the same specified computer, e.g., each column of elements of the mth row of each paragraph cipher vector is a serial number of the mth specified computer)>The elements determined, and thus, the elements of the mth row of the cryptographic matrix correspond to the mth designated computer), each column in the cryptographic matrix corresponds to each paragraph of the cryptographic vector, respectively.
According to one embodiment of the present invention, in step S105, a password for each designated computer is obtained from the password matrix.
For example, the secret information paragraph is equal to the number of the designated computers, the cipher matrix is a square matrix, each column of the cipher matrix corresponds to each secret paragraph, each row of the cipher matrix corresponds to each designated computer, and the row vector of the cipher matrix is the cipher of each corresponding designated computer.
According to one embodiment of the present invention, obtaining a password for each designated computer from the password matrix includes: acquiring a j-th row vector of the password matrix; and forming the numbers of all elements in the row vector into the password of the j appointed computer.
For example, the cipher matrix is a square matrix composed of paragraph cipher vectors of m secret information paragraphs,m is the number of the designated computers, and a plurality of elements of each row of the cipher matrix corresponds to each designated computer, so that the cipher of the corresponding designated computer can be determined by using the row vector of the cipher matrix, and based on the paragraph cipher vector and the cipher matrix, the j-th row vector of the cipher matrix is the followingDecomposing elements greater than or equal to 10 in the row vectors to obtain the code of the j-th appointed computer, for example, the j-th row vector of the code matrix is [1, 20, 35 ] ]Elements greater than or equal to 10 are decomposed, i.e., 20 and 35 are decomposed, resulting in 2, 0, 3, 5. Thus, the numbers 1, 2, 0, 3, 5 of all elements obtained based on the j-th row vector will be used to compose the password of the j-th specified computer by decomposing the numbers of all elements in the row vector, for example, 1, 2, 0, 3, 5 can be used as the password of the j-th specified computer.
According to one embodiment of the present invention, in step S106, the secret information is encrypted by the password of each specified computer, and the encrypted secret information corresponding to each specified computer is obtained.
For example, since m designated computers are used in total, the passwords of the m designated computers can be obtained, and the secret information can be encrypted by using the password of each designated computer, so that the encrypted secret information corresponding to the m designated computers, that is, the secret information encrypted by using the password of the j designated computer, is the encrypted secret information corresponding to the j designated computer.
According to one embodiment of the present invention, in step S107, encrypted secret information corresponding to each designated computer is broadcasted in the bus of the computing cluster, and the preset password is transmitted to the designated computer.
For example, the encrypted secret information is broadcasted in the bus, for example, the encrypted secret information may be stored in a common storage area of the computing cluster, and each computer in the computing cluster may download the encrypted secret information, but only a designated computer that receives the preset password may decrypt the encrypted information using its own serial number, that is, a non-designated computer may not decrypt the encrypted information even if it downloads the encrypted secret information, and thus may not view the secret information.
According to one embodiment of the present invention, in step S108, the computers in the computing cluster acquire the preset passwords and the encrypted secret information corresponding to each designated computer, and decrypt the encrypted secret information corresponding to each designated computer according to the serial numbers of the computers and the preset passwords to obtain a decryption result.
According to one embodiment of the present invention, decrypting the encrypted secret information corresponding to each specified computer according to the serial number of the computer and the preset password to obtain a decryption result includes: determining the number of the secret information paragraphs according to the number of bits of the preset password; obtaining a decryption vector corresponding to the serial number of the computer according to the number of the secret information paragraphs and the serial number of the computer; transmitting the decryption vector to an i-th computer; determining, by an i-th computer, a decryption security score from the decryption vector and the cryptographic matrix; and under the condition that the decryption security score is higher than a preset security threshold, determining that the decryption result is successful in decryption.
For example, the i-th computer may send the preset password to the designated computer, and the designated computer may determine the number of pieces of secret information from the number of bits of the preset password, that is, the number of bits of the preset password is equal to the number of pieces of secret information.
According to one embodiment of the present invention, there may be cases where a non-designated computer steals a preset password. However, the designated computer can obtain the decryption vector corresponding to the serial number of the computer according to the number of the secret information paragraphs and the serial number of the computer, but the designated computer cannot determine the serial number of the designated computer, and the serial number of the designated computer is different from the serial number of the designated computer, so that the correct decryption vector cannot be obtained.
According to one embodiment of the invention, the designated computer sends the decryption vector to the computer that initiated the shared secret information (i.e., the ith computer), the computer that initiated the shared secret information determines a decryption security score based on the decryption vector and the cryptographic matrix, and if the decryption security score is above a preset security threshold, the computer that initiated the shared secret information determines that the decryption was successful and sends the correct password to the designated computer. The non-appointed computer cannot acquire the serial number of the appointed computer and is different from the serial number of the appointed computer, so that after the non-appointed computer sends the decryption vector obtained by calculation to the ith computer, the decryption security score calculated by the ith computer based on the decryption vector of the non-appointed computer is lower, and the decryption failure of the non-appointed computer is judged.
According to one embodiment of the present invention, obtaining a decryption vector corresponding to a serial number of the computer according to the number of the secret information paragraphs and the serial number of the computer includes: obtaining a decryption vector corresponding to the serial number x of the computer according to formula (3)，
（3）
Wherein,and m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
For example, when the serial number x=1 of the computer, the corresponding decryption vector. The computer with sequence number 1 can decrypt the vector +.>Sending the information to the ith computer to judge, determining a decryption security score, if the computer with the serial number of 1 is the appointed computer, the decryption security score is higher, and the decryption result is that the decryption is successful, wherein the method comprises the following steps ofUnder the condition, the ith computer can want the computer with the serial number of 1 to send the password of the appointed computer with the serial number of 1, so that the computer with the serial number of 1 can successfully decrypt and obtain the decrypted secret information. Otherwise, if the computer with the serial number of 1 is a non-designated computer, after the decryption vector is sent to the ith computer, the decryption security score determined by the ith computer is lower, so that no password is sent to the computer with the serial number of 1.
In this way, the decryption vector corresponding to the serial number of the computer can be determined according to the number of the secret information paragraphs and the serial number of the computer, so that the secret information can be prevented from being decrypted when the unspecified computer receives the secret information in the broadcast, the computer with the serial number inconsistent with the specified computer can not decrypt the encrypted secret information, and the privacy of information sharing is ensured.
According to one embodiment of the invention, determining, by an ith computer, a decryption security score from the decryption vector and the cryptographic matrix, comprises: decomposing the elements with the values greater than or equal to 10 in the decryption vector to obtain the data of each data bit of each element in the decryption vector; according to the data of each data bit of each element in the decryption vector, obtaining a decomposition decryption vector; decomposing elements greater than or equal to 10 in each row vector of the password matrix to obtain data of each data bit of each element in each row vector of the password matrix; according to the data of each data bit of each element in each row vector, obtaining a decomposition row vector corresponding to each row vector; and determining a decryption security score according to the decomposed row vector corresponding to each row vector and the decomposed decryption vector.
For example, an element with a value greater than 10 may exist in the obtained decryption vector, and the element with a value greater than or equal to 10 in the decryption vector is decomposed, for example, an element in the decryption vector is 20, and the element is decomposed into 2 and 0. And decomposing an element greater than or equal to 10 in each row vector of the cipher matrix, for example, decomposing an element of 30 in the row vector of the cipher matrix into 3 and 0. The decomposed elements are compared bit by bit, the difference value of the two elements before decomposition is 10, and the difference value of the two elements after decomposition is 1 and 0 respectively, so that the accuracy of comparison can be positioned to the unit number, and the accuracy of comparison and the accuracy of matching are improved. The decomposed data of each element in the decryption vector forms a decomposed decryption vector, the decomposed data of each element in each row vector forms a decomposed row vector, and the decryption security score may be determined based on the decomposed row vector and the decomposed decryption vector.
According to one embodiment of the present invention, determining a decryption security score from the decomposed row vectors corresponding to each row vector and the decomposed decryption vector includes: determining a decryption security score according to equation (4) ，
（4）
Wherein Y is a decomposed row vector corresponding to the Y-th row vectorX is a decomposed decryption vector of decryption vectors corresponding to serial number X of the computer +.>Data volume of->
For a matrix of Y rows and X columns, +.>Is a matrix of X rows and Y columns, s is the number of steps, u is any positive integer, and at +.>Wherein s and u are each less than or equal to Y-X, in +.>Wherein s and u are each less than or equal to X-Y, -/->Indicating that when the number of steps s=u,otherwise, let(s)>M is the number of secret information paragraphs, y is less than or equal to m, y and m are positive integers, and if is a conditional function.
According to one embodiment of the present invention, the amount of data of the decomposed row vector and the decomposed decryption vector after decomposition is not necessarily equal whenWhen (I)>Representing the usage matrix +.>Multiplying the decomposed row vector corresponding to the y-th row vector, thereby cutting out X elements in the decomposed row vector to form a new vector, and solving the new vector and +.>Cosine similarity of>In which s represents the number of steps, when s=1, < +.>From 1 st to X th element, when s=2, is taken out +.>Elements 2 to X+1 in (a) and so on, +.>Indicating the need to intercept Y-X steps and solve the new vector and +.>Cosine similarity of>Representing the maximum value of the Y-X cosine similarities calculated in the Y-X step.
According to one embodiment of the invention, whenWhen (I)>Representing the usage matrix +.>Multiplying the decomposition decryption vector, cutting out Y elements in the decomposition decryption amount to form a new vector, and solving the new vector and +.>Cosine similarity of>In (I)>Representing the number of steps, when s=1, cut out +.>From 1 st to Y th element, when s=2, is taken out +.>Elements 2 to Y+1 in (a) and so on, +.>Indicating the need to intercept the X-Y steps and solving the new vector and +.>Cosine similarity of>Representing the maximum of the X-Y cosine similarities calculated in the X-Y steps.
According to one embodiment of the invention, equation (4) selects both cases by means of a conditional function, whereThe value of the conditional function is +.>In->When the value of the conditional function is. Further, the above conditional function value is a conditional function value obtained by calculating a decomposed row vector corresponding to the decomposed decryption vector and the y-th row vector, and the decomposed row vector corresponding to each row vector may be subjected to the above operation to obtain a conditional function value obtained by calculating a decomposed row vector corresponding to each row vector, so that the maximum value may be selected from the plurality of conditional function values as the decryption security score. And a preset security threshold (e.g., 0.9 or 0.95, etc.) may be set, and if the decryption security score is higher than the preset security threshold, the decryption result may be determined as successful decryption. The preset security threshold is not set to 1, that is, the decomposed decryption vector is not required to be completely matched with the decomposed row vector corresponding to the row vector of a certain row, so that the problem that the decomposed decryption vector of the decryption vector calculated by the designated computer based on the serial number of the designated computer can be successfully matched due to calculation errors such as decimal numbers can be avoided.
In this way, if the data amount in the decomposed row vector is inconsistent with the data amount in the decomposed decryption vector, a new vector with consistent data amount can be obtained by intercepting in each step, so that cosine similarity can be calculated, the similarity maximum value is used as a decryption security score, and therefore, in the decryption process, the difference of the row vector and the decryption vector in the data amount is considered, and a preset security threshold can be set to avoid the problem that the row vector and the decryption vector cannot be matched due to calculation errors such as decimal numbers, so that the decomposed decryption vector of the decryption vector calculated by the appointed computer based on the own sequence number can be successfully matched, and the accuracy and the security of the decryption security score are improved.
According to one embodiment of the present invention, in step S109, in the case where the decryption result is that the decryption is successful, the secret information is obtained.
According to an embodiment of the present invention, in a case where the decryption result is that the decryption is successful, obtaining the secret information includes: and if the decryption result is that the decryption is successful, the ith computer sends the password of the appointed computer corresponding to the decryption security score to the computer which is successful in decryption, and the encrypted secret information of the appointed computer corresponding to the decryption security score is decrypted, so that the secret information is obtained.
For example, the designated computer determines a decryption security score according to the decomposed row vector corresponding to each row vector and the decomposed decryption vector, determines that decryption is successful when the decryption security score is greater than the set threshold, and when decryption is successful, the computer initiating sharing sends the password of the designated computer (i.e., the password of the designated computer corresponding to the row vector that takes the maximum value of the conditional function in the calculation process of the decryption security score) that is successful in the corresponding computer, and the designated computer can decrypt the encrypted secret information by using the password to obtain the secret information.
According to the secret sharing method for multiparty secure computation of the embodiment of the invention, the paragraph cipher vectors of a plurality of secret information paragraphs are obtained through the serial numbers of the designated computers and the preset cipher, so that a cipher matrix is formed, the cipher of each designated computer is obtained based on the cipher matrix, and thus secret information is encrypted respectively through the cipher of each computer, when a non-designated computer exists in a computing cluster, the secret information can be encrypted through the serial numbers of the designated computers, so that even if the non-designated computer can obtain encrypted information, decryption can not be carried out through the serial numbers of the non-designated computer, and therefore, when the non-designated computer exists in the computing cluster, the security and privacy of the secret information are improved. When the paragraph password vector is determined, the paragraph password vector can be determined according to the serial number of the appointed computer, the preset password and the number of the paragraphs referring to the secret information, and the serial number of the appointed computer is referred to when the paragraph password vector is generated, so that the password is related to the serial number of the appointed computer when the password is finally generated, the unspecified computer is difficult to decrypt through the serial number of the unspecified computer, and the secret information sharing confidentiality is improved. When the decryption vector is determined, the decryption vector corresponding to the serial number of the computer can be determined according to the number of the secret information paragraphs and the serial number of the computer, so that the secret information can be prevented from being decrypted when the unspecified computer receives the secret information in broadcasting, the computer with the serial number which is inconsistent with the specified computer can not decrypt the encrypted secret information, and the privacy of information sharing is ensured. When determining the decryption security score, if the data quantity in the decomposed row vector is inconsistent with the data quantity in the decomposed decryption vector, a new vector with consistent data quantity can be obtained through interception, further cosine similarity calculation can be performed, the similarity maximum value is used as the decryption security score, and therefore in the decryption process, the difference of the row vector and the decryption vector in the data quantity is considered, and a preset security threshold can be set to avoid the problem that the row vector cannot be matched due to calculation errors such as decimal numbers, so that the decomposed decryption vector of the decryption vector calculated by the appointed computer based on the own sequence number can be successfully matched, and the accuracy and the security of the decryption security score are improved.
Fig. 2 schematically illustrates a block diagram of a secret sharing system of multiparty secure computing, according to an embodiment of the invention, the system comprising:
the serial number module is used for determining the serial number of the appointed computer in the computing cluster when the ith computer in the computing cluster appoints the computer shared secret information to the computing cluster, wherein i is less than or equal to N, N is the total number of the computers in the computing cluster, and i and N are both positive integers;
the secret information paragraph module is used for splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers;
the paragraph password vector module is used for obtaining the paragraph password vector of each secret information paragraph according to the number of the appointed computers, the serial numbers of the appointed computers and preset passwords set for the secret information paragraphs, wherein the number of digits of the preset passwords is the same as the number of the secret information paragraphs;
the password matrix module is used for obtaining a password matrix according to the paragraph password vector of each secret information paragraph;
the password module is used for obtaining the password of each appointed computer according to the password matrix;
The encryption module is used for encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer;
the broadcasting module is used for broadcasting the encrypted secret information corresponding to each appointed computer in the bus of the computing cluster and sending the preset password to the appointed computer;
the decryption module is used for acquiring the preset passwords and the encrypted secret information corresponding to each appointed computer by the computers in the computing cluster, and decrypting the encrypted secret information corresponding to each appointed computer according to the serial numbers of the computers and the preset passwords to obtain a decryption result;
the result module is used for obtaining the secret information under the condition that the decryption result is that the decryption is successful;
obtaining a paragraph password vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers and preset passwords set for the secret information paragraphs, wherein the paragraph password vector comprises the following components:
according to the formula
Obtaining a paragraph cipher vector for a kth secret information paragraphWherein->The serial number of the computer is designated for the 1 st, Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
The present invention may be a method, apparatus, system, and/or computer program product. The computer program product may include a computer readable storage medium having computer readable program instructions embodied thereon for performing various aspects of the present invention.
It will be appreciated by persons skilled in the art that the embodiments of the invention described above and shown in the drawings are by way of example only and are not limiting. The objects of the present invention have been fully and effectively achieved. The functional and structural principles of the present invention have been shown and described in the examples and embodiments of the invention may be modified or practiced without departing from the principles described.
Finally, it should be noted that: the above embodiments are only for illustrating the technical solution of the present invention, and not for limiting the same; although the invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some or all of the technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit of the invention.

Claims (9)

1. A secret sharing method for multiparty secure computing, comprising:
when the ith computer in the computing cluster appoints the computer shared secret information to the computing cluster, determining the sequence number of the appointed computer in the computing cluster, wherein i is less than or equal to N, N is the total number of computers in the computing cluster, and i and N are both positive integers;
splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers;
obtaining a paragraph password vector of each secret information paragraph according to the number of the appointed computers, the serial numbers of the appointed computers and preset passwords set for the secret information paragraphs, wherein the number of digits of the preset passwords is the same as the number of the secret information paragraphs;
obtaining a password matrix according to the paragraph password vector of each secret information paragraph;
obtaining the password of each appointed computer according to the password matrix;
encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer;
Broadcasting encrypted secret information corresponding to each appointed computer in a bus of a computing cluster, and sending the preset password to the appointed computer;
the computer in the computing cluster acquires the preset passwords and the encrypted secret information corresponding to each appointed computer, and decrypts the encrypted secret information corresponding to each appointed computer according to the serial number of the computer and the preset passwords to obtain a decryption result;
under the condition that the decryption result is that the decryption is successful, the secret information is obtained;
obtaining a paragraph password vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers and preset passwords set for the secret information paragraphs, wherein the paragraph password vector comprises the following components:
according to the formula
Obtaining a paragraph cipher vector for a kth secret information paragraphWherein->Designating the serial number of the computer for 1 st, +.>Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
2. The secret sharing method of claim 1, wherein obtaining the cryptographic matrix from the paragraph cipher vector of each paragraph of secret information comprises:
According to the formula
A cryptographic matrix P is obtained.
3. The secret sharing method of multiparty security computing of claim 2, wherein obtaining a password for each designated computer from the password matrix comprises:
acquiring a j-th row vector of the password matrix;
and forming the numbers of all elements in the row vector into the password of the j appointed computer.
4. The secret sharing method of multiparty security computing according to claim 1, wherein decrypting the encrypted secret information corresponding to each designated computer according to the serial number of the computer and the preset password to obtain the decryption result comprises:
determining the number of the secret information paragraphs according to the number of bits of the preset password;
obtaining a decryption vector corresponding to the serial number of the computer according to the number of the secret information paragraphs and the serial number of the computer;
transmitting the decryption vector to an i-th computer;
determining, by an i-th computer, a decryption security score from the decryption vector and the cryptographic matrix;
and under the condition that the decryption security score is higher than a preset security threshold, determining that the decryption result is successful in decryption.
5. The secret sharing method of multiparty security computation according to claim 4, wherein obtaining a decryption vector corresponding to the serial number of the computer based on the number of segments of secret information and the serial number of the computer, comprises:
According to the formula
Obtaining a decryption vector corresponding to the serial number x of the computerWherein->And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
6. A method of secret sharing for a multiparty security computation according to claim 4, wherein determining, by an ith computer, a decryption security score from the decryption vector and the cryptographic matrix, comprises:
decomposing the elements with the values greater than or equal to 10 in the decryption vector to obtain the data of each data bit of each element in the decryption vector;
according to the data of each data bit of each element in the decryption vector, obtaining a decomposition decryption vector;
decomposing elements greater than or equal to 10 in each row vector of the password matrix to obtain data of each data bit of each element in each row vector of the password matrix;
according to the data of each data bit of each element in each row vector, obtaining a decomposition row vector corresponding to each row vector;
and determining a decryption security score according to the decomposed row vector corresponding to each row vector and the decomposed decryption vector.
7. The method of secret sharing for multiparty security computation according to claim 6, wherein determining a decryption security score from the decomposed row vector corresponding to each row vector and the decomposed decryption vector, comprises:
According to the formula
Determining decryption security scoringWherein Y is a decomposition row vector corresponding to the Y-th row vector +.>X is a decomposed decryption vector of decryption vectors corresponding to serial number X of the computer +.>Is used for the data amount of the (a),
for a matrix of Y rows and X columns, +.>Is a matrix of X rows and Y columns, s is the number of steps, u is any positive integer, and at +.>Wherein s and u are each less than or equal to Y-X, in +.>Wherein s and u are each less than or equal to X-Y, -/->Indicating +.>Otherwise, let(s)>M is the number of secret information paragraphs, y is less than or equal to m, y and m are positive integers, and if is a conditional function.
8. The secret sharing method of multiparty security computation according to claim 7, wherein obtaining the secret information if the decryption result is successful comprises:
and if the decryption result is that the decryption is successful, the ith computer sends the password of the appointed computer corresponding to the decryption security score to the computer which is successful in decryption, and the encrypted secret information of the appointed computer corresponding to the decryption security score is decrypted, so that the secret information is obtained.
9. A secret sharing system for secure computation of multiple parties, comprising:
The serial number module is used for determining the serial number of the appointed computer in the computing cluster when the ith computer in the computing cluster appoints the computer shared secret information to the computing cluster, wherein i is less than or equal to N, N is the total number of the computers in the computing cluster, and i and N are both positive integers;
the secret information paragraph module is used for splitting the secret information according to the number of the appointed computers to obtain a plurality of secret information paragraphs, wherein the number of the secret information paragraphs is the same as the number of the appointed computers;
the paragraph password vector module is used for obtaining the paragraph password vector of each secret information paragraph according to the number of the appointed computers, the serial numbers of the appointed computers and preset passwords set for the secret information paragraphs, wherein the number of digits of the preset passwords is the same as the number of the secret information paragraphs;
the password matrix module is used for obtaining a password matrix according to the paragraph password vector of each secret information paragraph;
the password module is used for obtaining the password of each appointed computer according to the password matrix;
the encryption module is used for encrypting the secret information through the password of each appointed computer to obtain encrypted secret information corresponding to each appointed computer;
The broadcasting module is used for broadcasting the encrypted secret information corresponding to each appointed computer in the bus of the computing cluster and sending the preset password to the appointed computer;
the decryption module is used for acquiring the preset passwords and the encrypted secret information corresponding to each appointed computer by the computers in the computing cluster, and decrypting the encrypted secret information corresponding to each appointed computer according to the serial numbers of the computers and the preset passwords to obtain a decryption result;
the result module is used for obtaining the secret information under the condition that the decryption result is that the decryption is successful;
obtaining a paragraph password vector of each secret information paragraph according to the number of the specified computers, the serial numbers of the specified computers and preset passwords set for the secret information paragraphs, wherein the paragraph password vector comprises the following components:
according to the formula
Obtaining a paragraph cipher vector for a kth secret information paragraphWherein->Designating the serial number of the computer for 1 st, +.>Designating the serial number of the computer for 2 nd, +.>Designating the serial number of the computer for the mth, < >>And m is the number of the secret information paragraphs, k is less than or equal to m, and k and m are positive integers.
CN202410014353.0A 2024-01-05 2024-01-05 Secret sharing method and system for multiparty secure computation Active CN117527447B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202410014353.0A CN117527447B (en) 2024-01-05 2024-01-05 Secret sharing method and system for multiparty secure computation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202410014353.0A CN117527447B (en) 2024-01-05 2024-01-05 Secret sharing method and system for multiparty secure computation

Publications (2)

Publication Number Publication Date
CN117527447A true CN117527447A (en) 2024-02-06
CN117527447B CN117527447B (en) 2024-03-22

Family

ID=89757043

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202410014353.0A Active CN117527447B (en) 2024-01-05 2024-01-05 Secret sharing method and system for multiparty secure computation

Country Status (1)

Country Link
CN (1) CN117527447B (en)

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120260086A1 (en) * 2011-04-05 2012-10-11 Haggerty David T Apparatus and methods for distributing and storing electronic access clients
CN109547797A (en) * 2019-01-02 2019-03-29 太原科技大学 A kind of separable encrypted domain information concealing method
US20200036707A1 (en) * 2015-08-21 2020-01-30 Veridium Ip Limited System and method for biometric protocol standards
CN113939817A (en) * 2019-06-10 2022-01-14 微软技术许可有限责任公司 Pattern matching for authentication using random noise symbols and pattern recognition
CN113994329A (en) * 2019-06-10 2022-01-28 微软技术许可有限责任公司 User interface for authentication using random noise symbols
CN114185993A (en) * 2021-12-21 2022-03-15 北京理工大学 Auditable data sharing method based on block chain
CN114548418A (en) * 2021-12-30 2022-05-27 天翼电子商务有限公司 Secret sharing-based transverse federal IV algorithm
CN116187433A (en) * 2023-04-28 2023-05-30 蓝象智联(杭州)科技有限公司 Federal quasi-newton training method and device based on secret sharing and storage medium
WO2023196016A1 (en) * 2022-04-08 2023-10-12 Google Llc Secure computation using multi-party computation and a trusted execution environment

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20120260086A1 (en) * 2011-04-05 2012-10-11 Haggerty David T Apparatus and methods for distributing and storing electronic access clients
US20200036707A1 (en) * 2015-08-21 2020-01-30 Veridium Ip Limited System and method for biometric protocol standards
CN109547797A (en) * 2019-01-02 2019-03-29 太原科技大学 A kind of separable encrypted domain information concealing method
CN113939817A (en) * 2019-06-10 2022-01-14 微软技术许可有限责任公司 Pattern matching for authentication using random noise symbols and pattern recognition
CN113994329A (en) * 2019-06-10 2022-01-28 微软技术许可有限责任公司 User interface for authentication using random noise symbols
CN114185993A (en) * 2021-12-21 2022-03-15 北京理工大学 Auditable data sharing method based on block chain
CN114548418A (en) * 2021-12-30 2022-05-27 天翼电子商务有限公司 Secret sharing-based transverse federal IV algorithm
WO2023196016A1 (en) * 2022-04-08 2023-10-12 Google Llc Secure computation using multi-party computation and a trusted execution environment
CN116187433A (en) * 2023-04-28 2023-05-30 蓝象智联(杭州)科技有限公司 Federal quasi-newton training method and device based on secret sharing and storage medium

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
张建勋;张翠军;田俊峰;蔡红云;: "集群存储系统数据安全研究", 计算机应用研究, no. 09, 15 September 2007 (2007-09-15) *
张智辉, 隋爱芬, 杨义先: "TETRA与GSM系统安全机制的研究与比较", 计算机应用研究, no. 12, 28 December 2005 (2005-12-28) *

Also Published As

Publication number Publication date
CN117527447B (en) 2024-03-22

Similar Documents

Publication Publication Date Title
CN108476198B (en) Method and system for executing computer program
Rohith et al. Image encryption and decryption using chaotic key sequence generated by sequence of logistic map and sequence of states of Linear Feedback Shift Register
CN115688167B (en) Method, device and system for inquiring trace and storage medium
EP1576763B1 (en) Secret sharing scheme using exclusive or calculation
CN109800585B (en) Image interpolation space completely reversible separable ciphertext domain information hiding algorithm
CN115276947B (en) Private data processing method, device, system and storage medium
EP2742644B1 (en) Encryption and decryption method
Basit et al. Multi-stage multi-secret sharing scheme for hierarchical access structure
CN114465708B (en) Privacy data processing method, device, system, electronic equipment and storage medium
Randall et al. Privacy preserving record linkage using homomorphic encryption
CN116561787A (en) Training method and device for visual image classification model and electronic equipment
Moon et al. An Efficient Encrypted Floating‐Point Representation Using HEAAN and TFHE
Tarigan Use of Electronic Code Book (Ecb) Algorithm in File Security
CN104050617A (en) Method for image encryption based on Liu chaotic system
CN111526000B (en) Parallel part homomorphic encryption method and system based on confusion model projection
EP2286610B1 (en) Techniques for peforming symmetric cryptography
CN112989394A (en) Vector geographic data encryption and decryption method and system
CN117527447B (en) Secret sharing method and system for multiparty secure computation
CN109559269B (en) Image encryption method and terminal
CN109902498B (en) Data encryption method, data decryption method, and corresponding devices and equipment
CN116861477A (en) Data processing method, system, terminal and storage medium based on privacy protection
CN109409111B (en) Encrypted image-oriented fuzzy search method
CN114172631B (en) Sorting method and system based on secret sharing
Charalampidis et al. A novel piecewise chaotic map for image encryption
CN114765529A (en) Homomorphic encryption storage method and device for distributed data, electronic equipment and computer readable medium

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