A distributed secure database system using evolving nonces

A distributed secure database system using evolving nonces and ghost servers secures small blockchain networks by ensuring valid block verification and adding smokescreen transactions, addressing vulnerabilities in smaller systems.

JP7590077B2Active Publication Date: 2024-11-26RAYTHEON CO
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
JP2023539823
Authority / Receiving Office
JP · JP
Patent Type
Patents
Current Assignee / Owner
Priority Date
2020-12-29
Filing Date
2021-12-22
Publication Date
2024-11-26
Estimated Expiration
2041-12-22

AI Technical Summary

Technical Problem

Small blockchain systems are vulnerable to attacks due to their smaller number of entities or nodes, making it easier for malicious actors to manipulate or breach the blockchain.

Method used

Implementing a distributed secure database system that uses evolving nonces, which are time-synchronized random or pseudorandom sequences generated at frequent intervals, allowing for secure block verification without complex cryptomining or voting schemes, and incorporating ghost servers to generate smokescreen transactions.

Benefits of technology

Enhances security in small blockchain systems by ensuring only valid blocks are added, while making it difficult for attackers to penetrate, thus maintaining data integrity and security without the computational overhead of traditional methods.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure 0007590077000001
    Figure 0007590077000001
  • Figure 0007590077000002
    Figure 0007590077000002
  • Figure 0007590077000003
    Figure 0007590077000003
Patent Text Reader

Abstract

The distributed secure database system includes a ledger, a transmitting device, an edge device, and a time synchronization source. An evolving nonce is generated at the transmitting device and the edge device. The evolving nonce is time synchronized across the transmitting device and the edge device. A hash value is generated at the transmitting device and the edge device using the evolving nonce. The hash value is verified at each of the transmitting device and the edge device during a specific time frame. When the hash value is verified by the transmitting device and the edge device, a block is added to the distributed secure database system.
Need to check novelty before this filing date? Find Prior Art

Description

[Technical field]

[0001] Claiming priority This patent application claims the benefit of priority to U.S. Application No. 17 / 136,905, filed December 29, 2020, which is incorporated by reference in its entirety.

[0002] Technical Field TECHNICAL FIELD The embodiments described herein relate generally to distributed secure databases, and in one embodiment, but not by way of limitation, to a distributed secure database that uses evolving nonces. [Background technology]

[0003] A distributed secure database system is sometimes called a blockchain, which is a growing list of blocks or records that are linked through some type of cryptography. The cryptography typically involves solving complex mathematical problems, commonly called cryptomining. Each block in the blockchain contains a cryptographic hash of the previous block in the blockchain, a timestamp, and the data.

[0004] Blockchains are resistant to modification of their data because once recorded, the data in any given block cannot be retroactively changed without modifying all subsequent blocks. For use as a distributed ledger, blockchains are typically managed by a peer-to-peer network that collectively adhere to a protocol for inter-node communication and verifying new blocks. Although blockchain records are not immutable, blockchains are highly secure when multiple devices or nodes are used. Blockchain technology is sometimes referred to as an open distributed ledger that can efficiently record transactions between two or more parties in a verifiable and permanent manner. [Brief description of the drawings]

[0005] The drawings, which are not necessarily drawn to scale, may include, but are not limited to, similar numerals that describe similar components in different figures. Similar numerals with different suffixes may represent different instances of similar components. Several embodiments are illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings.

[0006] [Figure 1] FIG. 1 is a block diagram of a distributed secure database system using evolving nonces.

[0007] [Diagram 2] FIG. 1 is a block diagram illustrating features and operation of a distributed secure database system using evolving nonces.

[0008] [Diagram 3] FIG. 1 is a block diagram of a computer system in which one or more of the disclosed embodiments may be implemented. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0009] In a typical distributed secure database system or blockchain, there are thousands of entities, devices or nodes. A well-known example of such a blockchain is the cryptocurrency Bitcoin. The sheer size of such a blockchain network, coupled with the difficulty of cryptomining associated with blockchains and the voting requirements for resolving disputes, makes it virtually impossible to improperly modify blocks in the blockchain or improperly add blocks to the blockchain. However, in smaller blockchain systems, it may be easier to breach the blockchain via attack methods that manipulate one or more blocks. For example, such systems may include fewer than 100 entities, devices or nodes; systems established with a publish / subscribe architecture; or device networks where all connected devices are "whitelisted." Embodiments of the present disclosure address these issues and provide a secure blockchain system for blockchains of any size, particularly those with a relatively small number of entities, devices or nodes.

[0010] Figure 1 is a block diagram illustrating components of a distributed secure database system using evolving nonce. Figure 2 is a block diagram illustrating the features and operation of a distributed secure database system using evolving nonce.

[0011] Referring initially to FIG. 1, a blockchain 100 includes a transmitting device 110, an edge device 120, an external time synchronization source 130, and a ledger 140. The transmitting device and the edge device have access to the ledger 140. The ledger 140 has a holding area 145. Evolving nonces 150 are generated for the transmitting device 110 and the edge device 120. The nonces may be hosted at the transmitting device, may exist separately from the transmitting device, or may be separable from the transmitting device when not in use. An embodiment includes one or more ghost servers 160, the function of which is described below in connection with FIG. 2. As described further below, before a transaction or block is added to the blockchain 100, the transaction or block must be verified and validated at 170 according to a method described.

[0012] FIG. 2 includes multiple process blocks 210-250. While arranged substantially serially in the example of FIG. 2, other examples may rearrange the blocks, omit one or more blocks, and / or execute two or more blocks in parallel using multiple processors or a single processor organized as two or more virtual machines or sub-processors. Additionally, still other examples may implement the blocks as one or more specific interconnected hardware or integrated circuit modules with associated control and data signals communicated through the modules. Thus, any process flows are applicable to software, firmware, hardware and hybrid implementations.

[0013] 2, at 210, an evolving nonce 150 is generated at the transmitting device and at each of the edge devices. As shown at 212, the evolving nonce 150 may be a random number, a pseudorandom or non-random sequence generated by a known algorithm (e.g., elliptic curve key generation), and / or a pseudorandom or non-random sequence generated by a future developed algorithm. Each of the transmitting device 110 and the edge device 120 is coupled to an external time source 130 so that the same nonce value can be generated for all of these devices at a particular time. In addition, the blockchain 100 can generate nonces continuously at any time, either at equal or varying intervals, which in a low transaction system is aided by one or more ghost servers 160 that act to seed valid blocks onto the blockchain. For example, the blockchain 100 can generate nonces at a rate on the order of every second. These time frames can be constant, for example, every second, or the time frames can be variable, such as a first time frame of 1 second, a second time frame of 4 seconds, a third time frame of 2 seconds, a fourth time frame of 1 second, etc. Each one of these generated nonces is time synchronized, so that at a particular time frame, each of the transmitting device 110 and the edge device 120, knowing the public information, can verify the nonce for a block by solving it directly, or given a public-private key architecture that allows the public key to be solved. As a result, unlike conventional blockchains, where nonce generation involves cryptomining, solving extensive and difficult problems, and computations, at limited frequency and many times, the evolving nonces of the present disclosure can be generated at very frequent time intervals (e.g., whenever a new transaction is available). In addition, conventional blockchains rely on the complexity of solving nonce to become increasingly computationally complex and drive scarcity, whereas in embodiments of the present disclosure, nonce generation is relatively easy, but drives a more computationally complex system to add or modify entries without authorization.

[0014] At 220, the nonce for a particular time frame is used to generate a hash value at each of the transmitting device 110 and the edge device 120. Referring again to FIG. 1, a one-way hash function 112 is used to generate the hash value. In one embodiment, metadata 114 may be used in generating the hash value. In another embodiment, the hash value is generated by providing the one-way hash function 112 with a previous hash value from a previous block, an external timestamp from a time synchronization source, and an evolving nonce.

[0015] At 230, the generated hash value is verified at each of the transmitting device 110 and the edge device 120. Block 170 of FIG. 1 illustrates this verification process. After the generation of the new hash value at each of the transmitting device 110 and the edge device 120, the hash value is placed in the holding area 145 of the secure ledger 140. The verification process does not require voting as in cryptocurrency-based distributed ledgers and is performed at each individual edge device. To verify a record, the edge device has the hash value from the previous record that was verified in the ledger, the timestamp value when the current record was generated, and an evolving nonce value that is associated with the time the record was generated. All these values ​​are concatenated into a string and hashed with the same function used to generate all other records in the ledger. If the hash value is the same as the hash value of the record being verified, the block is authentic, and if the hash value does not match the record, it is fake and is removed from the ledger.

[0016] After the new hash value is verified at each of the transmitting device 110 and the edge device 120, the new block is added to the distributed secure database system at 240. The result of operations 210-240 is that if the edge devices 120 are not synchronized within a limited time window of nonce generation, the block is not added to the blockchain. This is in contrast to traditional blockchains, which rely on solving complex mathematical problems (cryptomining) and voting schemes to resolve disputes. In addition, the ledger in the holding area and the original ledger must match. If they match, the new block is added to the blockchain. If they do not, the new block is not added to the blockchain.

[0017] At 250, the ghost server 160 of FIG. 1 generates transactions on the blockchain 100 on an aperiodic, semi-periodic, and / or partially constrained time basis to obscure normal traffic patterns in addition to providing additional blockchain security. Nonce may or may not be generated in association with these transactions generated by the ghost server 160. Rather, the purpose of the ghost server transactions is simply to place traffic on the blockchain network. These transactions act as a smokescreen, which makes it more difficult for third parties to infiltrate or hack the blockchain 100.

[0018] 3 is a block diagram illustrating a computing and communications platform 300 in an exemplary form of a general-purpose machine that may perform some or all of the operations of FIGS. 1 and 2 according to various embodiments. In particular embodiments, the programming of the computing platform 300 according to one or more particular algorithms produces a special-purpose machine upon execution of the programming. In a networked deployment, the computing platform 300 may operate in the capacity of either a server or a client machine in a server-client network environment, or as a peer machine in a peer-to-peer (or distributed) network environment.

[0019] The exemplary computing platform 300 includes at least one processor 302 (e.g., a central processing unit (CPU), a graphics processing unit (GPU), or both, a processor core, a computation node, etc.), a main memory 304, and a static memory 306, which communicate with each other via a link 308 (e.g., a bus). The computing platform 300 may further include a video display unit 310, input devices 312 (e.g., keyboard, camera, microphone), and a user interface (UI) navigation device 314 (e.g., mouse, touch screen). The computing platform 300 may additionally include a storage device 316 (e.g., a drive unit), a signal generating device 318 (e.g., a speaker), and an RF environment interface device (RFEID) 320.

[0020] Storage device 316 includes non-transitory machine-readable medium 322 on which is stored one or more sets of data structures and instructions 324 (e.g., software) that embody or are utilized by any one or more of the methods or functions described herein. Instructions 324 may also reside, completely or at least partially, within main memory 304, static memory 306, and / or processor 302 during execution by computing platform 300, with main memory 304, static memory 306, and processor 302 also constituting machine-readable media.

[0021] While the machine-readable medium 322 is illustrated in the exemplary embodiment as being a single medium, the term "machine-readable medium" may include a single medium or multiple media (e.g., centralized or distributed databases and / or associated caches and servers) that store one or more instructions 324. The term "machine-readable medium" should also be interpreted to include any tangible medium capable of storing, encoding, or carrying instructions for execution by a machine and capable of causing a machine to perform any one or more of the methods of the present disclosure, or storing, encoding, or carrying data structures used by or associated with such instructions. Thus, the term "machine-readable medium" should be interpreted to include, but is not limited to, solid-state memories, and optical and magnetic media. Specific examples of machine-readable media include, but are not limited to, non-volatile memory including semiconductor memory devices (e.g., electrically programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM)) and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and CD-ROM and DVD-ROM disks; and field programmable gate arrays (FPGAs).

[0022] The RFEID 320 includes radio receiver circuitry along with analog-to-digital conversion circuitry and interface circuitry for communicating over the link 308, according to various embodiments. Various form factors are contemplated for the RFEID 320. For example, the RFEID may be in the form of a wideband radio receiver or a scanning radio receiver that interfaces with the processor 302 over the link 308. In one example, the link 308 includes a PCI Express (PCIe) bus that includes a slot into which a NIC form factor may be removably mated. In another embodiment, the RFEID 320 includes circuitry located on a motherboard along with local link circuitry, processor interface circuitry, other input / output circuitry, memory circuitry, storage devices, peripheral controller circuitry, and the like. In another embodiment, the RFEID 320 is a peripheral device that interfaces with the link 308 via a peripheral input / output port, such as a Universal Serial Bus (USB) port. The RFEID 320 receives RF emissions over a wireless transmission medium 326. The RFEID 320 may be constructed to receive radar signaling, wireless communication signaling, unintended emissions, or some combination of such emissions.

[0023] The above detailed description includes references to the accompanying drawings, which form a part of the detailed description. The drawings show, by way of illustration, specific embodiments that may be practiced. These embodiments may also be referred to herein as "examples." Such examples may include elements in addition to those shown or described. However, examples that include the elements shown or described are also contemplated. Furthermore, examples that use any combination or permutation of these elements (or one or more aspects thereof) as shown or described with respect to a particular example (or one or more aspects thereof) or with respect to other examples (or one or more aspects thereof) shown or described herein are also contemplated.

[0024] The publications, patents, and patent documents referred to in this specification are incorporated by reference in their entirety as if each was individually incorporated by reference. In the event of a conflict between the usage in this document and those documents incorporated by reference, the usage in the incorporated references shall supplement the usage in this document, and in the event of no conflict, the usage in this document shall control.

[0025] As used herein, the terms "a" or "an" are used as is common in patent documents to include one or more, independent of any other instances or usages of "at least one" or "one or more." As used herein, the term "or" is used in an open-ended manner, such that "A or B" includes "including A but not including B," "including B but not including A," and "A and B," unless otherwise indicated. In the appended claims, the terms "including" and "in which" are used as the plain English equivalents of the respective terms "comprising" and "wherein." Also, in the following claims, the terms "including" and "comprising" are open-ended, i.e., in the claims, the terms "including" and "comprising" are open-ended, i.e., a system, device, article, or process that includes elements in addition to the elements recited after a term in a claim is still considered to be within the scope of that claim. Moreover, in the following claims, terms such as "first," "second," and "third" are used merely as labels and are not intended to imply a numerical order to their objects.

[0026] The above description is intended to be illustrative and not limiting. For example, the above examples (or one or more aspects thereof) may be used in combination with others. Other embodiments may be used by those of ordinary skill in the art who have reviewed the above description, for example. The Abstract is intended to enable the reader to quickly ascertain the nature of the technical disclosure. It is presented with the understanding that it will not be used to interpret or limit the scope or meaning of the claims. Also, in the above detailed description, various features may be grouped together to simplify the disclosure. However, the claims may not recite all features disclosed herein, since an embodiment may feature a subset of those features. Moreover, an embodiment may include fewer features than those disclosed in a particular example. Thus, the following claims are incorporated into the detailed description, and the claims stand alone as separate embodiments. The scope of the embodiments disclosed herein should be determined with reference to the appended claims, along with the full scope of equivalents to which such claims are entitled.

Claims

1. 1. A distributed secure database system, comprising: A ledger and A transmission device; A plurality of edge devices; A time synchronization source; The distributed secure database system comprises: generating an evolving nonce at the transmitting device and each of the plurality of edge devices, the evolving nonce being time synchronized across the transmitting device and each of the plurality of edge devices; generating a hash value at the transmitting device and each of the plurality of edge devices using the evolving nonce; verifying the hash value at the transmitting device and at each of the edge devices during a particular time frame; adding a block to the distributed secure database system when the hash value is verified by the transmission device and each of the plurality of edge devices; [0023] A distributed secure database system.

2. a server, the server being operable to generate additional traffic on the distributed secure database system to obscure normal traffic patterns on the distributed secure database system; 2. The distributed secure database system according to claim 1.

3. the hash value is generated by providing a previous hash value from a previous block, an external timestamp from the time synchronization source, and the evolving nonce to a one-way hash function.

2. The distributed secure database system according to claim 1.

4. adding metadata to the hash value; 4. The distributed secure database system according to claim 3.

5. The particular time frame may include a fixed time frame or a variable time frame.

2. The distributed secure database system according to claim 1.

6. The evolving nonce comprises a random number, a pseudorandom sequence, or a non-random sequence.

2. The distributed secure database system according to claim 1.

7. generating multiple nonces with varying frequency; 2. The distributed secure database system according to claim 1.

8. 1. A method for creating and maintaining a distributed secure database system, comprising: generating an evolving nonce at a transmitting device and at each of a plurality of edge devices, the evolving nonce being time synchronized across the transmitting device and each of the plurality of edge devices; generating a hash value at the transmitting device and each of the plurality of edge devices using the evolving nonce; verifying the hash value at the transmitting device and at each of the edge devices during a particular time frame; adding a block to the distributed secure database system when the hash value is verified by the transmitting device and each of the plurality of edge devices; A method comprising:

9. a server, the server being operable to generate additional traffic on the distributed secure database system to obscure normal traffic patterns on the distributed secure database system; The method according to claim 8.

10. the hash value is generated by providing a previous hash value from a previous block, an external timestamp from a time synchronization source, and the evolving nonce to a one-way hash function. The method according to claim 8.

11. adding metadata to the hash value; The method of claim 10.

12. The particular time frame may include a fixed time frame or a variable time frame. The method according to claim 8.

13. The evolving nonce comprises a random number, a pseudorandom sequence, or a non-random sequence. The method according to claim 8.

14. generating a plurality of nonces with varying frequency; The method according to claim 8.

15. When executed by the processor, generating an evolving nonce at a transmitting device and at each of a plurality of edge devices, the evolving nonce being time synchronized across the transmitting device and each of the plurality of edge devices; generating a hash value at the transmitting device and each of the plurality of edge devices using the evolving nonce; verifying the hash value at the transmitting device and at each of the edge devices during a particular time frame; adding a block to a distributed secure database system when the hash value is verified by the transmitting device and each of the plurality of edge devices; A non-transitory computer readable medium comprising instructions for performing a method comprising:

16. a server coupled to the non-transitory computer readable medium, the server operable to generate additional traffic on the distributed secure database system to obscure normal traffic patterns on the distributed secure database system.

16. The non-transitory computer readable medium of claim 15.

17. the hash value is generated by providing a previous hash value from a previous block, an external timestamp from a time synchronization source, and the evolving nonce to a one-way hash function.

16. The non-transitory computer readable medium of claim 15.

18. adding metadata to the hash value; 20. The non-transitory computer readable medium of claim 17.

19. The particular time frame may include a fixed time frame or a variable time frame.

16. The non-transitory computer readable medium of claim 15.

20. the evolving nonce comprises a random number, a pseudorandom sequence, or a non-random sequence; generating multiple nonces with varying frequency; 16. The non-transitory computer readable medium of claim 15.

Citation Information

Patent Citations

  • Authentication system

    JP2015130633A

  • Using Nonce Tables to Resolve Simultaneous Blockchain Transaction Failures

    JP2020518872A

  • Method and apparatus for selecting distributed consensus node based on proof of nonce

    US20190379538A1