IP Library Granted Patent US 12,609,915
Granted Patent B2
US 12,609,915 · App. 18/630,973 · Granted Apr 21, 2026

Security-enhanced origination of blockchain transactions

Inventors: Silvia Bartolucci (London, GB); Pauline Bernat (London, GB); Daniel Joseph (London, GB)
Assignee: NCHAIN LICENSING AG
H04L63/0421H04L9/0841H04L9/085H04L9/0861H04L9/3073H04L9/3247H04L63/0281H04L9/3236H04L9/50
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,609,915
App. No.
18/630,973
Granted
Apr 21, 2026
Kind
B2
Abstract

A blockchain-implemented transaction from an originator node is to be broadcast. The originator node is communicatively coupled to proxy nodes. The method, implemented by a proxy node, includes: receiving a transaction including an input taking x+r units of computing resources, an output providing x units to the output address and another output providing d+r units to a 1-of-n multi-signature address unlockable by any one of a set of private keys associated the proxy nodes. The proxy node selects a quantity of computing resources, t units, to be allocated to the proxy node for broadcasting the transaction and having it included in the blockchain and generates a further transaction taking d+r units sourced from the multi-signature address and an output providing t units to the proxy node. The proxy node broadcasts both transactions timed to permit their inclusion in the same block of the blockchain.

Claims (33)

1 . A computer-implemented method comprising, by a given proxy node:

receiving, via a computer network, a transaction generated and partially signed by an originator node, the transaction including a first input and a first and second output, wherein the first input takes x+r units of computing resources and wherein the first output provides x units to an output address and the second output provides d+r units to a 1-of-n multi-signature address unlockable using any one of a plurality of second private keys, each of the second private keys being associated with a respective one of a plurality of proxy nodes, the plurality of proxy nodes including the given proxy node, and each of the second private keys derivable by the respective one of the plurality of proxy nodes based on a private key of an asymmetric encryption key pair of the respective one proxy node and a secret value that the respective one proxy node shares with the originator node;

selecting a quantity of computing resources, t units, to be allocated to the given proxy node for broadcasting the transaction and having the transaction included in the blockchain;

selecting a quantity of computing resources, f units, to be allocated to a third-party for including the transaction in a blockchain;

digitally signing an updated transaction generated by adding a second input taking d+f units to the transaction; and

broadcasting the updated transaction, wherein f<r and t<(r−f).

2 . The computer-implemented method according to claim 1 , further comprising:

generating and digitally signing a further transaction including an input taking d+r units sourced from the 1-of-n multi-signature address using the second private key of the proxy node and an output providing t units to the given proxy node; and

broadcasting the updated transaction and the further transaction, timed to permit their inclusion in the same block of the blockchain.

3 . The computer-implemented method according to claim 2 , wherein the broadcast of the updated transaction and the broadcast of the further transaction are substantially concurrent.

4 . The computer-implemented method according to claim 2 , wherein at least one of the quantity of computing resources, f, to be allocated to the third-party for including the transaction in the blockchain and the quantity of computing resources, t units, to be allocated to the given proxy node for broadcasting the transaction is further selected based on having the further transaction included in a next block in the blockchain.

5 . The computer-implemented method according to claim 1 , wherein receiving the transaction includes receiving an identifier of the transaction.

6 . The computer-implemented method according to claim 5 , wherein the received identifier of the transaction is encrypted using a public key of the given proxy node.

7 . The computer-implemented method according to claim 1 , wherein the indication is received from the originator node.

8 . The computer-implemented method according to claim 1 , wherein the quantity of computing resources, f, to be allocated to the third-party for including the transaction in the blockchain is selected based on having the transaction included in a next block in the blockchain.

9 . The computer-implemented method according to claim 1 , wherein the originator node has an associated asymmetric encryption key pair including a public key and a private key and wherein the secret value shared between the originator node and the given proxy node is derivable by the originator node based on its private key and the public key of the given proxy node and by the given proxy node based on its private key and the public key of the originator node.

10 . The computer-implemented method according to claim 1 , wherein the asymmetric encryption key pairs are elliptic-curve key pairs and wherein establishing the secret value shared between the originator node and a particular proxy node corresponds to an Elliptic-Curve Diffie-Hellman (ECDH) key exchange.

11 . A computing device comprising:

a processor;

a memory;

a network interface; and

a non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by the processor, cause the computing device to execute a computer implemented method comprising, by a given proxy node:

receiving, via a computer network, a transaction generated and partially signed by an originator node, the transaction including a first input and a first and second output, wherein the first input takes x+r units of computing resources and wherein the first output provides x units to an output address and the second output provides d+r units to a 1-of-n multi-signature address unlockable using any one of a plurality of second private keys, each of the second private keys being associated with a respective one of a plurality of proxy nodes, the plurality of proxy nodes including the given proxy node, and each of the second private keys derivable by the respective one of the plurality of proxy nodes based on a private key of an asymmetric encryption key pair of that proxy node and a secret value that proxy node shares with the originator node;

selecting a quantity of computing resources, t units, to be allocated to the given proxy node for broadcasting the transaction and having the transaction included in the blockchain;

selecting a quantity of computing resources, f units, to be allocated to a third-party for including the transaction in the blockchain;

digitally signing an updated transaction generated by adding a second input taking d+f units to the transaction; and

broadcasting the updated transaction, wherein f<r and t<(r−f).

12 . A non-transitory computer-readable storage medium storing computer-executable instructions that, when executed by a processor of a computing device, cause the computing device to execute a computer-implemented method comprising, by a given proxy node:

receiving, via a computer network, a transaction generated and partially signed by an originator node, the transaction including a first input and a first and second output, wherein the first input takes x+r units of computing resources and wherein the first output provides x units to an output address and the second output provides d+r units to a 1-of-n multi-signature address unlockable using any one of a plurality of second private keys, each of the second private keys being associated with a respective one of a plurality of proxy nodes, the plurality of proxy nodes including the given proxy node, and each of the second private keys derivable by the respective one of the plurality of proxy nodes based on a private key of an asymmetric encryption key pair of that proxy node and a secret value that proxy node shares with the originator node;

selecting a quantity of computing resources, t units, to be allocated to the given proxy node for broadcasting the transaction and having the transaction included in the blockchain;

selecting a quantity of computing resources, f units, to be allocated to a third-party for including the transaction in the blockchain;

digitally signing an updated transaction generated by adding a second input taking d+f units to the transaction; and

broadcasting the updated transaction, wherein f<r and t<(r−f).

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 26, 2024
From: BARTOLUCCI, SILVIA; BERNAT, PAULINE; JOSEPH, DANIEL
To: NCHAIN HOLDINGS LTD.
Reel/Frame 067877/0544 →
CHANGE OF NAME Recorded Jun 26, 2024
From: NCHAIN HOLDINGS LTD.
To: NCHAIN LICENSING AG
Reel/Frame 067877/0558 →
Priority Claims (1)
GB 1721021 · Dec 15, 2017 · national
Continuity (3)
Continuation 17707866 · Mar 29, 2022
Continuation 16954175
Related Publication 20240291805A1 · Aug 29, 2024
References Cited (40)
US 8316237B1 · Felsher et al. · 2012 [cited by applicant]
US 8340287B2 · Sandhu et al. · 2012 [cited by applicant]
US 9774578B1 · Ateniese et al. · 2017 [cited by applicant]
US 10277400B1 · Griffin · 2019 [cited by examiner]
US 11057198B2 · Linder · 2021 [cited by examiner]
US 20060123465A1 · Ziegler · 2006 [cited by applicant]
US 20150358300A1 · Urzi et al. · 2015 [cited by applicant]
US 20160300231A1 · Shavell et al. · 2016 [cited by applicant]
US 20170091397A1 · Shah · 2017 [cited by examiner]
US 20170206523A1 · Goeringer et al. · 2017 [cited by applicant]
US 20170243193A1 · Manian et al. · 2017 [cited by applicant]
US 20170324738A1 · Hari et al. · 2017 [cited by applicant]
US 20170337534A1 · Goeringer et al. · 2017 [cited by applicant]
US 20170338947A1 · Ateniese · 2017 [cited by examiner]
US 20170344988A1 · Cusden · 2017 [cited by examiner]
US 20170345011A1 · Salami et al. · 2017 [cited by applicant]
US 20180097635A1 · Moses · 2018 [cited by examiner]
US 20180097779A1 · Karame · 2018 [cited by examiner]
US 20180101914A1 · Samuel · 2018 [cited by examiner]
US 20180137512A1 · Georgiadis et al. · 2018 [cited by applicant]
US 20180254891A1 · Linder · 2018 [cited by examiner]
US 20200021446A1 · Roennow et al. · 2020 [cited by applicant]
CN 107528835A · 2017 [cited by applicant]
WO 2018059939A1 · 2018 [cited by applicant]
Aitzhan et al., “Security and Privacy in Decentralized Energy Trading through Multi-signatures, Blockchain and Anonymous Messaging Streams,” IEEE Transactions on Dependable and Secure Computing 15(5):840-52, Jan. 1, 201… [cited by applicant]
Antonopoulos, “Mastering Bitcoin—Unlocking Digital Cryptocurrencies,” O'Reilly Media, Inc., Dec. 20, 2014, 282 pages. [cited by applicant]
Barrymac et al., “What would be the process for identifying a person that performed a transaction from a wallet on a personal device?,” Bitcoin StackExchange, Nov. 15, 2011, https://bitcoin.stackexchange.com/questions/2… [cited by applicant]
Biryukov et al., “Deanonymisation of clients in Bitcoin P2P network,” Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, Nov. 3, 2014, 15 pages. [cited by applicant]
Davis et al., “Thinking about ways to make it more difficult to link IP address to txn creator,” Bitcoin Forum, Mar. 14, 2015, https://bitcointalk.org/index.php?topic=990275.0;all, 15 pages. [cited by applicant]
Dingledine et al., “Tor: The second-generation onion router,” Naval Research Lab ,Washington DC, Jan. 1, 2004, 18 pages. [cited by applicant]
Goblin et al., “Configurable transaction fees,” Bitcoin Forum, May 4, 2011, https://bitcointalk.org/index.php?topic=7240.0, 7 pages. [cited by applicant]
International Search Report and Written Opinion mailed Dec. 12, 2018, Patent Application No. PCT/ IB2018/059922, 13 pages. [cited by applicant]
International Search Report and Written Opinion mailed Mar. 21, 2019, Patent Application No. PCT/IB2018/059922, 13 pages. [cited by applicant]
Nakamoto, “Bitcoin: A Peer-to-Peer Electronic Cash System,” Bitcoin, Oct. 31, 2008, https://bitcoin.org/bitcoin.pdf, 9 pages. [cited by applicant]
Nmat et al., “Microsoft Researchers Suggest Method to Improve Bitcoin Transaction Propagation,” Bitcoin Forum, Nov. 13, 2011, 37 pages. [cited by applicant]
Ponury Typ et al., “Re: [ANN] Navajo [NAV]—The Unbreakable Code [PoS/Anonymity/Privacy] p. 116,” Bitcoin Forum, Jul. 30, 2014, https://bitcointalk.org/index.php?topic=679791.2300, 6 pages. [cited by applicant]
Satoshi et al., “Connection Limits,” Bitcoin Forum, Aug. 9, 2010, https://bitcointalk.org/index.php?topic=741.0;prev_next=prev, 2 pages. [cited by applicant]
UK IPO Search Report mailed Jun. 11, 2018, Patent Application No. GB1721021.2, 8 pages. [cited by applicant]
Van Saberhagen, “CryptoNote v 2.0,” Oct. 17, 2013, https://bytecoin.org/old/whitepaper.pdf, 20 pages. [cited by applicant]
Venkatakrishnan et al., “Dandelion: Redesigning the Bitcoin Network for Anonymity,” Proceedings of the ACM on Measurement and Analysis of Computing Systems 1(1):1-34, Jun. 13, 2017. [cited by applicant]