LBS information retrieval method based on NTRU algorithm and careless transmission in zero-trust environment

Abstract

The invention discloses an LBS information retrieval method based on an NTRU algorithm and careless transmission in a zero-trust environment. The method comprises the steps that a server divides a target area into a plurality of blocks and allocates corresponding indexes; the server packages all interest point data of each block into a data set, generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and stores the data set to a roadside unit in a careless transmission mode; the target vehicle generates a private key and a public key through an NTRU algorithm; the target vehicle obtains the corresponding data set ciphertext from the roadside unit according to the index needing to be inquired; the target vehicle carries out disassembly and public key encryption on the index, and then sends the index to the server in a careless transmission mode; the server calculates a response ciphertext through the ciphertext data and returns the response ciphertext to the target vehicle; and the target vehicle calculates the symmetric key of the encryption key through the private key and the response ciphertext to decrypt the data set ciphertext to obtain the corresponding point-of-interest data plaintext. According to the invention, the privacy demand of the user and the LBS service quality are effectively balanced.

Description

Technical Field

[0001] The present invention relates to the field of location privacy protection LBS information retrieval, and in particular to an LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment. Background Art

[0002] The development of location-based services (LBS) stems from the increasing demand for location information. With the popularization of mobile Internet and smart devices, users have a growing demand for obtaining location-related information such as the surrounding environment and real-time dynamics.

[0003] With the development of mobile Internet technology, smart phones, tablet computers and other mobile devices have become popular rapidly, and people can access the Internet anytime and anywhere, which has greatly changed the way people obtain information and services. Mobile terminal devices have built-in positioning modules such as GPS, Bluetooth, and Wi-Fi, which can obtain user location information in real time. This has laid the foundation for the development of LBS information retrieval systems, making it possible to provide personalized and real-time information services based on user locations.

[0004] At present, various applications based on location information have emerged. For example, map navigation, nearby business search, real-time traffic information query, etc., all of these applications require accurate location information as support. These location-aware applications have gradually become an indispensable part of people's daily lives. At the same time, massive amounts of location data are constantly generated and accumulated. These location data contain valuable information such as user behavior trajectories, interest preferences, etc., and have become an important resource in the big data era. The LBS information retrieval system can mine users' location-related needs and preferences from these big data, and then provide users with more personalized and intelligent information services.

[0005] However, in the process of obtaining and using user location information, LBS information retrieval systems also bring new challenges to user privacy and security. If the user's location information is leaked or abused, it will seriously infringe on personal privacy. To meet this challenge, location privacy protection technology has emerged. Common location privacy protection technologies include anonymization and perturbation. Anonymization technology protects privacy by hiding the user's true identity, but if the attacker has enough background information, it is still possible to re-identify the user through association analysis and other methods. At the same time, anonymization processing will also reduce data availability and service quality. Perturbation technology blurs the user's true location information by introducing noise or random errors, but this practice will reduce the accuracy of location data, thereby affecting the performance of LBS services. At the same time, excessive perturbation may also cause the service to fail to be provided normally.

[0006] Therefore, how to design a method that can effectively balance user privacy needs and LBS service quality is a technical problem that needs to be solved urgently. Summary of the invention

[0007] In view of the above-mentioned deficiencies in the prior art, the technical problem to be solved by the present invention is: how to provide an LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment, by combining NTRU encryption with the oblivious transmission protocol to ensure that the location information is effectively protected during the transmission and retrieval process, while not causing a significant impact on the LBS service, thereby effectively balancing user privacy requirements and LBS service quality.

[0008] In order to solve the above technical problems, the present invention adopts the following technical solutions:

[0009] The LBS information retrieval method based on NTRU algorithm and oblivious transmission in zero-trust environment includes:

[0010] S1: The server divides the target area into several blocks and assigns a corresponding index to each block;

[0011] S2: The server packages all the POI data of each block into a data set, generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and then stores the encrypted data set ciphertext to the roadside unit through oblivious transmission;

[0012] S3: The target vehicle generates a private key and a public key through the NTRU algorithm;

[0013] S4: The target vehicle obtains the corresponding data set ciphertext from the roadside unit according to the index to be queried;

[0014] S5: After the target vehicle disassembles and encrypts the index with the public key, it sends the ciphertext data to the server via oblivious transmission;

[0015] S6: The server calculates the response ciphertext based on the ciphertext data and returns it to the target vehicle;

[0016] S7: The target vehicle uses the private key and the response ciphertext to calculate the symmetric key of the encryption key to decrypt the dataset ciphertext and obtain the corresponding POI data plaintext.

[0017] Preferably, in step S1, the target area is divided into n blocks, and a corresponding index value i is assigned to each block.

[0018] Preferably, in step S2, the specific processing steps of the server are as follows:

[0019] S101: For a block with index i, all the POI data of the block are packaged into a data set y i ;

[0020] S102: Decompose the index i into binary form to obtain the bit string {t0, t1, …, t l-1},in

[0021] S103: Randomly select two groups of numbers K 1 ,K -1 ∈Z p As the root key, Z p represents the domain of integers;

[0022] The formula is:

[0023]

[0024] S104: Select a value from the root key according to the bit string of index i to calculate the encryption key sk of the symmetric encryption algorithm AES ; Among them, if t i =0, then select K -1 The i-th value in j =1, then select K 1 The j-th value in ;

[0025] The formula is:

[0026]

[0027] Where: Hash represents hash operation;

[0028] S105: By encryption key sk AES For the data set y i Encrypt and generate the data set ciphertext c i ;

[0029] The formula is:

[0030]

[0031] Where: Enc represents encryption processing;

[0032] S106: The data set ciphertext c i Stored to a roadside unit by oblivious transfer.

[0033] Preferably, in step S2, the server also obtains the public key sent by the target vehicle, and uses the public key to encrypt the root key K 1 , K -1 After encryption, the root key ciphertext is stored.

[0034] Preferably, in step S3, the processing steps of the NTRU algorithm are as follows:

[0035] S301: Randomly select two polynomials f, g∈L g ; The polynomial f is invertible both modulo p and modulo q, and its inverse elements are represented by F q and F p , that is: Fq*f≡1(modq) and Fp*f≡1(modp); where L g Indicates a ring;

[0036] S302: Calculate h≡Fq*g(modq);

[0037] S303: Generate private key sk NTRU and public key pk ntru ;

[0038] The formula is:

[0039] sk NTRU =f;

[0040] pk ntru =h.

[0041] Preferably, in step S5, the specific processing steps of the target vehicle are as follows:

[0042] S501: Decompose the index i to be queried into binary form to obtain a bit string {t0, t1, …, t l-1};

[0043] S502: Use the public key to compare the bit string {t0, t1, ..., t l-1 The character t in} j Encrypt and generate character ciphertext

[0044] S503: The character ciphertext is transmitted by accident Send to the server.

[0045] Preferably, in step S6, the specific processing steps of the server are as follows:

[0046] S601: By character ciphertext Calculate the encrypted root key C j ;

[0047] The formula is:

[0048]

[0049] S602: Based on the encrypted root key C j Calculate the response ciphertext

[0050] The formula is:

[0051]

[0052] S603: Response ciphertext Return to the target vehicle.

[0053] Preferably, in step S7, the specific processing steps of the target vehicle are as follows:

[0054] S701: By responding to the ciphertext and private key sk NTRU Calculate the symmetric key sk of the encryption key AES ;

[0055] The formula is:

[0056]

[0057] In the formula: Hash represents hash operation; Dec represents decryption processing;

[0058] S702: Through the symmetric key sk AES Decrypt and restore the data set ciphertext c i , get the corresponding point of interest data plaintext m i ;

[0059] The formula is:

[0060]

[0061] Compared with the prior art, the LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment of the present invention has the following beneficial effects:

[0062] The present invention divides the target area into multiple blocks on the server and assigns a corresponding index to each block, then packages all the point of interest data of each block into a data set, and finally encrypts the data set. First, by dividing the target area into multiple blocks and assigning an index to each block, it is possible to effectively avoid directly exposing the user's precise location information. Even if the attacker intercepts the data, the user's specific location cannot be directly located, and the attacker can only know that the user is located in a certain block, thereby increasing the protection level of the user's location privacy. Secondly, the point of interest data of each block is packaged and encrypted to ensure the security of the data. Even if the data is intercepted during transmission or storage, the data cannot be decrypted without the correct key, thereby preventing the leakage of sensitive information. Finally, the partitioning and indexing mechanism makes the data organization more orderly, easy to manage and query, and compared with complete anonymization and excessive disturbance, this method protects the user's privacy while retaining the accuracy and availability of the data, ensuring that the LBS service can provide high-quality location information services.

[0063] In the present invention, the target vehicle generates a private key and a public key through the NTRU algorithm, and then realizes subsequent encryption, symmetric key generation and decryption through the private key and the public key. First of all, the NTRU algorithm is a public key encryption algorithm based on lattice theory, with a shorter key length and a faster encryption and decryption speed. Therefore, the NTRU algorithm can reduce the consumption of computing resources while ensuring security, speed up the key generation and encryption and decryption process, thereby improving the efficiency of LBS information retrieval. Secondly, compared with traditional public key encryption algorithms, the NTRU algorithm can still maintain a high level of security in a quantum computing environment, and can still protect the user's location information when computing power is improved in the future. Finally, the public and private keys of the NTRU algorithm are scalable, allowing NTRU to adapt to a variety of security requirements and application scenarios.

[0064] Based on the use of the NTRU algorithm to generate a public-private key pair, the present invention further transmits data through oblivious transmission. First, the oblivious transmission protocol allows users to selectively obtain specific information from a set of data without exposing the specific content of their selection, ensuring privacy and security during data transmission and preventing information leakage. Secondly, even if the transmission process is monitored or intercepted, it is difficult for attackers to infer the user's true intentions or choices from the transmitted data, thereby further enhancing data security protection. Finally, by combining NTRU encryption with the oblivious transmission protocol, it is ensured that location information is effectively protected during transmission and retrieval, and at the same time, it will not have a significant impact on LBS services, thereby effectively balancing user privacy requirements and LBS service quality.

[0065] In the present invention, the server generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and the vehicle decrypts the data set ciphertext by calculating the symmetric key of the encryption key through the private key and the response ciphertext. First of all, symmetric encryption algorithms usually have a faster encryption and decryption speed, which is suitable for fast encryption and decryption operations on large amounts of data, and helps to improve the response speed and user experience of LBS services. Secondly, data encrypted using a symmetric encryption algorithm is almost impossible to crack without the correct key, which ensures the confidentiality of the data and prevents unauthorized access and data leakage. Finally, compared with the public key encryption algorithm, the symmetric encryption algorithm only needs one key for encryption and decryption operations, which simplifies the complexity of key management; at the same time, because the key is shorter, it is also convenient for secure transmission during the communication process. BRIEF DESCRIPTION OF THE DRAWINGS

[0066] In order to make the purpose, technical solution and advantages of the invention more clear, the present invention will be further described in detail below with reference to the accompanying drawings, in which:

[0067] Figure 1 , Figure 2 , Figure 3It is a flowchart of the LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment;

[0068] Figure 4 Schematic diagram of block division. DETAILED DESCRIPTION

[0069] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. The components of the embodiments of the present invention generally described and shown in the drawings here can be arranged and designed in various different configurations. Therefore, the following detailed description of the embodiments of the present invention provided in the drawings is not intended to limit the scope of the claimed invention, but only represents selected embodiments of the present invention. Based on the embodiments in the present invention, all other embodiments obtained by ordinary technicians in this field without making creative work belong to the scope of protection of the present invention.

[0070] The following is a further detailed description through specific implementation methods:

[0071] Example:

[0072] This embodiment discloses an LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment.

[0073] like Figure 1 As shown in the figure, the LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment includes:

[0074] S1: The server divides the target area into several blocks and assigns a corresponding index to each block;

[0075] S2: The server packages all the POI data of each block into a data set, generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and then stores the encrypted data set ciphertext to the roadside unit through oblivious transmission;

[0076] In this embodiment, the oblivious transfer (OT), also known as forgetful transfer or confused transfer, is a cryptographic protocol that allows a sender to send part of the information in a message set to a receiver, while the sender cannot know which message the receiver has specifically selected.

[0077] S3: The target vehicle generates a private key and a public key through the NTRU algorithm;

[0078] S4: The target vehicle obtains the corresponding data set ciphertext from the roadside unit according to the index to be queried;

[0079] S5: After the target vehicle disassembles and encrypts the index with the public key, it sends the ciphertext data to the server via oblivious transmission;

[0080] S6: The server calculates the response ciphertext based on the ciphertext data and returns it to the target vehicle;

[0081] S7: The target vehicle uses the private key and the response ciphertext to calculate the symmetric key of the encryption key to decrypt the dataset ciphertext and obtain the corresponding POI data plaintext.

[0082] The present invention divides the target area into multiple blocks on the server and assigns a corresponding index to each block, then packages all the point of interest data of each block into a data set, and finally encrypts the data set. First, by dividing the target area into multiple blocks and assigning an index to each block, it is possible to effectively avoid directly exposing the user's precise location information. Even if the attacker intercepts the data, the user's specific location cannot be directly located, and the attacker can only know that the user is located in a certain block, thereby increasing the protection level of the user's location privacy. Secondly, the point of interest data of each block is packaged and encrypted to ensure the security of the data. Even if the data is intercepted during transmission or storage, the data cannot be decrypted without the correct key, thereby preventing the leakage of sensitive information. Finally, the partitioning and indexing mechanism makes the data organization more orderly, easy to manage and query, and compared with complete anonymization and excessive disturbance, this method protects the user's privacy while retaining the accuracy and availability of the data, ensuring that the LBS service can provide high-quality location information services.

[0083] In the present invention, the target vehicle generates a private key and a public key through the NTRU algorithm, and then realizes subsequent encryption, symmetric key generation and decryption through the private key and the public key. First of all, the NTRU algorithm is a public key encryption algorithm based on lattice theory, with a shorter key length and a faster encryption and decryption speed. Therefore, the NTRU algorithm can reduce the consumption of computing resources while ensuring security, speed up the key generation and encryption and decryption process, thereby improving the efficiency of LBS information retrieval. Secondly, compared with traditional public key encryption algorithms, the NTRU algorithm can still maintain a high level of security in a quantum computing environment, and can still protect the user's location information when computing power is improved in the future. Finally, the public and private keys of the NTRU algorithm are scalable, allowing NTRU to adapt to a variety of security requirements and application scenarios.

[0084] Based on the use of the NTRU algorithm to generate a public-private key pair, the present invention further transmits data through oblivious transmission. First, the oblivious transmission protocol allows users to selectively obtain specific information from a set of data without exposing the specific content of their selection, ensuring privacy and security during data transmission and preventing information leakage. Secondly, even if the transmission process is monitored or intercepted, it is difficult for attackers to infer the user's true intentions or choices from the transmitted data, thereby further enhancing data security protection. Finally, by combining NTRU encryption with the oblivious transmission protocol, it is ensured that location information is effectively protected during transmission and retrieval, and at the same time, it will not have a significant impact on LBS services, thereby effectively balancing user privacy requirements and LBS service quality.

[0085] In the present invention, the server generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and the vehicle decrypts the data set ciphertext by calculating the symmetric key of the encryption key through the private key and the response ciphertext. First of all, symmetric encryption algorithms usually have a faster encryption and decryption speed, which is suitable for fast encryption and decryption operations on large amounts of data, and helps to improve the response speed and user experience of LBS services. Secondly, data encrypted using a symmetric encryption algorithm is almost impossible to crack without the correct key, which ensures the confidentiality of the data and prevents unauthorized access and data leakage. Finally, compared with the public key encryption algorithm, the symmetric encryption algorithm only needs one key for encryption and decryption operations, which simplifies the complexity of key management; at the same time, because the key is shorter, it is also convenient for secure transmission during the communication process.

[0086] In order to better introduce the technical solution of the present invention, this embodiment is described through the following parts.

[0087] 1. Block Division

[0088] In this embodiment, Figure 4 As shown, the target area (geographic space) is divided into n blocks according to the actual needs of the user, and a corresponding index value i is assigned to each block, 0≤i≤n; where n=2 l , l is an integer.

[0089] 2. Data Encryption and Storage

[0090] In this embodiment, combined with Figure 2 As shown, the specific processing steps of the server are as follows:

[0091] S101: For a block with index i, all the points of interest data of the block are packaged into a data set y i ;

[0092] S102: Decompose the index i into binary form to obtain the bit string {t0, t1, …, t l-1},in

[0093] S103: Randomly select two groups of numbers K 1 ,K -1 ∈Z p As the root key, Z p represents the domain of integers;

[0094] The formula is:

[0095]

[0096] S104: Select a value from the root key according to the bit string of index i to calculate the encryption key sk of the symmetric encryption algorithm (AES encryption algorithm) AES ; Among them, if t i =0, then select K -1 The i-th value in j =1, then select K 1 The j-th value in ;

[0097] The formula is:

[0098]

[0099] Where: Hash represents hash operation;

[0100] S105: By encryption key sk AES For the data set y i Encrypt and generate the data set ciphertext c i ;

[0101] The formula is:

[0102]

[0103] Where: Enc represents encryption processing;

[0104] S106: The data set ciphertext c i Stored to a roadside unit by oblivious transfer.

[0105] Specifically, the server also obtains the public key sent by the target vehicle and uses the public key to encrypt the root key K 1 , K -1 After encryption, the root key ciphertext is stored. This can enhance the security of the key. If there are multiple vehicles, a corresponding root key ciphertext is generated for each vehicle.

[0106] NTRU Algorithm

[0107] In this embodiment, the processing steps of the NTRU algorithm are as follows:

[0108] S301: Randomly select two polynomials f, g∈L g ; The polynomial f is invertible both modulo p and modulo q, and its inverse elements are represented by F q and F p , that is: Fq*f≡1(modq) and Fp*f≡1(modp); where L g Indicates a ring;

[0109] S302: Calculate h≡Fq*g(modq);

[0110] S303: Generate private key sk NTRU and public key pk ntru ;

[0111] The formula is:

[0112] sk NTRU =f;

[0113] pk ntru =h.

[0114] 4. Response ciphertext generation

[0115] In this embodiment, combined with Figure 3 As shown, the specific processing steps for the target vehicle are as follows:

[0116] S501: Decompose the index i to be queried into binary form to obtain a bit string {t0, t1, …, t l-1};

[0117] S502: Use the public key to compare the bit string {t0, t1, ..., t l-1 The character t in} j ,0≤j≤l-1 to encrypt and generate character ciphertext Where 0≤j≤l-1;

[0118] S503: The character ciphertext is transmitted by accident Send to the server.

[0119] In this embodiment, combined with Figure 3 As shown, the specific processing steps of the server are as follows:

[0120] S601: By character ciphertext Calculate the (NTRU) encrypted root key C j ;

[0121] The formula is:

[0122]

[0123] S602: Based on the encrypted root key C j Calculate the response ciphertext

[0124] The formula is:

[0125]

[0126] S603: Response ciphertext Return to the target vehicle.

[0127] 4. Data Decryption

[0128] In this embodiment, combined with Figure 3 As shown, the specific processing steps for the target vehicle are as follows:

[0129] S701: By responding to the ciphertext and private key sk NTRU Calculate the symmetric key sk of the encryption key AES ;

[0130] The formula is:

[0131]

[0132] In the formula: Hash represents hash operation; Dec represents decryption processing;

[0133] S702: Through the symmetric key sk AES Decrypt and restore the data set ciphertext c i , get the corresponding point of interest data plaintext m i ;

[0134] The formula is:

[0135] The plaintext data of the point of interest here is m i With the dataset y i Essentially the same.

[0136] Finally, it should be noted that the above embodiments are only used to illustrate the technical solution of the present invention rather than to limit the technical solution. Those skilled in the art should understand that those modifications or equivalent substitutions of the technical solution of the present invention that do not depart from the purpose and scope of the technical solution should be included in the scope of the claims of the present invention.

Claims

1. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in zero-trust environment is characterized by: include: S1: The server divides the target area into several blocks and assigns a corresponding index to each block; S2: The server packages all the POI data of each block into a data set, generates an encryption key through a symmetric encryption algorithm to encrypt the data set, and then stores the encrypted data set ciphertext to the roadside unit through oblivious transmission; S3: The target vehicle generates a private key and a public key through the NTRU algorithm; S4: The target vehicle obtains the corresponding data set ciphertext from the roadside unit according to the index to be queried; S5: After the target vehicle disassembles and encrypts the index with the public key, it sends the ciphertext data to the server via oblivious transmission; S6: The server calculates the response ciphertext based on the ciphertext data and returns it to the target vehicle; S7: The target vehicle uses the private key and the response ciphertext to calculate the symmetric key of the encryption key to decrypt the dataset ciphertext and obtain the corresponding POI data plaintext.

2. The LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 1, characterized in that: In step S1, the target area is divided into n blocks, and a corresponding index value i is assigned to each block.

3. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 1, characterized in that: In step S2, the specific processing steps of the server are as follows: S101: For a block with index i, all the POI data of the block are packaged into a data set y i ; S102: Decompose the index i into binary form to obtain the bit string {t0, t1, …, t l-1 },in S103: Randomly select two groups of numbers K 1 ,K -1 ∈Z p As the root key, Z p represents the domain of integers; The formula is: S104: Select a value from the root key according to the bit string of index i to calculate the encryption key sk of the symmetric encryption algorithm AES ; Among them, if t i =0, then select K -1 The value of the i-th digit in , if t j =1, then select K 1 The j-th value in ; The formula is: Where: Hash represents hash operation; S105: By encryption key sk AES For the data set y i Encrypt and generate the data set ciphertext c i ; The formula is: Where: Enc represents encryption processing; S106: The data set ciphertext c i Stored to a roadside unit by oblivious transfer.

4. The LBS information retrieval method based on the NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 3, characterized in that: In step S2, the server also obtains the public key sent by the target vehicle and uses the public key to encrypt the root key K 1 , K -1 After encryption, the root key ciphertext is stored.

5. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 1, characterized in that: In step S3, the processing steps of the NTRU algorithm are as follows: S301: Randomly select two polynomials f, g∈L g ; The polynomial f is invertible both modulo p and modulo q, and its inverse elements are represented by F q and F p , that is: Fq*f≡1(modq) and Fp*f≡1(modp); where L g Indicates a ring; S302: Calculate h≡Fq*g(modq); S303: Generate private key sk NTRU and public key pk ntru ; The formula is: en NTRU =f; pk ntru =h。 6. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 1, characterized in that: In step S5, the specific processing steps of the target vehicle are as follows: S501: Decompose the index i to be queried into binary form to obtain a bit string {t0, t1, …, t l-1 }; S502: Use the public key to compare the bit string {t0, t1, ..., t l-1 The character t in} j Encrypt and generate character ciphertext S503: The character ciphertext is transmitted by accident Send to the server.

7. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 6, characterized in that: In step S6, the specific processing steps of the server are as follows: S601: By character ciphertext Calculate the encrypted root key C j ; The formula is: S602: Based on the encrypted root key C j Calculate the response ciphertext The formula is: S603: Response ciphertext Return to the target vehicle.

8. The LBS information retrieval method based on NTRU algorithm and oblivious transmission in a zero-trust environment as claimed in claim 7, characterized in that: In step S7, the specific processing steps of the target vehicle are as follows: S701: By responding to the ciphertext and private key sk NTRU Calculate the symmetric key sk of the encryption key AES ; The formula is: Where: Hash represents hash operation; Dec represents decryption processing; S702: Through the symmetric key sk AES Decrypt and restore the data set ciphertext c i , get the corresponding point of interest data plaintext m i ; The formula is:

Images