Ciphertext retrieval method based on identity authentication in Internet of Vehicles in zero-trust environment
By adopting the ciphertext retrieval method based on identity authentication in the Internet of Vehicles, using bilinear pairing and counting Bloom filter technology, the problems of low efficiency and privacy leakage in encrypted data query in a zero-trust environment are solved, and efficient and secure are achieved encrypted data retrieval and storage.
Patent Information
- Application Number
- CN202411031650.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-30
- Publication Date
- 2024-11-26
AI Technical Summary
In a zero-trust environment, the query of encrypted data in the Internet of Vehicles is inefficient and there is a potential risk of privacy leakage, making it difficult to achieve effective encrypted data retrieval.
Using the ciphertext retrieval method based on identity authentication, public-private key pairs are generated through bilinear pairing, keywords in the shared file are extracted and mapped to the corresponding location of the counting Bloom filter, index linked list is established, and encrypted data storage is realized. and query, and accelerate query using the counting Bloom filter and coordinated retrieval of roadside units and cloud servers.
It improves the query efficiency and security of encrypted data, reduces the risks of unauthorized access and privacy leakage, enhances data privacy protection capabilities, and reduces storage overhead and data transmission delay.
Smart Images

Figure CN119030705A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of big data Internet and Internet of Vehicles, and in particular to a ciphertext retrieval method based on identity authentication in an Internet of Vehicles under a zero-trust environment. Background Art
[0002] The Internet of Vehicles is a concept that covers the Internet and vehicle technologies, aiming to achieve a high degree of interconnection between vehicles, between vehicles and infrastructure, and between vehicles and the Internet. It enables real-time communication between vehicles through sensors, communication equipment, and advanced software, enabling vehicles to share traffic and road condition data, and provide collaborative driving and autonomous driving functions. Although the Internet of Vehicles has made great contributions to providing users with convenient travel options in terms of transportation, intelligent and automated driving, alleviating urban traffic conditions, and making driving safer, more convenient, and more efficient, there are many problems with data privacy and security. Vehicle services are expected to improve traffic congestion, reduce pollution, and improve transportation efficiency and safety. However, the extensive use of private information during the operation of the service, with little consideration of the impact on users and third parties (individuals whose information is indirectly involved), has limited the development of the Internet of Vehicles.
[0003] Zero Trust is a new security architecture concept based on the principle of "never trust, always verify" and is designed to address the lack of trust in traditional network security models. In a zero-trust architecture, no internal or external network entity is trusted by default. Instead, each access request is strictly authenticated, authorized, and continuously monitored. In the Internet of Vehicles environment, the high-frequency data exchange between vehicles, infrastructure, and cloud platforms makes data security and privacy protection particularly important. Traditional network security models are stretched when faced with the complex multi-party interactions of the Internet of Vehicles, while zero-trust architecture can provide more reliable security protection for the Internet of Vehicles.
[0004] The main goal of the privacy protection strategy is to establish a dynamic mechanism to ensure that private and sensitive information can remain confidential during data storage and transmission, thereby preventing unauthorized malicious parties from accessing or tampering. At the same time, considering the massive amount of data involved in the Internet of Vehicles, the storage and computing capabilities of vehicles are limited, and cloud servers have strong computing and storage capabilities. However, under the zero-trust framework, vehicles, roadside units, and cloud servers do not trust each other. Therefore, effective storage and utilization of resources as well as verification and dynamic control of access each time have also become a key issue.
[0005] As a new service model, cloud computing has gradually become a necessary infrastructure for Internet of Vehicles communications. At the same time, cloud-based data sharing has become an indispensable means for the Internet of Vehicles to achieve efficient interconnection between people, vehicles, and objects. In particular, the cloud-based information retrieval services (e.g., location data, driving behavior, vehicle performance, etc.) required in intelligent connected vehicle groups, the integration of the Internet of Vehicles and the cloud provides great convenience for users and significantly improves traffic efficiency. However, in a zero-trust environment, vehicles, roadside units, and cloud servers do not trust each other, resulting in a potential risk of privacy leakage during data interaction. Therefore, in order to avoid sensitive data leakage, the data must be encrypted before being uploaded to the cloud server. However, querying encrypted information is a difficult problem, and the applicant has found that searchable encryption provides a practical solution that can perform identity authentication every time the vehicle makes a query. Therefore, how to effectively implement encrypted data query for vehicles in a zero-trust environment is a technical problem that needs to be solved urgently. Summary of the invention
[0006] In view of the deficiencies of the above-mentioned prior art, the technical problem to be solved by the present invention is: how to provide a ciphertext retrieval method based on identity authentication in a vehicle network in a zero-trust environment, extract and encrypt keywords in shared files, and map the keyword ciphertext to the corresponding position of the counting Bloom filter, and then write the index of the shared file into the linked list of the corresponding position, and finally realize the storage and query of the shared file index through the counting Bloom filter, thereby effectively realizing the encrypted data query of the vehicle in a zero-trust environment.
[0007] In order to solve the above technical problems, the present invention adopts the following technical solutions:
[0008] The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment includes:
[0009] S1: Generate a public-private key pair for the vehicle user based on the bilinear pairing method and send the public key to the data owner;
[0010] S2: After the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework, the public parameters generated based on the public key are sent to the vehicle users who pass the trust assessment;
[0011] S3: Extract keywords from the shared file of the data owner; map the keywords to the corresponding positions of the counting Bloom filter, and write the index of the shared file into the linked list of the corresponding position; upload the counting Bloom filter linked list and the encrypted shared file; the counting Bloom filter linked list refers to the counting Bloom filter itself plus the linked list at each position;
[0012] S4: Send the trapdoor generated by the vehicle user according to its private key, public parameters and keywords to the nearest roadside unit;
[0013] S5: Map the trapdoor of the vehicle user to the corresponding position of the counting Bloom filter, and check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the nearby roadside units: if it exists, determine the index of the shared file according to the linked list of the corresponding position, obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user; if it does not exist, send the trapdoor of the vehicle user to the cloud server;
[0014] S6: Map the trapdoor to the corresponding position of the counting Bloom filter through the cloud server, and determine the index of the shared file according to the linked list of the corresponding position; obtain the corresponding encrypted shared file according to the index of the shared file and send it to the roadside unit, and send the encrypted shared file to the vehicle user through the roadside unit.
[0015] Preferably, in step S1, the public-private key pair of the vehicle user is generated by the following steps:
[0016] S101: Obtain relevant parameters of the bilinear pairing method e,g,q; where q is a prime number, represents a prime order q-order cyclic group, and g represents a cyclic group The generator of arrive Bilinear mapping of ;
[0017] S102: Through the hash function H0 and the vehicle user's ID i Generate vector X i ;
[0018] The formula is:
[0019] x i =(x i1 ,x i2 ,…,x in )=((H0(id i )) 1 ,(H0(id i )) 2 ,…,(H0(id i )) n );
[0020] S103: Through the hash function H0 and the vehicle user's ID i , combined with the relevant parameters of the bilinear pairing method to generate the public key pk i With private key sk i ;
[0021] The formula is:
[0022] pk i =H0(id i );
[0023]
[0024] Where: The exponential corresponding to the vector X i x in in .
[0025] Preferably, in step S2, after the data owner performs a trust assessment on the vehicle users participating in data sharing under the zero trust framework, public parameters are generated based on the public keys sent by all vehicle users who have passed the trust assessment, and the public parameters are sent to all vehicle users who have passed the trust assessment.
[0026] Preferably, in step S2, the public parameters of the data owner are generated by the following steps:
[0027] S2021: construct a polynomial f(z) based on all vehicle user public keys that pass the trust evaluation;
[0028] The formula is:
[0029]
[0030] pk i =H0(id i );
[0031] Where: z represents the independent variable in the polynomial f(z); n Represents coefficient; pk i represents the public key of vehicle user i; n represents the number of vehicle users that have passed the trust evaluation of the data owner;
[0032] S2022: Generate a vector Z using polynomial coefficients of the polynomial f(z);
[0033] The formula is:
[0034] Z=(z1,z2,…,z n );
[0035] S2023: Generate a common parameter pp through the vector Z;
[0036] The formula is:
[0037]
[0038] Preferably, step S3 specifically includes the following steps:
[0039] S301: Shared file set D = {d1, d2, ..., d m} extract keywords from each shared file to obtain the keyword set w = {w1, w2, …, wt};
[0040] S202: For each keyword w i Encrypt to get the keyword ciphertext Where e and g represent the bilinear mapping and cyclic group in the relevant parameters of the bilinear pairing method The generator of g w Represents the encrypted keyword w;
[0041] S303: Through the hash function H′=(h1,h2,…,h k ) The keyword ciphertext v i Mapped to the corresponding position of the counting Bloom filter;
[0042] The formula is:
[0043] H′=(h1(v i ),h2(v i ),…,h k (v i ))→B;
[0044] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0045] S304: Write the index of the shared file containing the corresponding keyword into the linked list at the corresponding position of the keyword.
[0046] Preferably, in step S304, the linked list for counting each position in the Bloom filter includes a linked list head and a linked list element;
[0047] The formula is:
[0048] Link.head = {B[k], Next};
[0049] Link.element = {D, Next};
[0050] Where: Link.head represents the head of the linked list; Link.element represents the linked list element; B[k] represents the position in the counting Bloom filter; D represents the shared file index associated with the keyword at position B[k]; Next is a pointer to the next element.
[0051] Preferably, in step S4, a trapdoor is generated by using the private key, public parameters and keywords of the vehicle user;
[0052] The formula is:
[0053]
[0054] x0=(H0(id i )) 0 =1;
[0055]
[0056] In the formula: st w represents a trapdoor; sk represents the private key of the vehicle user; pp represents the public parameters obtained by the vehicle user; r represents the public parameters g r An integer; w represents a keyword.
[0057] Preferably, step S5 specifically includes the following steps:
[0058] S501: Obtaining a hierarchical Bloom filter tree of roadside units;
[0059] S502: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Map to the corresponding position of the counting Bloom filter; check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the roadside units near it through the hierarchical Bloom filter tree: if it exists, execute S503; if not, send the trapdoor of the vehicle user to the cloud server;
[0060] The formula mapped to the counting bloom filter is expressed as:
[0061] H′=(h1(st w ),h2(st w ),…,h k (st w ))=(h1(v),h2(v),…,h k (v)) → B;
[0062] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0063] S503: Obtain the intersection Res of the linked lists of all corresponding positions, and determine the index of the shared file through the non-empty intersection;
[0064] The formula is:
[0065]
[0066] Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position;
[0067] S504: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
[0068] Preferably, in step S502, the shortest path graph of the root roadside unit network graph generates a hierarchical Bloom filter tree;
[0069] Among them, when checking whether the nearest roadside unit itself and its nearby roadside units have the keyword corresponding to the trapdoor through the hierarchical Bloom filter tree, first determine whether the root node of the nearest roadside unit has the keyword: if not, send the trapdoor to the cloud server; if so, determine whether the nearest roadside unit itself has the keyword, if so, execute S503; if not, traverse each branch and leaf in the root node of the nearest roadside unit until the roadside unit with the keyword is found, and execute S503.
[0070] Preferably, step S6 specifically includes the following steps:
[0071] S601: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Mapped to the corresponding position of the counting bloom filter of the cloud server;
[0072] The formula is:
[0073] H′=(h1(st w ),h2(st w ),…,h k (st w ))=(h1(v),h2(v),…,h k (v)) → B;
[0074] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0075] S602: Obtain the intersection of all linked lists at corresponding positions, and determine the index of the shared file through the non-empty intersection;
[0076] The formula is:
[0077]
[0078] Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position;
[0079] S603: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
[0080] Compared with the prior art, the ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment in the present invention has the following beneficial effects:
[0081] In the present invention, a public-private key pair is generated for the vehicle user based on a bilinear pairing method. First, the bilinear pairing technology allows the integrity of the signature or encrypted data generated by the public key to be verified without directly exposing the private key. This mechanism ensures the confidentiality and integrity of the data during transmission and storage, and effectively prevents data leakage and tampering. Secondly, each vehicle user has a unique public-private key pair, which provides identity-based fine-grained control for data access and enhances the flexibility and accuracy of identity authentication. Finally, the cryptographic primitives based on bilinear pairing can support more advanced encryption protocols, such as identity-based encryption (IBE), attribute-based encryption (ABE), etc., which further improves the flexibility and security of encrypted data and makes data access control more in line with actual needs.
[0082] In the present invention, the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework. First, the zero trust framework requires continuous verification and evaluation of the identity and behavior of each requester, rather than being based on static network boundaries or device locations, so that the data owner can evaluate the trust of vehicle users in real time, dynamically adjust access rights, and effectively reduce potential security risks. Secondly, through trust assessment, the data owner can ensure that only strictly screened and verified vehicle users can obtain data access rights, which reduces the risk of unauthorized access or data leakage and enhances the ability to protect data privacy. Finally, the trust assessment mechanism enables the data owner to accurately control the scope and objects of data sharing, avoiding unnecessary data transmission and processing overhead.
[0083] The present invention extracts the keywords in the shared file of the data owner, maps the keywords to the corresponding position of the counting Bloom filter, writes the index of the shared file into the linked list of the corresponding position, and finally uploads the counting Bloom filter linked list and the encrypted shared file. First, by mapping the keywords to the counting Bloom filter, it is beneficial to quickly determine whether a keyword exists in the shared file without traversing the entire file or database, which improves the efficiency of data retrieval. Secondly, as a data structure with high space efficiency, the counting Bloom filter can achieve high error rate control at a small storage space cost. The keywords and shared file indexes are stored in the counting Bloom filter and its linked list, which can significantly reduce the storage overhead compared with the traditional index structure (such as hash table or database index). Finally, by associating the file index with the keyword and storing it in the linked list of the counting Bloom filter, the data owner can flexibly control which vehicle users (based on their keyword query) can access which shared files. This keyword-based access control mechanism is more fine-grained. At the same time, in the process of mapping the keyword to the counting Bloom filter, the keyword itself is not directly stored in the filter, but is stored through the fingerprint (or "mark") processed by the hash function. This method avoids the plaintext exposure of the keyword and enhances data privacy protection.
[0084] In the present invention, when a vehicle user needs to share a file, a trapdoor is generated by a private key, a public parameter and a keyword and sent to the nearest roadside unit, and the encrypted shared file is retrieved by the roadside unit or the cloud server through a counting Bloom filter. First, the trapdoor generated by the vehicle user through the private key, the public parameter and the keyword is encrypted. Only the vehicle user holding the corresponding private key and the correct public parameter can generate a valid trapdoor, which ensures the security of the trapdoor transmission process and prevents unauthorized access and tampering. Secondly, by sending the trapdoor to the nearest roadside unit and utilizing the collaboration of the roadside unit and the cloud server, the encrypted shared file can be efficiently retrieved in a distributed environment, which not only reduces the delay and bandwidth consumption of data transmission, but also improves the scalability and fault tolerance of the system. Finally, the roadside unit first attempts to retrieve the keyword and file index corresponding to the trapdoor in the local or nearby roadside unit. If no match can be found locally, the trapdoor is forwarded to the cloud server for further retrieval. This hierarchical retrieval strategy improves the flexibility of query processing. At the same time, during the entire query process, the identity of the vehicle user and the query content are protected. As an encrypted query request, the trapdoor will not directly expose the user's privacy information. The cloud server and roadside unit cannot directly obtain the user's sensitive information when processing the trapdoor. BRIEF DESCRIPTION OF THE DRAWINGS
[0085] In order to make the purpose, technical solution and advantages of the invention clearer, the present invention will be further described in detail below with reference to the accompanying drawings, in which:
[0086] Figure 1 This is the overall architecture diagram of the ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment;
[0087] Figure 2 This is the structural diagram of the counting Bloom filter linked list;
[0088] Figure 3 is the instance scene graph;
[0089] Figure 4 is an example of a roadside unit network diagram;
[0090] Figure 5 is an instance of the shortest path graph of a roadside unit;
[0091] Figure 6 An instance of a hierarchical bloom filter tree. DETAILED DESCRIPTION
[0092] 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.
[0093] The following is a further detailed description through specific implementation methods:
[0094] Example:
[0095] This embodiment discloses a ciphertext retrieval method based on identity authentication in a vehicle network under a zero-trust environment.
[0096] like Figure 1 As shown in the figure, the ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment includes:
[0097] S1: Generate a public-private key pair for the vehicle user based on the bilinear pairing method and send the public key to the data owner;
[0098] S2: After the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework, the public parameters generated based on the public key are sent to the vehicle users who pass the trust assessment;
[0099] S3: Extract the keywords from the shared file of the data owner; map the keywords to the corresponding positions of the counting Bloom filter, and write the index of the shared file into the linked list of the corresponding positions; upload the counting Bloom filter linked list and the encrypted shared file; the counting Bloom filter is a variant of the Bloom filter, which adds a counting function to the traditional Bloom filter to support the deletion of elements. The structure of the counting Bloom filter linked list is as follows: Figure 2 As shown, it refers to the counting Bloom filter itself plus the linked list at each position;
[0100] In this embodiment, the data owner encrypts the shared file with a symmetric key and sends the symmetric key to the vehicle user who has passed the trust evaluation. After receiving the encrypted shared file, the subsequent vehicle user decrypts it with the received symmetric key.
[0101] S4: Send the trapdoor generated by the vehicle user according to its private key, public parameters and keywords to the nearest roadside unit;
[0102] S5: Map the trapdoor of the vehicle user to the corresponding position of the counting Bloom filter, and check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the nearby roadside units: if it exists, determine the index of the shared file according to the linked list of the corresponding position, obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user; if it does not exist, send the trapdoor of the vehicle user to the cloud server;
[0103] S6: Map the trapdoor to the corresponding position of the counting Bloom filter through the cloud server, and determine the index of the shared file according to the linked list of the corresponding position; obtain the corresponding encrypted shared file according to the index of the shared file and send it to the roadside unit, and send the encrypted shared file to the vehicle user through the roadside unit.
[0104] In the present invention, a public-private key pair is generated for the vehicle user based on a bilinear pairing method. First, the bilinear pairing technology allows the integrity of the signature or encrypted data generated by the public key to be verified without directly exposing the private key. This mechanism ensures the confidentiality and integrity of the data during transmission and storage, and effectively prevents data leakage and tampering. Secondly, each vehicle user has a unique public-private key pair, which provides identity-based fine-grained control for data access and enhances the flexibility and accuracy of identity authentication. Finally, the cryptographic primitives based on bilinear pairing can support more advanced encryption protocols, such as identity-based encryption (IBE), attribute-based encryption (ABE), etc., which further improves the flexibility and security of encrypted data and makes data access control more in line with actual needs.
[0105] In the present invention, the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework. First, the zero trust framework requires continuous verification and evaluation of the identity and behavior of each requester, rather than being based on static network boundaries or device locations, so that the data owner can evaluate the trust of vehicle users in real time, dynamically adjust access rights, and effectively reduce potential security risks. Secondly, through trust assessment, the data owner can ensure that only strictly screened and verified vehicle users can obtain data access rights, which reduces the risk of unauthorized access or data leakage and enhances the ability to protect data privacy. Finally, the trust assessment mechanism enables the data owner to accurately control the scope and objects of data sharing, avoiding unnecessary data transmission and processing overhead.
[0106] The present invention extracts the keywords in the shared file of the data owner, maps the keywords to the corresponding position of the counting Bloom filter, writes the index of the shared file into the linked list of the corresponding position, and finally uploads the counting Bloom filter linked list and the encrypted shared file. First, by mapping the keywords to the counting Bloom filter, it is beneficial to quickly determine whether a keyword exists in the shared file without traversing the entire file or database, which improves the efficiency of data retrieval. Secondly, as a data structure with high space efficiency, the counting Bloom filter can achieve high error rate control at a small storage space cost. The keywords and shared file indexes are stored in the counting Bloom filter and its linked list, which can significantly reduce the storage overhead compared with the traditional index structure (such as hash table or database index). Finally, by associating the file index with the keyword and storing it in the linked list of the counting Bloom filter, the data owner can flexibly control which vehicle users (based on their keyword query) can access which shared files. This keyword-based access control mechanism is more fine-grained. At the same time, in the process of mapping the keyword to the counting Bloom filter, the keyword itself is not directly stored in the filter, but is stored through the fingerprint (or "mark") processed by the hash function. This method avoids the plaintext exposure of the keyword and enhances data privacy protection.
[0107] In the present invention, when a vehicle user needs to share a file, a trapdoor is generated by a private key, a public parameter and a keyword and sent to the nearest roadside unit, and the encrypted shared file is retrieved by the roadside unit or the cloud server through a counting Bloom filter. First, the trapdoor generated by the vehicle user through the private key, the public parameter and the keyword is encrypted. Only the vehicle user holding the corresponding private key and the correct public parameter can generate a valid trapdoor, which ensures the security of the trapdoor transmission process and prevents unauthorized access and tampering. Secondly, by sending the trapdoor to the nearest roadside unit and utilizing the collaboration of the roadside unit and the cloud server, the encrypted shared file can be efficiently retrieved in a distributed environment, which not only reduces the delay and bandwidth consumption of data transmission, but also improves the scalability and fault tolerance of the system. Finally, the roadside unit first attempts to retrieve the keyword and file index corresponding to the trapdoor in the local or nearby roadside unit. If no match can be found locally, the trapdoor is forwarded to the cloud server for further retrieval. This hierarchical retrieval strategy improves the flexibility of query processing. At the same time, during the entire query process, the identity of the vehicle user and the query content are protected. As an encrypted query request, the trapdoor will not directly expose the user's privacy information. The cloud server and roadside unit cannot directly obtain the user's sensitive information when processing the trapdoor.
[0108] In order to better introduce the technical solution of the present invention, this embodiment is described through the following parts.
[0109] 1. Public and private key pairs of vehicle users
[0110] In this embodiment, in step S1, the public and private key pair of the vehicle user is generated through the following steps:
[0111] S101: Obtain relevant parameters of the bilinear pairing method e,g,q; In this embodiment, a security parameter λ should be selected first, and then the parameters of the bilinear mapping pairing operation are generated. Where q is a prime number, represents a prime order q-order cyclic group, and g represents a cyclic group The generator of arrive Bilinear mapping of ;
[0112] S102: Through the hash function H0 and the vehicle user's ID i Generate vector X i ;
[0113] The formula is:
[0114] X i =(x i1 ,x i2 ,…,x in )=((H0(id i ))1 ,(H0(id i )) 2 ,…,(H0(id i )) n );
[0115] S103: Through the hash function H0 and the vehicle user's ID i , combined with the relevant parameters of the bilinear pairing method to generate the public key pk i With private key sk i ;
[0116] The formula is:
[0117] pk i =H0(id i );
[0118]
[0119] Where: The exponential corresponding to the vector X i x in in .
[0120] 2. Public parameters of data owners
[0121] In this embodiment, after the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework, the data owner generates public parameters based on the public keys sent by all vehicle users who have passed the trust assessment, and sends the public parameters to all vehicle users who have passed the trust assessment. The vehicle users who have passed the trust assessment are recorded as U = (u1, u2, ..., u n ).
[0122] Specifically, in step S2, the public parameters of the data owner are generated through the following steps:
[0123] S2021: construct a polynomial f(z) based on all vehicle user public keys that pass the trust evaluation;
[0124] The formula is:
[0125]
[0126] pk i =H0(id i );
[0127] Where: z represents the independent variable in the polynomial f(z); n Represents coefficient; pk i represents the public key of vehicle user i; n represents the number of vehicle users that have passed the trust evaluation of the data owner;
[0128] S2022: Generate a vector Z using polynomial coefficients of the polynomial f(z);
[0129] The formula is:
[0130] Z=(z1,z2,…,z n );
[0131] S2023: Generate a common parameter pp through the vector Z;
[0132] The formula is:
[0133]
[0134] 3. Counting Bloom Filter Link List
[0135] In this embodiment, combined with Figure 2 As shown, step S3 includes the following steps:
[0136] S301: Shared file set D = {d1, d2, ..., d m} extract keywords from each shared file to obtain the keyword set w = {w1, w2, …, w t};
[0137] S202: For each keyword w i Encrypt to get the keyword ciphertext Where e and g represent the bilinear mapping and cyclic group in the relevant parameters of the bilinear pairing method The generator of g w Represents the encrypted keyword w;
[0138] S303: Through the hash function H′=(h1,h2,…,h k ) The keyword ciphertext v i Mapped to the corresponding position of the counting Bloom filter;
[0139] The formula is:
[0140] H′=(h1(v i ),h2(v i ),…,h k (v i ))→B;
[0141] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0142] S304: Write the index of the shared file containing the corresponding keyword into the linked list at the corresponding position of the keyword.
[0143] Specifically, the linked list at each position in the counting Bloom filter includes a linked list head and a linked list element;
[0144] The formula is:
[0145] Link.head = {B[k], Next};
[0146] Link.element = {D, Next};
[0147] Where: Link.head represents the head of the linked list; Link.element represents the linked list element; B[k] represents the position in the counting Bloom filter; D represents the shared file index associated with the keyword at position B[k]; Next is a pointer to the next element, and the Next pointer of the last element points to Null (that is, empty, indicating that the linked list is terminated).
[0148] 4. Trapdoor
[0149] In this embodiment, a trapdoor is generated by using the private key, public parameters and keywords of the vehicle user;
[0150] The formula is:
[0151]
[0152] x0=(H0(id i )) 0 =1;
[0153]
[0154] In the formula: st w represents a trapdoor; sk represents the private key of the vehicle user; pp represents the public parameters obtained by the vehicle user; r represents the public parameters g r An integer; w represents a keyword.
[0155] 5. Retrieval of roadside units
[0156] In this embodiment, step S5 specifically includes the following steps:
[0157] S501: Obtaining a hierarchical Bloom filter tree of roadside units;
[0158] S502: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Map to the corresponding position of the counting Bloom filter; check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the roadside units near it through the hierarchical Bloom filter tree: if it exists, execute S503; if not, send the trapdoor of the vehicle user to the cloud server;
[0159] The formula mapped to the counting bloom filter is expressed as:
[0160] H′=(h1(st w ),h2(st w ),…,h k (st w ))=(h1(v),h2(v),…,h k (v)) → B;
[0161] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0162] In this embodiment, when the vehicle user belongs to the vehicle user set U=(u1,u2,…,u n ), the trapdoor generated by the vehicle user is equal to the keyword ciphertext of the data owner, and the formula is expressed as:
[0163]
[0164] Where H0(id) is The root, therefore Since x0=(H0(id)) 0 , so x0z0r=z0r.
[0165] S503: Obtain the intersection Res of the linked lists of all corresponding positions, and determine the index of the shared file through the non-empty intersection;
[0166] The formula is:
[0167]
[0168] Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position;
[0169] S504: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
[0170] Specifically, the shortest path graph of the root roadside unit network graph generates a hierarchical Bloom filter tree. Figure 3 The example scene diagram shown is used as an example for explanation. Figure 3 In the figure, the nearest roadside unit of the vehicle user is R1, and the shortest path diagram of R1 is as follows: Figure 4 As shown, the shortest path graph of R1 is as follows Figure 5As shown in Figure 1 (the transmission delay between roadside units is basically 40ms, and the delay between roadside units and cloud servers is 160ms, so we set a maximum of 3 intervals). The resulting hierarchical Bloom filter tree is as follows: Figure 6 It should be noted that Figure 6 The root nodes R10, R11, R12, and R13 are all generated based on the shortest path and are not physical roadside units.
[0171] Combination Figure 6 As shown, taking R1 as the nearest roadside unit as an example, when checking whether the nearest roadside unit itself and its nearby roadside units have the keyword corresponding to the trapdoor through the hierarchical Bloom filter tree, first determine whether the root node R13 of the nearest roadside unit R1 has the keyword: if not, send the trapdoor to the cloud server; if so, determine whether the nearest roadside unit R1 itself has the keyword, if so, execute S503; if not, traverse each branch R10 (R2, R3, R4), R11 (R5, R6, R8), R12 (R7, R69) in the root node R13 of the nearest roadside unit R1 until the roadside unit with the keyword is found and S503 is executed.
[0172] 6. Cloud Server Search
[0173] In this embodiment, step S6 specifically includes the following steps:
[0174] S601: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Mapped to the corresponding position of the counting bloom filter of the cloud server;
[0175] The formula is:
[0176] H′=(h1(st w ),h2(st w ),…,g k (st w ))=(h1(v),h2(v),…,h k (v)) → B;
[0177] Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function;
[0178] S602: Obtain the intersection of all linked lists at corresponding positions, and determine the index of the shared file through the non-empty intersection;
[0179] The formula is:
[0180]
[0181] Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position;
[0182] S603: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
[0183] 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. A ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment, characterized in that: include: S1: Generate a public-private key pair for the vehicle user based on the bilinear pairing method and send the public key to the data owner; S2: After the data owner conducts a trust assessment on the vehicle users participating in data sharing under the zero trust framework, the public parameters generated based on the public key are sent to the vehicle users who pass the trust assessment; S3: Extract keywords from the shared file of the data owner; map the keywords to the corresponding positions of the counting Bloom filter, and write the index of the shared file into the linked list of the corresponding position; upload the counting Bloom filter linked list and the encrypted shared file; the counting Bloom filter linked list refers to the counting Bloom filter itself plus the linked list at each position; S4: Send the trapdoor generated by the vehicle user according to its private key, public parameters and keywords to the nearest roadside unit; S5: Map the trapdoor of the vehicle user to the corresponding position of the counting Bloom filter, and check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the nearby roadside units: if it exists, determine the index of the shared file according to the linked list of the corresponding position, obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user; if it does not exist, send the trapdoor of the vehicle user to the cloud server; S6: Map the trapdoor to the corresponding position of the counting Bloom filter through the cloud server, and determine the index of the shared file according to the linked list of the corresponding position; obtain the corresponding encrypted shared file according to the index of the shared file and send it to the roadside unit, and send the encrypted shared file to the vehicle user through the roadside unit.
2. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 1 is characterized by: In step S1, the public and private key pair of the vehicle user is generated by the following steps: S101: Obtain relevant parameters of the bilinear pairing method e, g, q; where q is a prime number, represents a prime order q-order cyclic group, and g represents a cyclic group The generator of arrive Bilinear mapping of ; S102: Through the hash function H0 and the vehicle user's ID i Generate vector X i ; The formula is: X i =(x i1 ,x i2 ,…,x in )=((H0(id i )) 1 ,(H0(id i )) 2 ,…,(H0(id i )) n ); S103: Through the hash function H0 and the vehicle user's ID i , combined with the relevant parameters of the bilinear pairing method to generate the public key pk i With the private key sk i ; The formula is: pk i =H0(id i ); Where: The exponential corresponding to the vector X i x in in .
3. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 1 is characterized by: In step S2, after the data owner performs a trust assessment on the vehicle users participating in data sharing under the zero trust framework, it generates public parameters based on the public keys sent by all vehicle users who have passed the trust assessment, and sends the public parameters to all vehicle users who have passed the trust assessment.
4. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 3 is characterized by: In step S2, the public parameters of the data owner are generated through the following steps: S2021: construct a polynomial f(z) based on all vehicle user public keys that pass the trust evaluation; The formula is: pk i =H0(id i ); Where: z represents the independent variable in the polynomial f(z); n Represents coefficient; pk i represents the public key of vehicle user i; n represents the number of vehicle users that have passed the trust evaluation of the data owner; S2022: Generate a vector Z using polynomial coefficients of the polynomial f(z); The formula is: Z=(z1,z2,…,z n ); S2023: Generate a common parameter pp through the vector Z; The formula is:
5. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 1, characterized in that: Step S3 specifically includes the following steps: S301: Shared file set D = {d1, d2, ..., d m } extract keywords from each shared file to obtain the keyword set w = {w1, w2, ..., w t }; S202: For each keyword w i Encrypt to get the keyword ciphertext Where e and g represent the bilinear mapping and cyclic group in the relevant parameters of the bilinear pairing method The generator of g w Represents the encrypted keyword w; S303: Through the hash function H ′ =(h1,h2,…,h k ) The keyword ciphertext v i Mapped to the corresponding position of the counting Bloom filter; The formula is: H ′ =(h1(v i ),h2(in i ),…,h k (in i ))→B; Where: H ′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function; S304: Write the index of the shared file containing the corresponding keyword into the linked list at the corresponding position of the keyword.
6. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 5 is characterized by: In step S304, the linked list of each position in the counting Bloom filter includes a linked list head and a linked list element; The formula is: Link.head = {B[k], Next}; Link.element = {D, Next}; Where: Link.head represents the head of the linked list; Link.element represents the linked list element; B[k] represents the position in the counting Bloom filter; D represents the shared file index associated with the keyword at position B[k]; Next is a pointer to the next element.
7. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 5 is characterized by: In step S4, a trapdoor is generated using the private key, public parameters and keywords of the vehicle user; The formula is: x0=(H0(id i )) 0 =1; In the formula: st w represents a trapdoor; sk represents the private key of the vehicle user; pp represents the public parameters obtained by the vehicle user; r represents the public parameters g r An integer; w represents a keyword.
8. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 1, characterized in that: Step S5 specifically includes the following steps: S501: Obtaining a hierarchical Bloom filter tree of roadside units; S502: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Map to the corresponding position of the counting Bloom filter; check whether the keyword corresponding to the trapdoor exists in the nearest roadside unit itself and the roadside units near it through the hierarchical Bloom filter tree: if it exists, execute S503; if not, send the trapdoor of the vehicle user to the cloud server; The formula mapped to the counting bloom filter is expressed as: H′=(h1(st w ),h2(st w ),…,h k (st w ))=(h1(v),h2(v),…,h k (v))→B; Where: H′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function; S503: Obtain the intersection Res of the linked lists of all corresponding positions, and determine the index of the shared file through the non-empty intersection; The formula is: Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position; S504: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
9. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 8, characterized in that: In step S502, the shortest path graph of the root roadside unit network graph generates a hierarchical Bloom filter tree; Among them, when checking whether the nearest roadside unit itself and its nearby roadside units have the keyword corresponding to the trapdoor through the hierarchical Bloom filter tree, first determine whether the root node of the nearest roadside unit has the keyword: if not, send the trapdoor to the cloud server; if so, determine whether the nearest roadside unit itself has the keyword, if so, execute S503; if not, traverse each branch and leaf in the root node of the nearest roadside unit until the roadside unit with the keyword is found, and execute S503.
10. The ciphertext retrieval method based on identity authentication in the Internet of Vehicles under a zero-trust environment as claimed in claim 1, characterized in that: Step S6 specifically includes the following steps: S601: Through the hash function H′=(h1,h2,…,h k ) will trap door st w Mapped to the corresponding position of the counting bloom filter of the cloud server; The formula is: H′=(h1(st w ),h2(st w ),…,h k (st w ))=(h1(v),h2(v),…,h k (v))→B; Where: H ′ represents the position in the counting Bloom filter; B represents the counting Bloom filter; h k represents the kth hash function; S602: Obtain the intersection of all linked lists at corresponding positions, and determine the index of the shared file through the non-empty intersection; The formula is: Where: Res represents the intersection of linked lists; Res1 to Res k Respectively represent the linked lists of each corresponding position; S603: Obtain the corresponding encrypted shared file according to the index of the shared file and send it to the vehicle user.
Citation Information
Cited By
Semantic search method based on secret state knowledge graph
CN119691810A
