US 11,296,889 B2Grant

Secret sharing via blockchains

Issue Date:2022-04-05

•14 Claims

•13 Drawing Sheets

Abstract

Confidential, secret data may be shared via one or more blockchains. Mortgage applications, medical records, financial records, and other electronic documents often contain social security numbers, names, addresses, account information, and other personal data. A secret sharing algorithm is applied to any secret data to generate shares. The shares may then be integrated or written to one or more blockchains for distribution.

Metadata

Assignee

Inveniam Capital Partners, Inc.

Inventors

Paul Snow
Brian Deery
Mahesh Paolini-Subramanya

Application Information

Application Number:US 16/548,932

Filing Date:2019-08-23

Priority Date:2017-02-17

Art Unit:2491

Classifications

IPC:

H04L9/32G06F21/62H04L9/06G06F21/60G06F21/64H04L9/08H04L29/06

Field of Search:

H04L 9/06H04L 9/0637H04L 9/0816H04L 9/085H04L 9/3236H04L 9/3239H04L 63/12H04L 63/123H04L 2209/20H04L 2209/38G06F 21/60G06F 21/62G06F 21/6218G06F 21/6245G06F 21/64

Patent Drawings (13 sheets)

Description

Cross-Reference to Related Applications

[0001] This patent application is a continuation of U.S. application Ser. No. 15/435,612 filed Feb. 17, 2017 and since issued as U.S. Pat. No. 10,411,897, which is incorporated herein by reference in its entirety. This patent application also relates to U.S. application Ser. No. 15/419,033 filed Jan. 30, 2017, since issued as U.S. Pat. No. 10,419,225, and to U.S. application Ser. No. 15/419,042 also filed Jan. 30, 2017 (since abandonded), with both patent applications incorporated herein by reference in their entireties.

Background

[0002] Security is important in today's online environment. One reads nearly every day of another hacking. People's data is even being held ransom.

Brief Description of the Several Views of the Drawings

[0003] The features, aspects, and advantages of the exemplary embodiments are understood when the following Detailed Description is read with reference to the accompanying drawings, wherein:

[0004] FIGS. 1-3 are simplified illustrations for secretly sharing an electronic document, according to exemplary embodiments;

[0005] FIG. 4 is a detailed illustration of an operating environment, according to exemplary embodiments;

[0006] FIGS. 5-6 illustrate hashing, according to exemplary embodiments;

[0007] FIGS. 7-8 illustrate a sharing strategy, according to exemplary embodiments;

[0008] FIGS. 9-10 are flowcharts illustrating methods or algorithms for secret sharing via blockchain(s), according to exemplary embodiments; and

[0009] FIGS. 11-12 depict still more operating environments for additional aspects of the exemplary embodiments.

Detailed Description

[0010] The exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings. The exemplary embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this disclosure will be thorough and complete and will fully convey the exemplary embodiments to those of ordinary skill in the art. Moreover, all statements herein reciting embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure).

[0011] Thus, for example, it will be appreciated by those of ordinary skill in the art that the diagrams, schematics, illustrations, and the like represent conceptual views or processes illustrating the exemplary embodiments. The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing associated software. Those of ordinary skill in the art further understand that the exemplary hardware, software, processes, methods, and/or operating systems described herein are for illustrative purposes and, thus, are not intended to be limited to any particular named manufacturer.

[0012] As used herein, the singular forms “a,” “an,” and “the” are intended to include the plural forms as well, unless expressly stated otherwise. It will be further understood that the terms “includes,” “comprises,” “including,” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof. It will be understood that when an element is referred to as being “connected” or “coupled” to another element, it can be directly connected or coupled to the other element or intervening elements may be present. Furthermore, “connected” or “coupled” as used herein may include wirelessly connected or coupled. As used herein, the term “and/or” includes any and all combinations of one or more of the associated listed items.

[0013] It will also be understood that, although the terms first, second, etc. may be used herein to describe various elements, these elements should not be limited by these terms. These terms are only used to distinguish one element from another. For example, a first device could be termed a second device, and, similarly, a second device could be termed a first device without departing from the teachings of the disclosure.

[0014] FIGS. 1-3 are simplified illustrations for secretly sharing an electronic document 20, according to exemplary embodiments. The electronic document 20 contains sensitive information, such as a user's social security number, income, banking, and other personal information. The electronic document 20, in plain words, contains secret data 22. While the electronic document 20 may have any content, most readers are thought familiar with a mortgage application 24. That is, the electronic document 20 may be a web-based, portable document format (PDF) associated with an applicant's personal and financial records for obtaining a mortgage. As the reader understands, the mortgage application 24 includes the secret data 22, such as an applicant's social security number, income, and banking records. If the mortgage application 24 were to fall into the wrong hands, the secret data 22 may be nefariously used by a rogue entity.

[0015] Exemplary embodiments thus protect the secret data 22. A server 26 retrieves a representation 28 of the electronic document 20 and splits the representation 28 into multiple pieces termed shares 30. The server 26 may then distribute one or more of the shares 30 via a blockchain 32. As the reader may understand, the blockchain 32 is generally a digital ledger in which transactions are chronologically and/or publically recorded. The blockchain 32 is most commonly used in decentralized cryptocurrencies (such as Bitcoin). The blockchain 32, however, may be adapted to any chain or custody (such as in medical records and in chains of title in real estate transactions). Indeed, there are many different mechanisms and configurations of the blockchain 32, and exemplary embodiments may be adapted to any version. Regardless, the shares 30 may be integrated into the blockchain 32 as a distribution or publication mechanism. The blockchain 32 may then route via a communications network 34 to any destination.

[0016] FIG. 2 illustrates secret sharing. Once the representation 28 of the electronic document 20 is split into the multiple shares 30, the server 26 may integrate any one or more of the shares 30 into the blockchain 32, perhaps with a timestamp 40. While the blockchain 32 may be sent or routed to any destination (such as an Internet Protocol address associated with another server or device), FIG. 2 illustrates peer distribution. That is, the server 26 may broadcast the blockchain 32 to the IP addresses associated with a group 42 of peer devices or nodes. The blockchain 32, in other words, is distributed to trusted peers for further processing and/or verification.

[0017] FIG. 3 further illustrates secret sharing. Here the server 26 may integrate any one or more of the shares 30 into multiple blockchains 32. While exemplary embodiments may utilize any number of different blockchains 32, FIG. 3 illustrates a simple example of three (3) blockchains 32a-c distributed to three (3) different groups 42a-c of peer devices. That is, some of the shares 30 (such as a first subset 50) are integrated into a first blockchain 32a and distributed (via the communications network 34 illustrated in FIGS. 1-2) to a first group 42a of peer devices. A second subset 52 of the shares 30 are integrated into a second blockchain 32b and distributed to a second group 42b of peer devices. Still more shares 30 (such as the remaining portion or pieces in a third subset 54) are integrated into a third blockchain 32c and distributed to a third group 42c of peer devices. Different collections of the shares 30, in other words, may be distributed via different blockchains 32 to different peer devices.

[0018] Exemplary embodiments may thus stash the secret data 22 in the multiple blockchains 32a-c. Because the electronic document 20 (containing the secret data 22) is split into the multiple shares 30, any one or more of the peer devices must possess a sufficient minimum number M_Min(illustrated as reference numeral 60) of the shares 30 before the secret data 22 may be recovered. That is, possession of an insufficient number of the shares 30 guarantees that the secret data 22 remains unknown and confidential. So, if the first blockchain 32a contains less than the M_Min60 of the total shares 30, then the first group 42a of peer devices cannot reconstruct the secret data 22. Likewise, if the second blockchain 32b and/or the third blockchain 32c also contains less than the M_Min30, the second group 42b of peer devices and the third group 42c of peer devices are also unable to reveal or decipher the secret data 22. In other words, no single one of the multiple blockchains 32a-c stores the requisite minimum number M_Min60 of the shares 30 to launch a brute-force attack on the secret data 22. Even multiple ones of the blockchains 32a-c may be purposefully designed to never exceed the requisite minimum number M_Min60 of the shares 30, perhaps thus forcing a hacker to compromise several or all of the blockchains 32a-c. A rogue attack, in simple words, would have to access and compromise multiple blockchains 32 before jeopardizing the secret data 22 contained within the electronic document 20.

[0019] Exemplary embodiments thus present an elegant solution. Sensitive, secret documents (containing the secret data 22) may be secretly shared via the one or more blockchains 32a-c. Even if the blockchains 32a-c are dispersed to trusted peer devices, the peer devices still cannot discern the secret data 22 until the threshold minimum number M_Min60 of the shares 30 is obtained. Exemplary embodiments thus purposefully add a second-layer of protection, beyond merely trusted receipt of the blockchain 32. The trusted peers simply do not have access to the secret data 22 until the minimum number M_Min60 of the shares 30 is obtained.

[0020] Any secret sharing scheme may be utilized. The reader is perhaps familiar with Shamir's Secret Sharing Algorithm, which is a well-known cryptographic algorithm. Exemplary embodiments divide the secret data 22 into unique parts (e.g., the shares 30), with each individual share 30 being different from other shares 30. However, there are many secret sharing or splitting schemes and algorithms for distributing a secret, and exemplary embodiments may be applied regardless of any particular scheme or algorithm.

[0021] FIG. 4 is a detailed illustration of an operating environment, according to exemplary embodiments. Here the server 26 secretly shares the electronic document 20 via the one or more blockchains 32. The server 26 may have a processor 70 (e.g., “μP”), application specific integrated circuit (ASIC), or other component that executes an electronic representation of a sharing algorithm 72 stored in a local memory device 74. The sharing algorithm 72 includes instructions, code, and/or programs that cause the server 26 to perform operations, such as splitting or segmenting the representation 28 of the electronic document 20 into the multiple shares 30. The sharing algorithm 72 may then select one or more of the shares 30 (such as the first subset 50) for integration into the first blockchain 32a. The sharing algorithm 72 may then select other ones of the shares 30 (such as the second subset 52) for integration into the second blockchain 32b. The sharing algorithm 72 may then integrate any remaining, unselected ones of the shares 30 (such as the third subset 54) for integration into the third blockchain 32c. The sharing algorithm 72 may also add the timestamp 40 to each blockchain 32a-c. After different collections of the shares 30 are integrated into the different blockchains 32a-c, the blockchains 32a-c are distributed to their respective destinations (such as Internet Protocol addresses associated with the first group 42a of peer devices, the second group 42b of peer devices, and the third group 42c of peer devices).

[0022] Exemplary embodiments may be applied regardless of networking environment. Exemplary embodiments may be easily adapted to stationary or mobile devices having cellular, wireless fidelity (WI-FI®), near field, and/or BLUETOOTH® capability. Exemplary embodiments may be applied to mobile devices utilizing any portion of the electromagnetic spectrum and any signaling standard (such as the IEEE 802 family of standards, GSM/CDMA/TDMA or any cellular standard, and/or the ISM band). Exemplary embodiments, however, may be applied to any processor-controlled device operating in the radio-frequency domain and/or the Internet Protocol (IP) domain. Exemplary embodiments may be applied to any processor-controlled device utilizing a distributed computing network, such as the Internet (sometimes alternatively known as the “World Wide Web”), an intranet, a local-area network (LAN), and/or a wide-area network (WAN). Exemplary embodiments may be applied to any processor-controlled device utilizing power line technologies, in which signals are communicated via electrical wiring. Indeed, exemplary embodiments may be applied regardless of physical componentry, physical configuration, or communications standard(s).

[0023] Exemplary embodiments may utilize any processing component, configuration, or system. Any processor could be multiple processors, which could include distributed processors or parallel processors in a single machine or multiple machines. The processor can be used in supporting a virtual processing environment. The processor could include a state machine, application specific integrated circuit (ASIC), programmable gate array (PGA) including a Field PGA, or state machine. When any of the processors execute instructions to perform “operations”, this could include the processor performing the operations directly and/or facilitating, directing, or cooperating with another device or component to perform the operations.

[0024] Exemplary embodiments may packetize. The server 26 and the recipient peer devices may have network interfaces to the communications network 34, thus allowing collection and retrieval of information. The information may be received as packets of data according to a packet protocol (such as the Internet Protocol). The packets of data contain bits or bytes of data describing the contents, or payload, of a message. A header of each packet of data may contain routing information identifying an origination address and/or a destination address.

[0025] FIGS. 5-6 illustrate hashing, according to exemplary embodiments. When the server 26 retrieves the representation 28 of the electronic document 20, here the representation 28 may be one or more hash values 80. That is, the server 26 may call or invoke an electronic representation of a hashing algorithm 82 that hashes electronic data 84 representing or associated with the electronic document 20 to generate the hash values 80. The hash values 80 may be associated with a hash tree 86 and/or root 88. The sharing algorithm 72 may then retrieve and split the hash values 80 into the multiple shares 30. The sharing algorithm 72 may then group or collect different ones of the shares 30 for integration into the one or more blockchains 32 (as this disclosure earlier explained). The blockchains 32 are then distributed to their respective destinations (again as this disclosure earlier explained). Exemplary embodiments may thus first hash the electronic document 20, create the shares 30 from the hash values 80, and then integrate the shares 30 into the blockchain(s) 32.

[0026] Hashing adds another layer of security. Exemplary embodiments may call or execute the hashing algorithm 82 that generates the hash values 80 (e.g., the hash tree 86 and the root 88) associated with the electronic document 20. There are many hashing algorithms, and exemplary embodiments may utilize any of the hashing algorithms. For example, many readers may be familiar with the SHA family of cryptographic hashing algorithms. Moreover, the hash tree 86 may be described as the Merkle tree, which many readers are also thought familiar. Regardless, once the hash values 80 are determined, exemplary embodiments may split the hash values 80 into the shares 30 for integration into the one or more blockchains 32. That is, the shares 30 may be added to, or incorporated in, any record, transaction, or block and distributed via the blockchain(s) 32.

[0027] FIG. 6 illustrates an alternative hashing strategy. Here the server 26 may call or invoke the sharing algorithm 72 to split the electronic data 84 associated with the electronic document 20 into the multiple shares 30. The server 26 may then apply the hashing algorithm 82 to the shares 30 to generate the hash values 80. The hash values 80 may then be integrated into the one or more blockchains 32 for distribution. Exemplary embodiments may thus first create the shares 30 from the electronic data 84, hash the shares 30, and then integrate the hash values 80 into the blockchain(s) 32.

[0028] FIGS. 7-8 illustrate a sharing strategy 90, according to exemplary embodiments. Here the sharing algorithm 72 may retrieve and implement the sharing strategy 90 that defines distribution via the multiple blockchains 32a-c to protect the secret data 22. Suppose, for example, that the total number N_S(illustrated as reference numeral 92) of the shares 30 defines a number N_B(illustrated as reference numeral 94) of the different blockchains 32. The total number N_S92 of the shares 30, in other words, may relate by a ratio to the number N_B94 of blockchains 32 that must be used. As a simple example, the ratio may be

[0029]

\frac{N_{S}}{N_{B}} = 10, 000,

where the total number N_S92 of the shares 30 is ten thousand (10,000) times the number N_B94 of blockchains 32 that must be used. Again, as a simple example, if the electronic document 20 is associated with one million (1,000,000) shares 30, then one hundred (100) different blockchains 32 must be generated and distributed. The sharing strategy 90, in other words, may set a maximum number N_Smax(illustrated as reference numeral 96) of shares 30 integrated into any single blockchain 32. The sharing strategy 90, in other words, may thus limit the number of the shares 30 exposed by any individual blockchain 32.

[0030] FIG. 8 further illustrates the sharing strategy 90. Here, though, the number N_B94 of blockchains may be based on the number of recipients. That is, the total number N_R(illustrated as reference numeral 98) of the recipients may define the number N_B94 of the different blockchains 32. The greater the recipients, in other words, then the greater the N_B94 of blockchains 32 that must be used. Again, suppose that the sharing strategy 90 may again be defined as the ratio

[0031]

\frac{N_{R}}{N_{B}} = 100,

where the total number N_R98 of the recipients is one hundred (100) times the number N_B94 of blockchains 32 that must be used. Again, as a simple example, if there are ten thousand recipients, then one hundred (100) different blockchains 32 must be generated and distributed. The sharing strategy 90, in other words, may set a maximum number N_Rmax(illustrated as reference numeral 100) of recipients per blockchain 32. The sharing strategy 90, in other words, may thus limit the number of the shares 30 exposed by any individual blockchain 32.

[0032] The sharing strategy 90 may be implemented as logical rules. If the sharing strategy 90 is mathematically defined (such as the ratio above discussed), the sharing strategy 90 may be expressed as logical statements involving mathematical expressions. Exemplary embodiments may code or program the sharing strategy 90 to achieve policy goals and/or security objectives.

[0033] FIG. 9 is a flowchart illustrating a method or algorithm for secret sharing via the blockchain(s) 32, according to exemplary embodiments. The electronic data 84 representing the electronic document 20 is received (Block 200). The electronic data 84 is hashed using the hashing algorithm 82 (Block 202) to generate the hash values 80 (Block 204). The shares are created from the hash values 80 (Block 206). The shares 30 are integrated into the one or more blockchains 32 (Block 208).

[0034] FIG. 10 is another flowchart illustrating a method or algorithm for secret sharing via the blockchain(s) 32, according to exemplary embodiments. The electronic data 84 representing the electronic document 20 is received (Block 200). The electronic data 84 is split to create the shares 30 (Block 202). The shares 30 are hashed using the hashing algorithm 82 (Block 204) to generate the hash values 80 (Block 206). The hash values 80 are integrated into the one or more blockchains 32 (Block 208).

[0035] FIG. 11 is a schematic illustrating still more exemplary embodiments. FIG. 11 is a more detailed diagram illustrating a processor-controlled device 250. As earlier paragraphs explained, the sharing algorithm 72 and the hashing algorithm 82 may partially or entirely operate in any mobile or stationary processor-controlled device. FIG. 11, then, illustrates the sharing algorithm 72 and the hashing algorithm 82 stored in a memory subsystem of the processor-controlled device 250. One or more processors communicate with the memory subsystem and execute either, some, or all applications. Because the processor-controlled device 250 is well known to those of ordinary skill in the art, no further explanation is needed.

[0036] FIG. 12 depicts other possible operating environments for additional aspects of the exemplary embodiments. FIG. 12 illustrates the sharing algorithm 72 and the hashing algorithm 82 operating within various other processor-controlled devices 250. FIG. 12, for example, illustrates that the sharing algorithm 72 and the hashing algorithm 82 may entirely or partially operate within a set-top box (“STB”) (252), a personal/digital video recorder (PVR/DVR) 254, a Global Positioning System (GPS) device 256, an interactive television 258, a tablet computer 260, or any computer system, communications device, or processor-controlled device utilizing any of the processors above described and/or a digital signal processor (DP/DSP) 262. Moreover, the processor-controlled device 250 may also include wearable devices (such as watches), radios, vehicle electronics, clocks, printers, gateways, mobile/implantable medical devices, and other apparatuses and systems. Because the architecture and operating principles of the various devices 250 are well known, the hardware and software componentry of the various devices 250 are not further shown and described.

[0037] Exemplary embodiments may be applied to any signaling standard. Most readers are thought familiar with the Global System for Mobile (GSM) communications signaling standard. Those of ordinary skill in the art, however, also recognize that exemplary embodiments are equally applicable to any communications device utilizing the Time Division Multiple Access signaling standard, the Code Division Multiple Access signaling standard, the “dual-mode” GSM-ANSI Interoperability Team (GAIT) signaling standard, or any variant of the GSM/CDMA/TDMA signaling standard. Exemplary embodiments may also be applied to other standards, such as the I.E.E.E. 802 family of standards, the Industrial, Scientific, and Medical band of the electromagnetic spectrum, BLUETOOTH®, and any other.

[0038] Exemplary embodiments may be physically embodied on or in a computer-readable storage medium. This computer-readable medium, for example, may include CD-ROM, DVD, tape, cassette, floppy disk, optical disk, memory card, memory drive, and large-capacity disks. This computer-readable medium, or media, could be distributed to end-subscribers, licensees, and assignees. A computer program product comprises processor-executable instructions for sharing secrets via blockchains, as the above paragraphs explained.

[0039] While the exemplary embodiments have been described with respect to various features, aspects, and embodiments, those skilled and unskilled in the art will recognize the exemplary embodiments are not so limited. Other variations, modifications, and alternative embodiments may be made without departing from the spirit and scope of the exemplary embodiments.

Claims

The invention claimed is:

1. A method conducted by a server that secretly shares an electronic document between computers, comprising:

retrieving, by the server, the electronic document;

splitting, by the server, the electronic document into a number N_Sof secret shares via an electronic representation of a secret sharing algorithm;

determining, by the server, a maximum number N_Smaxof the number N_Sof the secret shares that are permissibly integrated into a single blockchain network;

determining, by the server, a number N_Bof different blockchain networks that are required to distribute the number N_Sof the secret shares of the electronic document according to a ratio of N_B=N_S/N_Smax; and

publishing, by the server, the number N_Sof the secret shares via the required number N_Bof the different blockchain networks to the computers.

2. The method of claim 1, further comprising retrieving the electronic representation of the secret sharing algorithm.

3. The method of claim 1, wherein the retrieving of the electronic document further comprises retrieving an electronic mortgage application.

4. The method of claim 1, further comprising integrating the number N_Sof the secret shares into the number N_Bof the different blockchain networks.

5. The method of claim 1, further comprising generating a hash value representing a secret share of the number N_Sof the secret shares by hashing an electronic data representing the secret share.

6. A system that secretly shares an electronic document between computers, comprising:

a hardware processor; and

a memory device storing instructions that when executed by the hardware processor perform operations, the operations comprising:

retrieving an electronic data representing the electronic document;

splitting the electronic data representing the electronic document into a number N_Sof secret shares via an electronic representation of a secret sharing algorithm;

determining a maximum number N_Smaxof the number N_Sof the secret shares that are permissibly integrated into a single blockchain network;

determining a number N_Bof different blockchain networks that are required to distribute the number N_Sof the secret shares according to a ratio of N_B=N_S/N_Smax; and

distributing the number N_Sof the secret shares using the required number N_Bof the different blockchain networks to the computers.

7. The system of claim 6, wherein the operations further comprise retrieving the electronic representation of the secret sharing algorithm.

8. The system of claim 6, wherein the operations further comprise retrieving an electronic mortgage application as the electronic data representing the electronic document.

9. The system of claim 6, wherein the operations further comprise integrating the number N_Sof the secret shares into the number N_Bof the different blockchain networks.

10. The system of claim 6, wherein the operations further comprise generating a hash value representing a secret share of the number N_Sof the secret shares by hashing the electronic data representing the secret share.

11. A non-transitory memory device storing instructions that when executed by a hardware processor perform operations for secretly sharing an electronic document, the operations comprising:

retrieving the electronic document;

splitting the electronic document into a number N_Sof multiple shares via an electronic representation of a secret sharing algorithm;

determining a maximum number N_Smaxof the number N_Sof the multiple shares that are permissibly integrated into any single blockchain network;

determining a number N_Bof different blockchain networks that are required to distribute the multiple shares of the electronic document according to a ratio of N_B=N_S/N_Smax; and

distributing the number N_Sof the multiple shares via the number N_Bof the different blockchain networks.

12. The non-transitory memory device of claim 11, wherein the operations further comprise retrieving the electronic representation of the secret sharing algorithm.

13. The non-transitory memory device of claim 11, wherein the operations further comprise retrieving an electronic mortgage application as the electronic document.

14. The non-transitory memory device of claim 11, wherein the operations further comprise integrating the number N_Sof the multiple shares into the number N_Bof the different blockchain networks.

Patent Citations (284)

Patent	Date	Inventor	Cited By
US4309569(A)	1982-06-01	Merkel	Applicant
US5499294(A)	1996-03-01	Friedman	Applicant
US5862218(A)	1999-01-01	Steinberg	Applicant
US5920629(A)	1999-07-01	Rosen	Applicant
US5966446(A)	1999-10-01	Davis	Applicant
US6363481(B1)	2002-03-01	Hardjono	Examiner
US7028263(B2)	2006-04-01	Maguire	Applicant
US7212808(B2)	2007-05-01	Engstrom	Applicant
US7272179(B2)	2007-09-01	Siemens et al.	Applicant
US7572179(B2)	2009-08-01	Choi et al.	Applicant
US7729950(B2)	2010-06-01	Mendizabal et al.	Applicant
US8245038(B2)	2012-08-01	Golle et al.	Applicant
US8266439(B2)	2012-09-01	Haber et al.	Applicant
US8442903(B2)	2013-05-01	Zadoorian et al.	Applicant
US8560722(B2)	2013-10-01	Gates et al.	Applicant
US8706616(B1)	2014-04-01	Flynn	Applicant
US8712887(B2)	2014-04-01	DeGroeve et al.	Applicant
US8867741(B2)	2014-10-01	McCorkindale et al.	Applicant
US8943332(B2)	2015-01-01	Horne et al.	Applicant
US9124423(B2)	2015-09-01	Jennas, II et al.	Applicant
US9378343(B1)	2016-06-01	David	Applicant
US9396006(B2)	2016-07-01	Kundu et al.	Applicant
US9398018(B2)	2016-07-01	MacGregor	Applicant
US9407431(B2)	2016-08-01	Bellare et al.	Applicant
US9411524(B2)	2016-08-01	O'Hare et al.	Applicant
US9411976(B2)	2016-08-01	Irvine	Applicant
US9411982(B1)	2016-08-01	Dippenaar et al.	Applicant
US9424576(B2)	2016-08-01	Vandervort	Applicant
US9436935(B2)	2016-09-01	Hudon	Applicant
US9472069(B2)	2016-10-01	Roskowski	Applicant
US9489827(B2)	2016-11-01	Quinn et al.	Applicant
US9584493(B1)	2017-02-01	Leavy	Applicant
US9588790(B1)	2017-03-01	Wagner	Applicant
US9722790(B2)	2017-08-01	Ebrahimi	Applicant
US9818109(B2)	2017-11-01	Loh	Applicant
US9830580(B2)	2017-11-01	MacGregor	Applicant
US9875510(B1)	2018-01-01	Kasper	Applicant
US9876646(B2)	2018-01-01	Ebrahimi	Applicant
US9882918(B1)	2018-01-01	Ford et al.	Applicant
US10102265(B1)	2018-10-01	Madisetti	Applicant
US10102526(B1)	2018-10-01	Madisetti	Applicant
US10108954(B2)	2018-10-01	Dunlevy	Applicant
US10135607(B1)	2018-11-01	Roets	Applicant
US10163080(B2)	2018-12-01	Chow	Applicant
US10346815(B2)	2019-07-01	Glover	Applicant
US10373129(B1)	2019-08-01	James	Applicant
US10628268(B1)	2020-04-01	Baruch	Applicant
US10826685(B1)	2020-11-01	Campagna	Applicant
US10929842(B1)	2021-02-01	Arvanaghi	Applicant
US10958418(B2)	2021-03-01	Ajoy	Applicant
US10997159(B2)	2021-05-01	Iwama	Applicant
US2003/0018563(A1)	2003-01-01	Kilgour et al.	Applicant
US2004/0085445(A1)	2004-05-01	Park	Applicant
US2005/0206741(A1)	2005-09-01	Raber	Applicant
US2006/0075228(A1)	2006-04-01	Black et al.	Applicant
US2006/0184443(A1)	2006-08-01	Erez et al.	Applicant
US2007/0027787(A1)	2007-02-01	Tripp	Applicant
US2007/0094272(A1)	2007-04-01	Yeh	Applicant
US2007/0174630(A1)	2007-07-01	Shannon	Applicant
US2007/0296817(A1)	2007-12-01	Ebrahimi et al.	Applicant
US2008/0010466(A1)	2008-01-01	Hopper	Applicant
US2008/0028439(A1)	2008-01-01	Shevade	Applicant
US2008/0059726(A1)	2008-03-01	Rozas	Applicant
US2009/0025063(A1)	2009-01-01	Thomas	Applicant
US2009/0287597(A1)	2009-11-01	Bahar	Applicant
US2010/0049966(A1)	2010-02-01	Kato	Applicant
US2010/0058476(A1)	2010-03-01	Isoda	Applicant
US2010/0161459(A1)	2010-06-01	Kass et al.	Applicant
US2010/0228798(A1)	2010-09-01	Kodama	Applicant
US2010/0241537(A1)	2010-09-01	Kass et al.	Applicant
US2011/0061092(A1)	2011-03-01	Bailloeul	Applicant
US2011/0161674(A1)	2011-06-01	Ming	Applicant
US2012/0203670(A1)	2012-08-01	Piersol	Applicant
US2012/0264520(A1)	2012-10-01	Marsland	Applicant
US2013/0142323(A1)	2013-06-01	Chiarella	Applicant
US2013/0222587(A1)	2013-08-01	Roskowski	Applicant
US2013/0276058(A1)	2013-10-01	Buldas	Applicant
US2014/0201541(A1)	2014-07-01	Paul	Examiner
US2014/0229738(A1)	2014-08-01	Sato	Applicant
US2014/0282852(A1)	2014-09-01	Vestevich	Applicant
US2014/0289802(A1)	2014-09-01	Lee	Applicant
US2014/0344015(A1)	2014-11-01	Puertolas-Montasnes et al.	Applicant
US2015/0193633(A1)	2015-07-01	Chida	Applicant
US2015/0206106(A1)	2015-07-01	Yago	Applicant
US2015/0242835(A1)	2015-08-01	Vaughan	Applicant
US2015/0244729(A1)	2015-08-01	Mao	Applicant
US2015/0309831(A1)	2015-10-01	Powers	Applicant
US2015/0332256(A1)	2015-11-01	Minor	Applicant
US2015/0378627(A1)	2015-12-01	Kitazawa	Applicant
US2015/0379484(A1)	2015-12-01	McCarthy	Applicant
US2016/0071096(A1)	2016-03-01	Rosca	Applicant
US2016/0098578(A1)	2016-04-01	Hincker	Applicant
US2016/0119134(A1)	2016-04-01	Hakoda et al.	Applicant
US2016/0148198(A1)	2016-05-01	Kelley	Applicant
US2016/0162897(A1)	2016-06-01	Feeney	Applicant
US2016/0217436(A1)	2016-07-01	Brama	Applicant
US2016/0239653(A1)	2016-08-01	Loughlin-Mchugh	Applicant
US2016/0253663(A1)	2016-09-01	Clark et al.	Applicant
US2016/0260091(A1)	2016-09-01	Tobias	Applicant
US2016/0267472(A1)	2016-09-01	Lingham et al.	Applicant
US2016/0267558(A1)	2016-09-01	Bonnell et al.	Applicant
US2016/0275294(A1)	2016-09-01	Irvine	Applicant
US2016/0283920(A1)	2016-09-01	Fisher et al.	Applicant
US2016/0292396(A1)	2016-10-01	Akerwall	Applicant
US2016/0292672(A1)	2016-10-01	Fay et al.	Applicant
US2016/0292680(A1)	2016-10-01	Wilson, Jr. et al.	Applicant
US2016/0294783(A1)	2016-10-01	Piqueras Jover	Applicant
US2016/0300200(A1)	2016-10-01	Brown et al.	Applicant
US2016/0300234(A1)	2016-10-01	Moss-Pultz et al.	Applicant
US2016/0321675(A1)	2016-11-01	McCoy et al.	Applicant
US2016/0321751(A1)	2016-11-01	Creighton, IV et al.	Applicant
US2016/0321769(A1)	2016-11-01	McCoy	Applicant
US2016/0328791(A1)	2016-11-01	Parsells et al.	Applicant
US2016/0330031(A1)	2016-11-01	Drego et al.	Applicant
US2016/0330244(A1)	2016-11-01	Denton	Applicant
US2016/0337119(A1)	2016-11-01	Hosaka et al.	Applicant
US2016/0342977(A1)	2016-11-01	Lam	Applicant
US2016/0342989(A1)	2016-11-01	Davis	Applicant
US2016/0344737(A1)	2016-11-01	Anton et al.	Applicant
US2016/0371771(A1)	2016-12-01	Serrano	Applicant
US2017/0005797(A1)	2017-01-01	Lanc et al.	Applicant
US2017/0005804(A1)	2017-01-01	Zinder	Applicant
US2017/0033933(A1)	2017-02-01	Haber	Applicant
US2017/0053249(A1)	2017-02-01	Tunnell et al.	Applicant
US2017/0061396(A1)	2017-03-01	Melika et al.	Applicant
US2017/0075938(A1)	2017-03-01	Black	Applicant
US2017/0103167(A1)	2017-04-01	Shah	Applicant
US2017/0124534(A1)	2017-05-01	Savolainen	Applicant
US2017/0124535(A1)	2017-05-01	Juels et al.	Applicant
US2017/0161439(A1)	2017-06-01	Raduchel	Examiner
US2017/0177898(A1)	2017-06-01	Dillenberger	Applicant
US2017/0178237(A1)	2017-06-01	Wong	Applicant
US2017/0213287(A1)	2017-07-01	Bruno	Applicant
US2017/0221052(A1)	2017-08-01	Sheng	Applicant
US2017/0228731(A1)	2017-08-01	Sheng	Applicant
US2017/0236123(A1)	2017-08-01	Ali	Applicant
US2017/0243208(A1)	2017-08-01	Kurian et al.	Applicant
US2017/0243289(A1)	2017-08-01	Rufo	Applicant
US2017/0244757(A1)	2017-08-01	Castinado et al.	Applicant
US2017/0330279(A1)	2017-11-01	Ponzone	Applicant
US2017/0344983(A1)	2017-11-01	Muftic	Applicant
US2017/0352031(A1)	2017-12-01	Collin	Applicant
US2017/0353309(A1)	2017-12-01	Gray	Applicant
US2017/0373859(A1)	2017-12-01	Shors et al.	Applicant
US2018/0005186(A1)	2018-01-01	Hunn	Applicant
US2018/0075239(A1)	2018-03-01	Boutnaru	Applicant
US2018/0075527(A1)	2018-03-01	Nagla et al.	Applicant
US2018/0091524(A1)	2018-03-01	Setty	Applicant
US2018/0097779(A1)	2018-04-01	Karame et al.	Applicant
US2018/0101701(A1)	2018-04-01	Barinov	Applicant
US2018/0101842(A1)	2018-04-01	Ventura	Applicant
US2018/0108024(A1)	2018-04-01	Greco	Applicant
US2018/0117446(A1)	2018-05-01	Tran	Applicant
US2018/0139042(A1)	2018-05-01	Binning	Applicant
US2018/0157700(A1)	2018-06-01	Roberts	Applicant
US2018/0167201(A1)	2018-06-01	Naqvi	Applicant
US2018/0173906(A1)	2018-06-01	Rodriguez	Applicant
US2018/0176017(A1)	2018-06-01	Rodriguez	Applicant
US2018/0181768(A1)	2018-06-01	Leporini	Applicant
US2018/0182042(A1)	2018-06-01	Vinay	Applicant
US2018/0189333(A1)	2018-07-01	Childress	Applicant
US2018/0189781(A1)	2018-07-01	McCann	Applicant
US2018/0204213(A1)	2018-07-01	Zappier	Applicant
US2018/0219683(A1)	2018-08-01	Deery	Applicant
US2018/0219685(A1)	2018-08-01	Deery	Applicant
US2018/0225640(A1)	2018-08-01	Chapman	Applicant
US2018/0241565(A1)	2018-08-01	Paolini-Subramanya	Applicant
US2018/0260888(A1)	2018-09-01	Paolini-Subramanya	Applicant
US2018/0260889(A1)	2018-09-01	Paolini-Subramanya	Applicant
US2018/0268162(A1)	2018-09-01	Dillenberger	Applicant
US2018/0268382(A1)	2018-09-01	Wasserman	Applicant
US2018/0268504(A1)	2018-09-01	Paolini-Subramanya	Applicant
US2018/0276668(A1)	2018-09-01	Li	Applicant
US2018/0276745(A1)	2018-09-01	Paolini-Subramanya	Applicant
US2018/0285879(A1)	2018-10-01	Gadnis	Examiner
US2018/0285970(A1)	2018-10-01	Snow	Applicant
US2018/0285971(A1)	2018-10-01	Rosenoer	Applicant
US2018/0288022(A1)	2018-10-01	Madisetti	Applicant
US2018/0315051(A1)	2018-11-01	Hurley	Applicant
US2018/0316502(A1)	2018-11-01	Nadeau	Applicant
US2018/0365201(A1)	2018-12-01	Hunn	Applicant
US2018/0365764(A1)	2018-12-01	Nelson	Applicant
US2018/0367298(A1)	2018-12-01	Wright	Examiner
US2019/0012637(A1)	2019-01-01	Gillen	Applicant
US2019/0013948(A1)	2019-01-01	Mercuri	Applicant
US2019/0018947(A1)	2019-01-01	Li	Applicant
US2019/0036887(A1)	2019-01-01	Miller	Applicant
US2019/0043048(A1)	2019-02-01	Wright	Applicant
US2019/0044727(A1)	2019-02-01	Scott	Applicant
US2019/0050855(A1)	2019-02-01	Martino	Applicant
US2019/0057382(A1)	2019-02-01	Wright	Applicant
US2019/0073666(A1)	2019-03-01	Ortiz	Applicant
US2019/0080284(A1)	2019-03-01	Kim	Applicant
US2019/0081793(A1)	2019-03-01	Martino	Applicant
US2019/0087446(A1)	2019-03-01	Sharma	Applicant
US2019/0123889(A1)	2019-04-01	Schmidt-Karaca	Applicant
US2019/0132350(A1)	2019-05-01	Smith	Applicant
US2019/0188699(A1)	2019-06-01	Thibodeau	Applicant
US2019/0197532(A1)	2019-06-01	Jayachandran	Applicant
US2019/0205563(A1)	2019-07-01	Gonzales, Jr.	Applicant
US2019/0236286(A1)	2019-08-01	Scriber	Applicant
US2019/0251557(A1)	2019-08-01	Jin	Applicant
US2019/0253258(A1)	2019-08-01	Thekadath	Applicant
US2019/0268141(A1)	2019-08-01	Pandurangan	Applicant
US2019/0268163(A1)	2019-08-01	Nadeau	Applicant
US2019/0281259(A1)	2019-09-01	Palazzolo	Applicant
US2019/0287107(A1)	2019-09-01	Gaur	Applicant
US2019/0288832(A1)	2019-09-01	Dang	Applicant
US2019/0296915(A1)	2019-09-01	Lancashire	Applicant
US2019/0303623(A1)	2019-10-01	Reddy	Applicant
US2019/0303887(A1)	2019-10-01	Wright	Applicant
US2019/0324867(A1)	2019-10-01	Tang	Applicant
US2019/0334715(A1)	2019-10-01	Gray	Applicant
US2019/0342422(A1)	2019-11-01	Li	Applicant
US2019/0347444(A1)	2019-11-01	Lowagie	Applicant
US2019/0347628(A1)	2019-11-01	Al-Naji	Applicant
US2019/0349190(A1)	2019-11-01	Smith	Applicant
US2019/0349426(A1)	2019-11-01	Smith	Applicant
US2019/0354606(A1)	2019-11-01	Snow	Applicant
US2019/0354607(A1)	2019-11-01	Snow	Applicant
US2019/0354611(A1)	2019-11-01	Snow	Applicant
US2019/0354724(A1)	2019-11-01	Lowagie	Applicant
US2019/0354725(A1)	2019-11-01	Lowagie	Applicant
US2019/0354964(A1)	2019-11-01	Snow	Applicant
US2019/0356733(A1)	2019-11-01	Snow	Applicant
US2019/0372770(A1)	2019-12-01	Xu	Applicant
US2019/0378128(A1)	2019-12-01	Moore	Applicant
US2019/0391540(A1)	2019-12-01	Westervelt	Applicant
US2019/0391858(A1)	2019-12-01	Studnicka	Applicant
US2019/0394044(A1)	2019-12-01	Snow	Applicant
US2019/0394048(A1)	2019-12-01	Deery	Applicant
US2020/0004946(A1)	2020-01-01	Gilpin	Applicant
US2020/0005290(A1)	2020-01-01	Madisetti	Applicant
US2020/0034813(A1)	2020-01-01	Calinog	Applicant
US2020/0042635(A1)	2020-02-01	Douglass	Applicant
US2020/0042960(A1)	2020-02-01	Cook	Applicant
US2020/0042982(A1)	2020-02-01	Snow	Applicant
US2020/0042983(A1)	2020-02-01	Snow	Applicant
US2020/0042984(A1)	2020-02-01	Snow	Applicant
US2020/0042985(A1)	2020-02-01	Snow	Applicant
US2020/0042986(A1)	2020-02-01	Snow	Applicant
US2020/0042987(A1)	2020-02-01	Snow	Applicant
US2020/0042988(A1)	2020-02-01	Snow	Applicant
US2020/0042990(A1)	2020-02-01	Snow	Applicant
US2020/0042995(A1)	2020-02-01	Snow et al.	Applicant
US2020/0044827(A1)	2020-02-01	Snow	Applicant
US2020/0044856(A1)	2020-02-01	Lynde	Applicant
US2020/0044857(A1)	2020-02-01	Snow	Applicant
US2020/0065761(A1)	2020-02-01	Tatchell	Applicant
US2020/0089690(A1)	2020-03-01	Qiu	Applicant
US2020/0099534(A1)	2020-03-01	Lowagie	Applicant
US2020/0104712(A1)	2020-04-01	Katz	Applicant
US2020/0145219(A1)	2020-05-01	Sebastian	Applicant
US2020/0167870(A1)	2020-05-01	Isaacson	Applicant
US2020/0175506(A1)	2020-06-01	Snow	Applicant
US2020/0195441(A1)	2020-06-01	Suen	Applicant
US2020/0211011(A1)	2020-07-01	Anderson	Applicant
US2020/0279324(A1)	2020-09-01	Snow	Applicant
US2020/0279325(A1)	2020-09-01	Snow	Applicant
US2020/0279326(A1)	2020-09-01	Snow	Applicant
US2020/0280447(A1)	2020-09-01	Snow	Applicant
US2020/0302433(A1)	2020-09-01	Green	Applicant
US2020/0389294(A1)	2020-12-01	Soundararajan	Applicant
US2021/0174353(A1)	2021-06-01	Snow	Applicant
US2021/0200653(A1)	2021-07-01	Jetzfellner	Applicant
US2021/0266174(A1)	2021-08-01	Snow	Applicant
US2021/0272103(A1)	2021-09-01	Snow	Applicant
US2021/0273810(A1)	2021-09-01	Lynde	Applicant
US2021/0273816(A1)	2021-09-01	Deery et al.	Applicant
US2021/0328804(A1)	2021-10-01	Snow	Applicant
CN110392052	2019-10-01		Applicant
DE10128728	2003-01-01		Applicant
EP3726438	2020-10-01		Applicant
JP5383297	2014-01-01		Applicant
KR100653512	2006-11-01		Applicant
KR101747221	2017-06-01		Applicant
WO49797	2000-08-01		Applicant
WO2007069176	2007-06-01		Applicant
WO2015077378	2015-05-01		Applicant
WO2018013898(A1)	2018-01-01		Applicant
WO2018109010	2018-06-01		Applicant
WO2018127923	2018-07-01		Applicant
WO2019180702	2019-09-01		Applicant
WO2019/207504	2019-10-01		Applicant

Non-Patent Literature (25)

Kroeger, T. et al., The Case for Distributed Data Archival Using Secret Splitting with Percival, 6th International Symposium on Resilient Control Systems (available at IEEE Xplore), p. 204-209 (Year: 2013).Examiner
Watanabe, Hiroki, et al. “Blockchain contract: Securing a blockchain applied to smart contracts.” 2016 IEEE International Conference on Consumer Electronics (ICCE). IEEE, 2016.Applicant
Crosby, Michael et al., “BlockChain Technology, Beyond Bitcoin”, Sutardja Center for Entrepreneurship & Technology, Berkeley Engineering, Oct. 16, 2015, 35 pages.Applicant
Alsolami, Fahad, and Terrance E. Boult. “CloudStash: using secret-sharing scheme to secure data, not keys, in multi-clouds.” Information Technology: New Generations (ITNG), 2014 11th International Conference on. IEEE, 2014.Applicant
Unknown, “Midex”, https://promo.midex.com/Midex_EN.pdf, 25 pages.Applicant
Unknown, Xtrade White Paper, https://xtrade1-9649.kxcdn.com/wp-content/uploads/2017/09/xtrade-whitepaper.pdf Feb. 7, 2018, 37 pages.Applicant
Haarmann, et al., “DMN Decision Execution on the Ethereum Blockchain,” Hasso Plattner Institute, University of Potsdam, 15 pages.Applicant
Kim et al., “A Perspective on Blockchain Smart Contracts,” Schulich School of Business, York University, Toronto, Canada, 6 pages.Applicant
Chakravorty, Antorweep, and Chunming Rong, “Ushare: user controlled social media based on blockchain.” Proceedings of the 11th International Conference on Ubiquitous Information Management and Communication. ACM, 2017.Applicant
Chen, Zhixong, and Yixuan Zhu. “Personal Archive Service System using Blockchain Technology: Case Study, Promising and Challenging.” AI & Mobile Services (AIMS), 2017 IEEE International Conference on. IEEE, 2017.Applicant
Al-Naji, Nader et al., “Basis: A Price-Stable Cryptocurrency with an Algorithmic Central Bank” www.basis.io Jun. 20, 2017, 27 pages.Applicant
Unkown, “Federated Learning: Collaborative Machine Learning without Centralized Training Data” Apr. 6, 2017, 11 pages.Applicant
Casey, “BitBeat: Factom Touts Blockchain Tool for Keeping Record Keepers Honest”, Wall Street Journal, Nov. 5, 2014.Applicant
Menezes, Alfred. J., et al. “Handbook of Applied Cryptography,” 1997, CRC Press, p. 527-28.Applicant
Written Opinion in PCT/US2021/040207, Snow, dated Oct. 7, 2021.Applicant
White, Ron, “How Computers Work,” Oct. 2003, Que, Seventh Edition (Year: 2003), 23 pages.Applicant
Luu et al., Making Smart Contracts Smarter, 2016.Applicant
Feng and Luo, “Evaluating Memory-Hard Proof-of-Work Algorithms on Three Processors,” PVLDB, 13(6): 898-911, 2020.Applicant
Luther, “Do We Need a “Fedcoin” Cryptocurrency?,” ValueWalk, Newstex Global Business Blogs, Dec. 30, 2015 (Year: 2015).Applicant
Iddo Bentov, Bitcoin and Secure Computation with Money, May 2016 (Year: 2016).Applicant
United States: New Generation cryptocurrency, USDX Protocol, Offers Crypto Advantages and Fiat Pegging, Apr. 2, 2018 (Year: 2018).Applicant
Ana Reyna et al.; “On blockchain and its integration with IoT. Challenges and opportunities.” Future Generation Computer Systems. vol. 88, Nov. 2018, pp. 173-190. https://www.sciencedirect.com/science/article/pii/S0167739X17329205 (Year: 2018).Applicant
Krol, Michal et al., “SPOC: Secure Payments for Outsourced Computations” https://arxiv.org/pdf/1807.06462.pdf. (Year: 2018).Applicant
Dai et al., “TrialChain: A Blockchain-Based Platform to Validate Data Integrity in Large, Biomedical Research Studies,” arXiv: 1807.03662, Jul. 10, 2018 (Year: 2018).Applicant
Eberhardt et al., “ZoKrates—Scalable Privacy-Preserving Off-Chain Computations,” https://ieeeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=8726497. (Year:2018).Applicant