WO2021137391A1 - Procédé de génération de chaîne de blocs utilisant un partage de secret - Google Patents

Procédé de génération de chaîne de blocs utilisant un partage de secret Download PDF

Info

Publication number
WO2021137391A1
WO2021137391A1 PCT/KR2020/012719 KR2020012719W WO2021137391A1 WO 2021137391 A1 WO2021137391 A1 WO 2021137391A1 KR 2020012719 W KR2020012719 W KR 2020012719W WO 2021137391 A1 WO2021137391 A1 WO 2021137391A1
Authority
WO
WIPO (PCT)
Prior art keywords
secret
identifier
block chain
participants
value
Prior art date
Application number
PCT/KR2020/012719
Other languages
English (en)
Korean (ko)
Inventor
신상호
유수빈
박윤하
김대수
전재현
김지성
조정화
손애선
Original Assignee
재단법인 경주스마트미디어센터
주식회사 우경정보기술
주식회사 엘토브
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 재단법인 경주스마트미디어센터, 주식회사 우경정보기술, 주식회사 엘토브 filed Critical 재단법인 경주스마트미디어센터
Publication of WO2021137391A1 publication Critical patent/WO2021137391A1/fr

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords

Definitions

  • the present invention relates to a method of creating a block chain using secret sharing in a multi-participant environment.
  • block chain As a data storage technology in a distributed ledger environment, block chain provides high transparency and reliability to users in terms of data management because it is impossible to forge or falsify data stored in a specific block using a hash function. Since the connected blocks are distributed and stored, there is no need for a central administrator, and the maintenance cost for safe data storage and management is relatively low.
  • the existing block chain creation method is performed through widely known cryptographic techniques and distributed consensus.
  • the encryption technique mainly uses a cryptographic hash function in which a secret key exists or a public key infrastructure (PKI).
  • PKI public key infrastructure
  • PKI mainly uses digital signature and public key cryptographic algorithms such as DSA, RSA, ECC, or EC-DSA.
  • DSA digital signature and public key cryptographic algorithms
  • RSA public key cryptographic algorithms
  • ECC electronic circuitry
  • EC-DSA public key cryptographic algorithms
  • the speed and the amount of computation are increasing exponentially. If the capacity of the data stored in the block increases, the time and amount of computation required for the operation increase accordingly, and as a result, separate software or hardware must be newly developed and constructed in the related field, thereby increasing the cost to solve this problem. will do
  • ECC there is a disadvantage that it cannot be used for storing nodes in the block chain right away because it has only recently entered the commercialization stage and checked various safety.
  • the existing block chain node creation technique can check the data stored in the block chain by using the participant's private key. However, if a participant loses the secret key or is attacked by a malicious attacker, sensitive information stored in the block chain node may be exposed as it is. Moreover, if the stored data in the block chain is a secret, managing it fundamentally depending on the secret key has a problem in that the cost of construction and maintenance in terms of the system increases.
  • the present invention provides a method of creating a block chain using secret sharing, which has no restrictions on participants using secret sharing, does not require management of a private key (or public key) for each participant, and can reduce block chain creation time and computational amount aim to do
  • the number of participants (n) related to the block data to be stored in the block chain, the identifiers of the participants (P i , 1 ⁇ i ⁇ n), and the irreducible polynomial (f() x)) a pre-processing step to set;
  • the identifier (P i ) is input into the reduced polynomial (f(x) ) to generate a secret fragment value (f(P i )), and the identifier (P i ) and the secret fragment value (f(P i )) Distributing the ordered pair (P i , f(P i )) to the participants, respectively, and an additional identifier (P n+1 ) and an additional secret fragment value (f(P n+1 )) other than the identifiers of the participants. and a secret sharing step of storing the ordered pair (P n+1 , f(P n+1 )) in the node.
  • the ordered pair (P i , f(P i )) of the identifier (P i ) and the secret fragment value (f(P i )) is calculated using Lagrange information.
  • the method may further include a proof-of-work step of performing proof-of-work by comparing (f'(P n+1 )) with an additional secret fragment value f(P n+1 ) stored in the node.
  • the irreducible polynomial (f(x)) may be defined by the following equation (1).
  • t is the threshold
  • a j is the coefficient value inserted in bits after binarizing and parsing the original data as a part of the block data to be inserted into the block chain
  • mod is the remainder to obtain the remainder of arbitrary division.
  • GF is a polynomial belonging to Galois feild
  • k means the number of bits
  • the block chain generation method using secret sharing In the block chain generation method using secret sharing according to an embodiment of the present invention, at least a part of block data to be inserted into the block chain cannot be inserted as a coefficient value (a j ) in the irreducible polynomial (f(x)). In this case, by additionally setting another irreducible polynomial (g(x), h(x), ...), the above secret sharing step can be performed repeatedly until all transformed binary data are inserted as coefficient values. have.
  • the irreducible polynomial (f'(x)) may be defined by the following Equation (2).
  • the additional identifier (P n+1 ) is at least one of a nonce and a time stamp in the block chain system. It can be specified according to the operation policy of the blockchain system.
  • a threshold (t) for starting the proof-of-work step is set in the pre-processing step, and the threshold value (t) or more among n participants is collusion
  • proof-of-work can be performed by submitting the ordered pair (P i , f(P i )) of its identifier (P i ) and the secret fragment value (f(P i )) to the blockchain system.
  • the threshold value t may be set to a higher stake for a certain participant than other participants.
  • the present invention is a finite body coupled with a computing device, and input values are the number of participants (n) related to block data to be stored in the block chain, the identifiers of the participants (P i , 1 ⁇ i ⁇ n), and the identifiers of the participants.
  • the identifier (P i ) is input into the reduced polynomial (f(x) ) to generate a secret fragment value (f(P i )), and the identifier (P i ) and the secret fragment value (f(P i )) Distributing the ordered pair (P i , f(P i )) to the participants, respectively, and an additional identifier (P n+1 ) and an additional secret fragment value (f(P n+1 )) other than the identifiers of the participants.
  • the additional secret fragment value (f'(P n+1 )) generated by inputting the additional identifier (P n+1 ) to the derived irreducible polynomial (f'(x)) and the additional secret fragment stored in the node
  • it may be implemented as a computer program stored in a computer-readable recording medium.
  • the time required and the amount of computation increase in proportion to the number of participants, but in the block chain generation method using secret sharing according to the embodiment of the present invention, According to the report, using secret sharing and finite-body operation, the required time and amount of computation are constant regardless of the number of participants, so it is very efficient when creating a block chain node in a multi-participant environment, It has an excellent effect. In addition, there is an effect that separate key management is not required.
  • FIG. 1 is a block diagram illustrating a block chain system according to an embodiment of the present invention.
  • FIG. 2 is a flowchart illustrating a block chain generation method using secret sharing according to an embodiment of the present invention.
  • FIG. 3 is a diagram for explaining a process in which coefficient values a j of the irreducible polynomial (f(x)) are generated from original data in the step of performing secret sharing according to an embodiment of the present invention.
  • FIG. 4 is an identifier (P i ) of the identifier (P i ) and the secret fragment value (f(P i )) by inputting the identifier (P i ) into the irreducible polynomial (f(x)) in the step of performing secret sharing according to an embodiment of the present invention; It is a diagram for explaining the process of distributing the ordered pairs (P i , f(P i )) to the participants, respectively.
  • FIG. 5 is a diagram for explaining a work proof step according to an embodiment of the present invention.
  • FIG. 6 is a diagram illustrating a computing device according to an embodiment of the present invention.
  • FIG. 1 is a block diagram showing a block chain system.
  • the block chain system may be a decentralized network 100 system composed of a plurality of nodes 200 .
  • the nodes 200 constituting the decentralized network 100 may be electronic devices having an arithmetic function, a communication function, a storage function, etc., such as a computer, a server, and a mobile terminal.
  • the decentralized network 100 can store and refer to information commonly known to all participating nodes in a connected bundle of blocks called a block chain.
  • the plurality of nodes 200 can communicate with each other and can be divided into a full node that stores, manages, and propagates the block chain and a light node that can simply participate in transactions.
  • Each block connected to the block chain contains block data to be stored in the block chain.
  • the block data may be transaction details within a certain period, that is, a transaction.
  • the nodes 200 manage transactions by creating, storing, or verifying a block chain according to their respective roles.
  • a transaction may represent various types of transactions.
  • a transaction may correspond to a financial transaction for indicating the ownership status of virtual currency and its change.
  • the transaction may correspond to a physical transaction for indicating the ownership status of the object and its change.
  • a transaction may be a work jointly created by a plurality of participants.
  • FIG. 2 is a flowchart illustrating a block chain generation method using secret sharing according to an embodiment of the present invention.
  • the method for generating a block chain using secret sharing includes a pre-processing step (S100) and a secret sharing step (S200). ), a proof-of-work step (S300), and a block chain storage step (S400).
  • the above steps ( S100 to S400 ) may be performed by a computing device that performs an arithmetic function, which will be described later with reference to FIG. 6 .
  • the number of participants (n) related to the block data to be stored in the blockchain the identifiers of the participants (P i ⁇ P n ), the irreducible polynomial in the finite field (f(x)), and the proof of work Set a threshold value (t) for
  • “participant” may mean a participant terminal.
  • the block data is a joint work by a plurality of participants
  • the number of participants (n) who participated in the joint work is set.
  • a participant's unique identifier (P i ⁇ P n ) is set.
  • the identifiers P i to P n may be set to an arbitrary number.
  • the minimum number of participants required for work proof is set as the threshold value (t).
  • the threshold value t may be set to 5.
  • a particular participant may have a higher stake than another participant. That is, a general participant is counted as 1, while a specific participant may be counted as 2 or more.
  • a finite field is a field that has only a finite number of elements and forms an algebraic structure. It means a field in which the result of operation (addition, multiplication, etc.) of elements in a finite field set is again within the set.
  • An irreducible polynomial is a polynomial that cannot be factored any further.
  • the reduced polynomial (f(x)) on the finite field set in this step is, for example, the following equation (1).
  • t is a threshold value
  • mod is a remainder function that finds the remainder of an arbitrary division
  • GF is a polynomial belonging to Galois feild.
  • k means the number of bits, generally 8 or 16 is selected, and up to 64 can be selected depending on the amount of data to be stored in the block chain.
  • an identifier (P i ) is input into the reduced polynomial (f(x)) of Equation (1 ) to generate a secret fragment value (f(P i )), and an identifier (P i ) and its corresponding secret Secret sharing is performed by distributing ordered pairs (P i , f(P i )) of the fragment values (f(P i )) to the participants, respectively.
  • secret sharing means a state in which the secret fragment value f(P i ) is distributed to several participants, respectively.
  • the identifier (Pi) performs a function similar to a kind of public key
  • the secret fragment value (f(Pi)) performs a function similar to the private key (or private key).
  • the existing private key is exposed for various reasons, the corresponding block data may be hacked, but even if the secret fragment value f(Pi) of the present invention is exposed, since the secret is shared among the participants, Hacking is impossible and block data can be hacked only when t or more of the secret fragment value (f(P i )) are exposed.
  • the secret fragment value (f(P i )) is the threshold value of t t pieces. Since there is almost no case of abnormal exposure, the secret sharing method is superior to the existing public key or symmetric key in terms of safety.
  • the coefficient value of the polynomial a j (j is 0 ⁇ t-1) is a part of the block data to be inserted into the actual block chain.
  • the coefficient value a j insert into The predetermined unit may be, for example, 8 bits or 16 bits, and may be the k size of GF(2 k ) in Equation (1).
  • the original data can be obtained by summing all the coefficient values a j .
  • FIG. 3 is a diagram for explaining a process in which coefficient values a j of the irreducible polynomial (f(x)) are generated from original data in the step of performing secret sharing according to an embodiment of the present invention.
  • original data is converted into binary data by the computing device of the present invention.
  • the converted binary data is divided into a certain bit unit, and this is inserted as a coefficient value a j of the reduced polynomial (f(x)).
  • All the converted binary data is divided into a predetermined bit unit and inserted as a coefficient value a j of the reduced polynomial (f(x)). Therefore, if all coefficient values a j are summed, it can become binary data of the original data, and the original data can be extracted by transforming it again.
  • a secret piece value (f(P i )) is generated by inputting an identifier (P i ) consisting of a random number into the reduced polynomial (f(x)) of Equation (1).
  • identifier P i
  • f (P i ) the secret piece value generated as (f (P i)) to the input of identifiers (P i) and the pair with ordered pairs (P i, f (P i )), the ordered pairs (P i, f (P i )) is distributed to the participants (participant terminals) of the corresponding identifier (P i ).
  • the identifier (P i ) is input to the irreducible polynomial (f(x)) in this secret sharing step, and an ordered pair (P i , f( ) of the identifier (P i ) and the secret fragment value (f(P i )) The process of distributing P i )) to each participant is shown.
  • a secret fragment value (f(P n+1 )) to be temporarily stored in the blockchain node is additionally created.
  • the secret fragment value (f(P n+1 )) temporarily stored in the node is called the additional secret fragment value.
  • the additional secret piece value f(P n+1 ) is generated by inputting the additional identifier P n+1 into equation (1).
  • the additional identifier (P n+1 ) uses values such as nonce and time stamp within the block chain system and may be separately specified according to the operation policy of the block chain system.
  • the additional secret fragment value f(P n+1 ) is stored in the node for proof-of-work in the proof-of-work step to be described later.
  • This step is the process of verifying the data through proof of work of the additional secret fragment value (f(P n+1 )) temporarily stored in the blockchain node.
  • the proof-of-work step will be described with reference to FIG. 5 .
  • 5 is a diagram for explaining a work proof step according to an embodiment of the present invention.
  • Proof-of-work is a collusion of more than a threshold (t) among n participants, and an ordered pair (P i , f(P i )) of its own identifier (P i ) and secret fragment value (f(P i )) is created in the blockchain system. , and the blockchain system automatically initiates the proof-of-work process when more than the threshold of t people are colluded.
  • the process of proof-of-work is the same as the restoration process of shared secret, and is performed using Lagrange interpolation.
  • the interpolation method is a method of estimating the value of the interval using discrete data
  • the Lagrange interpolation method is a method of creating an nth-order polynomial with (n+1) coordinates.
  • x is the variable of the polynomial f'(x)
  • x o is the identifier (P o )
  • x j is the identifier (P j )
  • y j is the secret fragment value (f(P j ))
  • ⁇ is a function that means product.
  • the additional secret fragment value (f'(P n+1 )) by inputting the additional identifier (P n+1 ) stored in the node in step S200 into the reduced polynomial (f'(x)) derived through Equation (2) create Next, when the same, by comparing the added value of the newly generated secret piece (f '(P n + 1 )) and adding a secret piece of value (f (P n + 1) ) stored in the node exit the proof-of-work. (See Fig. 5B)
  • the binary data of the original data is created by summing all the coefficient values a j , and the original data can be extracted by transforming it again. (See Fig. 5C)
  • SHA-3 is a cryptographic hash function announced in August 2015 by the US National Institute of Standards and Technology to replace SHA-2.
  • the hash value of the node before the block chain to generate a block in the form of a chain In addition to the additional secret fragment value (f(P n+1 )) stored temporarily to generate as a hash value, the hash value of the node before the block chain to generate a block in the form of a chain, a Nonce (or time stamp), and other block chains
  • various values that are policy-specified within the blockchain system are designated as input to SHA-3. This completes the process of creating a new type of block chain using secret sharing.
  • step S200 is not completed with the coefficient values in one reduced polynomial (f(x)), another reduced polynomial (g(x), h( x), ...) are additionally set, and the secret sharing operation step (S200) is repeatedly performed until all the converted binary data are inserted as coefficient values.
  • step S200 is completed while additional secret fragment values g(P n+1 ), h(P n+1 ), ...) are stored in the node as many as the number of reduced polynomials.
  • the block chain generation method using secret sharing when using a hash function or PKI having a key to create an existing block chain, the time required and the amount of computation are proportional to the number of participants. Unlike this increase, using secret sharing and finite-body operation, the required time and amount of computation are constant regardless of the number of participants, so it is very efficient when creating a block chain node in a multi-participant environment, and space and It has an excellent effect in terms of time. In addition, there is an effect that separate key management is not required.
  • the computing device TN100 of FIG. 6 may be a computing device that performs operations S100 to S400 described above.
  • the computing device TN100 may include at least one processor TN110 , a transceiver device TN120 , and a memory TN130 .
  • the computing device TN100 may further include a storage device TN140 , an input interface device TN150 , an output interface device TN160 , and the like.
  • Components included in the computing device TN100 may be connected by a bus TN170 to communicate with each other.
  • the processor TN110 may execute a program command stored in at least one of the memory TN130 and the storage device TN140.
  • the processor TN110 may mean a central processing unit (CPU), a graphics processing unit (GPU), or a dedicated processor on which methods according to an embodiment of the present invention are performed.
  • the processor TN110 may be configured to implement procedures, functions, methods, and the like described in connection with an embodiment of the present invention.
  • the processor TN110 may control each component of the computing device TN100 .
  • Each of the memory TN130 and the storage device TN140 may store various information related to the operation of the processor TN110 .
  • Each of the memory TN130 and the storage device TN140 may be configured as at least one of a volatile storage medium and a non-volatile storage medium.
  • the memory TN130 may include at least one of a read only memory (ROM) and a random access memory (RAM).
  • the transceiver TN120 may transmit or receive a wired signal or a wireless signal.
  • the transceiver TN120 may be connected to a network to perform communication.
  • the present invention may be implemented as a computer program.
  • the present invention may be implemented as a computer program stored in a computer-readable recording medium in order to execute the block chain generation method using secret sharing according to the present invention in combination with hardware.
  • the methods according to the embodiment of the present invention may be implemented in the form of a program readable by various computer means and recorded in a computer readable recording medium.
  • the recording medium may include a program command, a data file, a data structure, etc. alone or in combination.
  • the program instructions recorded on the recording medium may be specially designed and configured for the present invention, or may be known and available to those skilled in the art of computer software.
  • the recording medium includes magnetic media such as hard disks, floppy disks and magnetic tapes, optical recording media such as CDROMs and DVDs, and magneto-optical media such as floppy disks. optical media), and hardware devices specially configured to store and execute program instructions, such as ROM, RAM, flash memory, and the like.
  • Examples of program instructions may include not only machine language such as generated by a compiler, but also a high-level language that can be executed by a computer using an interpreter or the like.
  • Such hardware devices may be configured to operate as one or more software modules to perform the operations of the present invention, and vice versa.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Storage Device Security (AREA)

Abstract

L'invention concerne un procédé de génération de chaîne de blocs utilisant un partage de secret dans un environnement à plusieurs participants. Contrairement à la manière classique dans laquelle un temps d'exécution et un fonctionnement augmentent proportionnellement au nombre de participants lorsqu'un PKI ou une fonction de hachage ayant une clé est utilisé pour générer une chaîne de blocs, selon le procédé de génération de chaîne de blocs utilisant un partage de secret selon un mode de réalisation de la présente invention, l'utilisation du partage de secret et d'un fonctionnement de champ fini permet au temps d'exécution et au fonctionnement d'être maintenus constants quel que soit le nombre de participants. En conséquence, un nœud de chaîne de blocs peut être généré très efficacement dans un environnement à plusieurs participants et un excellent effet dans un aspect spatial et un aspect temporel dans la fabrication de matériel peut également être obtenu à l'avenir. De plus, une gestion de clé séparée n'est pas nécessaire.
PCT/KR2020/012719 2019-12-30 2020-09-21 Procédé de génération de chaîne de blocs utilisant un partage de secret WO2021137391A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
KR20190178748 2019-12-30
KR10-2019-0178748 2019-12-30

Publications (1)

Publication Number Publication Date
WO2021137391A1 true WO2021137391A1 (fr) 2021-07-08

Family

ID=76686838

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/KR2020/012719 WO2021137391A1 (fr) 2019-12-30 2020-09-21 Procédé de génération de chaîne de blocs utilisant un partage de secret

Country Status (1)

Country Link
WO (1) WO2021137391A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114553887A (zh) * 2022-01-24 2022-05-27 浙江数秦科技有限公司 一种区块链网络点对点数据传输方法
CN114567596A (zh) * 2022-01-24 2022-05-31 浙江数秦科技有限公司 一种用于区块链的数据快速交换方法

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190085106A (ko) * 2016-11-24 2019-07-17 알리바바 그룹 홀딩 리미티드 데이터 액세스를 위한 방법, 시스템 및 장치
KR20190138645A (ko) * 2017-04-07 2019-12-13 엔체인 홀딩스 리미티드 블록체인을 이용한 안전한 데이터 레코드 분산을 위한 방법 및 시스템

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20190085106A (ko) * 2016-11-24 2019-07-17 알리바바 그룹 홀딩 리미티드 데이터 액세스를 위한 방법, 시스템 및 장치
KR20190138645A (ko) * 2017-04-07 2019-12-13 엔체인 홀딩스 리미티드 블록체인을 이용한 안전한 데이터 레코드 분산을 위한 방법 및 시스템

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
SAMIR SHERIF M.; MOHAMED HODA K.; SAID HAZEM: "Compact aggregate short-lived signatures for consortium consensus protocols", 2019 14TH INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND SYSTEMS (ICCES), IEEE, 17 December 2019 (2019-12-17), pages 261 - 268, XP033756334, DOI: 10.1109/ICCES48960.2019.9068157 *
SOLTANI REZA; NGUYEN UYEN TRANG; AN AIJUN: "Practical Key Recovery Model for Self-Sovereign Identity Based Digital Wallets", 2019 IEEE INTL CONF ON DEPENDABLE, AUTONOMIC AND SECURE COMPUTING, INTL CONF ON PERVASIVE INTELLIGENCE AND COMPUTING, INTL CONF ON CLOUD AND BIG DATA COMPUTING, INTL CONF ON CYBER SCIENCE AND TECHNOLOGY CONGRESS (DASC/PICOM/CBDCOM/CYBERSCITECH), IEEE, 5 August 2019 (2019-08-05), pages 320 - 325, XP033659616, DOI: 10.1109/DASC/PiCom/CBDCom/CyberSciTech.2019.00066 *
YANG CHING-NUNG; LI JIAN-MING; WU SONG-YU; LIN SHIN-SHANG: "Secret Image Sharing with Public Reconstruction over Distributed Cloud Network", 2018 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING, BIG DATA AND BLOCKCHAIN (ICCBB), IEEE, 15 November 2018 (2018-11-15), pages 1 - 8, XP033576321, DOI: 10.1109/ICCBB.2018.8756467 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114553887A (zh) * 2022-01-24 2022-05-27 浙江数秦科技有限公司 一种区块链网络点对点数据传输方法
CN114567596A (zh) * 2022-01-24 2022-05-31 浙江数秦科技有限公司 一种用于区块链的数据快速交换方法
CN114567596B (zh) * 2022-01-24 2024-04-05 浙江数秦科技有限公司 一种用于区块链的数据快速交换方法
CN114553887B (zh) * 2022-01-24 2024-04-05 浙江数秦科技有限公司 一种区块链网络点对点数据传输方法

Similar Documents

Publication Publication Date Title
US20200372015A1 (en) Methods and apparatus for implementing state proofs and ledger identifiers in a distributed database
WO2019093574A1 (fr) Système et procédé de chaîne de blocs faisant appel à un programme de signature fondé sur le hachage
US20210344500A1 (en) Computer-implemented system and method for transferring access to digital resource
WO2017192007A2 (fr) Chaîne de blocs permettant de prendre en charge une pluralité de fonctions unidirectionnelles de vérification de blocs
WO2019045209A1 (fr) Module de fenêtre de blocs ayant un algorithme d'accord pour limiter le minage, serveur de gestion et système et procédé de négoce en monnaie virtuelle
WO2021137391A1 (fr) Procédé de génération de chaîne de blocs utilisant un partage de secret
WO2021137396A1 (fr) Procédé de service de certificat basé sur une preuve à connaissance nulle utilisant un réseau de chaîne de blocs, serveur de support de certification l'utilisant et terminal utilisateur l'utilisant
CN113573304B (zh) 签名实现、验签方法以及签名终端、验签终端和存储介质
WO2021036522A1 (fr) Procédé, appareil et dispositif pour vérifier une transaction de réticulation de chaîne de blocs, et système de chaîne de blocs
CN114357492B (zh) 一种基于区块链的医疗数据隐私融合方法及装置
WO2020246705A1 (fr) Appareil de gestion d'informations de documents permettant la gestion d'informations de documents sur la base d'une chaîne de blocs et son procédé de fonctionnement
CN109120573B (zh) 传输密钥生成方法、终端及服务器
CN109547193B (zh) 一种基于区块链且抗量子计算机攻击的电子投票方法
CN110224984A (zh) 一种基于区块链技术的多方授权方法及装置
WO2020158973A1 (fr) Système et procédé de consensus de chaîne de blocs à 2 modes de protocole d'acceptation d'hypothèse
US20100306543A1 (en) Method of efficient secure function evaluation using resettable tamper-resistant hardware tokens
WO2022177201A1 (fr) Système de gestion et de récupération de clé privée ayant des informations de sauvegarde de clé stockées de manière répartie
JP2002529778A (ja) 共有無作為性の分散暗号化への組み込み
CN111737708B (zh) 一种支持外包数据高效更新的可验证删除方法及系统
KR20210058784A (ko) 탈중앙화 아이디 기반의 가상 자산 서비스 제공 방법 및 이를 이용한 가상 자산 서비스 제공 서버
WO2023149660A1 (fr) Procédé et système d'apprentissage fédéré basé sur une signature de groupe, et support d'enregistrement pour la mise en œuvre de ceux-ci
WO2023191216A1 (fr) Système et procédé de chiffrement et de déchiffrement de données
JP6939313B2 (ja) 分散認証システム
WO2021137392A1 (fr) Procédé de gestion d'actifs vidéo basé sur une chaîne de blocs
WO2023074984A1 (fr) Système de vérification de machine virtuelle à chaîne de blocs basée sur une preuve à divulgation nulle de connaissance

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20908943

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20908943

Country of ref document: EP

Kind code of ref document: A1