Scalable byzantine fault-tolerant protocol with partial tee support
US-10887090-B2 · Jan 5, 2021 · US
US12073387B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-12073387-B2 |
| Application number | US-202217977814-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 31, 2022 |
| Priority date | Jun 20, 2017 |
| Publication date | Aug 27, 2024 |
| Grant date | Aug 27, 2024 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A computer-implemented method to participate in a token transfer process for transferring a first quantity of token from a sender node to a recipient node using a blockchain is disclosed. The token transfer process includes a plurality of participating nodes and execution of a set of indirect token transactions between multiple pairs of the participating nodes. The method is implemented at a participating node performing steps of obtaining a subset of the indirect token transactions for which the participating node is either an input node or an output node, collaborating with a respective second participating node included in each indirect token transaction of the subset to generate a commitment channel for the indirect token transaction between the participating node and a second participating node, and collaborating with all other participating nodes in executing the indirect token transactions of the subset using the generated commitment channels.
Opening claim text (preview).
The invention claimed is: 1. A computer-implemented method to participate in a token transfer process for transferring a first quantity of tokens from a sender node to a recipient node using a blockchain, the token transfer process including a plurality of participating nodes and execution of a set of indirect token transactions between multiple pairs of the participating nodes, the sender node and the recipient node being included in the token transfer process as participating nodes, the method, implemented at a participating node, comprising: obtaining a subset of the set of indirect token transactions, the subset including those transactions for which the participating node is either an input node or an output node, wherein the set of indirect token transactions is generated based on the first quantity of tokens and a predefined number of transaction rounds in the token transfer process; for each indirect token transaction in the subset, collaborating with a respective second participating node included in the indirect token transaction to generate a commitment channel for the indirect token transaction between the participating node and the second participating node; and collaborating with all other participating nodes in executing the indirect token transactions of the subset using the generated commitment channels; wherein generating the commitment channel for each indirect token transaction comprises: calculating a value for the commitment channel derived from a first public key (Q), wherein each participating node has a key share of a first private key (k) corresponding to the first public key: collaborating with the second participating node to, using the value, generate a first blockchain transaction (T c ) for committing an indirect quantity of tokens to transfer to an output address of the indirect token transaction; generating a second blockchain transaction (T r,0 ) that returns the committed indirect quantity of tokens to an input address of the indirect token transaction; and generating a third blockchain transaction (T t ) for executing transfer of the committed indirect quantity of tokens to the output address of the indirect token transaction. 2. The computer-implemented method claimed in claim 1 , wherein the first blockchain transaction (T c ) is submitted to the blockchain after the second blockchain transaction (T r,0 ) is signed by an output node of the indirect token transaction. 3. The computer-implemented method claimed in claim 1 , wherein the second blockchain transaction (T r,0 ) includes a transaction parameter (nLockTime) specifying a point in time after which the second blockchain transaction becomes eligible for submission to the blockchain. 4. The computer-implemented method claimed in claim 1 , wherein the set of indirect token transactions is further based on a predefined number of transactions per transaction round. 5. The computer-implemented method claimed in claim 1 , wherein the participating nodes include a plurality of sender-recipient pairs and wherein the set of indirect token transactions is generated based on respective quantities of tokens associated with the plurality of sender-recipient pairs. 6. The computer-implemented method claimed in claim 1 , wherein, for each indirect token transaction of the set, an indirect quantity of tokens for the indirect token transaction is less than a threshold value that is dependent on a committed quantity of tokens made available by a transferor. 7. A computing device to participate in a token transfer process including a plurality of participating nodes, the computing device being one of the participating nodes, the computing device comprising: a processor; memory; a network interface to provide network connectivity; and a blockchain application containing computer-executable instructions that, when executed by the processor, cause the processor to carry out the computer-implemented method claimed in claim 1 . 8. A non-transitory processor-readable medium storing processor-executable instructions to participate in a token transfer process including a plurality of participating nodes, wherein the processor-executable instructions, when executed by a processor in one of the participating nodes, cause the processor to carry out the computer-implemented method claimed in claim 1 .
Business processing using cryptography · CPC title
involving a neutral party, e.g. certification authority, notary or trusted third party [TTP] · CPC title
Financial cryptography, e.g. electronic payment or e-cash · CPC title
involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD · CPC title
using hash chains, e.g. blockchains or hash trees · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.