CN107862216B

CN107862216B - Privacy protection method, device and storage medium for anonymous cross-link transaction

Info

Publication number: CN107862216B
Application number: CN201710953056.2A
Authority: CN
Inventors: 孙毅; 张珺; 李忠诚; 李军; 蒋海
Original assignee: Bubi Beijing Network Technology Co ltd
Current assignee: Bubi Beijing Network Technology Co ltd
Priority date: 2017-10-13
Filing date: 2017-10-13
Publication date: 2021-04-06
Anticipated expiration: 2037-10-13
Also published as: CN107862216A

Abstract

The invention discloses a privacy protection method, a privacy protection device and a storage medium for anonymous cross-link transaction. The cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with the interconnection chain. The method comprises the following steps: constructing a source parallel chain for anonymous cross-chain transaction public parameters; statically registering or dynamically registering the public parameters to an interconnection chain; performing parallel chain network consensus verification on anonymous cross-chain transactions broadcasted in a source parallel chain according to the public parameters; and after the parallel chain network consensus verification passes, broadcasting the anonymous cross-chain transaction in the interconnection chain. The embodiment of the invention can realize the rapid protection of the privacy of the cross-chain transaction, verify and complete the cross-chain transaction under the condition of not revealing the privacy information of the cross-chain transaction, ensure the privacy of the cross-chain transaction and ensure the security of the privacy information of the participants of the cross-chain transaction.

Description

Privacy protection method, device and storage medium for anonymous cross-link transaction

Technical Field

The invention relates to the technical field of blockchain, in particular to a privacy protection method, a privacy protection device and a storage medium for anonymous cross-chain transaction.

Background

Since the introduction of bitcoin, the block chain technology has been rapidly developed. A variety of independent blockchains have emerged. The requirement for processing data across different blockchains (referred to as cross-chains) has become a more urgent requirement in blockchain applications today.

The applicant finds out through research that: in the blockchain network, although the user address is not associated with the real identity in the real world, the transaction information is shared with all the participating users, so that the transaction activity may be connected with the real identity in the real world by public information such as transaction amount, transaction time, transaction frequency and the like and by adopting statistical methods such as data mining and the like, thereby risking the leakage of user privacy. Because cross-chain transactions involve different blockchains, requiring longer authentication times, while anonymous transactions have shorter attestation times, a time conflict between authentication and attestation is created. Due to this time conflict effect, currently either only the user privacy of intra-chain (single-chain) transactions is studied or anonymous transactions are not considered.

How to protect privacy of anonymous cross-link transaction becomes a technical problem to be solved urgently.

Disclosure of Invention

In order to solve the problem of privacy protection of anonymous cross-link transactions, embodiments of the present invention provide a privacy protection method, apparatus and storage medium for anonymous cross-link transactions.

In a first aspect, a privacy preserving method for anonymous cross-chain transactions is provided. The cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with the interconnection chain. The method comprises the following steps:

constructing a source parallel chain for anonymous cross-chain transaction public parameters;

statically registering or dynamically registering the public parameters to an interconnection chain;

performing parallel chain network consensus verification on anonymous cross-chain transactions broadcasted in a source parallel chain according to the public parameters;

and after the parallel chain network consensus verification passes, broadcasting the anonymous cross-chain transaction in the interconnection chain.

In a second aspect, a privacy preserving method for anonymous cross-chain transactions is provided. The cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with the interconnection chain. The method comprises the following steps:

obtaining anonymous cross-link transaction of broadcast in an interconnection link;

performing internet network consensus verification on anonymous cross-link transactions according to public parameters statically or dynamically registered on the internet;

and after the network consensus verification of the interconnection chain passes, broadcasting the anonymous cross-chain transaction to a target parallel chain.

In a third aspect, a privacy preserving apparatus for anonymous cross-chain transactions is provided. The cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with the interconnection chain. The device includes:

the parameter construction module is used for constructing a source parallel chain and public parameters for anonymous cross-chain transaction;

the parameter registration module is used for statically registering or dynamically registering the public parameter to the interconnection chain;

the interconnection consensus module is used for carrying out parallel chain network consensus verification on the anonymous cross-chain transaction broadcasted in the source parallel chain according to the public parameters;

and the cross-link transaction module is used for broadcasting the anonymous cross-link transaction in the interconnection link after the parallel link network consensus verification passes.

In a fourth aspect, a privacy preserving apparatus for anonymous cross-chain transactions is provided. The cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with the interconnection chain. The device includes:

the transaction acquisition module is used for acquiring anonymous cross-link transactions broadcasted in the interconnection link;

the consensus verification module is used for carrying out interconnection chain network consensus verification on the anonymous cross-chain transaction according to the public parameters which are statically registered or dynamically registered on the interconnection chain;

and the transaction broadcasting module is used for broadcasting the anonymous cross-link transaction to the target parallel link after the network consensus verification of the interconnection link passes.

In a fifth aspect, a privacy preserving apparatus for anonymous cross-chain transactions is provided. The device includes:

a memory for storing a program;

a processor for executing the program stored by the memory, the program causing the processor to perform the method of the aspects described above.

In a sixth aspect, a computer-readable storage medium is provided. The computer readable storage medium has stored therein instructions which, when executed on a computer, cause the computer to perform the method of the above aspects.

In a seventh aspect, a computer program product containing instructions is provided. The product, when run on a computer, causes the computer to perform the method of the aspects described above.

In an eighth aspect, a computer program is provided. The computer program, when run on a computer, causes the computer to perform the methods of the aspects described above.

On one hand, the embodiment of the invention can statically register or dynamically register the public parameter to the interconnection chain by constructing the public parameter of the source parallel chain for anonymous cross-chain transaction, can realize the effects of one-time registration and multiple times of calling, can solve the conflict between overlong verification time caused by long generation time of the public parameter and short time for generating the zero-knowledge proof of the anonymous transaction, and improves the interaction performance of the cross-chain transaction.

On the other hand, the embodiment of the invention can add the public parameters of different parallel chains into the interconnection chain in a registration mode, and can ensure the simultaneous safe verification and execution of cross-chain anonymous transactions of different parallel chains under the interconnection chain environment.

In yet another aspect, embodiments of the invention may perform parallel chain network consensus verification for anonymous cross-chain transactions broadcast in a source parallel chain based on common parameters; after the parallel chain network consensus verification is passed, the anonymous cross-chain transaction is broadcasted in the interconnected chain, verification can be achieved under the condition that cross-chain transaction privacy information is not leaked, and cross-chain transaction completion can be achieved, so that the privacy of the cross-chain transaction is guaranteed, and the security of the privacy information of the participants of the cross-chain transaction is guaranteed.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments of the present invention will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a block chain cross-chain system architecture according to an embodiment of the present invention;

fig. 2(a) is a schematic flow chart of a data verification method for a parallel link access interconnection chain according to an embodiment of the present invention;

fig. 2(b) is a flowchart illustrating a data verification method for a parallel link access interconnection chain according to another embodiment of the present invention;

fig. 3(a) is a schematic flow chart of a data transceiving method of a parallel link access interconnect chain according to an embodiment of the present invention;

fig. 3(b) is a schematic flow chart of a data transceiving method of a parallel link access interconnect chain according to another embodiment of the present invention;

fig. 4 is a flowchart illustrating a method for accessing an interconnect chain by a parallel link according to another embodiment of the present invention;

FIG. 5 is a schematic sub-flow diagram of FIG. 4;

FIG. 6 is another sub-flow diagram of FIG. 4;

FIG. 7 is yet another sub-flow diagram of FIG. 4;

FIG. 8 is a block diagram of an interconnect chain according to an embodiment of the present invention;

FIG. 9 is a flowchart of a method for parallel chain cross-chain transactions according to yet another embodiment of the invention;

FIG. 10 is a schematic flow diagram of a privacy preserving method for anonymous cross-link transactions, in accordance with an embodiment of the invention;

FIG. 11 is a schematic flow diagram of a privacy preserving method for anonymous cross-link transactions according to another embodiment of the invention;

FIG. 12 is a schematic structural diagram of a privacy protecting apparatus for anonymous cross-link transactions according to an embodiment of the present invention;

FIG. 13 is a schematic diagram of a privacy protecting apparatus for anonymous cross-link transactions according to another embodiment of the present invention;

fig. 14 is a block diagram of a privacy protecting apparatus for anonymous cross-link transaction according to an embodiment of the present invention.

Detailed Description

In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.

Fig. 1 is a schematic diagram of a block chain interconnection system according to an embodiment of the invention.

As shown in fig. 1, the system may include: interlink chain 101, parallel chain 102, parallel chain 103, parallel chain 104, parallel chain 105, and parallel chain 106. In the interconnect chain 101 may be deployed: data transceiving nodes (represented by regular pentagons), data policing nodes (represented by ellipses), and data verification nodes (represented by triangles).

Parallel chains

102, 103, 104, 105, and 106 may each deploy one or more of: data transceiving nodes (represented by regular pentagons) and parallel-chain network nodes (represented by circles). Wherein the data-transceiving nodes are shared by the parallel chain and the interlink 101.

The interlink 101 is a blockchain, and can be used to establish a connection between various independent blockchains. Any block chain can be accessed into the interconnection chain, and information is exchanged through the interconnection chain, so that cross-chain transfer and operations of data access, storage, modification and the like of one block chain to another block chain can be completed. For example, interlink 101 can be used to establish a link between existing blockchains that are independent of each other (e.g., EtherFang blockchain Ripple blockchain, etc.), such that data interaction is no longer limited to a single blockchain, and such that the range of value flow is no longer limited to a single blockchain. By the system, any block chain can be accessed to the interconnection chain 101, and data processing such as cross-chain transaction and the like can be carried out with other block chains through the interconnection chain 101. For example, one blockchain performs data processing such as data access, storage, modification and the like on another blockchain. As another example, cross-chain transfer data processing is performed between different blockchains. Specifically, for example, when a bitcoin user in the Ripple blockchain needs to transfer money to an ether house user in the ether house blockchain, the bitcoin in the own account can be directly used for transaction, and the Ripple coin does not need to be converted into the ether coin by a third party. In addition, embodiments of the invention may manage two blockchains maintained by the same principal (e.g., one blockchain is responsible for financial activities and the other blockchain is responsible for virtual currency assets) such that the availability of virtual currency is dependent on financial activities. When the conditions such as asset freezing occur, the assets can influence financial activities, so that the asset blocking function is realized, the assets are effectively restricted and limited, and the asset safety is ensured.

The parallel chains may be referred to as parallel data block chains, or as parallel block chains. When a certain block chain (such as a bitcoin block chain or an ether house block chain) is connected to an interconnection chain, the interconnection chain becomes a parallel chain.

Parallel chains

102, 103, 104, 105, and 106 may access interconnect chain 101. A data transceiving node common to the parallel chain and the interlink is capable of forwarding the cross-chain transaction into the interlink network.

The data verification node can be used for receiving information such as transactions from a data transceiver and verifying the validity of the transactions on one hand; on the other hand, the data verification node may be configured to maintain a complete copy of the interlink and participate in the consensus process of the interlink 101. The data validation nodes are deployed only inside the interconnect chain 101 and are not part of the parallel chain. The data verification node can acquire transaction data from the parallel chain and verify the transaction validity at the same time, and the transaction is synchronized and agreed in the internet chain network. The data verification node is connected with the data transceiving node in the parallel chain, and can receive transaction information about the parallel chain sent by the data transceiving node and also can send transaction data from other parallel chains to the corresponding data transceiving node.

The data verification node can acquire the transaction data on the parallel chain collected by the data transceiving node through interaction with the data transceiving node. The data validation node can validate the transaction data on the parallel chain it obtained. The data verification nodes agree (agree) with each other and generate interlink blocks. After the consensus is successful, the data verification node may send the cross-chain transaction data to the data transceiving node of the corresponding destination chain (e.g., one of the parallel chains). The data verification node is connected with only one parallel chain at one time and is only responsible for the verification work of one parallel chain cross-chain transaction. But may be responsible for the validation of multiple parallel chain cross-chain transactions at different times, i.e., the validation nodes have a rotation mechanism.

The data transceiving nodes belong to both the parallel chain and the interlink, i.e. the data transceiving nodes are shared by the parallel chain and the interlink. Two block chain programs (such as a parallel chain and an interlink chain) can run on the data transceiver node. The data verification node is connected with the data verification node in the interconnection chain, can send transaction information of the parallel chain to the data verification node, and can also receive transaction data from other parallel chains sent by the data verification node.

A flat chain may have multiple data transceiving nodes. When no cross-chain transaction exists on the flat block chain where the data receiving and sending node is located, the data receiving and sending node sends the block head of the flat block chain to the verification node; when the cross-chain transaction exists on the flat block chain where the data receiving and sending node is located, the data receiving and sending node sends the block head of the flat block chain, cross-chain transaction information and verification information for verifying the effectiveness of the cross-chain transaction to the verification node.

The data supervision node is only deployed inside the interconnection chain 101 and connected with the data verification node. It is not part of a parallel chain. The data supervision node supervises the transaction verification behavior of the data verification node, and punishs the data verification node when finding that the data verification node is incorrect. One supervising node may supervise one set (number greater than or equal to 1) of verification nodes.

Each node may be various electronic devices, or may be a functional unit, a functional module, or even a program in various electronic devices. These electronic devices include, but are not limited to, personal computers, servers, mining machines, and the like.

It should be understood that the number of blockchains and nodes in fig. 1 is merely illustrative. And flexible configuration is carried out according to the implementation requirement.

The following embodiments may all apply the system architecture of the embodiments of the present invention to perform data interaction or processing. For simplicity of description, the contents of the various embodiments may be referred to one another.

Fig. 2(a) is a schematic flow chart of a data verification method for a parallel link access interconnection chain according to an embodiment of the present invention.

The embodiment can be applied to the data verification node side of the interconnection chain.

As shown in fig. 2(a), the method may include the steps of: s210, a data verification node of an interconnection chain receives an access request which is sent by a data receiving and sending node of a parallel chain and used for accessing the parallel chain into the interconnection chain; s220, responding to the access request, generating identification information by the data verification node, storing the identification information into a storage for managing the parallel chain, and broadcasting the identification information in the interconnection chain; and S230, after at least one other verification node in the interconnection chain stores the identification information, the data verification node feeds back access success information to the data transceiving node, and sends at least part of stored information to the data transceiving node so as to enable the data transceiving node to carry out information synchronization.

In S210, the data transceiving node is a special parallel-link network node, which can be changed from a parallel-link network node. The parallel chain network nodes can freely and dynamically join and leave the internet, so that the internet architecture can be flexibly expanded. At first, a parallel-link network node may apply for joining an interlink, and after being verified by a data verification node in the interlink, the parallel-link network node becomes a data transceiving node.

In some embodiments, the parallel chains may include: a source parallel chain and a destination parallel chain.

In S220, the identification information may include one or more of the following information: the name of the parallel chain, the serial number of the parallel chain, a parallel chain consensus algorithm and parallel chain data transceiving node information (such as address, serial number and the like). The identification information may also include information that uniquely identifies a parallel chain, and the like.

In this step, the data validation node may be used to initially validate access requests individually. The storage for managing the parallel chain may store management information such as a parallel chain management table, a parallel chain management map, and the like.

The most important thing is that when the parallel link is connected into the interconnect chain, the access request initiated by the interconnect chain may include the consensus algorithm used by the access request, which mainly includes the field with valid verification block and the algorithm with valid verification block. Once the parallel chain is linked into the interlink, all verification nodes in the interlink update the parallel chain management table, and the related information of the new parallel chain is added into the table, wherein the related information comprises the consensus algorithm used by the parallel chain.

At least one, and preferably all, of the other authentication nodes in the interlink performs consensus authentication of the access request in S230. And after the consensus verification is passed, storing the identification information into respective storage for storing the parallel chain management table or the parallel chain management graph.

Parallel chain management tables and the like corresponding to the data verification nodes are stored, and parallel chain comparison tables and the like are also stored in the data transmitting and receiving nodes. The data receiving and sending node can synchronize the parallel chain and the interconnection chain according to the information sent by the data verification node. For example, the parallel chain lookup table is synchronized with the parallel chain management table.

In this step, other verification nodes may be used to collectively perform network consensus, i.e., recheck verification, on the access request.

On one hand, in the embodiments of the present invention, the data verification node receives an access request for accessing the parallel link into the interconnect link, which is sent by the data transceiving node of the parallel link, and in response to the access request, the data verification node generates the identification information, stores the identification information in the storage for managing the parallel link, and may update the information for managing the parallel link in the data verification node, for example, update the parallel link management table.

On the other hand, the identification information is broadcasted in the interconnection chain through the data verification node, so that other verification nodes in the interconnection chain can store the identification information and update respective information for managing the parallel chain.

In another aspect, the data verification node feeds back the access success information to the data transceiving node and sends at least part of the stored information to the data transceiving node, so that the data transceiving node can update the parallel chain comparison table corresponding to the parallel chain management table.

Therefore, the embodiment of the invention can realize information synchronization of the nodes in the parallel chain and each node in the interconnection chain. Through information synchronization (for example, parallel chain management table information synchronization) among data verification nodes in the interconnection chain, when the next parallel chain initiates an access request, any data verification node in the interconnection chain has a unified and latest parallel chain management table, so that each data verification node in the interconnection chain can correctly process the access request of the parallel chain, the problem of low security caused by existing information centralized management is solved, and the security of accessing the interconnection chain is improved. In addition, the embodiment of the invention can safely connect the parallel link into the interconnection chain, so that the nodes on different block chains can freely and dynamically join and quit the interconnection chain network, and the interconnection chain structure can be flexibly expanded.

In some embodiments, the above method may further comprise the steps of:

s240, the data verification node receives a source parallel chain block head which is sent by the data receiving and sending node and used for cross-chain transaction between a source parallel chain and a target parallel chain;

s250, the data verification node acquires a first consensus algorithm for the source parallel chain to perform consensus on the cross-chain transaction from the storage;

s260, the data verification node performs first verification on the source parallel chain block head by using a first consensus algorithm;

and S270, after the first verification is passed, the data verification node broadcasts the source parallel chain block header in the interconnection chain, so that at least one other verification node in the interconnection chain performs second verification on the cross-chain transaction by adopting a second consensus algorithm of the interconnection chain.

Therefore, the embodiment of the invention adopts different consensus algorithms to perform the first verification and the second verification, and compared with the same consensus algorithm to perform the second verification, the main advantages of the embodiment of the invention can be as follows:

1. the existing same consensus algorithm (such as the existing Cosmos method and other similar cross-chain methods) is adopted to limit parallel chains (zones), although the transaction logic can be simplified, the existing consensus method does not necessarily match with the actual transaction situation, so the network consensus effect is not good. Although the transaction logic is slightly complex, when the inter-link transaction is performed, the interconnect link (hub) needs to verify the validity of the inter-link transaction sent by the parallel link, that is, whether the transaction of the parallel link corresponding to the inter-link transaction is valid is verified through the stored parallel link block header, and meanwhile, when the interconnect link synchronizes the parallel link block headers, the validity of the block header also needs to be verified, so that the adopted consensus method can be ensured to be matched with the actual transaction condition, and the network consensus effect can be improved.

2. The existing same consensus algorithm is used, the consistency of the mode of the verification block can be ensured to a certain extent, so that the inconvenience caused by the method for testing the multiple verification block limiters is avoided, the cross-chain transaction processing speed is improved, namely, the network of the block chain using the uniform consensus algorithm has simpler processing logic and more efficient processing performance, but the uniform consensus algorithm limits the type of the accessed block chain, and the expansibility of the block chain is reduced. In addition, the same conventional consensus method does not require a consensus algorithm, so in order to ensure the security of each parallel chain transaction, specific verification information must be attached during cross-chain transaction to help the interconnection chain to confirm the transaction on the parallel chain. In comparison, the embodiment of the invention does not need to attach specific verification information, so that the part of operation logic can be simplified, the time of later-stage cross-chain transaction is saved, the efficiency of the cross-chain transaction can be improved, the expansibility of the interconnection chain is stronger, and the development prospect is larger.

Fig. 2(b) is a schematic flow chart of a data verification method for a parallel link access interconnection chain according to another embodiment of the present invention.

As shown in fig. 2(b), the method may include the steps of:

s201, a data verification node of the interconnection chain receives an access request which is sent by a data receiving and sending node of the parallel chain and used for accessing the parallel chain into the interconnection chain.

S202, responding to the access request, the data verification node generates identification information at least comprising a first consensus algorithm, stores the identification information, and broadcasts the identification information in an interconnection chain.

S203, after the data verification node confirms that at least one other verification node in the interconnection chain receives the identification information, the data verification node feeds back access success information including the identification information to the data transceiving node.

In some embodiments, the method may further comprise the steps of:

and S204, the data verification node sends the access success information to the data transceiving node so that the data transceiving node can perform information synchronization by using the identification information in the access success information.

Wherein the parallel chains may include: a source parallel chain and/or a destination parallel chain. The source parallel chain can cross-chain trade with the destination parallel chain through the interconnection chain.

In some embodiments, the method may further comprise the steps of:

and S205, the data verification node performs first verification on the source parallel chain block head by using a first consensus algorithm according to the source parallel chain block head used for performing cross-chain transaction on the source parallel chain and the destination parallel chain.

The first consensus algorithm may be an algorithm for the source parallel chain to agree on the cross-chain transaction.

S206, after the first verification is passed, the data verification node broadcasts the source parallel chain block head in the interconnection chain, so that at least one other verification node in the interconnection chain adopts a second consensus algorithm to carry out second verification on the cross-chain transaction.

And the second consensus algorithm is an algorithm for realizing consensus on cross-chain transactions by the interconnection chain.

In some embodiments, the identification information further comprises: information is requested.

In some embodiments, the request information includes one or more of the following information: the name of the parallel chain, the serial number of the parallel chain and the information of the data transceiving node of the parallel chain.

Fig. 3(a) is a schematic flow chart of a data transceiving method of a parallel link access interconnect chain according to an embodiment of the present invention.

The present embodiment can be applied to the data-transceiving node side of the parallel chain. Its implementation differs from the 2 embodiments of fig. 2 mainly in that it is written at a different angle, and both implementations can be mutually referred to and cited.

As shown in fig. 3(a), the method may include the steps of: s310, the data receiving and sending node of the parallel chain sends an access request for accessing the parallel chain to the interconnection chain to the data verification node of the interconnection chain; s320, after the data verification node generates identification information according to the access request, the identification information is stored in a storage for managing the parallel chain and is broadcasted in the interconnection chain, and at least one other verification node in the interconnection chain stores the identification information, the data transceiving node receives access success information fed back by the data verification node; s330, the data transceiving node receives at least part of the stored information sent by the data verification node and performs information synchronization.

On one hand, the embodiment of the invention can solve the problem of difficult extensibility in the prior art by using the access method, so that any parallel chain can be stably and conveniently accessed into an internet chain network.

On the other hand, the embodiment of the invention ensures the validity of the access and the later transaction to the maximum extent, and the user does not need to trust the interconnection chain and only needs to verify the validity of the operation of accessing the interconnection chain by the parallel link and the cross-chain transaction by using the verification information.

In another aspect, embodiments of the present invention can connect existing independent blockchains to expand the range of value distribution.

Fig. 3(b) is a schematic flow chart of a data transceiving method of a parallel link access interconnect chain according to another embodiment of the present invention.

As shown in fig. 3(b), the method may include the steps of:

s301, the data receiving and sending node of the parallel chain sends an access request for accessing the parallel chain to the interconnection chain to the data verification node of the interconnection chain.

S302, after the data verification node generates identification information including a first consensus algorithm according to the access request, stores the identification information, broadcasts the identification information in the interconnection chain and confirms that at least one other verification node in the interconnection chain receives the identification information, the data transceiving node receives access success information including the identification information fed back by the data verification node.

In some embodiments, the method of parallel chaining into interconnect chains may further comprise the steps of:

and S303, the data transceiving node performs information synchronization by using the identification information in the access success information.

Fig. 4 is a flowchart illustrating a method for accessing an interconnect chain by a parallel link according to another embodiment of the present invention.

The embodiment can be applied to two sides of a data transceiving node of a parallel chain and a data verification node of an interconnection chain. As shown in fig. 4, the method may include the steps of:

s410, the parallel chain initiates an access request for accessing the interconnection chain.

One or more nodes on the flat block chain run an interlink program to obtain preset interlink node information and initiate an access request.

And S420, the data verification node of the interconnection chain verifies the access request.

The verification node judges whether to accept the access request.

And S430, processing the feedback information by the parallel chain, and synchronizing the information.

This part of the content will be described in detail below.

In some embodiments, the method may further comprise:

and S440, the data verification node receives a source parallel chain block header which is sent by the data transceiving node and used for cross-chain transaction between the source parallel chain and the destination parallel chain.

S450, the data verification node acquires a first consensus algorithm for the source parallel chain to perform consensus on the cross-chain transaction from the storage.

And S460, the data verification node performs first verification on the source parallel link block header by using a first consensus algorithm.

S470, after the first verification is passed, the data verification node broadcasts the source parallel chain block header in the interconnection chain, so that at least one other verification node in the interconnection chain performs second verification on the cross-chain transaction by adopting a second consensus algorithm of the interconnection chain.

In some embodiments, one or more of the following information may be recorded using a block header of an interlink: the hash value of the head of the last block, the serial number of the block, the hash value of the root of the transaction Merkle tree, the timestamp and the signature of the verification node. One or more of the following information may be recorded using the block body of the interlink: cross-link data processing information (such as cross-link transaction information), parallel link block header, validity evidence. By the design, the current block and the previous block can be connected to form a verifiable block chain, so that the difficulty of tampering the block can be increased.

Fig. 5 is a sub-flow diagram of fig. 4.

Referring to fig. 4 and 5, the process of initiating an access request to access an interconnect chain by a parallel chain (i.e., S410) may include the following steps:

and S411, the parallel link network node runs an interconnection link program to obtain the information of the preset node in the program.

The parallel chain network node may be one or more nodes on a flat block chain.

S412, the parallel link network node requests active data verification node information in the internet link network from a preset node;

s413, the preset node sends active data verification node information in the interconnection chain network to a parallel chain network node;

and S414, the parallel chain network node initiates an interconnection chain access request to the obtained active data verification node.

Fig. 6 is another sub-flow diagram of fig. 4.

Referring to fig. 4 and 6, the data verification node of the interlink verifying the access request (i.e., S420) may include the steps of:

s421, the data verification node queries the parallel chain network management table maintained by the data verification node.

S422, the data verification node judges whether the parallel chain has access to the internet.

When the parallel link is determined to be the accessed inter-link network, S423 is performed.

When it is determined that the parallel link does not access the inter-link network, the process goes to S428.

And S423, when the parallel chain is judged to be the accessed interconnection chain network, the data verification node generates identification information for the parallel chain network node and broadcasts the identification information, and then stores the identification information into the flat block chain network management table.

That is, the data verification node that received the access request generates and broadcasts identification information for the parallel-link network node that originated the access request.

S424, the other verification nodes receiving the identification information also store the identification information in the flat-link network management table.

This marks the node or nodes that initiated the request as data-transceiving nodes for the flat chain.

And S425, the data verification node sends access success information to the data transceiving node which initiates the request.

S426, the verification node receiving the access request sends the updated flat-block link network management table information to the data transceiver node initiating the request.

And S427, all the data transmitting and receiving nodes update the flat block chain network management table, at this time, the synchronization of the flat block chain network management table information in the whole interconnected chain network is completed, and then the update information of the flat block chain network management table is fed back to the responsible data verification node.

The information synchronization (e.g., parallel chain management table information synchronization) between the data verification nodes in the interconnection chain is that when a parallel chain access request is next time, any data verification node in the interconnection chain has a uniform and latest parallel chain management table. Therefore, the data verification nodes in the interconnection chain can correctly process the access requests of the parallel chain.

And S428, connecting S422, and when the parallel link is judged not to be accessed to the interlink network, the data verification node receiving the access request initiates a voting of full participation on the interlink network to process the access request.

S429, judging whether the vote passes or not.

If the vote passes, the process proceeds to step S4210. If the vote does not pass, the process proceeds to step S4211.

S4210, if the vote is passed, the data verification node receiving the access request generates and broadcasts identification information for the parallel chain requested to be accessed and the parallel chain network node initiating the request, and then stores the identification information in the flat-chain network management table, and goes to S424.

S4211, if the vote fails, the verification node receiving the access request sends updated flat-block chain network management table information to the parallel chain network node initiating the request;

fig. 7 is yet another sub-flow diagram of fig. 4.

Referring to fig. 4 and 7, the parallel chain processing the feedback information, performing information synchronization (i.e., S430) may include the steps of:

s431, the parallel chain initiating the access request receives a feedback of the interconnect chain to the access request.

And S432, judging whether to access or not according to the feedback.

And S433, if the feedback is access failure, the parallel chain which initiates the access request broadcasts the received access failure information in the parallel chain.

And S434, if the feedback indicates that the access is successful, the flat block chain initiating the access request receives the flat block chain network management table information sent by the interconnection chain, and broadcasts the received information in the parallel chain.

And S435, receiving the updating information of the flat block chain network management table sent by the interconnection chain by other flat block chains, and perfecting the flat block chain comparison table of the other flat block chains.

In addition, in the case of no conflict, those skilled in the art can flexibly adjust the order of the above operation steps or flexibly combine the above steps according to actual needs. Various implementations are not described again for the sake of brevity.

Fig. 8 is a block diagram of an interconnect chain according to an embodiment of the invention.

As shown in fig. 8, the structure of the blocks of the interconnection chain may include a block header 1 and a block body 2. Wherein, the block head 1 may include: hash value of last chunk header 3, chunk sequence number 4, valid summary of transaction information in chunk 5, timestamp 6, and verification node signature 7. The block body 2 may include: specific transaction information 8 and verification information 9 for cross-chain transactions.

The hash value 3 of the previous block header may be a fixed-length character string obtained by performing a hash operation on the previous block. The design can connect the block with the previous block to form a verifiable block chain, and can increase the difficulty of tampering the block.

The sequence number 4 of a tile may refer to a symbol that identifies where the tile is located. Such a design may facilitate other functions to point to the block.

A valid summary of transaction information in the tile 5 may be a Merkle tree root hash. The Merkle tree root hash may include hash values generated by interlink transaction calculation and hash values generated by block chain cross-chain transaction and validity evidence calculation.

The time stamp 6 may be a sequence of characters that uniquely identifies a time of day that identifies the time at which the block was generated.

The verification node signature 7 may be a digital signature generated by the verification node that generated the block with a private key to identify the generator of the block.

The specific transaction information 8 may include specific cross-chain transaction information and specific inter-chain transaction information.

The verification information 9 for the cross-chain transaction may include: other hash values (i.e., cross-chain transaction validity evidence) required to validate the cross-chain transaction using the Merkle tree, and the chunk header of the chunk chain. Using these hash values and the blockhead of the blockchain, the validity of the cross-chain transaction can be verified.

In some embodiments, the interlink may include: and a data verification node.

In some embodiments, the data verification node may be configured to receive an access request issued by a data transceiving node of a parallel chain to access the parallel chain to an interconnect chain; responding to the access request, the data verification node generates identification information comprising a first consensus algorithm, stores the identification information and broadcasts the identification information in an interconnection chain; and after confirming that at least one other verification node in the interconnection chain receives the identification information, feeding back access success information comprising the identification information to the data receiving and transmitting node.

In some embodiments, the data validation node is further configured to: and sending the access success information to the data transceiving node so that the data transceiving node can carry out information synchronization by using the identification information in the access success information.

In some embodiments, the parallel chains may include: a source parallel chain and/or a destination parallel chain.

In some embodiments, the data validation node may be further operable to: according to a source parallel chain block head used for cross-chain transaction of a source parallel chain and a target parallel chain, performing first verification on the source parallel chain block head by using a first common identification algorithm; after the first verification is passed, the data verification node broadcasts the source parallel chain block header in the interconnection chain, so that at least one other verification node in the interconnection chain performs second verification on the cross-chain transaction by adopting a second consensus algorithm.

In some embodiments, the first consensus algorithm is an algorithm where the source parallel chain agrees on cross-chain transactions.

In some embodiments, the second consensus algorithm is an algorithm that interconnects chains to agree on cross-chain transactions.

In some embodiments, an interconnect chain further comprises: a block head and a block body. Wherein the block header may be used to record one or more of the following information: the hash value of the head of the previous block, the serial number of the block, the hash value of the root of the transaction Merkle tree, a timestamp and a signature of a verification node; the block volume may be used for recording one or more of the following information: cross-link transaction information, parallel link block header, validity evidence.

In some embodiments, the parallel chains may include: and a data transceiving node.

In some embodiments, the data transceiving node may be configured to send an access request to a data validation node of an interlink to link a parallel link into the interlink; and generating identification information comprising a first consensus algorithm at the data verification node according to the access request, storing the identification information, broadcasting the identification information in the interconnection chain, and receiving access success information comprising the identification information fed back by the data verification node after confirming that at least one other verification node in the interconnection chain receives the identification information.

In some embodiments, the data transceiving node may be further configured to synchronize information using the identification information in the access success information.

Fig. 9 is a flowchart illustrating a method for parallel chain cross-chain transaction according to another embodiment of the present invention.

As shown in fig. 9, the method may include the steps of:

s910, the interlink verification node receives the parallel link block header sent by the corresponding parallel link data transceiver node.

S920, the verification node queries the consensus algorithm of the parallel chain according to all the parallel chain network management tables of the verification node, and finds out a method for verifying the validity of the block header.

S930, the verifying node verifies the validity of the block header according to the verifying mode, if the block header is valid, the block header is stored, and the valid block header is broadcasted to the whole internet link network.

In some embodiments, the interlink may include: the data validation node in the various embodiments described above, and other validation nodes in the various embodiments described above.

In some embodiments, it may further include: and a data supervision node. The data supervision node can be used for monitoring the verification operation of the data verification node and/or other verification nodes and managing the data verification node and/or other verification nodes when the verification operation is abnormal. Therefore, the data supervision node can ensure fairness and high efficiency of verification and network consensus, and safety of later access and transaction is improved.

In some embodiments, the interlink may include: a block head and a block body. Wherein the content of the first and second substances,

the block header may be used to record one or more of the following information: the hash value of the head of the last block, the serial number of the block, the hash value of the root of the transaction Merkle tree, the timestamp and the signature of the verification node. The block volume may be used for recording one or more of the following information: cross-link data processing information (such as cross-link transaction information), parallel link block header, validity evidence.

In some embodiments, the parallel chains may include: the data transceiving node of the various embodiments described above.

In some embodiments, the parallel chains may include: a parallel-link network node. The parallel link network node can be used for operating an interconnection link program, acquiring preset node information in the program, requesting active data verification node information from the preset node, and requesting access to an interconnection link from the active data verification node.

In some embodiments, a blockchain interconnect system may include: parallel links of the various embodiments described above, and interlink links of the various embodiments described above.

FIG. 10 is a flowchart illustrating a privacy preserving method for anonymous cross-link transactions, according to an embodiment of the invention.

In this embodiment, the cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with an interconnection chain. The method can be applied to the source data verification node side of the source parallel chain.

As shown in fig. 10, the method may include the steps of:

s101, constructing a source parallel chain for public parameters of anonymous cross-chain transaction; s102, statically registering or dynamically registering the public parameters to an interconnection chain; s103, carrying out parallel chain network consensus verification on anonymous cross-chain transactions broadcasted in a source parallel chain according to the public parameters; and S104, after the parallel chain network consensus verification passes, broadcasting the anonymous cross-chain transaction in an interconnection chain.

In step S101, common parameter construction may be performed based on a parallel chain zero knowledge proof of knowledge method. For example, the zero knowledge proof of knowledge method of zkSNARK is used. zkSNARK is a cryptographic method to prove/verify computational integrity.

In some embodiments, the common parameter construction may be implemented with modules written into the program, such as a parallel chain cross-chain transaction validation rule module, a transaction rule transformation module, a common parameter generation module, a binding and registration module, and the like.

In some embodiments, the parallel chain cross-chain transaction validation rules module may be configured to determine a parallel chain cross-chain transaction validation rules function by which the validity of a cross-chain transaction may be validated. For example, the verification rule of the user balance and the verification rule of the public key signature are performed based on the UTXO model (a model that can be used for the bitcoin block chain), but not limited to these two rules.

In some embodiments, a transaction rule transformation module may be used for transformation of transaction validation rules in a blockchain. The problem to be solved by this module is the NP problem. NP problems refer to the existence of non-deterministic problems that polynomial algorithms can solve, where NP-complete problems are again the most likely type of problem that is not a P problem. The module may use zkSNARK zero knowledge proof of knowledge algorithm to solve the transaction validity verification problem. However, zkSNARK zero knowledge demonstrates that the algorithm can only operate on Quadratic Arithmetic Programs (QAPs). The transaction rule conversion module can convert a certain parallel chain cross-chain transaction verification rule function into a form that zkSNARK zero knowledge proof algorithm can process, such as a QAP form.

In some embodiments, the QAP format may be as follows:

in the above formula (1), A_i(x)、B_i(x)、C_i(x) H (x), Z (x) are polynomials obtained after the cross-chain transaction verification rule is converted into the QAP form. The QAP equation constructed based on the parallel chain transaction verification rules is fixed except that the coefficients of the polynomial in the QAP equation vary with information on the sender, receiver, transfer amount, etc. of the transaction.

In some embodiments, the common parameter generation module may generate common parameters of the zero-knowledge proof algorithm based on a QAP form of a certain parallel-chain cross-chain transaction rule, including: a generator key (PK) and a Verifier Key (VK). Wherein: for a generator key (PK), a parallel chain of transaction initiators uses the generator key (PK) to generate a zero knowledge proof of transaction related private information. For the Verifier Key (VK), the verifier can verify the zero-knowledge proof generated by the corresponding generator key (PK) in the transaction using a certain parallel chain Verifier Key (VK).

In some embodiments, because the calculation time of the parallel chain common parameters is long, the binding and registration module is designed to bind the ID of a certain parallel chain with the generator key (PK) and the Verifier Key (VK), and then register the parallel chain with the interconnection chain, so as to facilitate repeated use.

In some embodiments, cross-chain anonymous transaction verification and implementation may be used to implement the overall process of initiation to final confirmation of a cross-chain anonymous transaction.

In step S101, building a common parameter for anonymous cross-chain transactions for source parallel chains may comprise the sub-steps of: s1011, determining a verification rule function of the source parallel chain for anonymous cross-chain transaction; s1012, converting the verification rule function into a ternary vector R1CS form; s1013, converting the R1CS form into a QAP form of a quadratic arithmetic program; and S1014, generating public parameters based on the zero-knowledge proof algorithm according to the QAP form. Wherein, the common parameters may include: a generator key PK and a verifier key VK.

In S1012, in order to convert the transaction verification rule into the QAP form, the transaction verification rule function needs to be converted into the NP-complete language R1CS form. In this step, first, a parallel chain cross-chain transaction verification rule may be abstracted into a complex polynomial. The complex polynomial is then decomposed into two forms: a ═ b and a ═ b (op) c, op may be an operator such as addition, subtraction, multiplication, division, and a and b may be variables, numbers, or sub-expressions. Finally, the decomposed expression is converted into a series of ternary vectors (a, b, c), namely R1 CS.

In S1013, the transaction verification rule in the form of R1CS of the parallel chain cross-chain transaction is converted into a form of QAP (quadratic arithmetic program), which may adopt fast fourier transform or lagrange interpolation, but is not limited to these two methods.

In S1014, zkSNARK zero knowledge proof of knowledge algorithm common parameters, i.e. generator key (PK) and Verifier Key (VK), for the parallel chain cross-chain anonymous transaction are generated based on QAP (quadratic arithmetic program) form. Since the transaction verification rules of the parallel chain include complex polynomial operations such as verifying signatures, calculating root hash values of Merkle trees (Merkle trees), the QAP form constructed by the rules includes a large number of hash operation functions, and directly calculating linear combinations in the QAP form consumes a large amount of computing resources and time. To avoid this, the polynomial contained in the QAP form needs to be converted into a value at some security random variable rn, at which point the QAP equation is still true.

To avoid direct combination of polynomial A_i(x)、B_i(x)、C_i(x) The value at the secure random variable is published in a common parameter, and the value can be converted to a point on the elliptic curve based on the elliptic curve generation point G:

p ═ G × n (formula 2)

In the above formula (2), P is a point on the elliptic curve. Under the existing research system, the discrete logarithm problem based on the elliptic curve is difficult to solve, namely, n (n is a finite field variable, and rn belongs to n in the embodiment) is extremely difficult to obtain from P and G. Thus, the points after the numerical value conversion are published in the common parameters.

In order to enable the verification node in the inter-link network to verify the validity of the transaction without knowing the privacy information related to the transaction, such as the transaction parties and the transaction amount, an elliptic curve pairing function e is required, and the function needs to satisfy the following conditions:

e (P, Q + R) ═ e (P, Q) · e (P, R) (formula 3)

e (P + Q, R) ═ e (P, R) · e (Q, R) (formula 4)

In the above equations 3 and 4, P, Q, R is the point on the ellipse curve, and only the verification is needed to verify the QAP equation of the inter-link transaction rule transformation:

e (δ _ a, δ _ b) ═ e (δ _ c, G) · e (δ _ h, δ _ z) (equation 5)

Wherein:

δ_a＝G*A(rn)

δ_b＝G*B(rn)

δ_c＝G*C(rn)

δ_h＝G*H(rn)

δ_z＝G*Z(rn)

with the generator key (PK), a node (e.g., a verification node) may prove to generate proof that a transaction is valid without revealing transaction privacy information; accordingly, the validation node can verify the validity of the transaction incidental evidence through the Verifier Key (VK), thereby making an operation to accept or reject the transaction.

In step S102, statically registering or dynamically registering the common parameter on the interlink may include 2 implementations.

The first implementation mode is that the ID, PK and VK of a source parallel chain are bound, and the bound information is registered on an interconnection chain through a predetermined Application Programming Interface (API), so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on a source code of the interconnection chain;

and in the second implementation mode, the ID, PK and VK of the source parallel chain are bound, and the source code of the interconnection chain is changed based on the bound information, so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on the changed code.

And binding and registering the parallel chain ID, a generator key (PK) and a Verifier Key (VK) on an interconnection chain, and enabling the parallel chain ID to take effect finally only after most of verifiers in the interconnection chain vote, wherein the parallel chain zero-knowledge proof algorithm public parameter construction process is finished. The specific implementation modes include dynamic registration, static registration and the like.

In some embodiments, the dynamic registration may be: after the parallel chain ID is bound with a generator key (PK) and a Verifier Key (VK), the parallel chain ID is registered to be a service of the mutual identification verification of the interconnection chain through a specific API, the specific mutual identification verification mode of the interconnection chain is not changed, and the code of the interconnection chain is not updated. The static registration may be: and after the parallel chain ID is bound with a generator key (PK) and a Verifier Key (VK), updating the interlink block chain code, so that interlink nodes can verify the cross-chain anonymous transaction sent by the parallel chain, and the consensus and forwarding of the transaction are completed. However, the specific registration method is not limited to the above two methods.

In step S103, an implementation of broadcasting anonymous cross-chain transactions in the source parallel chain may include: generating zero knowledge proof information of anonymous cross-link transaction based on PK; and generating anonymous transaction information according to the zero-knowledge proof information, the cross-chain transaction information, the ID of the source parallel chain and the ID of the destination parallel chain, and broadcasting the anonymous transaction information in the source parallel chain. According to the public parameters, the implementation mode of carrying out parallel chain network consensus verification on the anonymous cross-chain transaction can comprise the following steps: acquiring zero knowledge proving information in anonymous transaction information; zero knowledge proof information was verified according to VK.

Step S103 may comprise the following sub-steps:

s1031, the transaction initiator in the parallel chain generates a zero knowledge proof of the transaction using the generator key (PK). The main inputs of the generator key (PK) are cross-chain anonymous transaction Merkle root hash value, sequence number (generated by pseudo-random function using initiator private key and random number) and other information, and the auxiliary inputs are transaction information, Merkle branch, transaction initiator public and private key privacy information, receiver public key information, and related random number (random number used in generating sequence number).

S1032, combining the transaction main input, the generated zero knowledge proof, the local parallel chain block chain identification, the target parallel chain block chain identification and other information to form the cross-chain anonymous transaction.

S1033, the transaction initiator in the parallel chain broadcasts the cross-chain anonymous transaction formed in step S1032 into the parallel chain.

S1034, the node in the parallel chain receives the cross-chain anonymous transaction generated in step S1032 and verifies the cross-chain anonymous transaction generated in step S1032 using a Verifier Key (VK). If all the nodes in the parallel chain are verified, the process proceeds to step S1035, and if not, the process proceeds to step S1036.

S1035, the cross-chain anonymous transaction generated in step S1032 passes the verification of the node in the parallel chain, is packaged into the block, and after the block is identified in the parallel chain, the block header of the block and the cross-chain anonymous transaction are forwarded to the interlink chain, and then the process proceeds to step S1037.

S1036, the cross-chain anonymous transaction generated in step S1032 is invalid, the transaction is discarded, and the verification and implementation process of the cross-chain anonymous transaction is finished.

S1037, the node in the interlink receives the cross-link anonymous transaction sent out in the step S1035, obtains SPV certification information of the cross-link anonymous transaction according to the block header sent out in the step S1035, verifies that the transaction passes parallel link consensus, and then verifies the cross-link anonymous transaction by using a Verifier Key (VK). If all verification nodes in the interlink pass the verification, the cross-chain anonymous transaction is recorded in the interlink block, and the step S104 is carried out, and if the verification does not pass, the step S1036 is carried out.

In step S104, after the parallel chain network consensus verification passes, the anonymous cross-chain transaction is broadcast in the interconnect chain, so that the verification node in the interconnect chain verifies the anonymous cross-chain transaction, and after the verification passes, the cross-chain transaction is transferred to the target parallel chain. And (5) forwarding the cross-chain anonymous transaction generated in the step S1032 to a target parallel chain block chain and taking effect, and ending the cross-chain anonymous transaction verification and implementation process.

Therefore, the transaction privacy protection method based on the cross-chain can verify and complete the cross-chain transaction under the condition that the privacy information of the cross-chain transaction is not leaked, so that the privacy of the cross-chain transaction is ensured, and the privacy and the safety of the information of the cross-chain transaction participants can be ensured.

FIG. 11 is a flow diagram of a privacy preserving method for anonymous cross-link transactions, according to another embodiment of the invention.

In this embodiment, the cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with an interconnection chain. The method can be applied to the data verification node side of the interconnection chain.

As shown in fig. 11, the method may include the steps of: s111, constructing a source parallel chain for public parameters of anonymous cross-chain transaction; s112, statically registering or dynamically registering the public parameters to an interconnection chain; s113, according to the public parameters, carrying out parallel chain network consensus verification on the anonymous cross-chain transaction broadcasted in the source parallel chain; and S114, after the parallel chain network consensus verification passes, broadcasting the anonymous cross-chain transaction in an interconnection chain.

In step S111, building a common parameter of the source parallel chain for anonymous cross-chain transactions may comprise the sub-steps of: s1111, determining a verification rule function of the source parallel chain for anonymous cross-chain transaction. S1112, converting the verification rule function into a form of ternary vector R1 CS. S1113, the R1CS form is converted into a QAP form of a quadratic arithmetic program. And S1114, generating public parameters based on the zero-knowledge proof algorithm according to the QAP form. The common parameters may include: a generator key PK and a verifier key VK.

In step S112, statically registering or dynamically registering the common parameter on the interlink may include the following 2 implementation manners:

in a first implementation manner, the ID, PK and VK of the source parallel chain are bound, and the bound information is registered on the interconnection chain through a predetermined application programming interface API, so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on a source code of the interconnection chain.

In step S113, anonymous cross-link transactions in the source parallel chain for broadcasting may include: generating zero knowledge proof information of anonymous cross-link transaction based on PK; and generating anonymous transaction information according to the zero-knowledge proof information, the cross-chain transaction information, the ID of the source parallel chain and the ID of the destination parallel chain, and broadcasting the anonymous transaction information in the source parallel chain.

Performing parallel-link network consensus verification on anonymous cross-link transactions according to common parameters may include: acquiring zero knowledge proving information in anonymous transaction information; zero knowledge proof information was verified according to VK.

In addition, in the case of no conflict, those skilled in the art can flexibly adjust the order of the above operation steps or flexibly combine the above steps according to actual needs. Various implementations are not described again for the sake of brevity. In addition, the contents of the various embodiments may be mutually incorporated by reference.

Fig. 12 is a schematic structural diagram of a privacy protecting apparatus for anonymous cross-link transaction according to an embodiment of the present invention.

In this embodiment, the cross-chain transaction is a transaction between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with an interconnection chain.

As shown in fig. 12, a privacy preserving apparatus for anonymous cross-chain transactions may include: a parameter construction module 121, a parameter registration module 122, an interconnection consensus module 123, and a cross-chain transaction module 124. Wherein the parameter construction module 121 can be used for constructing a common parameter of the source parallel chain for anonymous cross-chain transaction; the parameter registration module 122 may be configured to statically register or dynamically register the common parameters on the interlink; the interconnection consensus module 123 may be configured to perform parallel chain network consensus verification on anonymous cross-chain transactions broadcasted in the source parallel chain according to the common parameter; the cross-link transaction module 124 may be configured to broadcast the anonymous cross-link transaction in the interlink after the parallel link network consensus verification passes.

In some embodiments, the parameter construction module 121 may include: the device comprises a function determining unit, a first conversion unit, a second conversion unit and a parameter generating unit. Wherein: the function determination unit may be configured to determine a validation rule function for the source parallel chain for anonymous cross-chain transactions; the first conversion unit may be configured to convert the validation rule function into the form of a ternary vector R1 CS; a second conversion unit may be used to convert the R1CS form into a quadratic arithmetic program QAP form; the parameter generation unit may be adapted to generate the common parameters based on the zero knowledge proof of knowledge algorithm according to the QAP form.

In some embodiments, the common parameters are parameters of a zero-knowledge proof of knowledge algorithm, the common parameters including: a generator key PK and a verifier key VK.

In some embodiments, the parameter registration module 122 may include: an interface registration unit or a code change unit.

The interface registration unit can be used for binding the ID, PK and VK of the source parallel chain and registering the binding information on the interconnection chain through a predetermined Application Programming Interface (API) so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on a source code of the interconnection chain; or, the code changing unit may be configured to bind the ID, PK and VK of the source parallel chain, and change the source code of the interconnect chain based on the bound information, so that the interconnect chain performs interconnect chain consensus verification on an anonymous cross-chain transaction initiated by the source parallel chain based on the changed code.

Fig. 13 is a schematic structural diagram of a privacy protecting apparatus for anonymous cross-link transaction according to another embodiment of the present invention.

The privacy protecting apparatus for anonymous cross-link transaction may include: a transaction acquisition module 131, a consensus verification module 132, and a transaction broadcast module 133. The transaction acquisition module 131 may be configured to acquire anonymous cross-link transactions broadcasted in an interlink; the consensus verification module 132 may be configured to perform an interconnect network consensus verification on the anonymous cross-link transaction according to a public parameter statically or dynamically registered on the interconnect link; the transaction broadcasting module 133 may be configured to broadcast the anonymous cross-link transaction to the destination parallel link after the network consensus verification of the internet passes.

In some embodiments, the common parameters include: a generator key PK and a verifier key VK.

In some embodiments, the consensus verification module 132 may include: an information acquisition unit and an information verification unit.

The information acquisition unit can be used for acquiring zero knowledge proof information in the anonymous transaction information;

the information verification unit may be adapted to verify the zero-knowledge proof information according to VK.

In the above embodiments, the implementation may be wholly or partially realized by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product comprises one or more computer instructions which, when run on a computer, cause the computer to perform the method described in the various embodiments above. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.

It should be noted that the apparatuses in the foregoing embodiments can be used as the execution main body in the methods in the foregoing embodiments, and can implement corresponding processes in the methods to achieve the same technical effects, and for brevity, the contents of this aspect are not described again.

As shown in fig. 14, the framework may include a Central Processing Unit (CPU)141, which may perform various operations performed by the above-described respective embodiments according to a program stored in a Read Only Memory (ROM)142 or a program loaded from a storage section 148 into a Random Access Memory (RAM) 143. In the RAM143, various programs and data necessary for the operation of the system architecture are also stored. The CPU141, ROM 142, and RAM143 are connected to each other via a bus 144. An input/output (I/O) interface 145 is also connected to bus 144.

The following components are connected to the I/O interface 145: an input portion 146 including a keyboard, a mouse, and the like; an output section 147 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 148 including a hard disk and the like; and a communication section 149 including a network interface card such as a LAN card, a modem, or the like. The communication section 149 performs communication processing via a network such as the internet. The drive 1410 is also connected to the I/O interface 145 as needed. A removable medium 1411 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1410 as necessary, so that a computer program read out therefrom is installed into the storage section 148 as necessary.

In particular, according to an embodiment of the present invention, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the invention include a computer program product comprising a computer program tangibly embodied on a machine-readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network through the communication section 149, and/or installed from the removable medium 1411.

The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.

Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.

Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.

Claims

1. A privacy protection method for anonymous cross-chain transactions, wherein the cross-chain transactions are transactions between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with an interlink, the method comprising the following steps:

constructing a common parameter of the source parallel chain for anonymous cross-chain transactions;

statically registering or dynamically registering the public parameters to the interconnection chain;

performing parallel chain network consensus verification on anonymous cross-chain transactions broadcasted in the source parallel chain according to the public parameters;

after the parallel chain network consensus verification passes, broadcasting the anonymous cross-chain transaction in the interconnection chain;

the common parameters include: a generator key PK and a verifier key VK;

the parallel chain network consensus verification of the anonymous cross-chain transaction broadcasted in the source parallel chain according to the public parameters comprises:

generating zero knowledge proof information for the anonymous cross-link transaction based on the PK;

generating anonymous transaction information according to the zero knowledge proof information, the cross-chain transaction information, the ID of the source parallel chain and the ID of the destination parallel chain, and broadcasting the anonymous transaction information in the source parallel chain;

acquiring the zero knowledge proof information in the anonymous transaction information;

verifying the zero knowledge proof information according to the VK.

2. The method of claim 1, wherein the building of the common parameters of the source parallel chain for anonymous cross-chain transactions comprises:

determining a validation rule function for the source parallel chain for anonymous cross-chain transactions;

converting the validation rule function into a form of a ternary vector R1 CS;

converting said R1CS form to a quadratic arithmetic program QAP form;

and generating public parameters based on a zero knowledge proof algorithm according to the QAP form.

3. The method of claim 1, wherein statically registering or dynamically registering the common parameter on the interlink comprises:

binding the ID, PK and VK of the source parallel chain, and registering the binding information on the interconnection chain through a predetermined Application Programming Interface (API) so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on a source code of the interconnection chain;

alternatively, the first and second electrodes may be,

and binding the ID, PK and VK of the source parallel chain, and changing a source code of the interconnection chain based on binding information so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on the changed code.

4. A privacy preserving apparatus for anonymous cross-chain transactions, wherein the cross-chain transactions are transactions between a source parallel chain and a destination parallel chain, and the source parallel chain and the destination parallel chain are respectively connected with an interlink, the apparatus comprising:

the parameter construction module is used for constructing public parameters of the source parallel chain for anonymous cross-chain transaction;

the interconnection consensus module is used for carrying out parallel chain network consensus verification on the anonymous cross-chain transaction broadcasted in the source parallel chain according to the public parameter;

the cross-link transaction module is used for broadcasting the anonymous cross-link transaction in the interconnection link after the parallel link network consensus verification is passed;

the common parameters are parameters based on a zero-knowledge proof algorithm, and the common parameters include: a generator key PK and a verifier key VK;

the interconnection consensus module is specifically configured to:

verifying the zero knowledge proof information according to the VK.

5. The apparatus of claim 4, wherein the parameter construction module comprises:

the function determination unit is used for determining a verification rule function of the source parallel chain for anonymous cross-chain transaction;

a first conversion unit for converting the validation rule function into the form of R1 CS;

a second conversion unit for converting the R1CS form into a QAP form;

and the parameter generating unit is used for generating the public parameters based on the zero knowledge proof algorithm according to the QAP form.

6. The apparatus of claim 4, wherein the parameter registration module comprises:

an interface registration unit, configured to bind the ID, PK and VK of the source parallel chain, and register the bound information on the interconnect chain through a predetermined application programming interface API, so that the interconnect chain performs interconnect chain consensus verification on an anonymous cross-chain transaction initiated by the source parallel chain based on a source code of the interconnect chain;

alternatively, the first and second electrodes may be,

and the code changing unit is used for binding the ID, the PK and the VK of the source parallel chain and changing the source code of the interconnection chain based on the binding information so that the interconnection chain performs interconnection chain consensus verification on anonymous cross-chain transaction initiated by the source parallel chain based on the changed code.

7. A privacy preserving apparatus for anonymous cross-link transactions, comprising:

a memory for storing a program;

a processor for executing a program stored by the memory, the program causing the processor to perform the method of any of claims 1-3.

8. A computer-readable storage medium, comprising: the instructions that, when executed, cause the apparatus to,

the instructions, when executed on a computer, cause the computer to perform the method of any of claims 1-3.