CN117640108A - Block authentication method based on zero knowledge proof - Google Patents
Block authentication method based on zero knowledge proof Download PDFInfo
- Publication number
- CN117640108A CN117640108A CN202311736058.8A CN202311736058A CN117640108A CN 117640108 A CN117640108 A CN 117640108A CN 202311736058 A CN202311736058 A CN 202311736058A CN 117640108 A CN117640108 A CN 117640108A
- Authority
- CN
- China
- Prior art keywords
- node
- block
- tracing
- key
- ciphertext
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000012795 verification Methods 0.000 claims description 10
- 230000004044 response Effects 0.000 claims description 9
- 230000000977 initiatory effect Effects 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 4
- 230000003993 interaction Effects 0.000 abstract 1
- 230000008569 process Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000002452 interceptive effect Effects 0.000 description 3
- 230000009467 reduction Effects 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Storage Device Security (AREA)
Abstract
The invention provides a block authentication method based on zero knowledge proof, which is used for acquiring node information from a first node and a second node; checking node information, uploading the node information to an intelligent contract by calling the intelligent contract if checking, and distributing a node identifier according to the node information; writing a first key into a node identifier of a first node; writing a second key into the node identifier of the second node, and storing the root key to the intermediate node; receiving a block access request; generating a key pair generated upon interaction between the nodes based on the first key; the initial access to the block is requested, and the node identification is written into the block, so that the security of block authentication is ensured.
Description
Technical Field
The invention belongs to the technical field of blockchain, and particularly relates to a block authentication method based on zero knowledge proof.
Background
Zero knowledge proof (ZeroKnowledgeProofs, ZKP) is a powerful cryptographic protocol. In short, where the Prover (saver) knows the answer to the question, he needs to prove to the verifier (Verifiers) the fact that "he knows the answer", but requires that the verifier cannot obtain any information of the answer. At present, zero knowledge proves to be particularly useful for providing verification of privacy security due to its extremely high privacy and conciseness. There are many applications in the blockchain domain, such as secure multiparty computing, distributed storage, verifiable outsourced databases, under-chain expansion, online auctions, and so forth. However, an important obstacle in the application of zero knowledge proof is that the process of proof generation by the prover is very time consuming, because the generation proof contains polynomial calculations (including fast number theory transforms and inverse fast number theory transforms) and elliptic curve multi-scalar multiplications over a finite field of large bit-width data.
The blockchain technology gives the access control technology the capability of breaking through the limitation by virtue of the characteristics of decentralization, non-falsifiability of data on the chain and public transparency. Intelligent contracts enable ideas for implementing access control logic on blockchains, such as blockchain and role-based access control, blockchain and attribute-based access control, blockchain and task-based access control, all with corresponding research, which enable viable access control logic by programming and deploying intelligent contracts with corresponding functionality on blockchains.
In view of this, a block authentication method based on zero knowledge proof is provided, which realizes authentication and control of block access in a block chain.
Disclosure of Invention
Therefore, the invention provides a block authentication method based on zero knowledge proof, which realizes the authentication and control of block access in a block chain and improves the safety of data accessed on the chain.
A first aspect of the present invention provides an anonymous block authentication method based on zero-knowledge proof, comprising,
s1, acquiring node information from a first node and/or a second node;
s2, checking the node information, and if the node information passes the checking, calling an intelligent contract to upload the node information to a blockchain, and distributing node identifiers to the first node and/or the second node according to the node information;
s3, writing a first secret key into the first node and the node identification thereof;
writing a second key into the second node and the node identifier thereof, and storing a root key to an intermediate node, wherein the root key is a decryption key of the first key and the second key;
s4, receiving a block access request from the first node and/or the second node;
s5, generating key pairs in response to the block access request based on the first keys, wherein each key pair at least comprises a group of first public keys and first private keys, and simultaneously generating a first traceability identifier;
meanwhile, when any first public key has a first private key corresponding to the first public key, a second tracing identifier is generated;
s6, based on the second secret key, if any first tracing identifier and/or second tracing identifier are stored in the block access request, correspondingly generating a first tracing ciphertext and/or a second tracing ciphertext and storing the first tracing ciphertext and/or the second tracing ciphertext into the block to be accessed;
s7, executing verification of the block access request,
checking whether the block access request comprises an original value or an encrypted value of the first tracing identifier and/or the second tracing identifier;
if yes, executing the step S9, otherwise, executing the step S8;
s8, writing the node identification into the block, simultaneously writing the first tracing ciphertext and/or the second tracing ciphertext into the block,
simultaneously receiving an anonymous credential from the smart contract and sending the anonymous credential to the first node and/or second node;
s9, checking consistency between the first tracing identifier and/or the second tracing identifier and corresponding ciphertext in the block;
if the block access request passes, returning an access response and calling the block to a requester of the block access request;
otherwise, return to S8.
Further, when the number of loops returning to the step S8 reaches a preset threshold, deleting the first tracing ciphertext and/or the second tracing ciphertext in the block corresponding to the block access request, returning to the step S2, and reallocating the node identifier.
Further, the intelligent is responded simultaneously when the intermediate node executes S7-S9, and the following steps are executed:
s10, acquiring a first backup of a first tracing identifier and/or a second tracing identifier from the intermediate node, and acquiring a second backup of a first tracing ciphertext and/or a second tracing ciphertext;
s20, receiving a check return value from the intermediate node, and generating an anonymous authentication value;
s30, writing a third secret key into the anonymous authentication value, generating an anonymous certificate corresponding to the third secret key, and writing a first time tracing value and a second time tracing value into the anonymous certificate, wherein the first time tracing value is a timestamp of the third secret key called by a requester, and the second time tracing value is a timestamp of the anonymous certificate updated;
s40, writing a block check value into the anonymous certificate, wherein the block check value comprises a first plaintext and a first ciphertext, the first plaintext is a check bit, the number of times that the block is accessed to be requested is checked, and the first ciphertext is generated after encrypting the first time tracing value and the second time tracing value together based on a third private key corresponding to the generation of each block access request;
s50, updating the anonymous certificate to the block and the intermediate node.
Further, when the intelligent reduction is performed by the intermediate node for the first time in S8, the following steps are further performed:
and extracting address data in the node information, encrypting the address data by the first key or the second key according to the source of the requester, writing the address data into a first ciphertext of the block check value, and updating the first ciphertext to an anonymous certificate.
Further, the intermediate node requests new address data in node information from the first node or the second node in response to the first node or the second node updating block access request;
and simultaneously, the intelligent contract is responded, and the address data is updated into the anonymous certificate in a non-coverage mode through the corresponding first ciphertext.
A second aspect of the present invention, for use in a first node or a second node, is characterized by comprising the steps of:
s100, initiating a registration request to an intermediate node;
s200, responding to the return information of the intermediate node and sending node information to the intermediate node;
s300, receiving a node identifier from the intermediate node;
s400, initiating a block access request to an intermediate node, and responding to the block access request verification of the intermediate node;
s500, if the verification is passed, sending a node identifier to an intermediate node and accessing the block through an anonymous certificate;
otherwise, return to step S400.
In a third aspect of the present invention, there is provided a block authentication system based on zero knowledge proof, comprising
A registration module configured to provide a registration request initiated by the first node and the second node to the intermediate node;
a key generation module configured to initiate a registration request according to the first node and the first node;
and a smart contract module configured to store smart contracts and assign node identities to the first node and the second node.
And a storage module configured to store a backup of each key generated by the key generation module, and simultaneously store registration request information provided by the first node and the second node.
In a fourth aspect the invention provides an electronic device comprising a memory and a computer program stored on the memory and executable on a processor adapted to implement the method of the first or second aspect of the invention when the program is executed by the processor.
In a fifth aspect of the invention, there is provided a computer readable storage medium having stored thereon a computer program adapted to implement the method of the first or second aspect of the invention when executed by a processor.
Compared with the prior art, the technical scheme provided by the invention has the following advantages:
according to the method, the first backup of the first tracing identifier and/or the second tracing identifier from the intermediate node is obtained through the intelligent contract, and the second backup of the first tracing ciphertext and/or the second tracing ciphertext is obtained; receiving a check return value from the intermediate node, and generating an anonymous authentication value; writing a third key into the anonymous authentication value, generating an anonymous certificate corresponding to the third key, and writing a first time tracing value and a second time tracing value into the anonymous certificate, wherein the first time tracing value is a timestamp of the third private key called by a requester, and the second time tracing value is a timestamp of the anonymous certificate updated; writing a block check value into the anonymous certificate, wherein the block check value comprises a first plaintext and a first ciphertext, the first plaintext is a check bit, the number of times that the block is accessed to be requested is checked, and the first ciphertext is generated after the first time tracing value and the second time tracing value are encrypted together based on a third private key corresponding to the generation of each block access request. The method and the system are characterized in that the method and the system verify the compliance of access by using intelligent contracts on the basis of initial data provided by nodes requesting access and interactive data generated between the nodes and intermediate nodes, the source of the access request does not have the capability of directly acquiring whether the access request has access rights or not, and multiple groups of check values and traceability values are generated according to the interactive data in a plurality of interactive steps in the invention so as to ensure the data security in the anonymized authentication process.
Drawings
FIG. 1 is a schematic flow chart of a method according to an embodiment of the present invention;
fig. 2 is a schematic structural diagram of an electronic device according to an embodiment of the present invention.
Detailed Description
So that the manner in which the features and techniques of the disclosed embodiments can be understood in more detail, a more particular description of the embodiments of the disclosure, briefly summarized below, may be had by reference to the appended drawings, which are not intended to be limiting of the embodiments of the disclosure. In the following description of the technology, for purposes of explanation, numerous details are set forth in order to provide a thorough understanding of the disclosed embodiments. However, one or more embodiments may still be practiced without these details. In other instances, well-known structures and devices may be shown simplified in order to simplify the drawing.
Example 1
A first aspect of the present invention provides an anonymous block authentication method based on zero-knowledge proof, comprising,
s1, acquiring node information from a first node and/or a second node;
s2, checking the node information, and if the node information passes the checking, calling an intelligent contract to upload the node information to a blockchain, and distributing node identifiers to the first node and/or the second node according to the node information;
s3, writing a first secret key into the first node and the node identification thereof;
writing a second key into the second node and the node identifier thereof, and storing a root key to an intermediate node, wherein the root key is a decryption key of the first key and the second key;
s4, receiving a block access request from the first node and/or the second node;
s5, generating key pairs in response to the block access request based on the first keys, wherein each key pair at least comprises a group of first public keys and first private keys, and simultaneously generating a first traceability identifier;
meanwhile, when any first public key has a first private key corresponding to the first public key, a second tracing identifier is generated;
s6, based on the second secret key, if any first tracing identifier and/or second tracing identifier are stored in the block access request, correspondingly generating a first tracing ciphertext and/or a second tracing ciphertext and storing the first tracing ciphertext and/or the second tracing ciphertext into the block to be accessed;
s7, executing verification of the block access request,
checking whether the block access request comprises an original value or an encrypted value of the first tracing identifier and/or the second tracing identifier;
if yes, executing the step S9, otherwise, executing the step S8;
s8, writing the node identification into the block, simultaneously writing the first tracing ciphertext and/or the second tracing ciphertext into the block,
simultaneously receiving an anonymous credential from the smart contract and sending the anonymous credential to the first node and/or second node;
s9, checking consistency between the first tracing identifier and/or the second tracing identifier and corresponding ciphertext in the block;
if the block access request passes, returning an access response and calling the block to a requester of the block access request;
otherwise, return to S8.
Further, when the number of loops returning to the step S8 reaches a preset threshold, deleting the first tracing ciphertext and/or the second tracing ciphertext in the block corresponding to the block access request, returning to the step S2, and reallocating the node identifier.
Further, the intelligent is responded simultaneously when the intermediate node executes S7-S9, and the following steps are executed:
s10, acquiring a first backup of a first tracing identifier and/or a second tracing identifier from the intermediate node, and acquiring a second backup of a first tracing ciphertext and/or a second tracing ciphertext;
s20, receiving a check return value from the intermediate node, and generating an anonymous authentication value;
s30, writing a third secret key into the anonymous authentication value, generating an anonymous certificate corresponding to the third secret key, and writing a first time tracing value and a second time tracing value into the anonymous certificate, wherein the first time tracing value is a timestamp of the third secret key called by a requester, and the second time tracing value is a timestamp of the anonymous certificate updated;
s40, writing a block check value into the anonymous certificate, wherein the block check value comprises a first plaintext and a first ciphertext, the first plaintext is a check bit, the number of times that the block is accessed to be requested is checked, and the first ciphertext is generated after encrypting the first time tracing value and the second time tracing value together based on a third private key corresponding to the generation of each block access request;
s50, updating the anonymous certificate to the block and the intermediate node.
Further, when the intelligent reduction is performed by the intermediate node for the first time in S8, the following steps are further performed:
and extracting address data in the node information, encrypting the address data by the first key or the second key according to the source of the requester, writing the address data into a first ciphertext of the block check value, and updating the first ciphertext to an anonymous certificate.
Further, the intermediate node requests new address data in node information from the first node or the second node in response to the first node or the second node updating block access request;
and simultaneously, the intelligent contract is responded, and the address data is updated into the anonymous certificate in a non-coverage mode through the corresponding first ciphertext.
A second aspect of the present invention, for use in a first node or a second node, is characterized by comprising the steps of:
s100, initiating a registration request to an intermediate node;
s200, responding to the return information of the intermediate node and sending node information to the intermediate node;
s300, receiving a node identifier from the intermediate node;
s400, initiating a block access request to an intermediate node, and responding to the block access request verification of the intermediate node;
s500, if the verification is passed, sending a node identifier to an intermediate node and accessing the block through an anonymous certificate;
otherwise, return to step S400.
In a third aspect of the present invention, there is provided a block authentication system based on zero knowledge proof, comprising
A registration module configured to provide a registration request initiated by the first node and the second node to the intermediate node;
a key generation module configured to initiate a registration request according to the first node and the first node;
and a smart contract module configured to store smart contracts and assign node identities to the first node and the second node.
And a storage module configured to store a backup of each key generated by the key generation module, and simultaneously store registration request information provided by the first node and the second node.
In this embodiment, the address data has unique characteristics, which are authentication values occurring in the authentication generation process when node ordering and anonymous identity authentication occur, that is, when the node is replaced for anonymous identity, the address data will also change, and the non-overwriting writing of the address data in the anonymous certificate can effectively record the difference between the holder and the non-holder of the node identification, and the traceability and encryption capability of the address data will be effectively improved according to the generation of related key data and the address data by the intermediate node. When each authentication occurs, address data in the authentication needs to be decrypted simultaneously so as to prevent the authentication party from backing up the data and then authenticating the block twice by utilizing the characteristics of the chain, when the same block flows from the original holder for many times, the holder holds the same block, the unitized information also changes, the privacy of the digital authentication block is not affected, the tracing of the embodiment is performed through nodes and anonymous identities, and the privacy of a chain user is protected while the security of the chain is simultaneously provided.
Example two
As shown in connection with fig. 2, an embodiment of the present disclosure provides a block authentication method based on zero knowledge proof, including a processor (processor) 30 and a memory (memory) 31. Optionally, the electronic device may also include a communication interface (communication interface) 32 and a bus 33. The processor 30, the communication interface 32, and the memory 31 may communicate with each other via the bus 33. The communication interface 32 may be used for information transfer. The processor 30 may invoke logic instructions in the memory 31 to perform the zero knowledge proof based block authentication method of the above described embodiments.
The disclosed embodiments provide a storage medium storing computer executable instructions configured to perform the above-described zero-knowledge proof-based block authentication method.
The storage medium may be a transitory computer readable storage medium or a non-transitory computer readable storage medium. A non-transitory storage medium comprising: a plurality of media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-only memory (ROM), a random access memory (RAM, randomAccessMemory), a magnetic disk, or an optical disk, or a transitory storage medium.
The above description and the drawings illustrate embodiments of the disclosure sufficiently to enable those skilled in the art to practice them. Other embodiments may involve structural, logical, electrical, process, and other changes. The embodiments represent only possible variations. Individual components and acts are optional unless explicitly required, and the sequence of operations may vary. Portions and features of some embodiments may be included in, or substituted for, those of others. Moreover, the terminology used in the present application is for the purpose of describing embodiments only and is not intended to limit the claims. As used in the description of the embodiments and the claims, the singular forms "a," "an," and "the" (the) are intended to include the plural forms as well, unless the context clearly indicates otherwise. Similarly, the term "and/or" as used in this application is meant to encompass any and all possible combinations of one or more of the associated listed. Furthermore, when used in this application, the terms "comprises," "comprising," and/or "includes," and variations thereof, mean that the stated features, integers, steps, operations, elements, and/or components are present, but that the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof is not precluded. Without further limitation, an element defined by the phrase "comprising one …" does not exclude the presence of other like elements in a process, method or apparatus comprising such elements. In this context, each embodiment may be described with emphasis on the differences from the other embodiments, and the same similar parts between the various embodiments may be referred to each other. For the methods, products, etc. disclosed in the embodiments, if they correspond to the method sections disclosed in the embodiments, the description of the method sections may be referred to for relevance.
Claims (9)
1. The block authentication method based on zero knowledge proof is used for an intermediate node and is characterized by comprising the following steps:
s1, acquiring node information from a first node and/or a second node;
s2, checking the node information, and if the node information passes the checking, calling an intelligent contract to upload the node information to a blockchain, and distributing node identifiers to the first node and/or the second node according to the node information;
s3, writing a first secret key into the first node and the node identification thereof;
writing a second key into the second node and the node identifier thereof, and storing a root key to an intermediate node, wherein the root key is a decryption key of the first key and the second key;
s4, receiving a block access request from the first node and/or the second node;
s5, generating key pairs in response to the block access request based on the first keys, wherein each key pair at least comprises a group of first public keys and first private keys, and simultaneously generating a first traceability identifier;
meanwhile, when any first public key has a first private key corresponding to the first public key, a second tracing identifier is generated;
s6, based on the second secret key, if any first tracing identifier and/or second tracing identifier are stored in the block access request, correspondingly generating a first tracing ciphertext and/or a second tracing ciphertext and storing the first tracing ciphertext and/or the second tracing ciphertext into the block to be accessed;
s7, executing verification of the block access request,
checking whether the block access request comprises an original value or an encrypted value of the first tracing identifier and/or the second tracing identifier;
if yes, executing the step S9, otherwise, executing the step S8;
s8, writing the node identification into the block, simultaneously writing the first tracing ciphertext and/or the second tracing ciphertext into the block,
simultaneously receiving an anonymous credential from the smart contract and sending the anonymous credential to the first node and/or second node;
s9, checking consistency between the first tracing identifier and/or the second tracing identifier and corresponding ciphertext in the block;
if the block access request passes, returning an access response and calling the block to a requester of the block access request;
otherwise, return to S8.
2. The zero knowledge proof based block authentication method according to claim 1, wherein when the number of loops returning to S8 reaches a preset threshold, deleting the first tracing ciphertext and/or the second tracing ciphertext in the block corresponding to the block access request, returning to S2, and reassigning the node identifier.
3. The zero-knowledge proof-based block authentication method according to claim 1, wherein the intelligent is simultaneously responded to when the intermediate node performs S7-S9, and the following steps are performed:
s10, acquiring a first backup of a first tracing identifier and/or a second tracing identifier from the intermediate node, and acquiring a second backup of a first tracing ciphertext and/or a second tracing ciphertext;
s20, receiving a check return value from the intermediate node, and generating an anonymous authentication value;
s30, writing a third secret key into the anonymous authentication value, generating an anonymous certificate corresponding to the third secret key, and writing a first time tracing value and a second time tracing value into the anonymous certificate, wherein the first time tracing value is a timestamp of the third secret key called by a requester, and the second time tracing value is a timestamp of the anonymous certificate updated;
s40, writing a block check value into the anonymous certificate, wherein the block check value comprises a first plaintext and a first ciphertext, the first plaintext is a check bit, the number of times that the block is accessed to be requested is checked, and the first ciphertext is generated after encrypting the first time tracing value and the second time tracing value together based on a third private key corresponding to the generation of each block access request;
s50, updating the anonymous certificate to the block and the intermediate node.
4. The zero-knowledge proof-based block authentication method as claimed in claim 3, wherein the intelligent convergence is further performed by the intermediate node when it performs S8 for the first time, by:
and extracting address data in the node information, encrypting the address data by the first key or the second key according to the source of the requester, writing the address data into a first ciphertext of the block check value, and updating the first ciphertext to an anonymous certificate.
5. The zero-knowledge proof-based block authentication method according to claim 1, wherein the intermediate node further requests new address data in node information to the first node or the second node in response to the first node or the second node updating block access request;
and simultaneously, the intelligent contract is responded, and the address data is updated into the anonymous certificate in a non-coverage mode through the corresponding first ciphertext.
6. The block authentication method based on zero knowledge proof is used for a first node or a second node and is characterized by comprising the following steps:
s100, initiating a registration request to an intermediate node;
s200, responding to the return information of the intermediate node and sending node information to the intermediate node;
s300, receiving a node identifier from the intermediate node;
s400, initiating a block access request to an intermediate node, and responding to the block access request verification of the intermediate node;
s500, if the verification is passed, sending a node identifier to an intermediate node and accessing the block through an anonymous certificate;
otherwise, return to step S400.
7. A zero knowledge proof based block authentication system, comprising:
a registration module configured to provide a registration request initiated by the first node and the second node to the intermediate node;
a key generation module configured to initiate a registration request according to the first node and the first node;
a smart contract module configured to store smart contracts and assign node identifications to the first node and the second node;
and a storage module configured to store a backup of each key generated by the key generation module, and simultaneously store registration request information provided by the first node and the second node.
8. An electronic device comprising a memory and a computer program stored on the memory and executable on a processor, the processor being adapted to implement the zero-knowledge proof-based block authentication method of any one of claims 1-7 when the program is executed.
9. A computer readable storage medium, having stored thereon a computer program, which, when being executed by a processor, is adapted to implement the zero-knowledge proof-based block authentication method as claimed in any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311736058.8A CN117640108A (en) | 2023-12-18 | 2023-12-18 | Block authentication method based on zero knowledge proof |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311736058.8A CN117640108A (en) | 2023-12-18 | 2023-12-18 | Block authentication method based on zero knowledge proof |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117640108A true CN117640108A (en) | 2024-03-01 |
Family
ID=90037655
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311736058.8A Pending CN117640108A (en) | 2023-12-18 | 2023-12-18 | Block authentication method based on zero knowledge proof |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117640108A (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020015525A1 (en) * | 2018-07-17 | 2020-01-23 | Huawei Technologies Co., Ltd. | Verifiable encryption based on trusted execution environment |
| CN114024766A (en) * | 2021-11-23 | 2022-02-08 | 重庆邮电大学 | Zero trust identity authentication method facing edge computing node |
| US20220141020A1 (en) * | 2020-11-04 | 2022-05-05 | Gwangju Institute Of Science And Technology | Blockchain e-voting system and operating method thereof |
| CN115694838A (en) * | 2022-10-31 | 2023-02-03 | 重庆大学 | Anonymous trusted access control method based on verifiable certificate and zero-knowledge proof |
| CN116015706A (en) * | 2022-10-27 | 2023-04-25 | 东南大学 | Block chain enabled industrial Internet of things authentication and key negotiation method |
-
2023
- 2023-12-18 CN CN202311736058.8A patent/CN117640108A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020015525A1 (en) * | 2018-07-17 | 2020-01-23 | Huawei Technologies Co., Ltd. | Verifiable encryption based on trusted execution environment |
| US20220141020A1 (en) * | 2020-11-04 | 2022-05-05 | Gwangju Institute Of Science And Technology | Blockchain e-voting system and operating method thereof |
| CN114024766A (en) * | 2021-11-23 | 2022-02-08 | 重庆邮电大学 | Zero trust identity authentication method facing edge computing node |
| CN116015706A (en) * | 2022-10-27 | 2023-04-25 | 东南大学 | Block chain enabled industrial Internet of things authentication and key negotiation method |
| CN115694838A (en) * | 2022-10-31 | 2023-02-03 | 重庆大学 | Anonymous trusted access control method based on verifiable certificate and zero-knowledge proof |
Non-Patent Citations (1)
| Title |
|---|
| 张利华;胡方舟;黄阳;万源华;李晶晶;: "基于联盟链的微电网身份认证协议", 应用科学学报, no. 01, 30 January 2020 (2020-01-30) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Aujla et al. | SecSVA: secure storage, verification, and auditing of big data in the cloud environment | |
| CN109492419B (en) | Method, device and storage medium for acquiring data in block chain | |
| EP3454238B1 (en) | Registration and authorization method, device and system | |
| CN110264200B (en) | Block chain data processing method and device | |
| CN108768633B (en) | Method and device for realizing information sharing in block chain | |
| US11176282B2 (en) | Encrypting data associated with decentralized identifier | |
| US20140270179A1 (en) | Method and system for key generation, backup, and migration based on trusted computing | |
| US7930763B2 (en) | Method of authorising a computing entity | |
| US11438157B2 (en) | Method and system for data ownership confirmation based on encryption | |
| US11128457B2 (en) | Cryptographic key generation using external entropy generation | |
| WO2020215685A1 (en) | Block chain-based information processing and acquisition methods and apparatus, device, and medium | |
| CN114239046A (en) | Data sharing method | |
| US20210306135A1 (en) | Electronic device within blockchain based pki domain, electronic device within certification authority based pki domain, and cryptographic communication system including these electronic devices | |
| TW202137199A (en) | Method of authenticating biological payment device, apparatus, electronic device, and computer-readable medium | |
| CN114268447B (en) | File transmission method and device, electronic equipment and computer readable medium | |
| CN114514550A (en) | Partitioning requests into blockchains | |
| US10805079B2 (en) | Method for securing an automated system | |
| CN114553557B (en) | Key calling method, device, computer equipment and storage medium | |
| CN117640108A (en) | Block authentication method based on zero knowledge proof | |
| CN115048672A (en) | Data auditing method and device based on block chain, processor and electronic equipment | |
| Divya et al. | A combined data storage with encryption and keyword based data retrieval using SCDS-TM model in cloud | |
| CN112769846B (en) | Key management method and device, electronic equipment and readable storage medium | |
| JP2019068327A (en) | User management device, user management system | |
| CN116527404B (en) | Digital collection directional sharing method and system based on block chain | |
| CN115062063B (en) | Data query method and device based on block chain |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: 901, 9th Floor, Building 7, Yard 8, Automobile Museum East Road, Fengtai District, Beijing, 100160 Applicant after: Shudun Information Technology Co.,Ltd. Address before: 100000 901, Floor 9, Building 7, Yard 8, Auto Museum East Road, Fengtai District, Beijing Applicant before: BEIJING SHUDUN INFORMATION TECHNOLOGY CO.,LTD. Country or region before: China |
|
| CB02 | Change of applicant information | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |