IP Library › Granted Patent US 12,243,057
Granted Patent B2
US 12,243,057 · App. 17/044,121 · Granted Mar 4, 2025

Offline storage system and method of use

Inventors: Philip Martin (San Francisco, CA); Julian Borrey (San Francisco, CA); Yolanda Liu (San Francisco, CA); Zachary Blacher (San Francisco, CA); Robert John Kearney (San Francisco, CA)
Assignee: Coinbase, Inc.
G06Q20/401H04L9/0637H04L9/0825H04L9/085H04L9/14H04L9/3073H04L9/50G06Q2220/00H04L2209/56
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,243,057
App. No.
17/044,121
Granted
Mar 4, 2025
Kind
B2
Abstract

A method for storing a cryptocurrency private key offline, including: encrypting the cryptocurrency private key using a primary encryption key; sharding the encrypted cryptocurrency private key into a plurality of alpha shards; generating beta shards by encrypting the alpha shards with secondary encryption keys; and storing representations of the beta shards offline. The method can additionally or alternatively include: retrieving the representations of the beta shards from the offline storage; decrypting the beta shards into the alpha shards based on the secondary encryption keys; reconstructing the encrypted cryptocurrency private key by recombining the alpha shards; and decrypting the encrypted cryptocurrency private key with the primary encryption key.

Claims (58)

1. A system for facilitating offline storage of a cryptocurrency key, the system comprising:

one or more processors programmed with instructions that, when executed by the one or more processors, cause operations comprising:

generating a symmetric-encryption ciphertext from a cryptocurrency private key by encrypting the cryptocurrency private key with a symmetric encryption key;

performing sharding of the symmetric-encryption ciphertext into key shards such that only a threshold number of the key shards is required for reconstructing the symmetric-encryption ciphertext, the threshold number being less than an overall number of the key shards derived from the sharding;

generating asymmetric-encryption shard ciphertexts from the key shards by encrypting the key shards with asymmetric encryption keys associated with the key shards, wherein generating the asymmetric-encryption shard ciphertexts from the key shards comprises:

determining, based on geographic locations associated with respective entities, a subset of entities of an entity set to respectively control regeneration of the key shards from the asymmetric-encryption shard ciphertexts such that the geographic locations are separated from one another by a threshold distance; and

using, based on the determination of the subset of entities, a first public key associated with a first entity of the subset of entities as one of the asymmetric encryption keys to encrypt at least one key shard of the key shards; and

causing storage of representations of the asymmetric-encryption shard ciphertexts in an offline computer storage system.

2. The system of claim 1 , wherein each key shard of the key shards is encrypted using a different asymmetric encryption key to generate a corresponding shard ciphertext.

3. The system of claim 1 , wherein generating the asymmetric-encryption shard ciphertexts from the key shards comprises:

randomly associating a first asymmetric encryption key with a first key shard of the key shards as an encryption key to be used for generating a first asymmetric-encryption shard ciphertext from the first key shard; and

generating, based on the random association, the first asymmetric-encryption shard ciphertext from the first key shard by encrypting the first key shard using the first asymmetric encryption key.

4. The system of claim 1 , the operations further comprising:

in response to a request to sign a transaction that includes a cryptocurrency address associated with the cryptocurrency private key, retrieving the asymmetric-encryption shard ciphertexts from the offline computer storage system and transmitting the asymmetric-encryption shard ciphertexts to a plurality of entities via a network;

in response to transmitting the asymmetric-encryption shard ciphertexts, obtaining a first key shard corresponding to a first shard ciphertext from a first entity and a second key shard corresponding to a second shard ciphertext from a second entity different from the first entity, the first key shard being generated by the first entity decrypting the first shard ciphertext, the second key shard being generated by the second entity decrypting the second shard ciphertext; and

in response to determining that the threshold number of the key shards has been obtained from the threshold number of the plurality of entities, regenerating the cryptocurrency private key from the key shards and signing the transaction with the cryptocurrency private key.

5. A method comprising:

generating a ciphertext from a cryptocurrency private key by encrypting the cryptocurrency private key with a primary encryption key;

performing sharding of the ciphertext into key shards such that only a threshold number of the key shards is required for reconstructing the ciphertext, the threshold number being less than an overall number of the key shards derived from the sharding;

generating shard ciphertexts from the key shards by encrypting the key shards with secondary encryption keys associated with the key shards;

storing representations of the shard ciphertexts in an offline storage system;

in response to a request to sign a transaction that includes a cryptocurrency address associated with the cryptocurrency private key, retrieving the shard ciphertexts from the offline storage system and transmitting the shard ciphertexts to a plurality of entities via a network;

in response to transmitting the shard ciphertexts, obtaining a first key shard corresponding to a first shard ciphertext from a first entity and a second key shard corresponding to a second shard ciphertext from a second entity different from the first entity, the first key shard being generated by the first entity decrypting the first shard ciphertext, the second key shard being generated by the second entity decrypting the second shard ciphertext; and

in response to determining that the threshold number of the key shards has been obtained from the threshold number of the plurality of entities, regenerating the cryptocurrency private key from the key shards and signing the transaction with the cryptocurrency private key.

6. The method of claim 5 , wherein each key shard of the key shards is encrypted using a different secondary encryption key to generate a corresponding shard ciphertext.

7. The method of claim 5 , wherein generating the shard ciphertexts from the key shards comprises:

randomly associating a first secondary encryption key with a first key shard of the key shards as an encryption key to be used for generating a first shard ciphertext from the first key shard; and

generating, based on the random association, the first shard ciphertext from the first key shard by encrypting the first key shard using the first secondary encryption key.

8. The method of claim 5 , wherein generating the shard ciphertexts from the key shards comprises:

determining a subset of entities of an entity set to respectively control regeneration of the key shards from the shard ciphertexts; and

using, based on the determination of the subset of entities, a first public key associated with a first entity of the subset of entities as one of the secondary encryption keys to encrypt at least one key shard of the key shards.

9. The method of claim 8 , wherein determining the subset of entities comprises determining, based on geographic locations associated with respective entities, the subset of entities to respectively control regeneration of the key shards from the shard ciphertexts such that the geographic locations are geographically dispersed.

10. The method of claim 5 , wherein the representations of the shard ciphertexts comprises QR code representations corresponding to the shard ciphertexts.

11. The method of claim 5 , wherein the offline storage system is an air-gapped computer system.

12. The method of claim 5 , wherein:

generating the ciphertext from the cryptocurrency private key comprises generating a symmetric-encryption ciphertext from the cryptocurrency private key by encrypting the cryptocurrency private key with a symmetric encryption key;

generating the shard ciphertexts from the key shards comprises generating asymmetric-encryption shard ciphertexts from the key shards by encrypting the key shards with asymmetric encryption keys associated with the key shards; and

storing the representations of the shard ciphertexts comprises storing representations of the asymmetric-encryption shard ciphertexts in the offline storage system.

13. One or more non-transitory computer-readable media storing instructions that, when executed by one or more processors, cause operations comprising:

generating a ciphertext from a cryptocurrency private key by encrypting the cryptocurrency private key with a primary encryption key;

performing sharding of the ciphertext into key shards such that only a threshold number of the key shards is required for reconstructing the ciphertext, the threshold number being less than an overall number of the key shards derived from the sharding;

generating shard ciphertexts from the key shards by encrypting the key shards with secondary encryption keys associated with the key shards, wherein representations of the shard ciphertexts are stored in an offline storage system;

in response to a request to sign a transaction that includes a cryptocurrency address associated with the cryptocurrency private key, retrieving the shard ciphertexts from the offline storage system and transmitting the shard ciphertexts to a plurality of entities via a network;

in response to transmitting the shard ciphertexts, obtaining a first key shard corresponding to a first shard ciphertext from a first entity and a second key shard corresponding to a second shard ciphertext from a second entity different from the first entity, the first key shard being generated by the first entity decrypting the first shard ciphertext, the second key shard being generated by the second entity decrypting the second shard ciphertext; and

in response to determining that the threshold number of the key shards has been obtained from the threshold number of the plurality of entities, regenerating the cryptocurrency private key from the key shards and signing the transaction with the cryptocurrency private key.

14. The non-transitory computer-readable media of claim 13 , wherein each key shard of the key shards is encrypted using a different secondary encryption key to generate a corresponding shard ciphertext.

15. The non-transitory computer-readable media of claim 13 , wherein generating the shard ciphertexts from the key shards comprises:

randomly associating a first secondary encryption key with a first key shard of the key shards as an encryption key to be used for generating a first shard ciphertext from the first key shard; and

generating, based on the random association, the first shard ciphertext from the first key shard by encrypting the first key shard using the first secondary encryption key.

16. The non-transitory computer-readable media of claim 13 , wherein generating the shard ciphertexts from the key shards comprises:

determining, based on geographic locations associated with respective entities, a subset of entities of an entity set to respectively control regeneration of the key shards from the shard ciphertexts; and

using, based on the determination of the subset of entities, a first public key associated with a first entity of the subset of entities as one of the secondary encryption keys to encrypt at least one key shard of the key shards.

17. The non-transitory computer-readable media of claim 13 , wherein the representations of the shard ciphertexts comprises QR code representations corresponding to the shard ciphertexts.

18. The non-transitory computer-readable media of claim 13 , wherein the offline storage system is an air-gapped computer system.

19. The non-transitory computer-readable media of claim 13 , wherein:

generating the ciphertext from the cryptocurrency private key comprises generating a symmetric-encryption ciphertext from the cryptocurrency private key by encrypting the cryptocurrency private key with a symmetric encryption key;

generating the shard ciphertexts from the key shards comprises generating asymmetric-encryption shard ciphertexts from the key shards by encrypting the key shards with asymmetric encryption keys associated with the key shards; and

storing the representations of the shard ciphertexts comprises storing representations of the asymmetric-encryption shard ciphertexts in the offline storage system.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 23, 2025
From: MARTIN, PHILIP; BORREY, JULIAN; LIU, YOLANDA; BLACHER, ZACHARY; KEARNEY, ROBERT JOHN
To: COINBASE, INC.
Reel/Frame 069980/0382 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Oct 29, 2020
From: MARTIN, PHILIP; BORREY, JULIAN; LIU, YOLANDA; BLACHER, ZACHARY; KEARNEY, ROBERT JOHN
To: COINBASE, INC.
Reel/Frame 054209/0596 →
Continuity (3)
Provisional Application 62687157 · Jun 19, 2018
Provisional Application 62658856 · Apr 17, 2018
Related Publication 20210019971A1 · Jan 21, 2021
References Cited (193)
US 5884274A · Walker et al. · 1999 [cited by applicant]
US 6125186A · Saito et al. · 2000 [cited by applicant]
US 6952683B1 · Gerhard · 2005 [cited by applicant]
US 6959394B1 · Brickell et al. · 2005 [cited by applicant]
US 7644037B1 · Ostrovsky · 2010 [cited by applicant]
US 7689500B2 · Cottrell · 2010 [cited by applicant]
US 7689550B2 · Lee et al. · 2010 [cited by applicant]
US 7970823B2 · Moeller et al. · 2011 [cited by applicant]
US 8055575B2 · Grody et al. · 2011 [cited by applicant]
US 8111648B2 · Gandham · 2012 [cited by applicant]
US 8117648B2 · Slaton et al. · 2012 [cited by applicant]
US 8606703B1 · Dorsey et al. · 2013 [cited by applicant]
US 8839386B2 · Gilboy · 2014 [cited by applicant]
US 8855318B1 · Patnala et al. · 2014 [cited by applicant]
US 9071429B1 · Roth et al. · 2015 [cited by applicant]
US 9135787B1 · Russell et al. · 2015 [cited by applicant]
US 9224262B2 · Fine et al. · 2015 [cited by applicant]
US 9495668B1 · Juels · 2016 [cited by applicant]
US 9892460B1 · Winklevoss · 2018 [cited by examiner]
US 10068228B1 · Winklevoss et al. · 2018 [cited by applicant]
US 10180912B1 · Franklin et al. · 2019 [cited by applicant]
US 10229396B2 · Shtylman · 2019 [cited by examiner]
US 10256983B1 · Bauer et al. · 2019 [cited by applicant]
US 10269009B1 · Winklevoss et al. · 2019 [cited by applicant]
US 10332205B1 · Russell et al. · 2019 [cited by applicant]
US 10375037B2 · Baird, III · 2019 [cited by examiner]
US 10469309B1 · Gupta et al. · 2019 [cited by applicant]
US 10586057B2 · Keselman et al. · 2020 [cited by applicant]
US 10733291B1 · McLeod · 2020 [cited by applicant]
US 10873450B2 · Keselman · 2020 [cited by examiner]
US 20010034605A1 · Hoffman · 2001 [cited by applicant]
US 20010050990A1 · Sudia · 2001 [cited by applicant]
US 20020023053A1 · Szoc et al. · 2002 [cited by applicant]
US 20020116611A1 · Zhou et al. · 2002 [cited by applicant]
US 20030048906A1 · Vora et al. · 2003 [cited by applicant]
US 20050010760A1 · Goh et al. · 2005 [cited by applicant]
US 20050138374A1 · Zheng et al. · 2005 [cited by applicant]
US 20060168663A1 · Mljoen et al. · 2006 [cited by applicant]
US 20070223706A1 · Rose · 2007 [cited by applicant]
US 20070255943A1 · Kern et al. · 2007 [cited by applicant]
US 20070258585A1 · Sandhu · 2007 [cited by examiner]
US 20080091586A1 · Cottrell · 2008 [cited by applicant]
US 20080095375A1 · Tateoka · 2008 [cited by examiner]
US 20080263363A1 · Jueneman et al. · 2008 [cited by applicant]
US 20090037405A1 · Lee et al. · 2009 [cited by applicant]
US 20090144810A1 · Gilboy · 2009 [cited by applicant]
US 20090177894A1 · Orsini et al. · 2009 [cited by applicant]
US 20090205036A1 · Slaton et al. · 2009 [cited by applicant]
US 20090254750A1 · Bono et al. · 2009 [cited by applicant]
US 20100054458A1 · Schneider · 2010 [cited by applicant]
US 20100175061A1 · Maeda et al. · 2010 [cited by applicant]
US 20100235588A1 · Maeda et al. · 2010 [cited by applicant]
US 20110071958A1 · Grody et al. · 2011 [cited by applicant]
US 20110087582A1 · Pak et al. · 2011 [cited by applicant]
US 20110106675A1 · Perlman · 2011 [cited by applicant]
US 20110202755A1 · Orsini et al. · 2011 [cited by applicant]
US 20110251941A1 · Dunwoody · 2011 [cited by applicant]
US 20120136782A1 · Norman et al. · 2012 [cited by applicant]
US 20120150750A1 · Aw et al. · 2012 [cited by applicant]
US 20120239556A1 · Magruder et al. · 2012 [cited by applicant]
US 20130010966A1 · Li et al. · 2013 [cited by applicant]
US 20130065670A1 · Michaelson et al. · 2013 [cited by applicant]
US 20130166455A1 · Feigelson · 2013 [cited by applicant]
US 20130191632A1 · Spector et al. · 2013 [cited by applicant]
US 20130246261A1 · Purves et al. · 2013 [cited by applicant]
US 20130290710A1 · Broder et al. · 2013 [cited by applicant]
US 20130318347A1 · Moffat · 2013 [cited by applicant]
US 20130339738A1 · Shaw · 2013 [cited by applicant]
US 20130343546A1 · Shibutani et al. · 2013 [cited by applicant]
US 20140019352A1 · Shrivastava · 2014 [cited by applicant]
US 20140025473A1 · Cohen · 2014 [cited by applicant]
US 20140052617A1 · Chawla et al. · 2014 [cited by applicant]
US 20140057599A1 · Hazari · 2014 [cited by applicant]
US 20140082749A1 · Holland et al. · 2014 [cited by applicant]
US 20140108223A1 · Xiao · 2014 [cited by applicant]
US 20140156512A1 · Rahman et al. · 2014 [cited by applicant]
US 20140172633A1 · Dogin et al. · 2014 [cited by applicant]
US 20140229739A1 · Roth et al. · 2014 [cited by applicant]
US 20140274327A1 · Fine et al. · 2014 [cited by applicant]
US 20140279436A1 · Dorsey et al. · 2014 [cited by applicant]
US 20140281550A1 · Resch · 2014 [cited by applicant]
US 20140289118A1 · Kassemi et al. · 2014 [cited by applicant]
US 20140297537A1 · Kassemi et al. · 2014 [cited by applicant]
US 20140304171A1 · Mertens et al. · 2014 [cited by applicant]
US 20150033301A1 · Pianese et al. · 2015 [cited by applicant]
US 20150039444A1 · Hardin et al. · 2015 [cited by applicant]
US 20150050987A1 · Huang et al. · 2015 [cited by applicant]
US 20150120569A1 · Belshe et al. · 2015 [cited by applicant]
US 20150127495A1 · Houri · 2015 [cited by applicant]
US 20150170112A1 · Decastro · 2015 [cited by applicant]
US 20150178693A1 · Solis · 2015 [cited by applicant]
US 20150209678A1 · Edwards et al. · 2015 [cited by applicant]
US 20150220928A1 · Allen · 2015 [cited by applicant]
US 20150227897A1 · Loera · 2015 [cited by applicant]
US 20150228004A1 · Bednarek et al. · 2015 [cited by applicant]
US 20150262137A1 · Armstrong · 2015 [cited by applicant]
US 20150262139A1 · Shtylman · 2015 [cited by applicant]
US 20150262171A1 · Langschaedel et al. · 2015 [cited by applicant]
US 20150262173A1 · Durbin et al. · 2015 [cited by applicant]
US 20150262176A1 · Langschaedel et al. · 2015 [cited by applicant]
US 20150287026A1 · Yang et al. · 2015 [cited by applicant]
US 20150294308A1 · Pauker et al. · 2015 [cited by applicant]
US 20150302401A1 · Metral · 2015 [cited by applicant]
US 20150310424A1 · Myers · 2015 [cited by applicant]
US 20150332256A1 · Minor · 2015 [cited by applicant]
US 20150365283A1 · Ronca et al. · 2015 [cited by applicant]
US 20160034896A1 · O'Brien et al. · 2016 [cited by applicant]
US 20160085955A1 · Lerner · 2016 [cited by applicant]
US 20160086418A1 · Smolen et al. · 2016 [cited by applicant]
US 20160171570A1 · Dogin et al. · 2016 [cited by applicant]
US 20160191250A1 · Bestler et al. · 2016 [cited by applicant]
US 20160203572A1 · McConaghy et al. · 2016 [cited by applicant]
US 20160253907A1 · Taveira · 2016 [cited by examiner]
US 20160261411A1 · Yau et al. · 2016 [cited by applicant]
US 20160277398A1 · Gregg et al. · 2016 [cited by applicant]
US 20160321654A1 · Lesavich et al. · 2016 [cited by applicant]
US 20160344543A1 · Alness et al. · 2016 [cited by applicant]
US 20160380767A1 · Hayashi et al. · 2016 [cited by applicant]
US 20170063531A1 · Sullivan · 2017 [cited by applicant]
US 20170083718A1 · Peddada et al. · 2017 [cited by applicant]
US 20170161439A1 · Raduchel et al. · 2017 [cited by applicant]
US 20170228953A1 · Lupovici · 2017 [cited by examiner]
US 20170293769A1 · Quinlan · 2017 [cited by examiner]
US 20180024740A1 · Miller et al. · 2018 [cited by applicant]
US 20180075453A1 · Durvasula et al. · 2018 [cited by applicant]
US 20180191503A1 · Alwar et al. · 2018 [cited by applicant]
US 20180248704A1 · Coode et al. · 2018 [cited by applicant]
US 20180367316A1 · Cheng et al. · 2018 [cited by applicant]
US 20190236245A1 · Desarzens et al. · 2019 [cited by applicant]
US 20190288840A1 · Gallancy · 2019 [cited by examiner]
US 20200019685A1 · Takahashi · 2020 [cited by applicant]
US 20200036707A1 · Callahan et al. · 2020 [cited by applicant]
US 20200044833A1 · Shpurov et al. · 2020 [cited by applicant]
US 20200084027A1 · Duchon et al. · 2020 [cited by applicant]
US 20210019971A1 · Martin · 2021 [cited by examiner]
EP 2634738A1 · 2013 [cited by applicant]
JP 2007109002A · 2007 [cited by applicant]
WO 0184906A2 · 2001 [cited by applicant]
WO 2006047694A1 · 2006 [cited by applicant]
WO 2014190323A1 · 2014 [cited by applicant]
WO 2018127606A1 · 2018 [cited by applicant]
“A plea to exchanges . . . lets do 2 factor right!” Bitcoin Forum, download from https://bitcointalk.org/index.php?topic=109424.0%E2%80%93%20Stephen%20Gomick%20NOV%205%20%2712%20at%2016:56 (posted Sep. 14, 2012), (10 pa… [cited by applicant]
“Bitcoin Explained Like You're Five Part 3-Cryptography”, https://chrispacia.wordpress.com/2013/09/07/bitcoin-cryptography-digital signatures-explained/, 2013, (21 pages). [cited by applicant]
“blockchainCreate”, http://blockchain.info:80/wallet/faq, dated Jan. 9, 2012, (5 pages). [cited by applicant]
“How to sell Lindens” dated Mar. 6, 2013 (Year: 2013). [cited by applicant]
“Off-the-chain transactions”, downloaded from http://gavintech.blogspot.com/2012/07/off-chain-transactions.html, dated Jul. 3, 2012 (Year: 2012), (4 pages). [cited by applicant]
“Securing your wallet”, download from https://bitcoin.org/en/secure-yourwallet (post from 2013), (4 pages). [cited by applicant]
“Send bitcoins to an unknown recipient”, Feb. 13, 2011, downloaded from https://bitcointalk.org/index.php?topic=3427.0, (Year: 2011). [cited by applicant]
“Send Bitcoins to Email Addresses!”, Jan. 9, 2012, downloaded from https://web.archive.org/web/20120109084110/http://www.bitcoinmail.com/, merged and attached as PDF file, (Year: 2012). [cited by applicant]
“Transaction Fees (“Transaction fees and negative balances””, downloaded from https://bitcointalk.org/index.php?topic=6856.0 dated Apr. 30, 2011-May 1, 2011, (Year:2011), (3 pages). [cited by applicant]
“Wholesale Payment Systems: Interbank Payment and Messaging System, Fedwire and Clearing House Interbank Payment Systems (CHIPS)”, http://www.ffiec.gov/ffiecinfobase/booklets/Wholesale/02.html, Dec. 16, 2005, (3 pages). [cited by applicant]
“You Can Now Send Bitcoins over Email with Tip Bot”, Feb. 26, 2014, downloaded from https://www.coindesk.com/can-how-send-bitcoins-email-tip-bot,' (Year: 2014). [cited by applicant]
Beal, Alex, “Backing Up Sensitive Data With Secret Sharing”, downloaded from https:www.usrsb.in/secret-sharing-backup.html, dated Feb. 23, 2013) (Year: 2013), (8pages). [cited by applicant]
Bitcoin Explained (“Bitcoin Explained Like You're Five, Part 4-Securing Your Wallet,” bitcoin-explained-like-youre-five-part-4-securing-your-wallet/ attached as PDF file, dated Sep. 29, 2013) (Year: 2013) https://chrisp… [cited by applicant]
Computer Arch (http://www.math.uaa.alaska.edu/˜afkjm/cs101 /handouts/ComputerArch.pdf attached as pdf, dated Sep. 10, 2009). [cited by applicant]
Dion, Derek A. , “I'll gladly trade you two bits on Tuesday for a byte today: Bitcoin, regulating fraud in the e-conomy pf Hacker-cash”, Journal of Law, Technology & Policy, vol. 2013, 2013, pp. 165-201. [cited by applicant]
Doguet, Joshua J. , “The Nature of the Form: Legal and Regulatory issues surrounding the Bitcoin digital currency system”, Louisiana Law Review, vol. 73, No. 1, Summer 2013, pp. 1118-1153. [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2019/027857 mailed Jul. 15, 2019. [cited by applicant]
Meiklejohn, Sarah et al., “A fistful of bitcoins: Characterizing Payments among men with no names”, 2013, (8 pages). [cited by applicant]
NIST (Archived NIST Technical Series Publication, dated Jul. 2012, “sp800-57 _part1_rev3_general.pdf”, attached as pdf.). [cited by applicant]
Wallace, Benjamin , “The rise and fall of bitcoin”, Magazine, WIRED, https://www.wired.com/2011 /11 /mf_bitcoin/all/1., Nov. 23, 2011, pp. 1-17. [cited by applicant]
“Blockchain (“How do off chain transactions work?” downloaded from https://bitcoin.stackexchange.com/questions/123530/how-do-off-chain-transactions-work, year 2013.”. [cited by applicant]
“Coin Selection Algorithm—What is the coin selection algorithm”, downloaded from https://web.archive.org/web/20130228073524/https://bitcoin.stackexchange.com/questions/1077/what-is-the-coin-selection-algorithm dated Feb… [cited by applicant]
“GitHub for SelectCoin code”, https://github.com/trottier/original-bitcoin/blob/master/src/main.cpp, lines 2410-2510, dated Apr. 4, 2013. [cited by applicant]
“How Bitcoin Works, downloaded from https://www.forbes.com/sites/investopedia/2013/08/01/how-bitcoin-works/#284bd94a17ff, dated Aug. 1, 2013, attached as PDF file. (Year: 2013)”. [cited by applicant]
“Inputs.io FAQ”, https://inputs.io/faq, 2013. [cited by applicant]
“International Search Report and Written Opinion of the ISA dated Dec. 18, 2019 for PCT/US19/52371.” [cited by applicant]
“Multi-Party Threshold Signature Scheme”, https://github.com/binance-chain/tss-lib#readme. [cited by applicant]
“NPL4, Importing Bitcoin from a paper wallet into Electrum”, https://thecleverest.com/, dated Mar. 12, 2014. [cited by applicant]
“Proactive secret sharing”, Wikipedia, https://en.wikipedia.org/wiki/Proactive_secret_sharing. [cited by applicant]
“Strongcoin—The safest Bitcoin e-wallet on the planet”, https://www.javaworld.com/article/2078467/bitcoin-for-beginners-part-2--bitcoin-as-a-technology-and-network.html, year 2013. [cited by applicant]
“Whose bank account is it anyway?”, McMillan LLP, Jun. 24, 2011, downloaded from http://www.lexology.com/library/detail.aspx?g20the%20parties.attached as PDF file (Year: 2011). [cited by applicant]
Antonopoulos, Andreas M., “Mastering Bitcoin Unlocking Digital Crypto-Currencies”, 2014. [cited by applicant]
Bernstein, Daniel J., “Curve25519: new Differentiations-Hellman speed records”, 9th International Conference on Practice and Theory in Public-Key Cryptography, New York NY, USA, Apr. 24-26, 2006, Proceedings pp. 207-228… [cited by applicant]
Berstein, Daniel J., et al., “High-speed high-security signatures”, Journal of Cryptographic Engineering vol. 2, pp. 77-89(2012), Published: Aug. 14, 2012. [cited by applicant]
Bradbury, Danny , “BitGo Safe Aims to Secure Bitcoin Wallets with Multi-Signature Transactions”, CoinDesk, The Voice of Digital Currency, http:/web.archive.org/web/20140108021304/http://www.coindesk.com/, published Dec.… [cited by applicant]
Breitner, Joachim , et al., “Biased Nonce Sense: Lattice Attacks against Weak ECDSA Signatures in Cryptocurrencies”, Financial Cryptography and Data Security, pp. 3-20, DOI: 10.1007/978-3-030-32101-7_1, Sep. 2019. [cited by applicant]
Davis, Don , “Defective Sign & Encrypt in S/MIME, PKCS#7, MOSS, PEM, PGP, and XML”, The Proceedings of the 2001 UNSENIX Annual Technical Conference, Jun. 25-30, 2001, Boston, Massachusetts, USA, pp. 65-78 of the Proceed… [cited by applicant]
Gennaro, Rosario , et al., “Revisiting the Distributed Key Generation for Discrete-Log Based Cryptosystems”, https://pdfs.semanticscholar.org/642b/d1bbc86c7750cef9fa770e9e4ba86bd49eb9.pdf, 2003. [cited by applicant]
Krawczyk, H. , et al., “HMAC-based Extract-and-Expand Key Derivation Function (HKDF)”, Internet Engineering Task Force (IETF), May 2010, https://tools.ietf.org/html/rfc5869. [cited by applicant]
Lee, Leland , et al., “Alternative Signatures Schemes”, Medium, Feb. 12, 2019, https://medium.com/blockchain-at-berkeley/alternative-signatures-schemes-14a563d9d562. [cited by applicant]
Marlinspike, Moxie , et al., “The X3DH Key Agreement Protocol”, Signal, Revision 1, Nov. 4, 2016. [cited by applicant]
Merkel, Dirk , “Bitcoin for beginners, Part 2: Bitcoin as a technology and network”, Javaworld, Dec. 6, 2011. [cited by applicant]
Neuman, Nick , “KeySplit-Tackling the hard parts of being your own bank”, https://medium.com/@nickneuman/keysplit-private-key-security-for-cryptocurrency-owners-d1653ea9631d, Feb. 24, 2018. [cited by applicant]
International Search Report and Written Opinion for application No. PCT/US20/055949, dated Jan. 15, 2021. [cited by applicant]
Rothenberger, Benjamin , et al., “Internet Kill Switches Demystified”, Proceedings fo the 10th European Workshop on Systems Security, Apr. 23, 2017. [cited by applicant]
Nov. 19, 2021—(EP) European Extended Search Report—App. No. 19787749.1. [cited by applicant]
“How do YOU store a digital backup of your bip39 mnemonic?”, https://www.reddit.com/r/Bitcoin/comments/58zst0/how_do_you_store_a_digital_backup_of_your_bip39/, posted by udaggertreatment 4 years ago, May 2017. [cited by applicant]
Altimore, Pat , et al., “Azure Blockchain Workbench architecture”, https://docs.microsoft.com/en-us/azure/blockchain/workbench/architecture#transaction-builder-and-signer, Azure Blockchain, Microsoft Docs, Sep. 5, 2019. [cited by applicant]
Baldwin, M. , et al., “Quickstart: Set and retrieve a secret from Azure Key Vault using the Azure portal”, https://docs.microsoft.com/en-us/azure/key-vault/secrets/quick-create-portal, Azure Quickstart, Microsoft Docs, … [cited by applicant]
Bauer, Roderick , “Securing Your Cryptocurrency”, Backblaze, May 10, 2018. [cited by applicant]
Kasarabada, Lavanya , “Announcing Storage Service Encryption with customer managed keys general availability”, https://azure.microsoft.com/en-us/blog, posted Mar. 7, 2018. [cited by applicant]
Swanson, William , et al., “A Single-Sign-On Security Platform for Private and Decentralized Applications”, https://edge.app/wp-content/uploads/2019/01/Edge-White-Paper-1-22-2019.pdf, Edge, White Paper, Jan. 22, 2019. [cited by applicant]