IP Library Granted Patent US 12,627,517
Granted Patent B2
US 12,627,517 · App. 19/038,599 · Granted May 12, 2026

Systems and methods for performing secure transactions on blockchain

Inventors: Keir Finlow-Bates (Eura, FI); Bjorn Markus Jakobsson (New York, NY)
Assignee: Artema Labs, Inc
H04L9/50H04L9/0869H04L9/3213H04L9/3236
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,627,517
App. No.
19/038,599
Granted
May 12, 2026
Kind
B2
Abstract

Systems and methods for securing transactions in accordance with various embodiments of the invention are illustrated. One embodiment includes a method for confirming token ownership rights. The method generates a pre-image value using a random number generator. The method generates an action request that corresponds to an action performed cryptographic token(s). The method derives a commit output based on the pre-image value. The method generates a commit request that obfuscates the action request based on the commit output and submits the commit request to an immutable ledger. The method receives a confirmation when the commit request is approved by the ledger. When a reveal request referencing the commit output is published, the method receives a confirmation of at least one of: the reveal request being published, that the reveal request comprises a reference to the commit output, or that the action request has been approved.

Claims (70)

1 . A method for confirming token ownership rights, the method comprising:

generating, using a processor, a pre-image value, wherein the pre-image value is generated using a random number generator;

generating, using the processor, an action request, wherein the action request corresponds to an action performed for a set of at least one particular cryptographic token;

deriving, using the processor, a commit output, wherein the commit output:

is derived based, at least in part, on the pre-image value; and

references at least one condition for the action;

generating, using the processor, a commit request, wherein the commit request obfuscates the action request based on the commit output;

submitting, using the processor, the commit request to a particular immutable ledger;

receiving a first confirmation when the commit request is approved by the particular immutable ledger; and

after a reveal request referencing the commit output is published, receiving, based on the reveal request, a second confirmation

that the action request has been approved, wherein the reveal request referencing the commit output is published following a verification that:

the set of at least one particular cryptographic token is in possession of a generating party for the commit output;

the at least one condition for the action occurred; and

the reveal request comprises a reference to the commit output.

2 . The method of claim 1 , wherein:

the action request comprises a transfer request, transferring the set of at least one particular cryptographic token to a receiving address; and

the particular immutable ledger is a blockchain.

3 . The method of claim 2 , wherein the reveal request is submitted to the particular immutable ledger by the receiving address.

4 . The method of claim 1 , wherein deriving the commit output comprises applying at least one one-way function to the pre-image value and at least one message comprising an action-associated value.

5 . The method of claim 4 , wherein a first function of the at least one one-way function is a cryptographic hash function.

6 . The method of claim 5 , wherein the action-associated value included in a first message of the at least one message comprises at least one of:

an account identifier for each of one or more parties to the action;

a token type value, where the token type value numerically identifies a token type for the set of at least one particular cryptographic token; or

an address value, where the address value corresponds to a blockchain address.

7 . The method of claim 4 , wherein the second confirmation depends on whether applying the at least one one-way function to the commit output and the action-associated value referenced in the reveal request produces the same result as applying the at least one one-way function to the commit output and the action-associated value referenced in the commit request.

8 . The method of claim 1 , wherein:

the reveal request is submitted to a second immutable ledger; and

a node, monitoring both the particular immutable ledger and the second immutable ledger, determines whether the reveal request comprises the reference to the commit output.

9 . The method of claim 8 , wherein the action request corresponding to the commit request is approved by the second immutable ledger.

10 . The method of claim 1 , wherein the commit request corresponds to at least one additional request for a set of at least one additional cryptographic token.

11 . The method of claim 1 , wherein the commit output further references at least two addresses representing potential participants to the action.

12 . The method of claim 11 , wherein the generating party is identified by one of the at least two addresses representing potential participants to the action.

13 . The method of claim 11 , wherein a fraction of the at least one particular cryptographic token is:

exchanged in the transfer; and

identified in the reveal request.

14 . The method of claim 1 , wherein the generating party is selected at least in part based on the at least one condition referenced in the commit output.

15 . The method of claim 1 , wherein:

the action is a transfer corresponding to the set of at least one particular cryptographic token; and

at least some of the set of at least one particular cryptographic token comprises digital currency.

16 . The method of claim 1 wherein the random number generator is a pseudo-random generator.

17 . A non-transitory computer-readable medium comprising instructions that, when executed, are configured to cause a processor to perform a process for confirming token ownership rights, the process comprising:

generating a pre-image value, wherein the pre-image value is generated using a random number generator;

generating an action request, wherein the action request corresponds to an action performed for a set of at least one particular cryptographic token;

deriving, using the processor, a commit output, wherein the commit output:

is derived based, at least in part, on the pre-image value; and

references at least one condition for the action;

generating a commit request, wherein the commit request obfuscates the action request based on the commit output;

submitting the commit request to a particular immutable ledger;

receiving a first confirmation when the commit request is approved by the particular immutable ledger; and

after a reveal request referencing the commit output is published, receiving, based on the reveal request, a second confirmation

that the action request has been approved, wherein the reveal request referencing the commit output is associated with a verification that:

the set of at least one particular cryptographic token is in possession of a generating party for the commit output;

the at least one condition for the action occurred; and

the reveal request comprises a reference to the commit output.

18 . The non-transitory computer-readable medium of claim 17 , wherein:

the action request comprises a transfer request, transferring the set of at least one particular cryptographic token to a receiving address; and

the particular immutable ledger is a blockchain.

19 . The non-transitory computer-readable medium of claim 18 , wherein the reveal request is submitted to the particular immutable ledger by the receiving address.

20 . The non-transitory computer-readable medium of claim 17 , wherein deriving the commit output comprises applying at least one one-way function to the pre-image value and at least one message comprising an action-associated value.

21 . The non-transitory computer-readable medium of claim 20 , wherein a first function of the at least one one-way function is a cryptographic hash function.

22 . The non-transitory computer-readable medium of claim 21 , wherein the action-associated value included in a second message of the at least one message comprises at least one of:

an account identifier for each of one or more parties to the action;

a token type value, where the token type value numerically identifies a token type for the set of at least one particular cryptographic token; or

an address value, where the address value corresponds to a blockchain address.

23 . The non-transitory computer-readable medium of claim 20 , wherein the second confirmation depends on whether applying the at least one one-way function to the commit output and the action-associated value referenced in the reveal request produces the same result as applying the at least one one-way function to the commit output and the action-associated value referenced in the commit request.

24 . The non-transitory computer-readable medium of claim 17 , wherein:

the reveal request is submitted to a second immutable ledger; and

a node, monitoring both the particular immutable ledger and the second immutable ledger, determines whether the reveal request comprises the reference to the commit output.

25 . The non-transitory computer-readable medium of claim 24 , wherein the action request corresponding to the commit request is approved by the second immutable ledger.

26 . The non-transitory computer-readable medium of claim 17 , wherein the commit request corresponds to at least one additional request for a set of at least one additional cryptographic token.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 1, 2026
From: FINLOW-BATES;, KEIR; JAKOBSSON, BJORN MARKUS
To: ARTEMA LABS, INC
Reel/Frame 074251/0870 →
Continuity (5)
Provisional Application 63687205 · Aug 26, 2024
Provisional Application 63683175 · Aug 14, 2024
Provisional Application 63671588 · Jul 15, 2024
Provisional Application 63660984 · Jun 17, 2024
Related Publication 20250385807A1 · Dec 18, 2025
References Cited (24)
US 6901145B1 · Bohannon et al. · 2005 [cited by applicant]
US RE49968E · Ebrahimi · 2024 [cited by examiner]
US 20190394179A1 · Androulaki · 2019 [cited by examiner]
US 20200145198A1 · Guan · 2020 [cited by examiner]
US 20220035950A1 · Wakabayashi · 2022 [cited by examiner]
US 20230087602A1 · De Caro · 2023 [cited by examiner]
US 20230254136A1 · Stewart · 2023 [cited by examiner]
US 20230351464A1 · Beausoleil · 2023 [cited by examiner]
US 20240078940A1 · Salem · 2024 [cited by examiner]
US 20240171393A1 · Bathen · 2024 [cited by examiner]
US 20240394689A1 · Ellis · 2024 [cited by examiner]
US 20250013995A1 · Chaum · 2025 [cited by examiner]
Anderson et al., “A New Family of Authentication Protocols”, Acm Sigops Operating Systems Review, vol. 32, Issue 4, Oct. 1, 1998, pp. 9-20, https://doi.org/10.1145/302350.302353. [cited by applicant]
Bonneau et al., “Fawkescoin: A cryptocurrency without public-key cryptography”, Security Protocols XXII, Security Protocols 2014, Lecture Notes in Computer Science, vol. 8809, Oct. 29, 2014, https://doi.org/10.1007/978-… [cited by applicant]
Buterin, “How to Hard-Fork to Save Most Users' Funds in a Quantum Emergency”, Ethereum Research, Mar. 9, 2024, Available at: ethresear.ch/t/how-to-hard-fork-to-save-most-users-funds-in-a-quantum-emergency/18901. [cited by applicant]
Buterin et al., “ERC-4337: Account Abstraction Using Alt Mempool” Ethereum Improvement Proposals, No. 4337, Sep. 2021, available from https://eips.ethereum.org/EIPS/eip-4337. [cited by applicant]
Di Crescenzo et al., “How To Forget a Secret”, STACS 1999: STACS 99 pp. 500-509. [cited by applicant]
Golle et al., “Universal Re-Encryption for Mixnets”, Topics in Cryptology—CT-RSA 2004, The Cryptographers' Track at the RSA Conference 2004, San Francisco, CA, USA, Feb. 23-27, 2004. [cited by applicant]
Jakobsson, “Financial Instruments in Recommendation Mechanisms”, Published in FC 2002: Financial Cryptography, 2003, LNCS 2357, pp. 31-43. [cited by applicant]
Jakobsson, “On Quorum Controlled Asymmetric Proxy Re-encryption”, Lecture Notes in Computer Science, Oct. 1999, vol. 1560: 632-632. DOI: 10.1007/3-540-49162-7_9. [cited by applicant]
Jakobsson, “Privacy vs Authenticity”, Dissertation or Thesis, 1997, UMI Order No. GAX98-04529, 18pgs. [cited by applicant]
Jakobsson et al., “Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking”, Proceedings of the 11th USENIX Security Symposium, 2002, 16pgs. [cited by applicant]
Jakobsson et al., “Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers”, 1998, 15 pages, available from: http://markus-jakobsson.com/papers/jakobsson-crypto96.pdf., Jul. 24, 1996,. [cited by applicant]
Perrig et al., “The TESLA Broadcast Authentication Protocol”, CryptoBytes, vol. 5, No. 2, 2002, pp. 2-13, doi: 10.1007/978-1-4615-0229-6_3. [cited by applicant]