CN111628862B - Multi-party participated random number generation method and device - Google Patents
Multi-party participated random number generation method and device Download PDFInfo
- Publication number
- CN111628862B CN111628862B CN202010439033.1A CN202010439033A CN111628862B CN 111628862 B CN111628862 B CN 111628862B CN 202010439033 A CN202010439033 A CN 202010439033A CN 111628862 B CN111628862 B CN 111628862B
- Authority
- CN
- China
- Prior art keywords
- random number
- private key
- initiator
- participant
- seed
- 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.)
- Active
Links
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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the specification relates to a method and a device for generating random numbers with multiparty participation, which are applied to a alliance chain system. By utilizing the characteristic that a central organization can exist in a scene of the alliance chain, the concept of a random number initiator is introduced, and the random number participant only needs to send one transaction on the chain, so that the step of random number generation is simplified, and the problem that the random number participant misses participation in random number generation due to complicated steps is reduced. The technical scheme of the invention also comprises that the random number initiator provides a random number, so that the situation that the random number generation fails due to the fact that no person participates in the random number under the limit condition is avoided, and the robustness of the random number generation system is improved.
Description
Technical Field
The embodiment of the specification relates to the technical field of networks, in particular to a method and a device for generating random numbers by multiple parties.
Background
Blockchains have a great dependence on random numbers, and even the randomness of random numbers in public chains with PBFT, poS and the like as consensus algorithms directly relates to the decentralization and fairness characteristics of the system. Not only does the blockchain bulk itself require random numbers, but the types of Dapp that blockchain-based virtual machines work on are also highly dependent on random numbers. However, the random number of Dapp often selects a certain high Hash or a Hash of a certain transaction or performs deterministic pseudo-random operation on the above data, which must lead to the randomness of the random number being controlled by a miner with uncertainty.
In order to avoid the occurrence of Randao, a random number generation method relying on participants is proposed, but in the actual operation, multiple rounds of participation of the participants are required. While the participants are likely to provide seed hashing at round 2, giving up providing seeds at round 3 also compromises the randomness of the generation of random numbers.
Disclosure of Invention
The embodiment of the specification provides a method and a device for generating random numbers with multiparty participation, which are used for solving the problem that random characteristics are reduced due to the fact that participants abandon participation in random number generation in the midway in the prior art.
In order to solve the above technical problems, the embodiment of the present specification adopts the following technical solutions:
in a first aspect, a method for generating a random number with multiple participation is provided, and the method is applied to a coalition chain system, and comprises the following steps:
the random number initiator generates a root private key of the random number;
the random number initiating direction distributes the root private key to the random number participants, so that each random number participant obtains respective additional parameters and a distributed private key;
the random number participant obtains a public key corresponding to the dispatch private key through a public-private key algorithm;
the random number participants generate participant random number seeds, encryption is carried out by utilizing a public key corresponding to the dispatch private key, and the encrypted information and the corresponding additional parameters are stored in a uplink manner through an intelligent contract;
the random number initiator obtains additional parameters and corresponding encryption information of a random number participant from a chain, and reproduces a corresponding dispatching private key according to the additional parameters and a root private key, and decrypts the encryption information by utilizing the dispatching private key to obtain a random number seed of the participant;
accumulating the collected random number seeds of the participants to obtain final random number seeds;
a random number is generated based on the final random number seed.
In a second aspect, there is provided a multiparty participation random number generation apparatus for use in a federated chain system, the apparatus comprising:
root private key generation unit: a root private key for the random number initiator to generate a random number;
root private key dispatch unit: the root private key dispatch method comprises the steps that a root private key dispatch is conducted on random number participants in the random number initiating direction, so that each random number participant obtains respective additional parameters and a dispatch private key;
public key acquisition unit: the public key corresponding to the dispatch private key is obtained by the random number participant through a public-private key algorithm;
a first random number seed generation unit: the random number generation module is used for generating a random number seed of the party by the random number party, encrypting by utilizing a public key corresponding to the dispatch private key, and storing the encrypted information and the corresponding additional parameters in a uplink manner through an intelligent contract;
a random number unit is disclosed: the random number initiator is used for obtaining additional parameters and corresponding encryption information of a random number participant from a chain, reproducing a corresponding dispatch private key according to the additional parameters and a root private key, and decrypting the encryption information by utilizing the dispatch private key to obtain a random number seed of the participant;
and an accumulation unit: the method comprises the steps of accumulating collected random number seeds of the participants to obtain final random number seeds;
a random number determination unit: for generating a random number based on the final random number seed.
The above-mentioned at least one technical scheme that this description embodiment adopted can reach following beneficial effect: the random number generated in the public chain exposes a large number of defects, namely, in order to ensure that the decentralised random number is generated in the public chain environment, in the alliance chain scene, the central organization can exist, so that the invention utilizes the characteristic, introduces the concept of a random number initiator, and the random number participant only needs to send one transaction on the chain, thereby simplifying the step of random number generation and reducing the step of the random number participant, which is complicated, to miss participating in random number generation. The technical scheme of the invention also comprises that the random number initiator provides a random number, so that the situation that the random number generation fails due to the fact that no person participates in the random number under the limit condition is avoided, and the robustness of the random number generation system is improved.
Drawings
In order to more clearly illustrate the embodiments of the present description or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described below, it being obvious that the drawings in the following description are only some of the embodiments described in the embodiments of the present description, and that other drawings may be obtained according to these drawings without inventive effort to a person skilled in the art.
Fig. 1 is a schematic step diagram of a method for generating a random number with multiple parties involved in an embodiment of the present disclosure;
fig. 2 is a schematic structural diagram of a multiparty random number generating device according to an embodiment of the present disclosure.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present specification more apparent, the technical solutions of the embodiments of the present specification will be clearly and completely described below in connection with the specific embodiments of the present specification and the corresponding drawings. It will be apparent that the described embodiments are only some, but not all, of the embodiments of the present specification. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the embodiments herein, are intended to be within the scope of the embodiments herein.
The following describes in detail the technical solutions provided by the embodiments of the present specification with reference to the accompanying drawings.
Example 1
Referring to fig. 1, a schematic step diagram of a method for generating a random number with multiple participation provided in an embodiment of the present disclosure is applied to a federated chain system, where the method may include the following steps:
step 101: root private key Priv for generating random number by random number initiator Root ；
Step 102: the random number initiating direction distributes a root private key to random number participants, so that each random number participant obtains respective additional parameters Param-i and a distributed private key Priv-i;
it should be noted that: where Param-i represents an additional parameter corresponding to a random number party i (i=1, 2,3 … … N) (N is the number of random number parties), and Priv-i represents a dispatch private key corresponding to a random number party i (i=1, 2,3 … … N), similar to the following.
Step 103: the random number participant obtains a public key Pub-i corresponding to the distributing private key Priv-i through a public-private key algorithm;
step 104: the random number party generates a party random number seed S i Encrypting by utilizing the public key Pub-i corresponding to the dispatching private key Priv-i, and storing the encryption information and the corresponding additional parameter Param-i in a uplink manner through an intelligent contract;
step 105: the random number initiator obtains the additional parameter Param-i of the random number participant and the corresponding encryption information from the chain, and according to the additional parameter Param-i and the root private key Priv Root Reproducing the corresponding distribution private key Priv-i decrypting the encrypted information using the distribution private key Priv-i to obtain the party random number seed S i ；
Step 106: seed S for collected random numbers of participants i Accumulating to obtain the final random number seed S final The method comprises the steps of carrying out a first treatment on the surface of the I.e.
Step 107: based on final random number seed S final A random number is generated.
It should be noted that: root private key Priv Root Representing an initial private key, which is not distributed by any private key, which may be generated by encryption hardware; participant random number seed S i Representing a random number factor, the seed generation may be generated by encryption hardware.
Optionally, the step 102 may further include the steps of:
generating an additional parameter Param-i corresponding to each random number participant i; additional parameter Param-i is in the root private key Priv Root As an index parameter during dispatch, the definition may be a regular sequence (eg 0,1,2,3,4, …) or may be determined in other identifiable ways.
For the root private key Priv Root And adding the additional parameter Param-i, and performing hash operation to obtain a distributing private key Priv-i corresponding to the random number participant.
It should be noted that, each random number participant receives the additional parameter Param-i and the dispatch private key Priv-i corresponding to itself, and also receives the address of the smart contract for generating the random number sent by the random number initiator, and the ending block for generating the current random number is high.
In addition, in step 104, the encrypted information and the corresponding additional parameter Param-i are stored in a manner of K-V key value pair by intelligent contract, wherein key is the additional parameter Param-i and value is the corresponding encrypted information
While in step 105, the random number generator is pre-configuredFirstly setting the ending block height for generating the current random number, obtaining an additional parameter Param-i of a random number party from a chain, obtaining corresponding encryption information through K-V inquiry, and then according to the additional parameter and a root private key Priv Root Reproducing a corresponding distributing private key Priv-i, and decrypting the encrypted information by using the distributing private key Priv-i to obtain the random number seed S of the party i 。
Optionally, the method may further include:
the random number initiator generates an initiator random number seed S R ；
Seed S for collected random numbers of participants i Seed S with the initiator random number R Accumulating to obtain the final random number seed S final I.e.
Since in practical application, some unavoidable participants cannot effectively participate in the generation of random numbers, the practical participant random number seed S i Can not be fully collected, and when an extreme situation occurs and no one participates in random number generation, the initiator random number seed S can be used for R As the most random number seed S final The robustness of the random number generation system is improved.
Optionally, the method may further comprise the steps of:
the random number initiator generates an initiator random number seed S R Then, carrying out hash processing and then carrying out on-chain storage; this operation may pre-lock an initiator random number seed, after which the random number initiator cannot replace the seed when the random number seed is revealed.
Before proceeding to step 105, the following contract checking step is further performed:
transmitting the initiator random number seed S by a random number initiation direction intelligent contract R Comparing whether the hash value of the initiator random number seed is consistent with the hash value of the initiator random number seed stored on the chain;if the random numbers are consistent, continuing the next step, and if the random numbers are inconsistent, ending the generation of the random numbers.
Optionally, the number of the random number participants is at least 3, namely N is more than or equal to 3
According to the technical scheme of the specification, the concept of a random number initiator is introduced by utilizing the characteristic that a central organization can exist in a scene of a alliance chain, and a random number participant only needs to send one transaction on the chain, so that the step of random number generation is simplified, and the problem that the random number participant misses participation in random number generation due to complicated steps is reduced. The technical scheme of the invention also comprises that the random number initiator provides a random number, so that the situation that the random number generation fails due to the fact that no person participates in the random number under the limit condition is avoided, and the robustness of the random number generation system is improved.
Example two
Referring to fig. 2, a schematic structural diagram of a multiparty random number generating device for participation in a federated chain system according to an embodiment of the present disclosure is provided, where the device mainly includes:
root private key generation unit 201: root private key Priv for random number initiator to generate random number Root ；
Root private key dispatch unit 202: the root private key dispatch is carried out on the random number participants in the random number initiating direction, so that each random number participant obtains respective additional parameters Param-i and a dispatch private key Priv-i;
it should be noted that: where Param-i represents an additional parameter corresponding to a random number party i (i=1, 2,3 … … N) (N is the number of random number parties), and Priv-i represents a dispatch private key corresponding to a random number party i (i=1, 2,3 … … N), similar to the following.
Public key acquisition unit 203: the public key Pub-i corresponding to the distributing private key Priv-i is obtained by the random number participant through a public-private key algorithm;
the first random number seed generation unit 204: for the random number party to generate a party random number seed S i Encrypting by using the public key Pub-i corresponding to the distributing private key Priv-i, and intelligently combining the encryption information and the corresponding additional parameter Param-iAbout performing uplink storage;
the random number unit 205 is disclosed: the random number initiator obtains additional parameter Param-i and corresponding encryption information of the random number participant from the chain, and the random number initiator generates a root private key Priv according to the additional parameter Param-i and the root private key Priv Root Reproducing a corresponding distributing private key Priv-i, and decrypting the encrypted information by using the distributing private key Priv-i to obtain the random number seed S of the party i ；
Accumulation unit 206: for seeding the collected party random numbers S i Accumulating to obtain the final random number seed S final I.e.
Random number determination unit 207: for seed S based on final random numbers final A random number is generated.
It should be noted that: root private key Priv Root Representing an initial private key, which is not distributed by any private key, which may be generated by encryption hardware; participant random number seed S i Representing a random number factor, the seed generation may be generated by encryption hardware.
Optionally, the root private key dispatch unit 202 may further include:
accessory parameter generation unit 202-1: for generating an additional parameter Param-i corresponding to each of said random number participants i; additional parameter Param-i is in the root private key Priv Root As an index parameter during dispatch, the definition may be a regular sequence (eg 0,1,2,3,4, …) or may be determined in other identifiable ways.
Hash operation section 202-2: for the root private key Priv Root And adding the additional parameter Param-i, and performing hash operation to obtain a distributing private key Priv-i corresponding to the random number participant.
It should be noted that, each random number participant receives the additional parameter Param-i and the dispatch private key Priv-i corresponding to itself, and also receives the address of the smart contract for generating the random number sent by the random number initiator, and the ending block for generating the current random number is high.
In addition, in the first random number seed generating unit 204, the encryption information and the corresponding additional parameter Param-i are stored in a uplink manner through an intelligent contract, wherein the storage mode can be in the form of a K-V key value pair, and the key is the additional parameter Param-i and the value is the corresponding encryption information
In the disclosure random number unit 205, the random number initiator obtains the additional parameter Param-i of the random number participant from the chain at the preset end block height for generating the current random number, obtains the corresponding encryption information through K-V query, and then generates the root private key Priv according to the additional parameter Root Reproducing a corresponding distributing private key Priv-i, and decrypting the encrypted information by using the distributing private key Priv-i to obtain the random number seed S of the party i 。
Optionally, the apparatus may further include:
the second random number seed generation unit 208: for the random number initiator to generate an initiator random number seed S R ；
The accumulation unit 206 seeds S the collected random numbers of the participants i Seed S with the initiator random number R Accumulating to obtain the final random number seed S final I.e.
Since in practical application, some unavoidable participants cannot effectively participate in the generation of random numbers, the practical participant random number seed S i Can not be fully collected, and when an extreme situation occurs and no one participates in random number generation, the initiator random number seed S can be used for R As the most random number seed S final The robustness of the random number generation system is improved.
Optionally, the apparatus may further include:
random number seed uplink memory unit 209: for the random number initiator to generate an initiator random number seed S R After that, it is hashedPerforming on-chain storage after the processing; this operation may pre-lock an initiator random number seed, after which the random number initiator cannot replace the seed when the random number seed is revealed.
Contract checking unit 210: the random number initiator is used for transmitting the random number seed S of the initiator by the intelligent contract before the random number initiator obtains additional parameters and corresponding encryption information of the random number participant from a chain, a corresponding dispatch private key is reproduced according to the additional parameters and the root private key, and the encryption information is decrypted by utilizing the dispatch private key to obtain the random number seed of the participant R Comparing whether the hash value of the initiator random number seed is consistent with the hash value of the initiator random number seed stored on the chain; if the random numbers are consistent, continuing the next step, and if the random numbers are inconsistent, ending the generation of the random numbers.
Optionally, the number of the random number participants is at least 3, namely N is more than or equal to 3
According to the technical scheme of the specification, the concept of a random number initiator is introduced by utilizing the characteristic that a central organization can exist in a scene of a alliance chain, and a random number participant only needs to send one transaction on the chain, so that the step of random number generation is simplified, and the problem that the random number participant misses participation in random number generation due to complicated steps is reduced. The technical scheme of the invention also comprises that the random number initiator provides a random number, so that the situation that the random number generation fails due to the fact that no person participates in the random number under the limit condition is avoided, and the robustness of the random number generation system is improved.
It should be understood that the multiparty random number generation device described in the second embodiment may execute all the technical schemes involved in the multiparty random number generation method in the form of the functional module, and achieve the corresponding technical effects, which are not described herein.
In summary, the foregoing description is only a preferred embodiment of the present invention and is not intended to limit the scope of the present invention. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present specification should be included in the protection scope of the present specification.
The systems, devices, modules, or units illustrated in one or more of the embodiments described above may be implemented in particular by a computer chip or entity, or by a product having some function. One typical implementation is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
It should also be noted that the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article or apparatus that comprises the element.
In this specification, each embodiment is described in a progressive manner, and identical and similar parts of each embodiment are all referred to each other, and each embodiment mainly describes differences from other embodiments. In particular, for system embodiments, since they are substantially similar to method embodiments, the description is relatively simple, as relevant to see a section of the description of method embodiments.
The foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
Claims (6)
1. A method of generating random numbers for multiple parties to participate in a federated chain system, the method comprising:
the random number initiator generates a root private key of the random number;
the random number initiator generates additional parameters corresponding to each random number participant, hash operation is carried out after the additional parameters are added to the root private key, a dispatch private key corresponding to the random number participant is obtained, and root private key dispatch is carried out to the random number participants, so that each random number participant obtains the respective additional parameters and the dispatch private key, and the additional parameters are used as index parameters in the root private key dispatch process;
the random number participant obtains a public key corresponding to the dispatch private key through a public-private key algorithm;
the random number participants generate participant random number seeds, encryption is carried out by utilizing a public key corresponding to the dispatch private key, and the encrypted information and the corresponding additional parameters are stored in a uplink manner through an intelligent contract;
the random number initiator obtains additional parameters and corresponding encryption information of a random number participant from a chain, and reproduces a corresponding dispatching private key according to the additional parameters and a root private key, and decrypts the encryption information by utilizing the dispatching private key to obtain a random number seed of the participant;
the random number initiator generates an initiator random number seed; accumulating the collected random number seeds of the participants and the random number seeds of the initiator to obtain final random number seeds;
a random number is generated based on the final random number seed.
2. The method of claim 1, further comprising:
after the random number initiator generates an initiator random number seed, carrying out hash processing on the initiator random number seed and then carrying out on-chain storage;
the random number initiator obtains additional parameters and corresponding encryption information of a random number participant from a chain, and before reproducing a corresponding dispatch private key according to the additional parameters and a root private key and decrypting the encryption information by utilizing the dispatch private key to obtain the random number seed of the participant, the random number initiator further comprises:
the random number initiating direction intelligent contract sends the hash value of the initiator random number seed, and whether the hash value of the initiator random number seed is consistent with the hash value of the initiator random number seed stored on the chain or not is compared; if the random numbers are consistent, continuing the next step, and if the random numbers are inconsistent, ending the generation of the random numbers.
3. The method of claim 1, wherein the number of random number participants is at least 3.
4. A multiparty participation random number generation apparatus for use in a federated chain system, the apparatus comprising:
root private key generation unit: a root private key for the random number initiator to generate a random number;
root private key dispatch unit: the method comprises the steps that the random number initiator is used for generating additional parameters corresponding to each random number participant, carrying out hash operation after adding the additional parameters to the root private key to obtain a dispatch private key corresponding to the random number participant, and carrying out root private key dispatch to the random number participants to enable each random number participant to obtain the respective additional parameters and the dispatch private key, wherein the additional parameters are used as index parameters in the root private key dispatch process;
public key acquisition unit: the public key corresponding to the dispatch private key is obtained by the random number participant through a public-private key algorithm;
a first random number seed generation unit: the random number generation module is used for generating a random number seed of the party by the random number party, encrypting by utilizing a public key corresponding to the dispatch private key, and storing the encrypted information and the corresponding additional parameters in a uplink manner through an intelligent contract;
a random number unit is disclosed: the random number initiator is used for obtaining additional parameters and corresponding encryption information of a random number participant from a chain, reproducing a corresponding dispatch private key according to the additional parameters and a root private key, and decrypting the encryption information by utilizing the dispatch private key to obtain a random number seed of the participant;
a second random number seed generation unit: the random number seed is used for generating an initiator random number seed by the random number initiator;
and an accumulation unit: the method comprises the steps of accumulating collected random number seeds of a participant with the random number seeds of an initiator to obtain final random number seeds;
a random number determination unit: for generating a random number based on the final random number seed.
5. The apparatus of claim 4, further comprising:
random number seed uplink storage unit: after the random number initiator generates an initiator random number seed, carrying out hash processing on the initiator random number seed and then carrying out on-chain storage;
contract checking unit: the random number initiating direction intelligent contract is used for acquiring additional parameters and corresponding encryption information of a random number participant from a chain, and comparing whether the hash value of the random number participant is consistent with the hash value of the random number participant stored in the chain or not before the random number participant obtains the random number participant by decrypting the encryption information by utilizing the dispatch private key according to the additional parameters and the root private key; if the random numbers are consistent, continuing the next step, and if the random numbers are inconsistent, ending the generation of the random numbers.
6. The apparatus of claim 4, wherein the number of random number participants is at least 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010439033.1A CN111628862B (en) | 2020-05-22 | 2020-05-22 | Multi-party participated random number generation method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010439033.1A CN111628862B (en) | 2020-05-22 | 2020-05-22 | Multi-party participated random number generation method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111628862A CN111628862A (en) | 2020-09-04 |
| CN111628862B true CN111628862B (en) | 2023-09-12 |
Family
ID=72272701
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010439033.1A Active CN111628862B (en) | 2020-05-22 | 2020-05-22 | Multi-party participated random number generation method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111628862B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113935737B (en) * | 2021-12-15 | 2022-10-25 | 支付宝(杭州)信息技术有限公司 | Random number generation method and device based on block chain |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110365479A (en) * | 2019-07-11 | 2019-10-22 | 湖南天河国云科技有限公司 | Random digit generation method and device based on block chain |
-
2020
- 2020-05-22 CN CN202010439033.1A patent/CN111628862B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111628862A (en) | 2020-09-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109255247B (en) | Multi-party security calculation method and device and electronic equipment | |
| CN106549770B (en) | SM2 digital signature generation method and system | |
| US8638926B2 (en) | Sharing a secret with modular inverses | |
| WO2019088979A1 (en) | Multi-party threshold authenticated encryption | |
| CN107086907A (en) | Key synchronization, encapsulation transmission method and device for quantum key distribution process | |
| WO2012172080A4 (en) | Generation of cryptographic keys | |
| TWI704793B (en) | Object sharing system and object sharing method | |
| CN109768863A (en) | A kind of block chain key based on elliptic curve is shared and dynamic updating method | |
| CN106850198A (en) | SM2 digital signature generation method and system based on the collaboration of many devices | |
| CN106712942B (en) | SM2 digital signature generation method and system based on privacy sharing | |
| CN108055128B (en) | RSA key generation method, RSA key generation device, storage medium and computer equipment | |
| CN113179158B (en) | Multi-party combined data processing method and device for controlling bandwidth | |
| Takahashi et al. | Secret sharing scheme suitable for cloud computing | |
| CN106850229A (en) | SM2 digital signature generation method and system based on the secret segmentation of product | |
| CN111628862B (en) | Multi-party participated random number generation method and device | |
| CN100583754C (en) | Pseudo-random number generation method | |
| CN112199697A (en) | Information processing method, device, equipment and medium based on shared root key | |
| CN114021198B (en) | Method and device for determining common data for protecting data privacy | |
| CN105868987B (en) | A kind of method and system of shared information between devices | |
| Muth et al. | Smartdhx: Diffie-hellman key exchange with smart contracts | |
| CN114329533A (en) | Secure multiparty computing method and related device | |
| CN112860790B (en) | Data management method, system and device | |
| CN116010401A (en) | Information hiding trace query method and system based on block chain and careless transmission expansion | |
| CN116248359A (en) | Data transmission system, method and device based on careless transmission protocol | |
| CN113312604B (en) | Distributed secret image sharing method with public reconstruction based on blockchain authentication |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: Room 2339, 2nd Floor, No. 92, Huancheng North Road, Gongshu District, Hangzhou City, Zhejiang Province 310005 Applicant after: Hangzhou Xita Technology Co.,Ltd. Address before: 310000 No. 1001, floor 10, tower a, Huaxing Times Square, No. 478, Wensan Road, Xihu District, Hangzhou, Zhejiang Province Applicant before: Hangzhou Xita Technology Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |