CN113570373B - Responsibility pursuing transaction method and system based on block chain - Google Patents

Responsibility pursuing transaction method and system based on block chain Download PDF

Info

Publication number
CN113570373B
CN113570373B CN202111110316.2A CN202111110316A CN113570373B CN 113570373 B CN113570373 B CN 113570373B CN 202111110316 A CN202111110316 A CN 202111110316A CN 113570373 B CN113570373 B CN 113570373B
Authority
CN
China
Prior art keywords
account
transaction
accounts
sending
receiving
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202111110316.2A
Other languages
Chinese (zh)
Other versions
CN113570373A (en
Inventor
蒋芃
杨晨杰
祝烈煌
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Institute of Technology BIT
Original Assignee
Beijing Institute of Technology BIT
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing Institute of Technology BIT filed Critical Beijing Institute of Technology BIT
Priority to CN202111110316.2A priority Critical patent/CN113570373B/en
Publication of CN113570373A publication Critical patent/CN113570373A/en
Application granted granted Critical
Publication of CN113570373B publication Critical patent/CN113570373B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/389Keeping log of transactions for guaranteeing non-repudiation of a transaction
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/23Updating
    • G06F16/2379Updates performed during online database operations; commit processing
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60Protecting data
    • G06F21/62Protecting access to data via a platform, e.g. using keys or access control rules
    • G06F21/6218Protecting access to data via a platform, e.g. using keys or access control rules to a system of files or objects, e.g. local or distributed file system or database
    • G06F21/6245Protecting personal data, e.g. for financial or medical purposes
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00Payment architectures, schemes or protocols
    • G06Q20/38Payment protocols; Details thereof
    • G06Q20/40Authorisation, e.g. identification of payer or payee, verification of customer or shop credentials; Review and approval of payers, e.g. check credit lines or negative lists
    • G06Q20/405Establishing or using transaction specific rules

Abstract

One or more embodiments of the present specification provide a block chain-based accountable transaction method and system, including establishing an account bound with user identity information; constructing a Merker tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule; according to the accountability pursuit rule, after the transaction of the sending account and the receiving account, all accounts update balance; and the balance of the sending account and the receiving account is updated according to the transaction amount, and the balance of other accounts is unchanged before and after updating. The account-based transaction method is realized by the specification, can protect the privacy of the accounts of two transaction parties and the transaction amount, and has a responsibility tracing function.

Description

Responsibility pursuing transaction method and system based on block chain
Technical Field
One or more embodiments of the present disclosure relate to the field of blockchain technologies, and in particular, to a method and a system for liability-following transaction based on blockchain.
Background
Currently, the Transaction modes based on the blockchain mainly include a Transaction mode based on an Unspent Transaction Output (UTXO) and a Transaction mode based on an account. In the UTXO-based transaction mode, each transaction (transfer record) is recorded in a block instead of an account balance, and since different transactions may correspond to different transaction addresses, the mode can ensure privacy of the transactions, but the mode is difficult to support accountability and cannot be adapted to application requirements of a regulatory agency in a specific scene. In the account-based transaction mode, the account information (including balance, contract code, etc.) is stored using the global status, and after the transaction, the statuses of both parties of the transaction are updated, which does not have privacy of the transaction.
Disclosure of Invention
In view of this, one or more embodiments of the present disclosure are directed to a method and a system for accountable transaction based on a block chain, which can ensure privacy of transaction and support accountability.
In view of the above, one or more embodiments of the present specification provide a block chain-based accountable transaction method, including:
establishing an account bound with user identity information;
constructing a Merker tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
according to the accountability pursuit rule, after the transaction of the sending account and the receiving account, all accounts update balance; and the balance of the sending account and the receiving account is updated according to the transaction amount, and the balance of other accounts is unchanged before and after updating.
Optionally, the accountability rule is a maximum transaction amount within a specific period;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and in the specific period, the transaction amount of the sending account and the receiving account is less than or equal to the maximum transaction amount.
Optionally, the liability pursuit rule is a blacklist for recording an illegal transaction account;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and inquiring the blacklist by the sending account and the receiving account, determining the sending account and the receiving account as legal accounts in response to the fact that the sending account and the receiving account are not in the blacklist, and carrying out transaction between the sending account and the receiving account.
Optionally, for the account recorded in the blacklist, the user corresponding to the account and the transaction content of the account are tracked.
Optionally, the liability pursuing rule is a tax due;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and the transaction amount of the sending account and the receiving account is the tax due.
Optionally, the accountability rule is a frozen account;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: the sending account and/or the receiving account are blocked accounts, and the transaction between the sending account and the receiving account is stopped.
Optionally, any account is an anonymous account in the transaction account set of other accounts; the transaction amounts of the sending account and the receiving account are hidden based on homomorphic commitments and zero knowledge proofs.
Optionally, the transaction amount of the sending account and the receiving account is hidden based on homomorphic commitment and zero knowledge proof, and the method includes:
the sending account generates commitments of the receiving account and other accounts according to the transaction amount; the transaction amount between the sending account and the receiving account is an actual transaction amount, and the transaction amount between the sending account and other accounts is 0;
and after the sending account and the receiving account complete the transaction, updating the balance of all the accounts, determining the commitment of the receiving account as the commitment corresponding to the actual transaction amount by using zero knowledge proof, and determining the commitment of other accounts as the commitment of the transaction amount of 0.
Optionally, the sending account and the receiving account update the balance according to the transaction amount, the balance after the sending account is updated is decreased by the transaction amount, and the balance after the receiving account is updated is increased by the transaction amount.
An embodiment of the present specification further provides a block chain-based accountable transaction system, including:
the account module is used for establishing an account bound with the user identity information;
the account information construction module is used for constructing a Merkel tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
the transaction module is used for updating balance of all accounts after the accounts are sent and received for transaction according to the accountability rule; and the balance of the sending account and the receiving account is updated according to the transaction amount, and the balance of other accounts is unchanged before and after updating.
As can be seen from the above description, in the accountability transaction method and system based on the block chain provided in one or more embodiments of the present specification, an account bound with user identity information is established, an account is used as a node to construct a mekerr tree, according to the accountability rule, after a sending account and a receiving account transact, all accounts update balances, the sending account and the receiving account update balances according to a transaction amount, and balances before and after other accounts are updated do not change. The transaction method of the specification can protect the privacy of the accounts of both transaction parties and the transaction amount and has a responsibility tracing function.
Drawings
In order to more clearly illustrate one or more embodiments or prior art solutions of the present specification, the drawings that are needed in the description of the embodiments or prior art will be briefly described below, and it is obvious that the drawings in the following description are only one or more embodiments of the present specification, and that other drawings may be obtained by those skilled in the art without inventive effort from these drawings.
FIG. 1 is a schematic flow chart of a method according to one or more embodiments of the present disclosure;
FIG. 2 is a block data structure diagram according to one or more embodiments of the present disclosure;
FIG. 3 is a schematic diagram of commitment generation in accordance with one or more embodiments of the present disclosure;
FIG. 4A is a schematic diagram of an experimental group generated commitment experimental result according to one or more embodiments of the present disclosure;
FIG. 4B is a graphical representation of results of an updated balance experiment for an experimental group in accordance with one or more embodiments of the present disclosure;
FIG. 5A is a schematic diagram of an experimental result of generating commitments from another experimental group in accordance with one or more embodiments of the present disclosure;
FIG. 5B is a graphical representation of updated balance test results for another test group in accordance with one or more embodiments of the present disclosure;
FIG. 6 is a block diagram of a system architecture for one or more embodiments of the present description;
FIG. 7 is a schematic diagram of an electronic device in accordance with one or more embodiments of the disclosure.
Detailed Description
For the purpose of promoting a better understanding of the objects, aspects and advantages of the present disclosure, reference is made to the following detailed description taken in conjunction with the accompanying drawings.
It is to be noted that unless otherwise defined, technical or scientific terms used in one or more embodiments of the present specification should have the ordinary meaning as understood by those of ordinary skill in the art to which this disclosure belongs. The use of "first," "second," and similar terms in one or more embodiments of the specification is not intended to indicate any order, quantity, or importance, but rather is used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that the element or item listed before the word covers the element or item listed after the word and its equivalents, but does not exclude other elements or items. The terms "connected" or "coupled" and the like are not restricted to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", and the like are used merely to indicate relative positional relationships, and when the absolute position of the object being described is changed, the relative positional relationships may also be changed accordingly.
As described in the background section, in the transaction mode based on the UTXO, since the receiving address of each transaction may be different, the privacy of the transaction may be ensured, but it is difficult for the monitoring authority to perform tracing when investigating illegal transactions such as money laundering, abnormal financing, and the like. In the account-based transaction mode, the states of both transaction parties are updated after the transaction is completed, and the privacy of both transaction parties cannot be realized.
In view of this, embodiments of the present disclosure provide a accountability-following transaction method based on a block chain, in a transaction mode based on an account, privacy protection of two transaction parties is implemented by updating states of all accounts, and accountability following can be implemented based on the account.
Hereinafter, the technical means of the present disclosure will be described in further detail with reference to specific examples.
As shown in fig. 1 and 2, an embodiment of the present disclosure provides a block chain-based accountable transaction method, including:
s101: establishing an account bound with user identity information;
in this embodiment, to implement the tracing function, an account corresponding to the user identity information one to one is established, when the account is registered, an account is opened using an identity card, a passport, or other identity certificate of the user, and the account can be obtained only after the identity authentication is passed.
S102: constructing a Merkel tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
in this embodiment, all accounts are maintained using a merkel tree, each account being a node of the merkel tree. The account information stored in the node comprises a serial number, a balance, a set accountability rule, a contract code, storage data and the like; wherein, the serial number is used for limiting each transaction to be processed only once; the balance is the sum of the balances of all transactions of the account, and the balance of the transaction is the income minus the expenditure of the account; the contract code is a contract code in an intelligent contract; the stored data comprises related data in the consensus process and the like; the disclaimer rule includes, but is not limited to, a maximum transaction amount, a tax due, an account validity, an account freezing, and the like, and the specific rule may be set according to a requirement of a monitoring authority, which is not specifically limited in this embodiment.
As shown in fig. 2, in some approaches, a block in a block chain includes two parts, namely a block head and a block body, the block head stores a root node of a meikel tree, a block number, a hash value of a previous block, and the like, and the block body stores transaction data.
S103: according to the responsibility tracing rule, after the sending account and the receiving account are transacted, all accounts update balance; and the balance of the sending account and the receiving account is updated according to the transaction amount, and the balance is unchanged before and after the other accounts are updated.
In the embodiment, the accounts are transacted according to the responsibility pursuing rule, in order to realize the privacy of both transaction parties, after the transaction of both transaction parties, all the accounts are updated, and during updating, only the balance of both transaction parties changes, and the balance of other accounts which are not transacted does not change.
The block chain-based accountability transaction method provided by the embodiment comprises the steps of establishing an account bound with user identity information, establishing a Merkel tree by taking the account as a node, and updating balance of all accounts after the accounts are sent and received for transaction according to accountability rules; on one hand, the account is bound with the identity information of the user, so that the user can be conveniently tracked according to the abnormal transaction, on the other hand, the transaction parties need to carry out transaction according to the responsibility tracing rule, the responsibility tracing function is realized, once a certain account carries out transaction according to the responsibility tracing rule, the user can be tracked according to the abnormal transaction, all transaction contents of the user are obtained, and the transaction state of the user is monitored; in the third aspect, after the two transaction parties complete the transaction, the states of all accounts are updated instead of only the states of the two transaction parties, so that the privacy protection of the accounts is realized.
In some embodiments, the accountability rule is a maximum transaction amount within a particular time frame; according to the responsibility-following rule, the transaction between the sending account and the receiving account is as follows: and in a specific period, the transaction amount of the sending account and the receiving account is less than or equal to the maximum transaction amount. By limiting the maximum transaction amount, the transaction amount is prevented from exceeding the limit, the transaction safety of the user can be reminded, and supervision and accountability are facilitated. Optionally, the maximum transaction amount in a specific time frame may be a daily limit, a monthly limit, a single limit, or the like, without limitation.
In some modes, the account information stored in the node further comprises a cumulative transaction total amount within a specific period, and the cumulative transaction total amount and the balance are stored in a committed form, so that the privacy of the transaction amount is guaranteed.
In some embodiments, the disclaimer rule is a blacklist of accounts for which illegal transactions are recorded; according to the responsibility-following rule, the transaction between the sending account and the receiving account is as follows: and inquiring the blacklist by the sending account and the receiving account, determining the sending account and the receiving account as legal accounts in response to the fact that the sending account and the receiving account are not in the blacklist, and carrying out transaction between the sending account and the receiving account. The supervision mechanism and the block chain maintain the blacklist together, each node does not need to store a blacklist, part of nodes can be appointed to maintain the blacklist, and when other nodes need to inquire the blacklist, the blacklist is submitted to the appointed node to be checked. Once the account for carrying out illegal transaction is found, the illegal transaction account and the related account thereof are added into the blacklist, and the blacklist in the supervision agency and the block chain is synchronously updated, so that the user and all transaction contents of the account can be tracked according to the account recorded in the blacklist, and the illegal transaction account can be supervised conveniently by using the blacklist.
In some embodiments, the abnormal fund transaction or the account performing the abnormal operation may be identified as the account of the illegal transaction by combining multiple factors such as data analysis and calculation with experience, and the specific analysis and description about the identification method of the abnormal account is not described in this embodiment.
In some embodiments, the disclaimer rule is tax due; according to the responsibility-following rule, the transaction between the sending account and the receiving account is as follows: and the transaction amount of the sending account and the receiving account is the tax due. The application scenario of this example may be that the tax authority performs tax administration on tax payment enterprises in its jurisdiction area, and may set the taxes due for each enterprise, and each tax payment enterprise pays taxes to the tax authority according to the taxes due. In other scenarios, the taxpayable of the tax payment individual can be set, and after the tax payment period is reached, the tax payment individual account must pay the taxpayable. Therefore, if enterprises or individuals attempt to evade taxes, the supervision authorities can track the enterprises or individuals according to the accounts, the function of tracing accountability is realized, and tax management is facilitated.
In some embodiments, the accountability rule is to freeze an account; according to the responsibility-following rule, the transaction between the sending account and the receiving account is as follows: the sending account and/or the receiving account are blocked accounts, and the transaction between the sending account and the receiving account is stopped. By using the method of the embodiment, for an account which is determined to be a money laundering account or suspected money laundering account or may perform other illegal transactions, the account can be blocked by setting a accountability rule, and the transaction related to the account can be prohibited, and meanwhile, information recorded on a block chain, such as transaction content and transaction state related to the account, can be tracked, and the account can be supervised, so that accountability is realized. In addition, for the frozen account, the user can unfreeze through proof, and the transaction can be normally carried out after unfreezing.
In some embodiments, any account is aggregated as an anonymous account among the transaction accounts of other accounts; the transaction amounts of the sending account and the receiving account are hidden based on homomorphic commitments and zero knowledge proofs. Therefore, in the account-based transaction process, the accounts in the transaction account set owned by the account are all anonymous accounts, so that the exposure of account information is avoided, and the privacy protection of the sending account and the receiving account can be realized; the two transaction parties carry out transaction based on the homomorphic commitment protocol and the zero knowledge proof, so that the exposure of transaction amount is avoided, and the privacy protection of the transaction amount can be realized.
As shown in connection with FIG. 3, in some embodiments, assume that there are n accounts { U }1,U2,…,Un}, sending account UsTo the receiving account UtTransferring X currencies, i.e. X transaction amount, U of both partiess、UtInquiring the blacklist, judging whether the other party of the transaction is in the blacklist, and if both parties of the transaction are not in the blacklist, both parties of the transaction are legal accounts; next, the sending account U is judgedsWhether the balance is more than or equal to the transaction amount or not, if the current balance is more than or equal to the transaction amount, continuing to carry out transaction; sending account UsGenerating n-1 commitments c1,c2,…,cs-1,cs+1,…,cnWherein, the method for generating the commitment comprises the following steps: sending account selection n-1 random numbers
Figure 274563DEST_PATH_IMAGE001
And calculating:
Figure 129387DEST_PATH_IMAGE002
(1)
Figure 112386DEST_PATH_IMAGE003
(2)
wherein g and h are generators,
Figure 994015DEST_PATH_IMAGE004
g is a prime p-order cyclic group;
Figure 277229DEST_PATH_IMAGE005
Figure 302954DEST_PATH_IMAGE006
and is
Figure 38828DEST_PATH_IMAGE007
For the receiving account, bt=1,
Figure 706570DEST_PATH_IMAGE008
Figure 578711DEST_PATH_IMAGE009
For other accounts, biAnd = 0. That is, the transaction amount between the sending account and the receiving account is the actual transaction amount X, and the transaction amount between the sending account and the other account is actually 0, which may be expressed as:
Figure 40917DEST_PATH_IMAGE010
(3)
after the transaction between the sending account and the receiving account is completed, the balance of all accounts is updated, and the commitment c is determined by using zero knowledge prooftThe other commitments are commitments corresponding to the transaction amount X and the commitments are commitments corresponding to the transaction amount 0. Where the zero knowledge proof is expressed as:
Figure 998508DEST_PATH_IMAGE011
(4)
wherein the content of the first and second substances,
Figure 204362DEST_PATH_IMAGE012
for the zero knowledge proof generated, PoK represents the zero knowledge proof generation process.
After the certification, updating the money amounts of all accounts, wherein the calculation method comprises the following steps:
Figure 196588DEST_PATH_IMAGE013
(5)
wherein sending the updated balance of the account
Figure 95274DEST_PATH_IMAGE014
The transaction amount X is reduced, the transaction amount X is increased by the balance after the account updating is received, and the balance is not only the accounts of the two parties of the transactionThe balance of the account of the user before and after updating is unchanged, and thus, one transaction is completed. Therefore, the balance of all accounts is updated through homomorphic commitment and zero knowledge proof, and the leakage of the received account information and the transfer information can be avoided.
In some embodiments, a threat model is established based on the blockchain accountable transaction method provided by the present embodiment, and threat conditions that may be faced by the blockchain implementing the accountable transaction method are analyzed. In particular, assuming that the adversary is semi-honest, the semi-honest adversary fully complies with the gaming guidelines, but always attempts to break established security goals. An adversary may eavesdrop on the public status of each account and attempt to learn from the eavesdropped information the sending account, receiving account, and transaction amount for the transaction. When the adversary is the party to the transaction, the adversary will attempt to conduct illegal transactions without being identified, such as unlimited consumption, tax evasion, money laundering, etc., while not revealing privacy. It is assumed in this example that there is no hooking behavior between any two entities.
The present example makes the following assumptions for the threat model: first, the adversary can access all common information, such as the state recorded on the blockchain, the system public key, and data transmitted through a common channel. Second, it is assumed that certain secret information, such as the sending account, the receiving account, and the transaction amount, as well as the random number selected for each account, can only be obtained by the key. If the adversary knows to obtain the above information, the security and privacy of the whole system will be directly damaged. However, the key-holding authority may obtain such secret information when needed. Finally, it is assumed that the currency in which the transaction is conducted is valid, i.e., allowed to be spent. The center of gravity of the threat model is a money transfer without concern for other processes such as money casting, nor any evidence of money validity.
The following describes the effects of the accountable transaction method according to the present specification with reference to the experimental results.
Selecting a terminal configured with Intel (R) Celeron (R) 3205 @1.50GHz kernel to realize the method, wherein the operating system is a Linux version, the version number is 4.15.0-99-genetic and the memory is 2G. The PBC library is applied in the experiment, and the programming language is python. The parameters in the experiment are configured with a random number r =160 bits and the order q =512 bits of the base domain, thereby generating a cyclic group.
In the experiment, the time of commitment and balance updating is tested by setting different variables in experiment groups, and each experiment group has only one variable under the same configuration. Number of accounts niAnd a transaction amount xiPossibly two variables affecting the operation efficiency, and the change of the operation time is tested by adjusting the values of the two variables.
And constructing two experimental groups, wherein the anonymous transaction account set constructed in the two experimental groups has the same balance initial value corresponding to each account in the anonymous transaction account set. In the first experimental group, the transaction amount is set to x =10, the account number is used as a test variable, and n is respectively taken as a value0=100,n1=200,n2=300,n3=400,n4=500, test commitment generation time and time change of balance update. In the second experimental group, the account number is set to n =100, and the transaction amount x is setiAs test variables, the values x are taken separately0=10,x1=100,x2=1000,x3=10000,x4=100000,x5=1000000, test commitment generation time and time change of balance update.
When n is shown in FIGS. 4A and 4B0If =100, the time to generate the commitment is 0.291s, the time to update the balance is 0.004 s, and n is4The time to generate commitments when =500 is increased to 1.36 seconds, and the time to update balances is 0.008 seconds. Therefore, the time for generating the committed running time and the time for updating the balance are increased linearly along with the increase of the number of the accounts, the influence of the size of the transaction account set on the updating balance is small, and the updating balance does not cause too much calculation cost. The time to update the balance increases only 0.001 second for every 100 increments of the number of accounts, indicating that the method of the present specification can accommodate a large number of accounts. As the number of accounts increases, the time cost of generating the commitment increases more because the exponentiation operation to generate the commitment requires more computational cost, but such an increase does not have a greater impact on the overall trading method.
As shown in fig. 5A and 5B, the time to generate the commitment fluctuates around 0.280 seconds, and the time to update the balance fluctuates around 0.0035 seconds, both of which fluctuate within a small range, indicating that the transaction amount has little influence on the time to generate the commitment and the time to update the commitment, because the calculation cost consumed to generate the commitment is the same regardless of the transaction amount, and slight fluctuations in the time cost generated in the experiment may be due to a system reason. By combining the experimental results, the accountable transaction method provided by the specification can efficiently complete various functions.
It should be noted that the method of one or more embodiments of the present disclosure may be performed by a single device, such as a computer or server. The method of the embodiment can also be applied to a distributed scene and completed by the mutual cooperation of a plurality of devices. In such a distributed scenario, one of the devices may perform only one or more steps of the method of one or more embodiments of the present disclosure, and the devices may interact with each other to complete the method.
It should be noted that the above description describes certain embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims may be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing may also be possible or may be advantageous.
As shown in fig. 6, an embodiment of the present specification further provides a block chain-based accountable transaction system, including:
the account module is used for establishing an account bound with the user identity information;
the account information construction module is used for constructing a Merkel tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
the transaction module is used for updating balance of all accounts after the accounts are sent and received for transaction according to the responsibility-pursuing rule; and the balance of the sending account and the receiving account is updated according to the transaction amount, and the balance is unchanged before and after the other accounts are updated.
For convenience of description, the above system is described with the functions divided into various modules, which are described separately. Of course, the functionality of the modules may be implemented in the same one or more software and/or hardware implementations in implementing one or more embodiments of the present description.
The system of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Fig. 7 is a schematic diagram illustrating a more specific hardware structure of an electronic device according to this embodiment, where the electronic device may include: a processor 1010, a memory 1020, an input/output interface 1030, a communication interface 1040, and a bus 1050. Wherein the processor 1010, memory 1020, input/output interface 1030, and communication interface 1040 are communicatively coupled to each other within the device via bus 1050.
The processor 1010 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more Integrated circuits, and is configured to execute related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, or the like. The memory 1020 may store an operating system and other application programs, and when the technical solution provided by the embodiments of the present specification is implemented by software or firmware, the relevant program codes are stored in the memory 1020 and called to be executed by the processor 1010.
The input/output interface 1030 is used for connecting an input/output module to input and output information. The i/o module may be configured as a component in a device (not shown) or may be external to the device to provide a corresponding function. The input devices may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output devices may include a display, a speaker, a vibrator, an indicator light, etc.
The communication interface 1040 is used for connecting a communication module (not shown in the drawings) to implement communication interaction between the present apparatus and other apparatuses. The communication module can realize communication in a wired mode (such as USB, network cable and the like) and also can realize communication in a wireless mode (such as mobile network, WIFI, Bluetooth and the like).
Bus 1050 includes a path that transfers information between various components of the device, such as processor 1010, memory 1020, input/output interface 1030, and communication interface 1040.
It should be noted that although the above-mentioned device only shows the processor 1010, the memory 1020, the input/output interface 1030, the communication interface 1040 and the bus 1050, in a specific implementation, the device may also include other components necessary for normal operation. In addition, those skilled in the art will appreciate that the above-described apparatus may also include only those components necessary to implement the embodiments of the present description, and not necessarily all of the components shown in the figures.
The electronic device of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, and has the beneficial effects of the corresponding method embodiment, which are not described herein again.
Computer-readable media of the present embodiments, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, is limited to these examples; within the spirit of the present disclosure, features from the above embodiments or from different embodiments may also be combined, steps may be implemented in any order, and there are many other variations of different aspects of one or more embodiments of the present description as described above, which are not provided in detail for the sake of brevity.
In addition, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown in the provided figures, for simplicity of illustration and discussion, and so as not to obscure one or more embodiments of the disclosure. Furthermore, devices may be shown in block diagram form in order to avoid obscuring the understanding of one or more embodiments of the present description, and this also takes into account the fact that specifics with respect to implementation of such block diagram devices are highly dependent upon the platform within which the one or more embodiments of the present description are to be implemented (i.e., specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that one or more embodiments of the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative instead of restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic ram (dram)) may use the discussed embodiments.
It is intended that the one or more embodiments of the present specification embrace all such alternatives, modifications and variations as fall within the broad scope of the appended claims. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of one or more embodiments of the present disclosure are intended to be included within the scope of the present disclosure.

Claims (8)

1. A accountability trading method based on a block chain is characterized by comprising the following steps:
establishing an account bound with user identity information;
constructing a Merker tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
according to the accountability pursuit rule, after the transaction of the sending account and the receiving account, all accounts update balance; wherein any account is an anonymous account in the transaction accounts of other accounts;
the transaction amount of the sending account and the receiving account is hidden based on homomorphic commitments and zero knowledge proofs, and the method comprises the following steps:
the sending account generates commitments of the receiving account and other accounts according to the transaction amount; the transaction amount between the sending account and the receiving account is an actual transaction amount, and the transaction amount between the sending account and other accounts is 0;
the method for generating the commitment comprises the following steps: setting the account number as n and the transaction amount as X, sending an account UsSelecting n-1 random numbers
Figure 59811DEST_PATH_IMAGE001
Sending account UsGenerating n-1 commitments c1,c2,…,cs-1,cs+1,…,cnAnd calculating:
Figure 240257DEST_PATH_IMAGE002
(1)
Figure 698920DEST_PATH_IMAGE003
(2)
wherein g and h are generators,
Figure 41039DEST_PATH_IMAGE004
g is a prime p-order cyclic group; for the receiving account, biFor other accounts, b =1i=0,riIs the ith random number, ciIs the ith commitment;
after the sending account and the receiving account complete the transaction, the balance of all the accounts is updated, the commitment of the receiving account is determined to be the commitment corresponding to the actual transaction amount by using zero knowledge proof, and the commitments of other accounts are the commitments with the transaction amount of 0;
the method of zero knowledge proof is as follows:
Figure 483522DEST_PATH_IMAGE005
(4)
wherein the content of the first and second substances,
Figure 202079DEST_PATH_IMAGE006
for the generated zero knowledge proof, the PoK represents the zero knowledge proof generation process;
the method for updating the sum of all accounts is as follows:
Figure 515249DEST_PATH_IMAGE007
(5)
wherein Ls is the balance before the update of the sending account,
Figure 293849DEST_PATH_IMAGE008
to send an updated balance of the account, ctTo receive commitments from an account, Li is the balance before update for other accounts,
Figure 958049DEST_PATH_IMAGE009
updated balances for other accounts.
2. The method of claim 1, wherein the accountability rule is a maximum transaction amount within a specified time frame;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and in the specific period, the transaction amount of the sending account and the receiving account is less than or equal to the maximum transaction amount.
3. The method of claim 1, wherein the disclaimer rule is a blacklist of accounts for which illegal transactions are recorded;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and inquiring the blacklist by the sending account and the receiving account, determining the sending account and the receiving account as legal accounts in response to the fact that the sending account and the receiving account are not in the blacklist, and carrying out transaction between the sending account and the receiving account.
4. The method of claim 3, further comprising:
and tracking the user corresponding to the account and the transaction content of the account for the account recorded in the blacklist.
5. The method of claim 1, wherein the disclaimer rule is a tax due;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: and the transaction amount of the sending account and the receiving account is the tax due.
6. The method of claim 1, wherein the accountability rule is to freeze an account;
according to the responsibility-pursuing rule, the transaction of the sending account and the receiving account is as follows: the sending account and/or the receiving account are blocked accounts, and the transaction between the sending account and the receiving account is stopped.
7. The method of claim 1, wherein the sending account and the receiving account update the balance according to the transaction amount, such that the updated balance of the sending account is decreased by the transaction amount and the updated balance of the receiving account is increased by the transaction amount.
8. A blockchain-based accountable transaction system, comprising:
the account module is used for establishing an account bound with the user identity information;
the account information construction module is used for constructing a Merkel tree by taking the account as a node; the node comprises balance and a preset responsibility-following rule;
the transaction module is used for updating balance of all accounts after the accounts are sent and received for transaction according to the accountability rule; wherein any account is an anonymous account in the transaction accounts of other accounts;
the transaction amount of the sending account and the receiving account is hidden based on homomorphic commitments and zero knowledge proofs, and the method comprises the following steps:
the sending account generates commitments of the receiving account and other accounts according to the transaction amount; the transaction amount between the sending account and the receiving account is an actual transaction amount, and the transaction amount between the sending account and other accounts is 0;
the method for generating the commitment comprises the following steps: setting the account number as n and the transaction amount as X, sending an account UsSelecting n-1 random numbers
Figure 480297DEST_PATH_IMAGE010
Sending account UsGenerating n-1 commitments c1,c2,…,cs-1,cs+1,…,cnAnd calculating:
Figure 913552DEST_PATH_IMAGE011
(1)
Figure 863054DEST_PATH_IMAGE012
(2)
wherein the content of the first and second substances,g. h is a generator, and h is a generator,
Figure 421074DEST_PATH_IMAGE013
g is a prime p-order cyclic group; for the receiving account, biFor other accounts, b =1i=0,riIs the ith random number, ciIs the ith commitment;
after the sending account and the receiving account complete the transaction, the balance of all the accounts is updated, the commitment of the receiving account is determined to be the commitment corresponding to the actual transaction amount by using zero knowledge proof, and the commitments of other accounts are the commitments with the transaction amount of 0;
the method of zero knowledge proof is as follows:
Figure 871647DEST_PATH_IMAGE015
(4)
wherein the content of the first and second substances,
Figure 34775DEST_PATH_IMAGE006
for the generated zero knowledge proof, the PoK represents the zero knowledge proof generation process;
the method for updating the sum of all accounts is as follows:
Figure 282741DEST_PATH_IMAGE016
(5)
wherein Ls is the balance before the update of the sending account,
Figure 796899DEST_PATH_IMAGE017
to send an updated balance of the account, ctTo receive commitments from an account, Li is the balance before update for other accounts,
Figure 520005DEST_PATH_IMAGE018
updated balances for other accounts.
CN202111110316.2A 2021-09-23 2021-09-23 Responsibility pursuing transaction method and system based on block chain Active CN113570373B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111110316.2A CN113570373B (en) 2021-09-23 2021-09-23 Responsibility pursuing transaction method and system based on block chain

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111110316.2A CN113570373B (en) 2021-09-23 2021-09-23 Responsibility pursuing transaction method and system based on block chain

Publications (2)

Publication Number Publication Date
CN113570373A CN113570373A (en) 2021-10-29
CN113570373B true CN113570373B (en) 2022-02-11

Family

ID=78174007

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111110316.2A Active CN113570373B (en) 2021-09-23 2021-09-23 Responsibility pursuing transaction method and system based on block chain

Country Status (1)

Country Link
CN (1) CN113570373B (en)

Family Cites Families (23)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106549749B (en) * 2016-12-06 2019-12-24 杭州趣链科技有限公司 Block chain privacy protection method based on addition homomorphic encryption
CN106845960B (en) * 2017-01-24 2018-03-20 上海壹账通区块链科技有限公司 Method for secure transactions and system based on block chain
CN107483198B (en) * 2017-09-25 2019-11-12 中国科学院信息工程研究所 A kind of block catenary system supervised and method
CN107819753B (en) * 2017-10-31 2020-02-18 捷德(中国)科技有限公司 Block chain transaction system and method without complete anonymity
CN108241979B (en) * 2017-12-20 2021-03-16 深圳壹账通智能科技有限公司 Multi-account book transfer method based on block chain, electronic device and readable storage medium
CN110766549A (en) * 2018-07-27 2020-02-07 翟红鹰 Digital asset safe transaction method and device, computer equipment and storage medium
CN109325747B (en) * 2018-08-30 2020-06-09 阿里巴巴集团控股有限公司 Remittance method and device based on block chain
CN109165946A (en) * 2018-09-25 2019-01-08 安徽灵图壹智能科技有限公司 A kind of transaction verification system based on block chain
CN109272325A (en) * 2018-09-25 2019-01-25 安徽灵图壹智能科技有限公司 A kind of distributed block chain identity card
CN109377224A (en) * 2018-10-25 2019-02-22 阿里巴巴集团控股有限公司 Block chain method of commerce and device, electronic equipment
CN112381646A (en) * 2018-10-31 2021-02-19 创新先进技术有限公司 Privacy transaction based on block chain and application method and device thereof
CA3041157C (en) * 2018-11-07 2020-09-08 Alibaba Group Holding Limited Blockchain system supporting public and private transactions under account models
EP3542336B1 (en) * 2018-11-07 2021-01-27 Advanced New Technologies Co., Ltd. Blockchain data protection based on account note model with zero-knowledge proof
CN109598601A (en) * 2018-12-06 2019-04-09 北京瑞卓喜投科技发展有限公司 Account book monitoring method and account book monitoring system based on block chain
CN110059494B (en) * 2019-04-17 2020-11-03 深圳启元信息服务有限公司 Privacy protection method for block chain transaction data and block chain system
CN110473105B (en) * 2019-08-20 2024-01-16 深圳市迅雷网络技术有限公司 Block chain transaction settlement method, system and related equipment
CN111881483B (en) * 2020-08-07 2024-02-23 广州运通链达金服科技有限公司 Resource account binding method, device, equipment and medium based on blockchain
CN112115201B (en) * 2020-09-16 2021-11-16 建信金融科技有限责任公司 Transaction processing method and device based on block chain and transaction tracking method and device
CN112200571B (en) * 2020-10-09 2022-04-22 支付宝(杭州)信息技术有限公司 Resource distribution method and device based on block chain and electronic equipment
CN112200568B (en) * 2020-10-09 2022-05-13 支付宝(杭州)信息技术有限公司 Block chain based account creation method and device and electronic equipment
CN112069526A (en) * 2020-10-15 2020-12-11 深圳壹账通智能科技有限公司 Block chain-based account attribute processing method and device and storage medium
CN113269639A (en) * 2021-05-06 2021-08-17 众连智能科技有限公司 Business processing method, device, equipment and medium based on block chain intelligent contract
CN113222758A (en) * 2021-05-08 2021-08-06 华中科技大学 Alliance chain transaction information monitoring method, system and terminal on the premise of privacy

Also Published As

Publication number Publication date
CN113570373A (en) 2021-10-29

Similar Documents

Publication Publication Date Title
US11847529B2 (en) Architectures, systems and methods for program defined transaction system and decentralized cryptocurrency systems
CN110766550B (en) Asset query method and device based on block chain and electronic equipment
US20210089300A1 (en) System and method for identifying particular computer platform associated with potential altered or falsified execution of copy of software
US11321783B2 (en) Method and device for data processing based on blockchain
CN111460511B (en) Federal learning and virtual object distribution method and device based on privacy protection
CN109359971B (en) Block chain transaction method and device and electronic equipment
US20200074459A1 (en) Method, apparatus and electronic device for blockchain transactions
US11676117B2 (en) Blockchain compliance verification network
Bader et al. Smart contract-based car insurance policies
CN109947848A (en) Card method and apparatus are deposited based on block chain
US20190114707A1 (en) Distribution of Blockchain Tokens
EP3819803A1 (en) Blockchain-based data processing method and apparatus
CN111818095A (en) Tax refunding method and device based on block chain and electronic equipment
Baliker et al. On the applications of blockchain in FinTech: advancements and opportunities
CN113191869A (en) Digital currency account control method and device
Varghese et al. Cryptocurrency security and privacy issues: A research perspective
CN113807802A (en) Block chain-based labor worker salary settlement method and related equipment
CN113570373B (en) Responsibility pursuing transaction method and system based on block chain
CN116451280A (en) Asset management method and device based on blockchain
CN114444120A (en) Financing method and device based on block chain, electronic equipment and storage medium
GB2572339A (en) System and method for data processing using tokens
Blancaflor et al. The Prevalence of Digital Currency in E-commerce: A Case Study
CN113064899B (en) Method and device for storing asset securities type general evidence transaction certificates and electronic equipment
US20240127063A1 (en) Architectures, systems and methods for program defined transaction system and decentralized cryptocurrency system
Rajpoot et al. A Comprehensive Analysis of Block Chain-Based Crypto Currency Systems for Real-World Adoption

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant