Vehicle incident management using peer-to-peer networks and systems

Through peer-to-peer network and blockchain technology, the problem of data loss and modification in the data recording and reporting process in the vehicle accident management system is solved, and the data security and immutability are realized, and the reliability of the accident management system is improved. Transparency.

CN113711571BActive Publication Date: 2024-11-08MICRON TECHNOLOGY INC
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202080029456.4
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2019-03-25
Filing Date
2020-03-06
Publication Date
2024-11-08
Estimated Expiration
2040-03-06

AI Technical Summary

Technical Problem

The existing vehicle accident management system has problems such as data loss, difficulty in traceability of modification, and difficulty in ensuring data integrity during data recording and reporting, especially during power loss or data transmission during accidents.

Method used

Using peer-to-peer network and blockchain technology, the vehicle accident data is recorded and transmitted through the distributed architecture between peer-to-peer network nodes, and the blockchain's encrypted link and consensus mechanism ensures the integrity and immutability of data, using asymmetric Passwords perform message exchange and identity authentication, generating and verifying records in the blockchain.

Benefits of technology

The safety, immutability and reliability of vehicle accident data are achieved, ensuring that data is recorded after the accident without changing, reducing the risk of data loss and modification, and improving the reliability and transparency of the accident management system.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113711571B_ABST
    Figure CN113711571B_ABST
Patent Text Reader

Abstract

A computing node in a peer-to-peer network may receive data about an accident in response to a vehicle having an accident. A computing device in the peer-to-peer network may generate a record of the data and store a copy of the record in a persistent memory. The computing device may transmit the record to other computing nodes in the network via a peer-to-peer connection. Upon receiving the record, the nodes in the network may each store a copy of the record and broadcast the record to one or more additional computing nodes in the network to cause the one or more additional computing nodes to store one or more additional copies of the record. In response to a query about the accident, the node may provide the record. The node may participate in determining a network consensus in the network regarding the validity of the record.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Related Applications

[0002] This application claims priority to U.S. patent application serial number 16 / 363,069, filed on March 25, 2019, and entitled “VEHICLE ACCIDENT MANAGEMENT USING PEER-TO-PEER NETWORKS AND SYSTEMS,” the entire disclosure of which is hereby incorporated by reference herein. Technical Field

[0003] At least some embodiments disclosed herein relate generally to vehicle incident management systems, and more particularly, but not limited to, at least some embodiments disclosed herein relate to vehicle incident sensing, recording, and reporting using peer-to-peer networks and systems. Background Art

[0004] Accident management may include centralized management of claims following road crashes. This management may help drivers get back on the road and manage the claims process. Accident management encompasses many services, which may include vehicle recovery, vehicle replacement, damage assessment, arrangement for vehicle repairs, dealing with insurers, uninsured loss compensation, determining liability, injury assistance, and assistance with file preparation. Accident management is particularly useful for fleet operators who need to keep downtime of their vehicles to a minimum.

[0005] Peer-to-peer (P2P) computing or networking is a distributed application architecture that distributes tasks or workloads among peer computing devices. Peer computing devices may be equally privileged participants in an application. Peer computing devices are said to form a peer-to-peer network of nodes. Peer computing devices (which are independently operating devices relative to each other) make a portion of their resources (e.g., processing power, disk storage, or network bandwidth) directly available to other network participants without central coordination by a server or other type of central computing device.

[0006] A blockchain is a list of records that can grow with each transaction recorded to the chain. Records can be called blocks, and blocks can be linked using cryptography. Each block can contain a cryptographic hash of the previous block, a timestamp, and transaction data, usually represented as a Merkle Tree root hash. Blockchains can prevent their data from being modified. To serve as a distributed ledger, blockchains can be managed by a peer-to-peer network that jointly adheres to a protocol for inter-node communication and for confirming new blocks. Once recorded, the data in any given block cannot be retroactively changed without changing subsequent blocks, which requires some kind of consensus of the blockchain network. BRIEF DESCRIPTION OF THE DRAWINGS

[0007] The present disclosure will be more completely understood from the detailed description given below and the accompanying drawings of various embodiments of the present disclosure.

[0008] Figure 1 An example computing system is illustrated that can implement a vehicle incident management system for vehicle incident sensing, recording, and reporting using a peer-to-peer network and system in accordance with some embodiments of the present disclosure.

[0009] Figure 2 An example portion of an example traffic control device is described according to some embodiments of the present disclosure.

[0010] Figure 3 An example portion of an example vehicle is described according to some embodiments of the present disclosure.

[0011] Figure 4 is a flow chart of an example method performed by an example computing node of a peer-to-peer network according to some embodiments of the present disclosure.

[0012] Figure 5 is a flow chart of an example method performed by an example vehicle, according to some embodiments of the present disclosure, wherein the vehicle may or may not include a computing node of a peer-to-peer network.

[0013] Figure 6 Example data included in an example incident report communication sent from an example traffic control device is illustrated in accordance with some embodiments of the present disclosure.

[0014] Figure 7 Example data included in an example accident report communication sent from an example vehicle is illustrated according to some embodiments of the present disclosure.

[0015] Figure 8 A portion of an example blockchain illustrating blocks, where each block includes an incident report communication from a reporting party, such as a reporting vehicle or a reporting traffic control device.

[0016] Fig.9A An apparatus or non-transitory computer-readable storage medium for generating triples according to some embodiments is described.

[0017] Fig. 9B An apparatus or non-transitory computer-readable storage medium for validating triples and generating second-layer triples according to some embodiments is described. DETAILED DESCRIPTION

[0018] At least some aspects of the present disclosure relate to a vehicle accident management system using a peer-to-peer network and system and in particular, in some embodiments, the system includes vehicle accident sensing, recording and reporting using a peer-to-peer network and system. In some instances, the system records information about instances of vehicle accidents using blocks of a blockchain.

[0019] Information about the accident can be collected from the black box of the vehicle involved in the accident and / or other nearby machines (such as other vehicles and traffic control devices). This collected information can then be transmitted to the computing nodes of the peer-to-peer network to implement the blockchain ledger. The blockchain ledger can ensure that the accident data collected by the black box and / or other devices is recorded and not altered or destroyed after the accident.

[0020] Additionally, blockchains can implement redundant copies distributed to computing nodes in an integrated manner by cryptographically linking records. Records can be linked by a hash of the record contained in the content of at least a subsequent record, so that changes to a previous record can be easily detected by checking against its hash in a subsequent record. Validity can be checked against the hash in the replica and downstream records.

[0021] In some embodiments, to economize on the use of blockchain, a hash of the incident data from a black box or another device may be used to replace the raw collected data collected from sensors and cameras that sense and monitor the incident. Additionally, small data fields may be included in the record to minimize the use and size growth of the blockchain ledger. Although in some embodiments, the entire data set from the black box and other monitoring devices may be offloaded to one or more servers and / or blockchains.

[0022] In some embodiments, the system may use asymmetric cryptography for message exchanges between parties of the system. The system may use certificates based on asymmetric cryptography to indicate the identity of the vehicle's devices, traffic control devices (generally computing nodes), and other machines involved in the system. In addition, the system may use peer-to-peer networks and systems to maintain the integrity of message exchanges between parties of the system. For example, blockchain networks and systems may be used by some instances of the system.

[0023] The exchange of messages between these parties is a process that can be protected via the device identity combination system. In some embodiments, transaction records, incident data and / or status resulting from the message exchange can be stored in the blockchain. Thus, the integrity of the records is protected by the blockchain. Asymmetric cryptography can be used for mutual authentication between the incident monitoring party and the data recording party, which can be seen in certificates, digital signatures on exchanged messages, and / or in the implementation of the device identity combination system. Each party has a public key from the other party that is mutually authenticated. Both parties can accept each other's certificates, where (for example) a subscription is activated.

[0024] In addition, one or more ledgers (e.g., one or more blocks of a blockchain) may be used to record messages exchanged between parties. For example, each monitoring party and / or data recording party may have its own ledger associated with it. Each ledger may be implemented by a blockchain so that each recorded message in the ledger can maintain its integrity through the hash feature of the block of the blockchain.

[0025] Figure 1An example computing system 100 is illustrated that can implement a vehicle accident management system for vehicle accident sensing, recording, and reporting using a peer-to-peer network and system according to some embodiments of the present disclosure. System 100 includes at least one traffic control device 102, a vehicle 104, one or more communication networks 118, additional vehicles (e.g., vehicles 160 and 170), additional traffic control devices 150, and at least two representative computing nodes of the peer-to-peer network (e.g., computing nodes 182 and 184). Traffic control device 102 includes at least one traffic control computing device 110 having a vehicle tracking application 120 including a blockchain module 122 that can perform at least some of the operations described herein, such as at least some of the method steps of method 400. Vehicle 104 includes at least a vehicle computing device 112 having a vehicle tracking application 140 including a blockchain module 142 that can perform at least some of the operations described herein, such as at least some of the method steps of methods 400 and 500. The communication network(s) 118 include at least one wide area network (WAN), a local area network (LAN), an intranet, an extranet, the Internet, and / or any combination thereof.

[0026] Each of vehicles 160 and 170 includes portions of a vehicle, such as computing devices 162 and 172 as illustrated. Traffic control device 150 also includes computing device 152 and other portions of the traffic control device. The computing devices described herein (e.g., computing devices 110, 112, 152, 162, and 172) and example representative computing nodes of peer-to-peer networks (computing nodes 182 and 184), and / or any other computer systems or computing machines described herein may be personal computers (PCs), tablet PCs, set-top boxes (STBs), personal digital assistants (PDAs), cellular phones, network appliances, servers, network routers, switches or bridges, or any machine capable of executing a set of instructions (sequentially or otherwise) specifying actions to be taken by the machine. Furthermore, although specific to Figure 1 Each of the illustrated computing devices and computing nodes 182 and 184 illustrates a single machine, but the term "machine" shall also be taken to include any collection of machines that individually or jointly execute a set (or multiple sets) of instructions to perform any one or more of the methodologies or operations discussed herein. Figure 1 Each of the illustrated computing devices (and other computing devices described herein) and computing nodes 182 and 184 may each include at least one bus and / or motherboard, one or more controllers (e.g., one or more CPUs), main memory that may include temporary data storage, at least one type of network interface, a storage system that may include persistent data storage, and / or any combination thereof.

[0027] Blockchain modules 122 and 142 may also be configured to generate a new block of the blockchain (e.g., new block 802 of blockchain 800). The blockchain module may also record the accident information to a new block of the blockchain. The blockchain module may also record time information related to the accident and digital signatures from the accident monitoring party (e.g., black box recorder and traffic control device). The blockchain module may also generate a hash of all data recorded to the blockchain and record it to a new block, the blockchain including a hash of the recorded data of the new block and a hash of all data of the block recorded to the blockchain before the new block is generated. And the blockchain module may generate a hash of all data recorded to the block of the blockchain before the new block is generated and record it to the new block. In addition, the blockchain module may broadcast the recorded data of the new block to a peer-to-peer network. In some embodiments, computing devices 110 and 112 may be peer nodes in a peer-to-peer network, and in such embodiments, the blockchain module may further include a copy of the recorded data of the new block stored by a storage system (e.g., storage system 212, 312).

[0028] Additionally, for example, the peer-to-peer network may include various computing nodes, such as nearby vehicles, vehicles of common brands, vehicles of a club or fleet, computing nodes arranged along the road (such as base stations for cellular communications and may be integrated with or connected to base stations), servers of vehicle manufacturers, businesses, insurance providers, etc., and mobile devices of drivers, passengers, bystanders, emergency response teams, etc. Once the record is in the blockchain, it is very difficult to cover up or change aspects of the accident.

[0029] Figure 2 1 illustrates an example portion of an example traffic control device 200 according to some embodiments of the present disclosure. The traffic control device 200 may be communicatively coupled to the network(s) 118, as shown. In some embodiments, the traffic control device 200 is Figure 1 1 or 150, or any other traffic control device according to some embodiments of the present disclosure. Traffic control device 200 includes at least one bus 204, a controller 206 (e.g., a CPU), a main memory 208, a network interface 210, a data storage system 212, and one or more cameras and / or one or more sensors 214. One or more cameras and / or one or more sensors 214 may include any known camera or sensor used with or installed in a traffic control device.

[0030] Traffic control device 200 may include or be any known traffic control device, such as any known or foreseeable marking, sign, and signal device for informing, directing, and controlling traffic (including pedestrians and vehicles). These devices are typically placed adjacent to, suspended from, or along highways, roads, transportation facilities, and other public areas where traffic control is desired. For example, traffic control device 200 may be or include a traffic light.

[0031] The bus 204 communicatively couples a controller 206, a main memory 208, a network interface 210, a data storage system 212, and one or more cameras and / or one or more sensors 214, all of which may be part of a traffic control computing device, such as the traffic control computing device 110. The traffic control device 200 includes a computer system including at least a controller 206, a main memory 208 (e.g., a read-only memory (ROM), a flash memory, a dynamic random access memory (DRAM) (e.g., synchronous DRAM (SDRAM) or Rambus DRAM (RDRAM)), a static random access memory (SRAM), etc.), and a data storage system 212, which communicate with each other via a bus 204 (which may include multiple buses).

[0032] in other words, Figure 2 2 is a block diagram of an example traffic control device 200 having a computer system in which embodiments of the present disclosure may operate. In some embodiments, the computer system may include a set of instructions for causing the machine to perform any one or more of the methodologies discussed herein when executed. In such embodiments, the machine may be connected (e.g., via a network interface 210) to other machines in a LAN, an intranet, an extranet, and / or the Internet (e.g., network(s) 118). The machine may operate as a server or a client machine in a client-server network environment, as a peer machine in a peer-to-peer (or distributed) network environment (e.g., the peer-to-peer network described herein), or as a server or a client machine in a cloud computing infrastructure or environment.

[0033] Controller 206 represents one or more general purpose processing devices, such as a microprocessor, a central processing unit, or the like. More specifically, the processing device may be a complex instruction set computing (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIM) microprocessor, or a processor that implements other instruction sets or a processor that implements a combination of instruction sets. Controller 206 may also be one or more special purpose processing devices, such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), a network processor, or the like. Controller 206 is configured to execute instructions to perform the operations and steps discussed herein. Controller 206 may further include a network interface device (e.g., network interface 210) to communicate via one or more communication networks (e.g., network(s) 118).

[0034] The data storage system 212 may include a machine-readable storage medium (also referred to as a computer-readable medium) on which one or more sets of instructions or software embodying any one or more of the methods to be further described herein are stored. The instructions may also reside completely or at least partially within the main memory 208 and / or the controller 206 during their execution by the computer system, the main memory 208, and the controller 206, which also constitute the machine-readable storage medium. Although the memory, controller, and data storage portions are each shown as a single portion in the example embodiment, each portion should be considered to include a single portion or multiple portions that can store instructions and perform their corresponding operations. The term "machine-readable storage medium" should also be considered to include any medium capable of storing or encoding a set of instructions for execution by a machine and causing the machine to perform any one or more of the methods of the present disclosure. Therefore, the term "machine-readable storage medium" should be considered to include (but not limited to) solid-state memory, optical media, and magnetic media.

[0035] Figure 3 1 and 2 illustrate an example portion of an example vehicle 300 according to some embodiments of the present disclosure. The vehicle 300 may be communicatively coupled to the network(s) 118, as shown. In some embodiments, the vehicle 300 is a vehicle 104 or Figure 1 The vehicle 300 includes at least one bus 304, a controller 306 (e.g., a CPU), a main memory 308, a network interface 310, a storage system 312, one or more cameras and / or one or more sensors 314, a navigation system 316, and a black box recorder 318.

[0036] The bus 304 communicatively couples a controller 306, a main memory 308, a network interface 310, a data storage system 312, one or more cameras and / or one or more sensors 314, a navigation system 316, and a black box recorder 318, all of which may be part of a vehicle computing device, such as the vehicle computing device 112. The vehicle 300 includes a computer system including at least the controller 306, a main memory 308 (e.g., a read-only memory (ROM), a flash memory, a dynamic random access memory (DRAM) (e.g., synchronous DRAM (SDRAM) or Rambus DRAM (RDRAM)), a static random access memory (SRAM), etc.), and a data storage system 312, which communicate with each other via the bus 304 (which may include multiple buses).

[0037] in other words, Figure 3310 is a block diagram of an example vehicle 300 having a computer system in which embodiments of the present disclosure may operate. In some embodiments, the computer system may include a set of instructions that, when executed, cause the machine to perform any one or more of the methods discussed herein. In such embodiments, the machine may be connected (e.g., via a network interface 310) to other machines in a LAN, an intranet, an extranet, and / or the Internet (e.g., network(s) 118). The machine may operate as a server or a client machine in a client-server network environment, as a peer machine in a peer-to-peer (or distributed) network environment (e.g., the peer-to-peer network described herein), or as a server or a client machine in a cloud computing infrastructure or environment.

[0038] Controller 306 represents one or more general purpose processing devices, such as a microprocessor, a central processing unit, or the like. More specifically, the processing device may be a complex instruction set computing (CISC) microprocessor, a reduced instruction set computing (RISC) microprocessor, a very long instruction word (VLIM) microprocessor, or a processor that implements other instruction sets or a processor that implements a combination of instruction sets. Controller 206 may also be one or more special purpose processing devices, such as an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), a digital signal processor (DSP), a network processor, or the like. Controller 306 is configured to execute instructions to perform the operations and steps discussed herein. Controller 306 may further include a network interface device (e.g., network interface 310) to communicate via one or more communication networks (e.g., network(s) 118).

[0039] The data storage system 312 may include a machine-readable storage medium (also referred to as a computer-readable medium) on which one or more sets of instructions or software embodying any one or more of the methods to be further described herein are stored. The instructions may also reside completely or at least partially within the main memory 308 and / or controller 306 during their execution by the computer system, main memory 308, and controller 306, which also constitute the machine-readable storage medium. Although the memory, controller, and data storage portions are each shown as a single portion in the example embodiment, each portion should be considered to include a single portion or multiple portions that can store instructions and perform their corresponding operations. The term "machine-readable storage medium" should also be considered to include any medium capable of storing or encoding a set of instructions for execution by a machine and causing the machine to perform any one or more of the methods of the present disclosure. Therefore, the term "machine-readable storage medium" should be considered to include (but not limited to) solid-state memory, optical media, and magnetic media.

[0040] The navigation system 316 may include any known navigation system used with or installed in a vehicle, such as a system including a GPS system. The one or more cameras and / or one or more sensors 314 may include any known camera or sensor used with or installed in a vehicle. For example, the (several) camera / sensor 314 may include any camera or sensor used by an autonomous vehicle. The vehicles referred to herein may include autonomous vehicles, which may include a number of sensors to assist in controlling the autonomous vehicle. In the event of an accident, collision, or near-collision involving a vehicle, reviewing camera and sensor data recorded just before and / or during the accident may assist authorities in determining the cause of the accident and / or whether there may be a vehicle malfunction. However, if power is lost during the accident, the vehicle camera and sensor data stored in volatile memory may be lost. A drive recorder (EDR) (also known as a black box recorder) may be included in a vehicle to overcome the above-mentioned problems, for example see Figure 3 . The black box recorder 318 is a device that can be installed in the vehicle 300 to record information related to a vehicle collision or accident. In one example, an automobile original equipment manufacturer (OEM) that manufactures an autonomous vehicle can install a black box recorder (recorder 318) that can record a specific period before the accident, such as the last 30 seconds before the accident. For example, it is hoped that this data will be used to reproduce the root cause of the accident.

[0041] The information sent from the black box recorder 318 to the computing node of the blockchain network may include priority and / or smaller data. The black box recorder may include data of a predetermined type within a predetermined period of time, so that the data can be retrieved later to further study the accident. Since there are values ​​in the entire data set (especially the accident-related data set), the information initially recorded by the black box recorder may include unfiltered data. However, before sending the information to the computing node to record in the blockchain, it is beneficial to filter the data or select data that is small in itself but still valuable to the accident ledger. For example, identification data is small and useful. In addition, the hash of the data stored in the computing device or black box recorder can also be smaller. In addition, the vehicle status information (such as speed, direction, vehicle controller) at the time of the accident can also be smaller. Some time information (especially this information within a period of time leading to the accident) can be larger; and the camera image can be much larger. Therefore, in some embodiments, this information is filtered before being sent to the recording computing node. Or this information containing larger types of data is not sent at all. In addition, the verification of the digital signature of the monitoring device that sends the information to be recorded in the block can occur before the information is sent or at least before the block with information is generated. In addition, verification of the digital signature added to the block can be a criterion considered before generating the block. This criterion can be used together with other criteria described herein to determine the conditions for generating a block and / or verifying a hash using a generated block.

[0042] Corresponding control lines (such as buses 204 and 304) can operate different parts of the vehicle and traffic control device. The control line can be a direct link to the computing device (such as Figure 1 One or more control lines (e.g., see Figure 1 117). Additionally, a network connection may link computing devices through one or more communication networks, such as network(s) 118.

[0043] A peer-to-peer network of some embodiments may be a collection of nodes and peer connections. For example, Figure 1 The computing nodes 182 and 184 described in the figure may be nodes of a peer-to-peer network supported by computing devices connected by (several) networks 118. In some embodiments, computing devices other than the computing devices of the vehicle and the traffic control device are nodes of the peer-to-peer network. Alternatively, the computing devices of the traffic control device and / or the vehicle may be nodes of the peer-to-peer network. In some embodiments, computing devices other than the computing devices of the vehicle and the traffic control device and the computing devices of the traffic control device and / or the vehicle are nodes of the peer-to-peer network. For example, the corresponding computer systems of the traffic control device 200 and the vehicle 300 may be nodes of the peer-to-peer network. The network may include a peer-to-peer network that can support blockchain. In other words, the vehicle and / or the traffic control device may or may not be located in a peer-to-peer network (e.g., a peer-to-peer network that implements blockchain), depending on the embodiment.

[0044] Figure 4 4 is a flow chart of an example method 400 performed by an example portion of an example traffic control device (e.g., traffic control device 102, 150, or 200), an example vehicle (e.g., vehicle 104, 160, or 170), and / or an example computing node of a peer-to-peer network (e.g., computing node 182 or 184) according to some embodiments of the present disclosure. Method 400 begins at step 402: in response to a vehicle having or being involved in an accident, receiving data about the accident at a computing node in a peer-to-peer network of computing nodes. Receiving the data at the computing node may include receiving the data via a communication network.

[0045] The data may be collected by the vehicle or another party in which the accident has occurred or is occurring. Additionally, the data may be collected by the vehicle or another party just before the accident occurs. The vehicle in which the accident has occurred or is occurring may include a computing node that performs step 402 or any other step of method 400. Alternatively, receiving the data at the computing node may include receiving the data from the vehicle via a communication network. In this example, the vehicle may or may not include a node in a peer-to-peer network.

[0046] Additionally, data may be collected by a machine external to the vehicle, such as a traffic control device near the vehicle, such as traffic control device 102, 150, or 200. The machine may include a computing node or another node of a peer-to-peer network that performs the steps of method 400. Additionally, the machine may be another vehicle involved in the accident.

[0047] Receiving data at the computing node may include receiving data from the machine via a communication network. In some embodiments, the data is collected by the vehicle, another vehicle, a machine including the computing node, and / or another machine external to the vehicle.

[0048] In step 404, the compute node generates a record of the data. In step 406, the compute node stores a copy of the record in persistent storage at the compute node.

[0049] In step 408, the computing node transmits the record from the computing node to computing nodes in the peer-to-peer network via the peer connection. Upon receiving the record, each of the computing nodes in the peer-to-peer network is configured to store a copy of the record and broadcast the record to one or more additional computing nodes in the peer-to-peer network to cause the one or more additional computing nodes to store one or more additional copies of the record.

[0050] In step 410, in response to a query about the incident, the computing node provides the record. In step 412, in response to a query about the validity of the record, the computing node participates in determining a network consensus about the validity of the record in the peer-to-peer network. Each of the computing nodes in the peer-to-peer network is configured to determine a vote for the validity of the record based on a copy of the record in each computing node. The validity of the record is determined based on the vote. Each of the computing nodes in the peer-to-peer network is configured to determine a vote for the validity of the second record based on a copy of the record in each computing node. And the validity of the second record is determined based on the vote. The validity of the second record can be determined based on a majority of votes. The validity of the second record can also be determined based on a number of votes that exceeds a threshold number of nodes to confirm the validity of the second record. The validity of the record can be determined based on a majority of votes. The validity of the record can be determined based on a number of votes that exceeds a threshold number of nodes to confirm the validity of the record.

[0051] The validity of the first record and / or the second record or any block of the blockchain may be further confirmed based on the verification of the digital signature in the record or block. In some embodiments, this criterion may be used in conjunction with other criteria described herein or alone. Additionally, the condition of the hash of the block may be another factor in determining the validity of the record or block. The benefit of this criterion is that the block generator cannot be denied as the generator. In some embodiments, a block is identified as part of the blockchain if (1) the block is generated from an authorized host with a verified signature (e.g., verified by one or more nodes of a peer-to-peer network) and (2) the hash of the previous block matches the hash of the current block.

[0052] In the case where the external machine is another vehicle in the accident, the record may be a first record. In such cases, the computing node that performs the steps of process 400 may be a first computing node. And the vehicle may be a first computing node and the other vehicle in the accident may include a second computing node in a peer-to-peer network. In this example, method 400 may further include receiving second data about the accident at a second computing node (in step 402). The method may also include generating a second record of the second data in the second computing node (in step 404). And the method may further include storing a copy of the second record in a persistent memory at the second computing node (in step 406). In step 408, the second computing node transmits the second record to the computing node in the peer-to-peer network via a peer-to-peer connection. Each of the computing nodes in the peer-to-peer network is also configured to store a copy of the second record and broadcast the second record to one or more additional computing nodes in the peer-to-peer network to cause one or more additional computing nodes to store one or more additional copies of the second record. In addition, in step 410, in response to a query about the accident, the second node provides a second record. And in step 412, the second node participates in determining a network consensus about the second record in the peer-to-peer network.

[0053] In some embodiments, at least a portion of the received data is derived from or includes data collected by the vehicle and stored in a memory of a drive recorder (EDR) of the vehicle or in a data storage device communicatively coupled to the EDR prior to the accident. In some embodiments, the data regarding the accident may be a preselected subset of data from a larger data set, and the selection of a particular portion of the larger data set for the preselected subset may be based on the size of each of the particular portions being below a predetermined size threshold. Additionally, the data regarding the accident may be a preselected subset of data from a larger data set of data stored in a memory of the EDR of the vehicle or in a data storage device communicatively coupled to the EDR prior to the accident. And the selection of a particular portion of the larger data set for the preselected subset may be based on the size of each of the particular portions being below a predetermined size threshold determined during configuration of the EDR.

[0054] Figure 51 is a flow chart of an example method 500 performed by an example portion of an example vehicle (e.g., vehicle 104, 160, or 170) according to some embodiments of the present disclosure. Method 500 begins at step 502, where data stored in a memory of an EDR of the vehicle or a data storage device communicatively coupled to the EDR is received by a computing device of the vehicle.

[0055] In step 504, the computing device selects the specific portion based on the size of each portion of the specific portion of the received data. In some embodiments, the storage data is received by the computing device of the vehicle only when the computing device predicts that the vehicle is about to have an accident, the computing device determines that the vehicle has had an accident, or the computing device determines that the vehicle has had an accident within a predetermined period of time.

[0056] In step 506, the computing device sends the selected portion of the data to a computing node in a peer-to-peer network of computing nodes via the communications network. This may cause the computing nodes of the network to generate a record of the selected portion of the data (e.g., in Figure 4 The computing node then transmits the record to computing nodes in the peer-to-peer network via a peer connection, either at will or upon request by the computing node.

[0057] With respect to method 400, method 500, or any other method, process, or operation described herein, in some embodiments, a non-transitory computer-readable storage medium stores instructions that, when executed by at least one processing device (e.g., controller 206 or controller 306), cause the at least one processing device to perform method 400, method 500, or any other method, process, or operation described herein and / or any combination thereof.

[0058] In addition, for example, some embodiments may include a non-transitory computer-readable storage medium tangibly encoded with computer-executable instructions, which, when executed by a processor of a computing node in a peer-to-peer network of computing nodes, cause the processor to perform a method. This method may include receiving data about an accident in response to a vehicle having an accident. The method may also include generating a record of the data and storing a copy of the record in a persistent memory at the computing node. The method may also include transmitting the record from the computing node to the computing node in the peer-to-peer network via a peer-to-peer connection. When receiving the record, each of the computing nodes in the peer-to-peer network may be configured to store a copy of the record and broadcast the record to one or more additional computing nodes in the peer-to-peer network to cause the one or more additional computing nodes to store one or more additional copies of the record. In addition, in response to a requester querying an accident at a computing node, the method may include providing the record to the requester. In addition, in response to this query, the method may include participating in determining a network consensus about the record in the peer-to-peer network, wherein the processor of each of the computing nodes in the peer-to-peer network may be configured to determine a vote for the validity of the record based on the copy of the record in each computing node, and wherein the validity of the record may be determined based on the vote.

[0059] Figure 6 illustrates example data contained in an example incident report communication (traffic control device communication 600) sent from an example traffic control device in accordance with some embodiments of the present disclosure. Figure 7 Example data included in an example accident report communication (vehicle communication 700 ) sent from an example vehicle in accordance with some embodiments of the present disclosure is illustrated.

[0060] Asymmetric cryptography can be used to authenticate the parties monitoring and reporting vehicle incidents (e.g., traffic control devices or vehicles) and recording the reports to a block of the blockchain (e.g., a computing node of a peer-to-peer network), as evidenced by certificates, digital signatures on exchanged messages, and / or device identity combination systems (e.g., by Figure 6 Traffic control device communication and Figure 7 ). Each of the traffic control computing device and the vehicle computing device has a public key (e.g., public keys 602 and 702) from the other party that authenticates each other. Both parties can accept each other's certificates (e.g., certificates 604 and 704), where, for example, a subscription has been activated, such as a subscription to a vehicle incident management system.

[0061] The exchange of certificates can confirm that each identity (eg, identity 606 and 706) and the parties know each other and confirm that a subscription exists between the parties. Subscription is not necessarily a prerequisite for handshaking certificates between the parties.

[0062] The exchange of messages between the parties is a process that may be protected via a device identity combination system. The device identity combination system may be used for asymmetric cryptography. In such embodiments, the private key (e.g., private key 608 or 708) may be or may be based on a secret value injected during the manufacture of the computing device, referred to as a unique device secret (UDS). In some example implementations of the device identity combination system, the UDS may only ever exist within the computing device on which the UDS is provisioned.

[0063] In some embodiments, the device identity combination system may include deriving a K by using a key derivation function (KDF). L0 Layer L of the FDS 0 In terms of algorithm, K L0 =KDF[UDS,HASH(“L 1 ”)] (see, for example, Figure 6 and 7 The private key K involved L2 ). Other layers (L k ) can be a set of keys and certificates (for example, see Figure 6 and 7 The public key K involved L2 ) is provided to the next layer (L k+1 ). The layer is based on the immutable loader L 0 Start, then install the identity combination system core L 1 、Application firmware L 2 , operating system and application programs k+1 Each layer can provide integrity for the next layer, and so on. And each layer can verify the certificate indicating the identity of the devices of the parties exchanging information.

[0064] In some embodiments, asymmetric cryptography is used for mutual authentication between the parties. Mutual authentication may occur via a communication network or a direct link and may be initiated by the parties exchanging respective public key certificates (which include digital signatures for mutual authentication (e.g., see respective digital signatures 610 and 710 of communications 600 and 700)). Initiation of mutual authentication may occur after an accident so that monitoring and involved parties can exchange information securely. The information exchanged may include accident information, such as information about physical events just before, just after, and during the accident, time data associated with the physical events, driver information, vehicle and / or environmental conditions before, just after, and during the accident, and status information about aspects of the vehicle and nearby traffic control devices (e.g., see accident information 612 and 712 of communications 600 and 700). The parties may accept each other's certificates, where a subscription has been activated. If a party is not subscribed to the system, the party may provide specific information to subscribe (e.g., via public key encryption). Additionally, since each party has a public key from the other party that is mutually authenticated, encrypted messages can be sent between the parties and each party can decrypt the message using its own private key (since this technique uses asymmetric cryptography).

[0065] In general, the ownership of a public key is known to the public. If a public key can decrypt a message, then it can be inferred that the message was encrypted using the corresponding private key. A message cannot be encrypted by a public key. If only a specific individual, vehicle, or traffic control device has a private key, then it can be inferred that the message came from a specific individual, vehicle, or traffic control device. In order to be able to trust the inference, a trusted entity needs to authenticate that the public key corresponds to a private key held by a specific individual, vehicle, traffic control device, or computing node, so that the public key can be used to determine the identity of the individual, vehicle, traffic control device, or computing node.

[0066] Figure 8 A portion of an example blockchain 800 illustrating blocks, where each block includes an incident report communication from a reporting party, such as a reporting vehicle or a reporting traffic control device. Figure 8 A portion of an example blockchain 800 illustrating blocks (e.g., blocks 802, 804, 806, and 808), wherein each block includes a block header (e.g., see block header 810) and identifying information and information about an example of an accident. As illustrated, each block of the portion of blockchain 800 is generated by or at least associated with: a first traffic control device identified as "traffic control device A," a second traffic control device identified as "traffic control device B," a third traffic control device identified as "traffic control device C," a fourth traffic control device identified as "traffic control device D," a first vehicle identified as "vehicle A," and a second vehicle identified as "vehicle B." It should be understood that for purposes of this disclosure, Figure 8The depiction of blockchain 800 in the diagram is only a partial depiction of the blockchain and may exist to generate Figure 8 Blocks of the blockchain not depicted in or at least related to Figure 8 More traffic control devices and vehicles associated with blocks of the blockchain not depicted.

[0067] In general, blockchain 800 may be or include a distributed "ledger" or database with replicated copies of records stored independently on nodes of a peer-to-peer network implementing the blockchain. In some embodiments, no central node is responsible for controlling and / or managing the entire blockchain. Each node may manage, verify its copy, and participate in determining blockchain network consensus.

[0068] Block 802 is depicted as being decomposed so that at least some of the contents of block 802 are depicted. The decomposed view of block 802 shows the block including a block header 810, which includes hashes 812 and 814. Hash 812 may be or include a hash of all data recorded to the block of the entire blockchain before the new block 802 is generated. Specifically, the new block 802 may be generated by a computing device of a traffic control device ("traffic control device D") or a computing node of a peer-to-peer network after the corresponding information derived by the traffic control device ("traffic control device D") is received by the computing node. Hash 814 may be or include a hash of all data recorded to the blockchain, and the blockchain includes a hash of the recorded data of the new block and a hash of all data recorded to the block of the blockchain before the new block was generated.

[0069] In some embodiments, the computing devices of the vehicle and the traffic control device (see, for example, computing devices 110 and 112) are peer nodes in a peer-to-peer network (e.g., a network supporting blockchain 800). In such a network, each of the devices may store a copy of the recorded data of a block of the blockchain (e.g., new block 802 and previous blocks 804, 806, and 808) by a respective storage system. As shown, block 808 is generated and occurs immediately before new block 802. Each of the blocks may include data from one or more transactions associated with a vehicle incident. The information included in the exploded view of block 802 is only one of many examples of information that a block may contain. In addition, it should be understood that a block may be associated with multiple vehicles, multiple traffic control devices, one or more computing nodes of a peer-to-peer network, or any combination thereof.

[0070] Fig.9A An apparatus or non-transitory computer-readable storage medium for generating a triplet according to some embodiments is described. The triplet may include a public identifier of a party (e.g., a vehicle or a traffic control device), a public key of the party, and / or a certificate of the party. The triplet may be found in messages and communications described herein (e.g., see Figure 6 and 7 ).

[0071] As explained, L 0 Software 910 and L 1 Software 912 operates on an identity combination device. The identity combination device may be part of any of the computing devices described herein. 0 Code 910 comprises firmware executed in the ROM of the identity combination device. 0 Code 910 is responsible for generating the first key (K) according to the following formula L0 ) (also referred to as Fusion Derived Secret (FDS)): FDS = K L0 =KDF(UDS,HASH(L 1 identity)), where KDF is a one-way function (such as HMAC-SHA256 function), and UDS is in operation L 0 The unique device secret set during the manufacture of the device of code 910, HASH includes a second one-way function (such as a SHA256 function), and L 1 The logo contains L 1 Host configuration parameters for code 912.

[0072] L 0 Code 910 output K L0 To L 1 Code 912, which is then used to generate the representation L 1 The triplet of code 912. Then, this triplet is composed of L 1 Code 912 output to L 2 Code 914. As discussed, L 2 Code 914 may include code executed on an external device or, in some embodiments, a remote device. 0 Code 910 and L 1 Code 912 may be executed on the first party, and L 2 914 may be performed on a separate party.

[0073] As described, L 1 Code 912 is generally responsible for generating keys (referred to as "alias keys") and L 1 The triplet of code 912 itself.

[0074] As explained, L 1 Code 912 generates L via asymmetric identifier generator 902 1 The identifier of code 912. Generator 902 uses K L0 The key is used as a seed and outputs a deterministic public key (ID L1public ) and private key (ID L1private ). 1 Code 912 outputs the public key (IDL1public ) to L 2 Code 914, its use will be in Fig. 9B Described in the description.

[0075] In addition, L 1 Code 912 generates a second key pair using a second asymmetric key generator 904. This key generator 904 uses a random number generated by a random number generator 908 as a seed input and outputs a second deterministic public key (K L1public ) and private key (K L1private ). 1 Code 912 outputs the public key (K L1public ) to L 2 Code 914, its use will be in Fig. 9B Described in the description.

[0076] In addition, L 1 Code 912 uses double encryption technology to generate output to L 2 The ID certificate portion of the triplet of code 914. Specifically, L 1 Code 912 first uses the first encryption module 906A to use ID L1public The key is used as the encryption key to encrypt K L1public The key is used to generate an encrypted ciphertext K'. Then, this ciphertext is used as data supplied to the second encryption module 906B, and the K generated by the second generator 904 is L1private The result of the second encryption module 906B is output as ID L1 The double encrypted ciphertext K of the certificate. Encryption algorithm (and Fig. 9B The specific choice of the corresponding decryption algorithm in is not limited to the present disclosure.

[0077] Fig. 9B An apparatus or non-transitory computer-readable storage medium for validating triples and generating second-layer triples according to some embodiments is described. Fig. 9B The figure shown in L 2 The operation of code 914. However, the operation described herein can be performed for 2 Any layer of code 914 (such as L 3 Code 916) generalization.

[0078] In the illustrated embodiment, L 2 Code 914 from L 1 Code 912 received as Fig.9A The triples are generated as described in L. 2 Code 914 performs similar operations to L 1 Code 912 is relative to the generated L 2The operation of the triplet and the details thereof are not repeated here, but are incorporated by reference to the same numbered elements. A significant difference in the triplet generation circuit or software is that the first generator is implanted with a L 1 K generated by code 912 L1public Value rather than Fig.9A K described in L0 The value of (fusion-derived secret).

[0079] In addition, L 2 Code 914 includes a certificate checker 918 that can be implemented in hardware (ie, dedicated circuitry) or software or firmware. Details of the certificate checker 918 are shown in the exploded view of the figure. The certificate checker 918 verifies the identity of the certificate from L 1 The authenticity of the triplet received by code 912. In some embodiments, the certificate checker 918 acts as a gating function for the remaining components (i.e., preventing 2 Generate triples when triples are invalid).

[0080] As illustrated, the certificate checker 918 uses K L1 Public Key Decryption ID L1 Then, the obtained key M' is used as the key of the second decryption module 924, and the second decryption module 924 uses the key M' to decrypt the ID L1 Finally, the obtained plaintext M" is compared with the original public key (K L1public ). If the result of the comparator is positive, then the triple is confirmed to be valid. If the result of the comparator is not positive, then the triple is marked as invalid.

[0081] In the illustrated embodiment, the certificate checker 918 may be executed independently of the triplet generation circuits / software 902, 904, 906A-906B. In this way, the triplets of various entities may be generated by L 2 Code 914 verification.

[0082] Some portions of the above detailed description have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is generally conceived here of a self-compatible sequence of operations leading to a desired result. Operations are those requiring physical manipulation of physical quantities. Typically, but not necessarily, these quantities are in the form of electrical or magnetic signals capable of being stored, combined, compared, and otherwise manipulated. It has proven convenient at times, primarily for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.

[0083] It should be remembered, however, that all of these and similar terms should be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. The present disclosure may involve actions and processes of computer systems or similar electronic computing devices that manipulate and transform data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system's memories or registers or other such information storage systems.

[0084] The present disclosure also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the intended purpose, or it may comprise a general purpose computer selectively activated or reconfigured by a computer program stored in the computer. This computer program may be stored in a computer-readable storage medium, such as (but not limited to) any type of disk (including floppy disks, optical disks, CD-ROMs, and magneto-optical disks), read-only memory (ROM), random access memory (RAM), EPROM, EEPROM, magnetic or optical cards, or any type of medium suitable for storing electronic instructions, each coupled to a computer system bus.

[0085] The algorithms and displays presented herein are essentially independent of any particular computer or other device. Various general purpose systems may be used with the program according to the teachings herein, or it may prove convenient to construct more specialized equipment to perform the method. The structures of various these systems will appear as set forth in the following description. In addition, the present disclosure is not described with reference to any particular programming language. It should be appreciated that various programming languages ​​may be used to implement the teachings of the present disclosure, as described herein.

[0086] The present disclosure may be provided as a computer program product or software, which may include a machine-readable medium having stored thereon instructions that may be used to program a computer system (or other electronic device) to perform a process according to the present disclosure. A machine-readable medium includes any mechanism for storing information in a form that can be read by a machine (e.g., a computer). In some embodiments, a machine-readable (e.g., computer-readable) medium includes a machine (e.g., computer) readable storage medium, such as a read-only memory ("ROM"), a random access memory ("RAM"), a magnetic disk storage medium, an optical storage medium, a flash memory component, and the like.

[0087] In the foregoing description, embodiments of the present disclosure have been described with reference to specific example embodiments of the present disclosure. It will be apparent that various modifications may be made to the present disclosure without departing from the broader spirit and scope of the present disclosure as set forth in the appended claims. Therefore, the specification and drawings should be regarded as intended to be illustrative rather than restrictive.

Claims

1. A method for vehicle accident management, comprising: Responding to a vehicle incident: receiving data about the accident at a computing node in a peer-to-peer network of computing nodes, wherein the data is collected by a machine external to the vehicle; generating a record of the data in the computing node; storing a copy of the record in persistent storage at the computing node; and transmitting the record from the computing node to computing nodes in the peer-to-peer network via a peer-to-peer connection, wherein upon receiving the record, each of the computing nodes in the peer-to-peer network is configured to store a copy of the record as a block in a blockchain ledger and broadcast the record to one or more additional computing nodes in the peer-to-peer network to cause the one or more additional computing nodes to store one or more additional copies of the record; and In response to a query about the incident at the computing node: providing the record at the computing node; and The computing nodes participate in determining a network consensus about the record in the peer-to-peer network, wherein each of the computing nodes in the peer-to-peer network is configured to determine a vote on the validity of the record based on a copy of the record in each computing node, wherein the validity of the record is determined based on the vote. 2 . The method of claim 1 , wherein receiving the data at the computing node comprises receiving the data via a communication network. The method of claim 1 , wherein the data is collected by the vehicle. The method of claim 3 , wherein the vehicle comprises the computing node. The method of claim 3 , wherein receiving the data at the computing node comprises receiving the data from the vehicle via a communication network. The method of claim 1 , wherein the machine comprises the computing node.

7. The method of claim 1, wherein receiving the data at the computing node comprises receiving the data from the machine via a communications network. The method of claim 1 , wherein the data is collected by the vehicle and a machine external to the vehicle.

9. The method of claim 8, wherein the machine is another vehicle involved in the accident.

10. The method of claim 9, wherein the record is a first record, wherein the computing node is a first computing node, and wherein the vehicle comprises the first computing node and the other vehicle in the accident comprises a second computing node in the peer-to-peer network and wherein the method further comprises: receiving, at the second computing node, second data regarding the incident; generating a second record of the second data in the second computing node; storing a copy of the second record in persistent storage at the second computing node; and transmitting the second record from the second computing node to computing nodes in the peer-to-peer network via a peer-to-peer connection, wherein upon receiving the second record, each of the computing nodes in the peer-to-peer network is configured to store a copy of the second record and broadcast the second record to one or more additional computing nodes in the peer-to-peer network to cause the one or more additional computing nodes to store one or more additional copies of the second record; and In response to a query about the incident at the second computing node: providing the second record at the second computing node; and The second computing node participates in determining a network consensus in the peer-to-peer network regarding the second record, wherein each of the computing nodes in the peer-to-peer network is configured to determine a vote on the validity of the second record based on a copy of the record in each computing node, wherein the validity of the second record is determined based on the vote. The method of claim 10 , wherein the validity of the second record is determined based on a majority of the votes. 12 . The method of claim 10 , wherein the validity of the second record is determined based on the vote reaching a number exceeding a threshold number of nodes confirming the validity of the second record.

13. The method of claim 1, wherein the validity of the record is determined based on a majority of the votes or a number of the votes exceeding a threshold number of nodes confirming the validity of the record.

14. The method of claim 13, wherein the validity of the record is determined further based on a digital signature in the record being a verified digital signature.

15. A method according to claim 1, wherein at least a portion of the received data is derived from or includes data collected by the vehicle and stored in a memory of a drive recorder (EDR) of the vehicle or in a data storage device communicatively coupled to the EDR prior to the accident.

16. The method of claim 1, wherein the data regarding the incident is a preselected subset of data from a larger data set, and wherein selecting a particular portion of the larger data set for the preselected subset is based on a size of each of the particular portions being below a predetermined size threshold.

17. A method for vehicle accident management, comprising: Receiving, by a computing device of a vehicle, data stored in a memory of a drive recorder (EDR) of the vehicle or in a data storage device communicatively coupled to the EDR; selecting, by the computing device, the portions according to a size of each of the received portions of the data; and The selected portion of the data is sent by the computing device to a computing node in a peer-to-peer network of computing nodes via a communications network, causing the computing node to generate a record of the selected portion of the data and store a copy of the record in a persistent memory as a block in a blockchain ledger, causing the computing node to be configured to transmit the record to the computing node via a peer connection at will or upon request by a computing node in the peer-to-peer network.

18. The method of claim 17, wherein receiving the data by the computing device of the vehicle occurs only when the computing device predicts that the vehicle is about to be involved in an accident, the computing device determines that the vehicle is involved in an accident, or the computing device determines that the vehicle has been involved in an accident within a predetermined time period.

19. A non-transitory computer-readable storage medium having stored thereon computer-executable instructions which, when executed by a processor of a computing node in a peer-to-peer network of computing nodes, cause the processor to perform a method comprising: Responding to a vehicle incident: receiving data regarding the incident, wherein the data is collected by a machine external to the vehicle; generating a record of said data; storing a copy of the record in persistent storage at the computing node; and transmitting the record from the computing node to computing nodes in the peer-to-peer network via a peer-to-peer connection, wherein upon receiving the record, each of the computing nodes in the peer-to-peer network is configured to store a copy of the record as a block in a blockchain ledger and broadcast the record to one or more additional computing nodes in the peer-to-peer network to cause the one or more additional computing nodes to store one or more additional copies of the record; and In response to the requester querying the incident at the computing node: providing said record to said requester; and Participating in determining a network consensus about the record in the peer-to-peer network, wherein a processor of each of the computing nodes in the peer-to-peer network is configured to determine a vote for the validity of the record based on a copy of the record in each computing node, wherein the validity of the record is determined based on the vote.