Blockchain-based information security sharing method for connected vehicles

Abstract

The application discloses a kind of information security sharing methods of networked car based on block chain, it is realized based on the information sharing model of construction, the information sharing model includes the information provider of shared information, the information user needing information and the evidence of judging the authenticity of information;Including the following steps: information provider releases RON message containing user data, RON message is configured to be visible to the evidence satisfying threshold condition and authenticity to be judged;The evidence satisfying threshold condition carries out evidence to the RON message published, judges its authenticity;Through the number of evidence corresponding to the authenticity of RON message satisfies set threshold value, RON message state is configured as legal and credible message, and only visible to pay;Information user searches the legal and credible RON information of interest only visible to pay, and obtains information after paying.The present application solves the problem of information credibility by introducing the evidence of the evidence and realizes credible billing.

Description

Technical Field

[0001] This invention belongs to the technical field of blockchain applications, specifically relating to a blockchain-based method for secure sharing of information in connected vehicles. Background Technology

[0002] Intelligent connected vehicles need to obtain real-time information on road conditions and congestion at different locations while driving, in order to make correct judgments within a reasonable timeframe. Each vehicle must be equipped with GPS, communication devices, and various sensors, enabling each vehicle to obtain key environmental information and communicate with each other to form a vehicle-to-everything (V2X) network.

[0003] Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) connectivity are the inherent meanings of vehicle-road-cloud integration. With V2I, individual vehicles will receive more driving and service information. Vehicles can obtain information such as weather, traffic, and traffic flow on the roads they will travel on in advance, making traffic more intelligent and smoother. In this process, safe information sharing between vehicles is essential. Existing simple information sharing solutions mainly include two modes:

[0004] (1) Centralized sharing: Users who possess information upload the information to a trusted node, which then distributes the information to users who need it. In this model, the trusted node has a large traffic load, a long single-node request response time, and the messages are stored centrally. If the trusted node fails, it will cause a huge disaster.

[0005] (2) Distributed sharing: information flows between users who need information and users who have information. Message publishers broadcast the information they receive, and message users receive and use the information. However, there are obvious problems of message trust difficulties (publishers publish malicious and false information) and message publishing difficulties (users are unwilling to publish information).

[0006] Distributed sharing is suitable for current large-scale application scenarios, as it can alleviate network traffic load and ensure real-time response to requests. The key to distributed sharing lies in establishing secure sharing rules that ensure information sharing among users is reasonable and robust. Summary of the Invention

[0007] The purpose of this invention is to address the shortcomings of existing technologies by providing a blockchain-based method for secure sharing of connected vehicle information. This method solves the trust issue of information by introducing the verification behavior of witnesses and achieves trusted billing by leveraging the immutability and decentralization advantages of the blockchain system.

[0008] To solve the above-mentioned technical problems, the present invention adopts the following technical solution:

[0009] A blockchain-based method for secure information sharing in connected vehicles, which is based on a constructed information sharing model, including information providers who share information, information users who need information, and verifiers who judge the authenticity of information.

[0010] Includes the following steps:

[0011] The information provider publishes a RON message containing user data. The RON message is configured to be visible to witnesses who meet certain threshold conditions and whose authenticity is yet to be determined.

[0012] Those who meet the threshold conditions can verify the authenticity of the published RON messages.

[0013] Once the number of authentic RON messages corresponding to the verified messages reaches a set threshold, the RON message status is configured as a legitimate and trusted message, and it is only visible to paid users.

[0014] Information users search for legitimate and credible RON information that is only visible to those who are interested in paying a fee, and then obtain the information after paying.

[0015] Furthermore, the followers that meet the threshold condition are all followers with a reputation score greater than or equal to the threshold score, and the followers are users who have prior knowledge of the message.

[0016] Furthermore, the RON message contains information file keywords and other necessary information for verification.

[0017] Furthermore, other necessary information for verification includes a public key queue and a randomized list of point pairs.

[0018] Furthermore, the method by which the information provider publishes RON messages is as follows:

[0019] Information providers navigate through the front-end navigation interface, obtain traffic information for the road segment after driving, click to upload information, fill in the road segment name, deduct a certain amount of virtual currency, and complete the upload of the RON message.

[0020] Furthermore, when verifying, the verifier uses the SM2 ring signature method based on the national cryptographic standard to obtain a signature containing a public key queue, where the public key is the unique identifier of the user's identity.

[0021] Furthermore, the method for verifying the legality of information during verification is as follows:

[0022] Let n be the threshold for the number of co-certifiers, and r be the ring signature size. The information provider attaches a public key queue and a random point list to the published RON message. The public key queue is initialized with r–n fake public keys, and the random point list is initialized with r–n + 1 pairs of random large integer point pairs. The public keys are obtained by the SM2 public-private key generation algorithm, but there is no corresponding user. When a co-certifier performs a verification, they insert their own public key into the RON message public key queue. When n co-certifiers perform verification, the RON message public key queue will have r public keys. Then, the Lagrange interpolation formula is used to generate an r–n degree polynomial from the r–n + 1 random point pairs. A non-repeating point is randomly selected from this polynomial and inserted into the point list.

[0023] During verification, the public key queue in the signer's signature is verified one by one with the public key queue in the RON message. Then, it is calculated whether r random point pairs are on the same r-n degree polynomial. If both are satisfied, the RON message is considered valid; otherwise, it is invalid.

[0024] Furthermore, a value incentive mechanism was designed, which includes:

[0025] When an information provider publishes a RON message, a certain amount of virtual currency is deducted as a verification reward; when a verification participant performs verification, they receive a certain amount of virtual currency as a reward; when an information user uses a message, they need to pay a certain amount of virtual currency to the message provider; the virtual currency is refreshed at the beginning of a billing cycle, and at the end of the billing cycle, rewards are given to the users who have the most virtual currency.

[0026] Furthermore, if users find errors in RON information when using it for a fee, they can choose to complain about the RON information, which will then punish the publisher and the person who verified the RON information.

[0027] Furthermore, after an information sharing process is completed, penalties and rewards are imposed respectively for the evidence-tracking behavior, information uploading behavior, and information usage behavior in that sharing process, specifically as follows:

[0028] The regulations stipulate that legitimate evidence collection, information uploading, and information usage are positive behaviors, while reported evidence collection and information uploading are negative behaviors.

[0029] For positive behavior, the user's credit score is updated using the formula credit=credit+credit*0.5+10, thus increasing the user's credit score;

[0030] For negative behavior, the user's credit score is updated using the formula credit=credit-credit*0.3–5, which reduces the user's credit score and deducts virtual currency value.

[0031] Compared with existing technologies, the beneficial effects of this invention are as follows: Addressing the problems of low information reliability and low user willingness to share during the information sharing process of intelligent connected vehicles, this invention first proposes a "message user-message provider-follower" sharing model. By introducing the follower behavior of followers, the credibility of information is improved. Only information that has been followed by a given number of followers can be shared. Furthermore, to standardize follower behavior, this invention uses the SM2 ring signature algorithm to ensure the non-repudiation of follower behavior. Second, this invention establishes a value exchange incentive mechanism, specifying the currency circulation at each step of the information sharing process. At the end of the settlement cycle, users with high currency values ​​are rewarded, thereby increasing user participation. Finally, this invention leverages the immutability and decentralization advantages of the blockchain system to achieve reliable billing. Attached Figure Description

[0032] Figure 1 This is a schematic diagram of the implementation system structure of the blockchain-based connected vehicle information security sharing method according to an embodiment of the present invention;

[0033] Figure 2 This is a schematic diagram of the blockchain chaincode according to an embodiment of the present invention;

[0034] Figure 3 This is a schematic diagram of the information sharing process according to an embodiment of the present invention;

[0035] Figure 4 This is a schematic diagram of the front-end structure of an embodiment of the present invention;

[0036] Figure 5 This is a schematic diagram of the backend structure of an embodiment of the present invention. Detailed Implementation

[0037] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0038] It should be noted that, unless otherwise specified, the embodiments and features described in the present invention can be combined with each other.

[0039] The present invention will be further described below with reference to specific embodiments, but these are not intended to limit the scope of the invention.

[0040] This invention discloses a blockchain-based method for secure information sharing in connected vehicles. This method implements the proposed model using an edge-cloud-chain approach, and its deployment can be specific to the blockchain end, backend, and frontend. The blockchain end primarily involves writing smart contract chaincode to reliably record user virtual currency and reputation values. The backend is responsible for parsing requests from the frontend and delivering them to the blockchain end for execution. The frontend provides a user-friendly interface. The blockchain end is built on the Hyperledger Fabric platform, defining two ledgers: a user ledger and an information ledger. The backend is built using the Java Spring Boot framework, and the frontend uses the Vue Element Admin framework. The system structure comprised of the blockchain, backend, and frontend is described in [reference needed]. Figure 1 The system environment is Ubuntu 4.15.0-202-generic x86_64.

[0041] Let r be the ring size of the ring signature, and n be a threshold number of signers. An embodiment of this invention discloses a blockchain-based method for secure sharing of national cryptographic network vehicle information, comprising the following steps:

[0042] First, a user data structure is defined on the blockchain, comprising a user ledger and an information ledger. The user ledger specifically includes the user's public key, reputation score, and cryptocurrency value. The information ledger is defined as the data structure for related information, specifically including information file keywords, information file indexes, and information file hash values. On the chaincode side, the chaincode for the CRUD operations of the user ledger and information ledger is defined. The chaincode diagrams for the user ledger and information ledger are shown below. Figure 2 As shown.

[0043] The implementation process of chaincode installation in this embodiment is described below:

[0044] (1) Install Node.js 8.6.3 and Docker 23.0.0;

[0045] Use commands

[0046] sudo apt-get install node==8.6.3

[0047] Sudo apt-get install docker==23.0.0;

[0048] Installation complete

[0049] (2) Install Fabric, project address https: / / github.com / hyperledger / fabric / tree / release-2.1 Compile and install according to the official documentation;

[0050] (3) After writing the chaincode, install the chaincode onto the network node:

[0051] Navigate to the working directory test-network;

[0052] Run the command `. / network.sh up createChannel -ca` to open the network;

[0053] Run the command `. / network.sh deployCC -c mychannel -ccn basic -ccl go -ccp.. / dataSharing` to install the chaincode onto the node.

[0054] An information sharing model is constructed, comprising three roles: users who share information (information providers), users who use information (information users), and users who judge the authenticity of information (verifiers).

[0055] Based on the information sharing model constructed above, the information provider first publishes a RON message containing relevant user data. This message is visible to all users with a reputation score greater than or equal to a threshold, but its authenticity is unknown. All users with a reputation score greater than or equal to the threshold and prior knowledge of the message can verify it. Once the number of verifiers reaches the threshold, the message becomes a legitimate and credible message, and its status changes to "visible only to paid users." Information users search for legitimate and credible RON information of interest and then pay virtual currency to obtain the information. The complete information sharing process can be found by referring to... Figure 3 .

[0056] The front-end development includes the following interfaces: a user information query page, a route navigation page, a RON message publishing and viewing page, and a RON message verification application interface. The user information query page allows users to view their coin value, credit score, and public / private keys. The route navigation page allows users to publish and apply route map information, and use this information for navigation, displaying the navigation map and recommended routes. The RON message publishing page allows users to publish RON messages and view the RON message public key queue, random point queue, and signature queue. The RON message verification interface is used for verification by those who wish to verify the message. (Front-end pages and related interfaces are referenced.) Figure 4 .

[0057] The specific process of building the front end is as follows:

[0058] (1) Download the front-end vue-element-admin framework from GitHub. The project address is: https: / / github.com / PanJianChen / vue-element-admin ;

[0059] (2) Write the relevant front-end pages in the views folder of the project, including login, registration, RON message list, and navigation page;

[0060] (3) Add relevant routing information to the router.js file to ensure that the page can be accessed;

[0061] (4) Debug key functions and improve the code;

[0062] (5) Run `npm run build:prod` to package the front-end project into a `dataSharingFront` and place it on the server;

[0063] (6) Configure the server's nginx reverse proxy server and place the website root directory on dataSharingFront.

[0064] The user's specific operation process on the front end is as follows:

[0065] The information provider navigates through the navigation interface, obtains traffic information for the road segment after driving, clicks to upload information, fills in the road segment name, deducts a certain amount of virtual currency, and completes the upload of the RON message. At this time, the message cannot be used.

[0066] In this embodiment, a user's threshold score is set to 60. Other users with a reputation score of 60 or higher can find this message on the RON search page. If a user has also recently traveled this route, they can verify the authenticity of this message. The more users who verify, the more reliable the message is considered. A user can verify a message a maximum of 3 times per day to prevent excessive verification.

[0067] To ensure the traceability of the verification process, the SM2 ring signature algorithm is used for signing during verification. This method allows verification to be completed without the user exposing their public key. Let the message to be signed be m, the signer's private key be sk, the public key be pk, and the public keys in the public key queue be... The base point selected for the elliptic curve is g; the specific process for obtaining the signature is as follows:

[0068] 1) Randomly generate r – 1 random numbers (Note that Si is not included in the random numbers; Si is obtained later.)

[0069] 2) Generate a random number k;

[0070] 3) Calculation ,in, This is a calculated value, with a total of r values. We'll calculate one here: ;

[0071] 4) Iterative calculation Where x = i+2......r,1,2......i; using r – 1 randomly generated numbers from the first step. ,Right now Calculate the remaining r - 1 Currently, r items have been obtained. When x!=i+1, it satisfies When x = i+1, In order to make The values ​​form a cycle, solving the equation ,get Thus, for any i, we have Established;

[0072] 5) Return As a result of ring signature.

[0073] Before signing, the witness also needs to generate an r-n degree polynomial based on the random point sequence in the RON message. The generation method can use the Lagrange interpolation formula:

[0074] ;

[0075] In the formula, i j , i l Corresponding to the points j , l of x value, f(i j ) Let represent the y-value of point j, which is a summation formula; p is a large prime number. The input in the above formula is k points, and the output is a polynomial. f(x) ,in, x It is the independent variable.

[0076] After obtaining the signature and an r-n degree polynomial using the above method, the verifier can verify the RON message published by the information provider. The specific procedure is as follows:

[0077] The information provider includes a public key queue and a random point list in the published RON message. The public key queue is initialized with r–n fake public keys, and the random point list is initialized with r–n + 1 pairs of random large integer points. The public keys are generated by the SM2 public-private key generation algorithm, but there is no corresponding user. When a follower verifies, they insert their own public key into the RON message public key queue. When n followers verify, the RON message public key queue will have r public keys. Then, a non-repeating point is randomly selected from an r–n degree polynomial generated by the Lagrange interpolation formula and inserted into the point list.

[0078] Each follower uses the SM2 ring signature method of the Chinese cryptographic standard to sign. Its input is r public keys and the follower's own private key. The output is the signature, which is published in the RON message.

[0079] The verification information in the RON message includes: a public key queue containing r public keys, a random point column containing r point pairs, and n signer signatures;

[0080] When verifying information, the public key queue in the signature is first checked against the public key queue in the RON message. Then, it is calculated whether the r random point pairs are on the same r-n degree polynomial. If both are satisfied, the RON message is considered valid; otherwise, it is invalid.

[0081] In practical implementation, relevant processing interfaces are defined in the backend, including an SM2 key generation interface, a RON message publishing interface, a RON message verification interface, an SM2 ring signature interface, an SM2 ring signature verification interface, a message usage interface, and a navigation route generation interface. Specifically, when a user registers, they call the SM2 key generation interface to generate an SM2 public-private key pair as their identity. When a user publishes a RON message, they call the RON message publishing interface to package the road map information, r-n+1 point columns, and rn public keys into the RON message for publication. When a user performs verification, the verifying user calls the RON message verification interface to insert a random point and their own public key into the RON message. When the number of verifiers reaches n, the SM2 ring signature interface is called to generate a ring signature. When a message user uses the message, they call the SM2 ring signature verification interface. Additionally, users can call the navigation route generation interface on the navigation page to view road map information and planned routes. (Backend interface reference) Figure 5 .

[0082] The specific steps for setting up the backend are as follows:

[0083] (1) Create a new Spring Boot project using the IDE environment Eclipse. When creating the project, select the required options: MySQL, Web, and Lombok.

[0084] (2) Download Java SDK version 2.1 from the Fabric website and add it to the project's compilation directory.

[0085] (3) Design each interface and entity according to the invention scheme and complete each function.

[0086] (4) Create an entity folder and define entity classes such as RON messages and users.

[0087] (5) Create a service folder and define the fabric service interface FabricService, the shared service interface dataSharingService, etc.

[0088] (6) Create a controller folder and define relevant response interfaces, such as registration, login, and posting messages.

[0089] (7) After writing the code, package the project into a dataSharng.jar file in Eclipse and run it on the server. Execute java -jar dataSharng.jar.

[0090] When the number of signers for a message reaches n, all signers sign the message on the RON message viewing page. Signers receive a reward. Once all signatures are completed, the message becomes a valid message and can be used by other users.

[0091] To incentivize user participation in information sharing, this embodiment designs a reasonable value incentive mechanism, which includes: when an information provider publishes a RON message, a certain amount of virtual currency is deducted as a verification reward; verification participants receive a small amount of virtual currency as a reward when verifying; and message users pay virtual currency to the message provider when using the message. The virtual currency is refreshed at the beginning of a billing cycle, and rewards are given to the users with the most virtual currency at the end of the billing cycle.

[0092] When other users need the message, they can search for it in the RON message list. For available information of interest, they need to pay a certain amount of currency to the message provider to view it. When a user applies a message, the message will automatically update the user's map information. The user can then re-execute the navigation function to obtain the optimal route again.

[0093] When users find information to be incorrect, they can report the message to the system, and the publisher and those who verify the message will be punished.

[0094] When sharing information, if a message user finds that the RON information is incorrect, they can choose to complain about the RON information. The publisher and the verifier of the RON information will then be punished, including reducing reputation points and deducting virtual currency value.

[0095] In this step, legitimate follow-up actions, information uploading actions, and information usage actions are defined as positive actions, while reported follow-up actions and information uploading actions are defined as negative actions.

[0096] For positive behavior, the user's credit score is updated using the formula credit=credit+credit*0.5+10 to increase the user's credit score.

[0097] For negative behavior, the user's credit score is updated using the formula credit=credit-credit*0.3–5 to reduce the user's credit score.

[0098] User behavior is regulated based on their credit score, as shown in the table below:

[0099]

[0100] The above are merely preferred embodiments of the present invention and are not intended to limit the implementation methods and protection scope of the present invention. Those skilled in the art should recognize that any equivalent substitutions and obvious changes made based on the content of this specification should be included within the protection scope of the present invention.

Claims

1. A blockchain-based information security sharing method for connected vehicles, characterized in that, The method is based on a constructed information sharing model, which includes information providers who share information, information users who need information, and verifiers who judge the authenticity of information. Includes the following steps: The information provider publishes a RON message containing user data. The RON message is configured to be visible to witnesses who meet certain threshold conditions and whose authenticity is yet to be determined. Those who meet the threshold conditions can verify the authenticity of the published RON messages. Once the number of authentic RON messages corresponding to the verified messages reaches a set threshold, the RON message status is configured as a legitimate and trusted message, and it is only visible to paid users. Information users search for legitimate and credible RON information that is only visible to those who are interested in paying a fee, and then obtain the information after paying. When verifying, the witness uses the SM2 ring signature method based on the national cryptographic standard to obtain a signature containing a public key queue. The public key is the unique identifier of the user's identity. The method for verifying the legality of information during verification is as follows: Let n be the threshold for the number of co-certifiers, and r be the ring signature size. The information provider attaches a public key queue and a random point list to the published RON message. The public key queue is initialized with r–n fake public keys, and the random point list is initialized with r–n + 1 random point pairs. The public keys are generated by the SM2 public-private key generation algorithm, but there is no corresponding user. When a co-certifier performs a verification, they insert their own public key into the RON message public key queue. When n co-certifiers perform verification, the RON message public key queue will have r public keys. Then, the Lagrange interpolation formula is used to generate an r–n degree polynomial from the r–n + 1 random point pairs in the random point list. A non-repeating point is randomly selected from this polynomial and inserted into the point list. During verification, the public key queue in the signer's signature is verified one by one with the public key queue in the RON message. Then, it is calculated whether r random point pairs are on the same r-n degree polynomial. If both are satisfied, the RON message is considered valid; otherwise, it is invalid. 2.The blockchain-based information security sharing method for connected vehicles according to claim 1, wherein, Followers who meet the threshold condition are all followers with a reputation score greater than or equal to the threshold score, and the followers are users who have prior knowledge of the message.

3. The blockchain-based method for secure sharing of connected vehicle information according to claim 1, characterized in that, RON messages contain information file keywords and other necessary information for verification.

4. The blockchain-based method for secure sharing of connected vehicle information according to claim 3, characterized in that, Other necessary information for verification includes a public key queue and a randomized list of point pairs.

5. The blockchain-based method for secure sharing of connected vehicle information according to claim 1, characterized in that, The method by which an information provider publishes RON messages is as follows: Information providers navigate through the front-end navigation interface, obtain road condition information for the route after driving, click to upload information, fill in the route name, deduct a certain amount of virtual currency, and complete the upload of the RON message.

6. The blockchain-based method for secure sharing of connected vehicle information according to claim 1, characterized in that, A value-based incentive mechanism was also designed, which includes: When an information provider publishes a RON message, a certain amount of virtual currency is deducted as a verification reward; when a verification participant performs verification, they receive a certain amount of virtual currency as a reward; when an information user uses a message, they need to pay a certain amount of virtual currency to the message provider; the virtual currency is refreshed at the beginning of a billing cycle, and at the end of the billing cycle, rewards are given to the users who have the most virtual currency.

7. The blockchain-based method for secure sharing of connected vehicle information according to claim 1, characterized in that, If users of RON information discover errors while paying for its use, they can choose to file a complaint against the RON information, which will then penalize the publisher and the person who provided the verification.

8. The blockchain-based method for secure sharing of connected vehicle information according to claim 1, characterized in that, After an information sharing process is completed, penalties and rewards will be applied to the evidence-tracking behavior, information uploading behavior, and information usage behavior in that process, respectively, as follows: The regulations stipulate that legitimate evidence collection, information uploading, and information usage are positive behaviors, while reported evidence collection and information uploading are negative behaviors. For positive behavior, the user's credit score is updated using the formula credit=credit+credit*0.5+10, thus increasing the user's credit score; For negative behavior, the user's credit score is updated using the formula credit=credit-credit*0.3–5, which reduces the user's credit score and deducts virtual currency value.

Images