IP Library › Granted Patent US 12,348,621
Granted Patent B2
US 12,348,621 · App. 18/756,639 · Granted Jul 1, 2025

Secret splitting and metadata storage

Inventors: Michael D. Ornelas (Draper, UT); Jesse Empey (Saratoga Springs, UT); Brad Welker (Bountiful, UT)
Assignee: tZERO IP, LLC
H04L9/085G06F3/0604G06F3/0659G06F3/0679G06F8/61H04L9/0643H04L9/0897H04L9/30H04L9/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,348,621
App. No.
18/756,639
Granted
Jul 1, 2025
Kind
B2
Abstract

A computing device includes at least one processor configured to determine a retrieved secret share from each of at least two secret share storage devices or media that are retrieved from at least two of a plurality of shareholders. The at least one processor is also configured to determine whether each respective retrieved secret share is one of the plurality of secret shares that were generated based on whether the respective hash of the respective retrieved secret share matches any hash in the list of hashes of the plurality of secret shares within the metadata. The at least one processor is also configured to, in response to determining that each retrieved secret share is among the plurality of secret shares that were generated, attempt to reconstitute a secret using retrieved secret shares from the at least two secret share storage devices or media.

Claims (41)

1. A computing system comprising:

at least one processor configured to:

split a secret into a plurality of secret shares, at least a subset of which are required to reconstitute the secret;

transfer each respective secret share of the plurality of secret shares to a respective portable storage device or media;

wherein each portable storage device or media is distributed to a plurality of shareholders;

determine a retrieved secret share from each of at least two secret share storage devices or media that are retrieved from at least two of the plurality of shareholders;

determine metadata, the metadata having at least a list of hashes of the plurality of secret shares that were generated before the plurality of secret shares were distributed to the plurality of shareholders;

compare a respective hash of each respective retrieved secret share to each hash in the list of hashes of the plurality of secret shares within the metadata;

determine whether each respective retrieved secret share is one of the plurality of secret shares that were generated based on whether the respective hash of the respective retrieved secret share matches any hash in the list of hashes of the plurality of secret shares within the metadata; and

in response to determining that each retrieved secret share is among the plurality of secret shares that were generated, attempt to reconstitute the secret using retrieved secret shares from the at least two secret share storage devices or media, wherein each of the secret, the retrieved secret share from each of the at least two secret share storage devices or media, and the hashes of the plurality of secret shares are a different string of characters.

2. The computing system of claim 1 , wherein the secret is a cryptographic private key or a mnemonic phrase or seed that is used to reconstitute a private key.

3. The computing system of claim 1 , wherein the at least one processor is configured to attempt to reconstitute the secret using Shamir combining.

4. The computing system of claim 1 , wherein the at least one processor is configured to, when the secret is reconstituted as a reconstituted secret from the retrieved secret shares, perform at least one of the following actions requiring the reconstituted secret:

encrypting or decrypting data using the reconstituted secret;

generating a transaction address in a distributed ledger based on the reconstituted secret; or

signing a transaction using the reconstituted secret, wherein the transaction sends cryptocurrency out of an address in the distributed ledger.

5. The computing system of claim 1 , wherein the at least one processor is further configured to identify, when the attempt to reconstitute the secret is not successful, at least one of the retrieved secret shares as not being one of the plurality of secret shares that were generated when the respective hash of the respective retrieved secret share does not match any hash in the list of hashes of the plurality of secret shares within the metadata.

6. The computing system of claim 1 , wherein the at least one processor is further configured to perform, when the secret is reconstituted from the retrieved secret shares, an action requiring a reconstituted secret.

7. The computing system of claim 1 , wherein the at least one processor is further configured to decrypt at least one of the retrieved secret shares.

8. The computing system of claim 1 , wherein the metadata further has a copy of executable instructions used to split the secret into secret shares before distribution.

9. The computing system of claim 1 , wherein the metadata further has a copy of executable instructions used to generate the list of hashes of the plurality of secret shares.

10. A method, comprising:

splitting a secret into a plurality of secret shares, at least a subset of which are required to reconstitute the secret;

transferring each respective secret share of the plurality of secret shares to a respective portable storage device or media;

wherein each portable storage device or media is distributed to a plurality of shareholders;

determining a retrieved secret share from each of at least two secret share storage devices or media that are retrieved from at least two of the plurality of shareholders;

determining metadata, the metadata having at least a list of hashes of the plurality of secret shares that were generated before the plurality of secret shares were distributed to the plurality of shareholders;

comparing a respective hash of each respective retrieved secret share to each hash in the list of hashes of the plurality of secret shares within the metadata;

determining whether each respective retrieved secret share is one of the plurality of secret shares that were generated based on whether the respective hash of the respective retrieved secret share matches any hash in the list of hashes of the plurality of secret shares within the metadata; and

in response to determining that each retrieved secret share is among the plurality of secret shares that were generated, attempting to reconstitute the secret using retrieved secret shares from the at least two secret share storage devices or media, wherein each of the secret, the retrieved secret share from each of the at least two secret share storage devices or media, and the hashes of the plurality of secret shares are a different string of characters.

11. The method of claim 10 , wherein the secret is a cryptographic private key or a mnemonic phrase or seed that is used to reconstitute a private key.

12. The method of claim 10 , further comprising attempting to reconstitute the secret using Shamir combining.

13. The method of claim 10 , further comprising, when the secret is reconstituted as a reconstituted secret from the retrieved secret shares, performing at least one of the following actions requiring the reconstituted secret:

encrypting or decrypting data using the reconstituted secret;

generating a transaction address in a distributed ledger based on the reconstituted secret; or

signing a transaction using the reconstituted secret, wherein the transaction sends cryptocurrency out of an address in the distributed ledger.

14. The method of claim 10 , further comprising identifying, when the attempt to reconstitute the secret is not successful, at least one of the retrieved secret shares as not being one of the plurality of secret shares that were generated when the respective hash of the respective retrieved secret share does not match any hash in the list of hashes of the plurality of secret shares within the metadata.

15. The method of claim 10 , further comprising performing, when the secret is reconstituted from the retrieved secret shares, an action requiring a reconstituted secret.

16. The method of claim 10 , further comprising at least one of the retrieved secret shares.

17. The method of claim 10 , wherein the metadata further has a copy of executable instructions used to split the secret into secret shares before distribution.

18. The method of claim 10 , wherein the metadata further has a copy of executable instructions used to generate the list of hashes of the plurality of secret shares.

Assignments (4)
CORRECTIVE ASSIGNMENT TO CORRECT THE CORRECT THE ADD INVNETORS JESSE EMPEY AND BRAD WELKER PREVIOUSLY RECORDED AT REEL: 67917 FRAME: 77. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Jul 19, 2024
From: ORNELAS, MICHAEL D.; EMPEY, JESSE; WELKER, BRAD
To: MEDICI VENTURES, INC.
Reel/Frame 068460/0434 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 5, 2024
From: ORNELAS, MICHAEL D.
To: MEDICI VENTURES, INC.
Reel/Frame 067917/0077 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 5, 2024
From: MEDICI VENTURES, INC.
To: TZERO GROUP, INC.
Reel/Frame 067917/0343 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 5, 2024
From: TZERO GROUP, INC.
To: TZERO IP, LLC
Reel/Frame 067917/0553 →
Continuity (3)
Continuation 17169985 · Feb 8, 2021
Provisional Application 62981663 · Feb 26, 2020
Related Publication 20240348430A1 · Oct 17, 2024
References Cited (76)
US 6311171B1 · Dent · 2001 [cited by applicant]
US 7003667B1 · Slick et al. · 2006 [cited by applicant]
US 7548621B1 · Smith et al. · 2009 [cited by applicant]
US 8855318B1 · Patnala et al. · 2014 [cited by applicant]
US 9323603B2 · Resch et al. · 2016 [cited by applicant]
US 9667416B1 · Machani et al. · 2017 [cited by applicant]
US 9673975B1 · Machani · 2017 [cited by applicant]
US 9954680B1 · Machani et al. · 2018 [cited by applicant]
US 20020071566A1 · Kurn · 2002 [cited by applicant]
US 20040039924A1 · Baldwin et al. · 2004 [cited by applicant]
US 20040042620A1 · Andrews et al. · 2004 [cited by applicant]
US 20050086471A1 · Spencer · 2005 [cited by applicant]
US 20070160198A1 · Orsini · 2007 [cited by examiner]
US 20070223706A1 · Gantman et al. · 2007 [cited by applicant]
US 20080031460A1 · Brookner et al. · 2008 [cited by applicant]
US 20090122981A1 · Kaji · 2009 [cited by applicant]
US 20100020966A1 · Hata et al. · 2010 [cited by applicant]
US 20120121088A1 · Hata et al. · 2012 [cited by applicant]
US 20130219189A1 · Simmons · 2013 [cited by applicant]
US 20140250303A1 · Miller et al. · 2014 [cited by applicant]
US 20150326547A1 · Carlson · 2015 [cited by applicant]
US 20160241405A1 · Jeong et al. · 2016 [cited by applicant]
US 20170005797A1 · Lanc · 2017 [cited by examiner]
US 20170142082A1 · Qian · 2017 [cited by applicant]
US 20180234239A1 · Hasegawa · 2018 [cited by examiner]
US 20180276745A1 · Paolini-Subramanya et al. · 2018 [cited by applicant]
US 20180375653A1 · Setty · 2018 [cited by examiner]
US 20190288834A1 · Black et al. · 2019 [cited by applicant]
US 20190342084A1 · Mehedy et al. · 2019 [cited by applicant]
US 20200119908A1 · Christensen et al. · 2020 [cited by applicant]
US 20200119917A1 · Christensen et al. · 2020 [cited by applicant]
US 20210266150A1 · Ornelas et al. · 2021 [cited by applicant]
EP 2693358A1 · 2014 [cited by applicant]
JP 2007334417A · 2007 [cited by applicant]
JP 2019153842A · 2019 [cited by applicant]
KR 20050104220A · 2005 [cited by applicant]
KR 20140072188A · 2014 [cited by applicant]
WO 2009109232A1 · 2009 [cited by applicant]
WO 2019021105A1 · 2019 [cited by applicant]
Japanese Patent Office, “Notice of Allowance”, dated Oct. 31, 2024 from JP Application No. 2022-551266, from Foreign Counterpart to U.S. Appl. No. 17/169,985, pp. 1 through 4, Published: JP. [cited by applicant]
“Authenticated encryption”, Dec. 7, 2017, pp. 1-8. [cited by applicant]
“Divide and Manage Secret Data Securely With Shamir's Secret Sharing”, Nov. 11, 2017, pp. 1-5. [cited by applicant]
“Public-key signatures”, Nov. 16, 2018, pp. 1-9. [cited by applicant]
“Sealed Boxes”, Sep. 28, 2019, pp. 1-3. [cited by applicant]
“Shamir39 Mnemonic Code Splitter”, Oct. 3, 2017, pp. 1-3. [cited by applicant]
“Shamir's Quest: Collect Any 3 Keys to Unlock the Secret!”, The blog at the bottom of the sea, Apr. 30, 2016, pp. 1-9. [cited by applicant]
“Ssss(1)—Linux man page”, at least as early as Jan. 11, 2021, pp. 1 through 2, https://linux.die.net/man/1/ssss. [cited by applicant]
Armstrong, “How Coinbase Builds Secure Infrastructure to Store Bitcoin in the Cloud”, The Coinbase Engineering Blog, Oct. 21, 2017, pp. 1-8. [cited by applicant]
Canadian Intellectual Property Office, “Office Action”, from CA Application No. 3,169,707, from Foreign Counterpart to U.S. Appl. No. 17/169,985, filed Dec. 5, 2023, pp. 1 through 4, Published: CA. [cited by applicant]
European Patent Office, “Extended European Search Report”, from EP Application No. 21761224.1, from Foreign Counterpart to U.S. Appl. No. 17/169,985, filed Jan. 31, 2024, pp. 1 through 9, Published: EP. [cited by applicant]
Flecther-Hill, “Kimono—trustless secret sharing using time-locks on Ethereum”, medium.com, May 30, 2018, pp. 1-8. [cited by applicant]
GitHub, “bitcoin/bips”, at least as early as Jan. 11, 2021, pp. 1 through 6, https://github.com/bitcoin/bips/blob/master/bip-0039.mediawiki. [cited by applicant]
Gray, “How to split a private key to create a “shared secret” and secure your XRP in the event of death/theft/natural disaster/etc. using Shamir's Secret Sharing Scheme”, XRP Chat, Jul. 5, 2017, pp. 1-14, Invision Commu… [cited by applicant]
International Bureau, “International Preliminary Report on Patentability” from PCT Application No. PCT/US2019/022607, from Foreign Counterpart to U.S. Appl. No. 16/355,527, filed Sep. 24, 2020, pp. 1 through 11, Publish… [cited by applicant]
International Bureau, “International Preliminary Report on Patentability”, from PCT Application No. PCT/US2021/017019, from Foreign Counterpart to U.S. Appl. No. 17/169,985, filed Sep. 8, 2022, pp. 1 through 7, Publishe… [cited by applicant]
International Searching Authority, “International Search Report and Written Opinion from PCT Application No. PCT/US2019/022607 mailed Jul. 2, 2019”, from Foreign Counterpart to U.S. Appl. No. 16/355,527, pp. 1-14, Publi… [cited by applicant]
International Searching Authority, “International Search Report and Written Opinion from PCT Application No. PCT/US2019/055032”, from Foreign Counterpart to U.S. Appl. No. 16/595,004, filed Jan. 22, 2020, pp. 1-10, Publ… [cited by applicant]
International Searching Authority, “International Search Report and Written Opinion from PCT Application No. PCT/US2019/055034”, from Foreign Counterpart to U.S. Appl. No. 16/595,020, filed Jan. 23, 2020, pp. 1-11, Publ… [cited by applicant]
International Searching Authority, “International Search Report and Written Opinion from PCT Application No. PCT/US2021/017019”, from Foreign Counterpart to U.S. Appl. No. 17/169,985, filed Jun. 1, 2021, pp. 1 through 1… [cited by applicant]
Miller, “Simple Security with Shamir Secret Sharing”, GridPlus, Aug. 16, 2017, pp. 1-7. [cited by applicant]
Olimid, “Secret Sharing-based Group Key Establishment”, Faculty of Mathematics and Computer Science, 2013, pp. 1-116, University of Bucharest. [cited by applicant]
Poettering, “What is ‘Secret Sharing?”’, Shamir's Secret Sharing Scheme, Jan. 2, 2018, pp. 1-3, point-at-infinity.org/ssss/. [cited by applicant]
Poyiatzis, “Shamir's Secret Sharing—A numeric example walkthrough”, Sep. 22, 2018, pp. 1 through 10, Unsplash. [cited by applicant]
Raman et al., “Dynamic Distributed Storage for Scaling Blockchains”, arXiv: 1711.07617v1, Nov. 21, 2017, available at https://arxiv.org/abs/1711.07617v1, pp. 1 through 19. [cited by applicant]
Raman et al., “Dynamic Distributed Storage for Scaling Blockchains”, arXiv: 1711.07617v2, Jan. 7, 2018, available at https://arxiv.org/abs/1711.07617v2, pp. 1 through 19. [cited by applicant]
Satoshilabs, “Dev Corner: A Detailed Guide to Shamir Backup”, at least as early as Dec. 3, 2019, pp. 1 through 9. [cited by applicant]
Stetsyuk, “Never store your secrets in one place again”, PassGuardian, Oct. 26, 2017, pp. 1-4. [cited by applicant]
Team Nchain, “Keys to Secure the Digital Future: nChains's Inventions for Security of Bitcoin, Digital Assets & Digital Resources”, nChain, Aug. 3, 2017, pp. 1-7. [cited by applicant]
U.S. Patent and Trademark Office, “Final Office Action”, U.S. Appl. No. 17/169,985, filed Sep. 27, 2023, pp. 1 through 19, Published: US. [cited by applicant]
U.S. Patent and Trademark Office, “Notice of Allowance”, U.S. Appl. No. 17/169,985, dated Mar. 13, 2024, pp. 1 through 25, Published: US. [cited by applicant]
U.S. Patent and Trademark Office, “Office Action”, U.S. Appl. No. 17/169,985, Mar. 16, 2023, pp. 1 through 32, Published: US. [cited by applicant]
Wikipedia, “Secret Sharing”, Feb. 19, 2018, pp. 1-8. [cited by applicant]
Wikipedia, “Message authentication code”, Mar. 8, 2018, pp. 1-5, Wikipedia. [cited by applicant]
Wikipedia, “Shamir's Secret Sharing”, Oct. 20, 2017, pp. 1-6. [cited by applicant]
Canadian Intellectual Property Office, “Office Action”, dated Oct. 15, 2024 from CA Application No. 3,169,707, from Foreign Counterpart to U.S. Appl. No. 17/169,985, pp. 1 through 5, Published: CA. [cited by applicant]
Raman et al., “Dynamic Distributed Storage for Blockchains,” 2018 IEEE International Symposium on Information Theory (ISIT), Jun. 22, 2018, pp. 2619 through 2623. [cited by applicant]