Blockchain-implemented methods and systems for authorisation based on bilinear map accumulators
Abstract
The invention relates to distributed ledger technologies such as consensus-based blockchains. Computer-implemented methods for locking and unlocking transaction inputs and outputs are described. The invention is implemented using a blockchain network. A group of entities form a group in with membership may be proven using an accumulation tree. A variety of methods are described for generating the accumulation tree, including methods that use a central authority and methods that use a decentralized protocol in place of the central authority. In various implementations, parties are able to unlock transaction outputs that are based on group membership without revealing their identity generally.
Claims
exact text as granted — not AI-modifiedWhat is claimed is:
1 . A computer-implemented verification method comprising:
generating a digest of an accumulation tree, each element of the accumulation tree representing a computer system in a set of computer systems; generating a record for insertion into a distributed data structure, the record containing authorization information that is based at least in part on the digest; and causing the record to be inserted into the distributed data structure.
2 . The method of claim 1 further comprising using the record to verify a blockchain transaction.
3 . The computer-implemented method claimed in claim 1 , wherein:
the record includes a locking script; and the authorization information identifies a hash of a local digest of the accumulation tree.
4 . The computer-implemented method of claim 1 , wherein:
the record includes an unlocking script; and the authorization information identifies a number derived from a local digest represented by a point on an elliptic curve.
5 . The computer-implemented method of claim 1 , wherein:
the record includes an unlocking script; and the authorization information identifies a number derived from a global digest represented by a point on an elliptic curve.
6 . The computer-implemented method of claim 1 , wherein a structure of the accumulation tree is determined based at least in part on an organisational structure associated with the set of computer systems.
7 . The computer-implemented method of claim 1 , wherein:
a set of tree parameters are negotiated amongst the set of computer systems, the set of tree parameters including a tree depth and a number of child nodes per intermediate node; and the accumulation tree is constructed in accordance with the set of tree parameters.
8 . The computer-implemented method of claim 1 , wherein the set of computer systems share information with each other that allows each computer system to reconstruct a common secret and a global digest of the accumulation tree.
9 . The computer-implemented method of claim 1 , wherein:
a subset of the set of computer systems share information of the subset with other members of the subset so that members of the subset are able to determine a local digest for the subset; and computer systems that are in the set of computer systems and not in the subset are not provided with the information and are unable to determine the local digest.
10 . The computer-implemented method of claim 9 , wherein the computer systems that are in the set of computer systems and not in the subset are provided with a hash of a local digest of a parent node of the subset of computer systems.
11 . The computer-implemented method of claim 1 , further comprising generating a witness that, in combination with the digest, proves membership in the set of computer systems.
12 . The computer-implemented method of claim 1 , wherein:
membership in the set of computer systems is determined by an authoritative computer system; and the authoritative computer system establishes, amongst the set of computer systems, a shared set of parameters associated with the accumulation tree.
13 . The computer-implemented method of claim 1 , wherein each computer system in the set of computer systems shares a hash of a credential of the computer system with other members of the set so that each member of the set is able to determine a global digest of the accumulation tree.
14 . The computer-implemented method of claim 1 , wherein:
the distributed data structure is a blockchain; and the record is a Bitcoin transaction record.
15 . A system, comprising:
a processor; and memory including executable instructions that, as a result of execution by the processor, causes the system to perform the computer-implemented method of claim 1 .
16 . A non-transitory computer-readable storage medium having stored thereon executable instructions that, as a result of being executed by a processor of a computer system, cause the computer system to at least perform the computer-implemented method of claim 1 .Join the waitlist — get patent alerts
Track US2024022425A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.