CN116527276B - Efficient privacy protection method for traffic monitoring service of Internet of vehicles - Google Patents

Efficient privacy protection method for traffic monitoring service of Internet of vehicles Download PDF

Info

Publication number
CN116527276B
CN116527276B CN202310550336.4A CN202310550336A CN116527276B CN 116527276 B CN116527276 B CN 116527276B CN 202310550336 A CN202310550336 A CN 202310550336A CN 116527276 B CN116527276 B CN 116527276B
Authority
CN
China
Prior art keywords
path
vehicle
query
real
traffic monitoring
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202310550336.4A
Other languages
Chinese (zh)
Other versions
CN116527276A (en
Inventor
顾辰
凌宝红
胡东辉
崔选得
马宝山
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hefei University of Technology
Original Assignee
Hefei University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hefei University of Technology filed Critical Hefei University of Technology
Priority to CN202310550336.4A priority Critical patent/CN116527276B/en
Publication of CN116527276A publication Critical patent/CN116527276A/en
Application granted granted Critical
Publication of CN116527276B publication Critical patent/CN116527276B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3263—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements
    • H04L9/3268—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving certificates, e.g. public key certificate [PKC] or attribute certificate [AC]; Public key infrastructure [PKI] arrangements using certificate validation, registration, distribution or revocation, e.g. certificate revocation list [CRL]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0823—Network architectures or network communication protocols for network security for authentication of entities using certificates
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • H04L63/0884—Network architectures or network communication protocols for network security for authentication of entities by delegation of authentication, e.g. a proxy authenticates an entity to be authenticated on behalf of this entity vis-à-vis an authentication entity
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L2209/00—Additional information or applications relating to cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00
    • H04L2209/84—Vehicles

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computer Hardware Design (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a high-efficiency privacy protection method for traffic monitoring service of the Internet of vehicles, which is applied to a network environment consisting of a trusted third party, a traffic monitoring server, a map server and vehicles and comprises the following steps: 1, registering a vehicle; 2, generating a position point set by path segment 3; 4, generating a real path set; 5, generating an confusion position; 6, generating inquiry time; and 7, obtaining traffic information. The invention can provide accurate, timely and effective traffic information for the driver based on geographic indistinguishability while protecting the position privacy and the identity privacy of the driver.

Description

Efficient privacy protection method for traffic monitoring service of Internet of vehicles
Technical Field
The invention belongs to the field of Internet of vehicles application, and particularly relates to a high-efficiency privacy protection method for Internet of vehicles traffic monitoring service.
Background
Currently, large amounts of geospatial data are collected in the internet of vehicles in various ways. Geospatial data may provide many benefits for personalized services, such as shared travel, recommendation systems, and web searches. By using the geospatial data, the server can promote local restaurants near the current location of the user and recommend tourist attractions according to the location of the driver. In addition, the rapid development of the internet of vehicles also shows great potential for improving traffic efficiency. In traffic monitoring services, vehicles equipped with on-board units (OBUs) and various sensors (e.g., multi-beam lidar and high-resolution cameras) may sense the surrounding environment and report events such as car accidents and traffic jams to a cloud server. When other drivers send location query events, the traffic monitoring server returns the results to the drivers, helping them to better understand the road conditions. Despite the tremendous potential of traffic monitoring services, some challenging problems still need to be solved for such location-based services.
Existing location-based services have the following problems:
1. uploading the query information to the server exposes the driver's location and other information.
2. The timeliness of events such as traffic jams is not of concern.
3. Existing privacy protection schemes do not consider the geographic rationality of the confusion location.
Disclosure of Invention
The invention aims to solve the defects of the prior art, and provides a high-efficiency privacy protection method for the traffic monitoring service of the Internet of vehicles, so that accurate, timely and effective traffic information can be provided for a driver while the position privacy and the identity privacy of the driver are protected.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
the invention relates to a high-efficiency privacy protection method for traffic monitoring service of the internet of vehicles, which is characterized by being applied to a network environment consisting of a trusted third party, a traffic monitoring server, a map server and all vehicles and comprising the following steps:
step one: registering a vehicle;
step 1.1: each vehicle, the map server and the traffic monitoring server respectively provide identity authentication and a registration request for the trusted third party;
step 1.2: the trusted third party respectively verifies the identities of the corresponding vehicle, the map server and the traffic monitoring server, issues certificates to the corresponding vehicle, map server and traffic monitoring server when verification passes, and ignores corresponding requests when verification fails;
step two: path segmentation;
each vehicle uniformly divides the total travel path of the vehicle into I sub-paths;
step three: generating a position point set;
step 3.1: when the vehicle A is located in the (i-1) th sub-path, the vehicles A are respectivelyAt the start of the ith sub-pathCircle with circle center and radius r +.>Randomly selecting k starting point position sets { p }, on 1 ,p 2 ,…,p k -a }; the radius r is generated according to the given privacy budget E and through Gamma distribution; p is p k Expressed as starting point +.>A circle with the center of the circle>A kth position on; i epsilon [1, I]；
Step 3.2: vehicle a generates an endpoint in the ith sub-path in the manner of step 3.1Circle with circle center and radius r +.>End position set { p' 1 ,p' 2 ,…,p' k -a }; wherein p' k Expressed as endpoint +.>A circle with the center of the circle>A kth position on;
step 3.3: vehicle A sends { p } to the map server 1 ,p 2 ,…,p k Sum { p' 1 ,p' 2 ,…,p' k }；
Step four: generating a real path set;
step 4.1: map server receives { p } 1 ,p 2 ,…,p k Sum { p' 1 ,p' 2 ,…,p' k After } query from the mth origin position p m To the nth starting position p n Existing origin real path<p m ,p n >And from the mth end position p' m To the nth end position p' n Is the terminal real path of (a)<p' m ,p'n>；
Respectively taking the real paths of the starting points<p m ,p n >And destination real path<p' m ,p'n>Correspondingly adding the real starting point path set P and the real end point path set P'; m, n E [1, k ]]；
Step 4.2: the map server sends P and P' to the vehicle A;
step five: generating an confusion position;
step 5.1: start point for the ith sub-pathVehicle A will be round->Dividing into a plurality of grids, wherein ∈ ->Representation comprising the endpoints->Is to superimpose the set of true paths P on the grid +.>Applying;
step 5.2: if in the real path set P<p m ,p n >And grid ofCrossing according to the starting point->And a true path<p m ,p n >Euclidean distance between them, using formula (1) will +>Mapping to confusion location points->After that, step 5.4 is performed:
in the formula (1), the components are as follows,indicates the start point +.>Mapping to confusion location points->S represents the probability that the set of true paths P falls on the grid +.>A set of path points in (a);
if there is no path or grid in the real path set PIf the two are intersected, the step 5.3 is carried out;
step 5.3: according to other grids andif yes, obtaining the confusion position point mapped by the starting point of the corresponding grid according to the process of step 5.2, otherwise, continuing to access the grid farther until finding the path intersected with the path in the real path set PA grid;
step 5.4: obtaining the end point of the ith sub-path according to the method from step 5.1 to step 5.3Mapped to confusion location point->
Step six: generating a start query time;
vehicle A calculates the query time of the a-1 th query before sending the a-th query requestWherein (1)>And->Represents the start time and the end time of the a-1 st query respectively, thereby obtaining the query time of the previous a-1 st query and forming a query time set +.>
Forming a travel time set from travel times on I sub-paths Representing the travel time of the ith sub-path;
obtaining the start time of the vehicle A at the a-th query by using the formulas (2) - (5)
In the formulas (2) to (5),representing the average value of the set of time periods T; />Representing a travel time set T l Average value of (2);a query time representing the a-th query;
step seven: obtaining traffic information;
step 7.1: vehicle A starts the inquiry time according to the a-th inquiryTransmitting the confusion location point +_ to the traffic monitoring server>And->
Step 7.2: traffic monitoring server query pathAnd returns to vehicle a.
The electronic device of the invention comprises a memory and a processor, wherein the memory is used for storing a program for supporting the processor to execute the efficient privacy protection method, and the processor is configured to execute the program stored in the memory.
The invention relates to a computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, performs the steps of the efficient privacy preserving method.
Compared with the prior art, the invention has the beneficial effects that:
1. the invention provides an efficient privacy protection scheme for the traffic monitoring service of the Internet of vehicles, and the driving path is divided into a plurality of sub-paths, so that the timeliness of traffic information is ensured.
2. The invention redesigns the privacy protection scheme based on geographic indistinguishability, and protects the position privacy of the participants while ensuring the efficient execution of the service.
3. The confusion positions in the invention are all selected from the real paths, so that the geographic rationality of the confusion positions is ensured.
4. The invention designs the inquiry sending time carefully, so that the traffic monitoring server can not link the real identity of the driver, and the identity privacy of the driver is ensured.
5. The invention selects the confusion position which is closer to the real position as far as possible, and ensures the service availability to the greatest extent.
6. The invention carries out position confusion based on an exponential mechanism, and strictly follows differential privacy definition.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a schematic diagram of the path of the present invention;
FIG. 3 is a diagram illustrating a confusion position selection according to the present invention.
Detailed Description
In this embodiment, a high-efficiency privacy protection scheme for traffic monitoring service of internet of vehicles is applied to a network environment composed of a trusted third party, a traffic monitoring server, a map server and vehicles, as shown in fig. 1, the general steps of information inquiry executed by the vehicles on each sub-path are shown in the following steps:
step one: registering a vehicle;
step 1.1: each vehicle, the map server and the traffic monitoring server respectively provide identity authentication and registration request for a trusted third party;
step 1.2: the trusted third party respectively verifies the identities of the corresponding vehicle, the map server and the traffic monitoring server, issues certificates to the corresponding vehicle, the map server and the traffic monitoring server when the verification passes, and ignores the corresponding request when the verification fails;
step two: path segmentation;
each vehicle uniformly divides the total travel path of the vehicle into I sub-paths;
step three: generating a position point set;
step 3.1: when the vehicle A is located in the ith-1 th sub-path, the vehicle A is respectively located at the start point of the ith sub-pathCircle with circle center and radius r +.>Randomly selecting k starting point position sets { p }, on 1 ,p 2 ,…,p k -a }; the radius r is generated according to the given privacy budget E and through Gamma distribution; p is p k Expressed as starting point +.>A circle with the center of the circle>A kth position on; i epsilon [1, I]；
Step 3.2: vehicle a generates an endpoint in the ith sub-path in the manner of step 3.1Circle with circle center and radius r +.>End position set { p' 1 ,p' 2 ,…,p' k -a }; wherein p' k Expressed as endpoint +.>A circle with the center of the circle>A kth position on;
step 3.3: vehicle A sends { p } to the map server 1 ,p 2 ,…,p k Sum { p' 1 ,p' 2 ,…,p' k }；
Step four: generating a real path set;
step 4.1: the map server receives { p1, p 2 ,…,p k Sum { p' 1 ,p' 2 ,…,p' k After } query from the mth origin position p m To the nth starting position p n Existing origin real path<p m ,p n >And from the mth end position p' m To the nth end position p' n Is the terminal real path of (a)<p' m ,p'n>；
Respectively taking the real paths of the starting points<p m ,p n >And destination real path<p' m ,p'n>Correspondingly adding the real starting point path set P and the real end point path set P'; m, n E [1, k ]]；
Step 4.2: the map server sends P and P' to the vehicle A;
step five: generating an confusion position;
step 5.1: start point for the ith sub-pathVehicle A will be round->Divided into a plurality of grids, as shown in FIG. 2, wherein +.>Representation comprising the endpoints->Is to superimpose the set of true paths P on the grid +.>Applying;
step 5.2: if in the real path set P<p m ,p n >And grid ofCrossing according to the starting point->And a true path<p m ,p n >Euclidean distance between them, using formula (1) will +>Mapping to confusion location points->After that, step 5.4 is performed:
in the formula (1), the components are as follows,indicates the start point +.>Mapping to confusion location points->S represents the probability that the set of true paths P falls on the grid +.>A set of path points in (a);
if there is no path or grid in the real path set PIf the two are intersected, the step 5.3 is carried out;
step 5.3: as shown in FIG. 3, according to other grids andif yes, obtaining the confusion position points mapped by the starting points of the corresponding grids according to the process of the step 5.2, otherwise, continuing to access farther grids until grids intersected with the paths in the real path set P are found, if no grid meeting the condition is found, obtaining a null value, and ending the current step;
step 5.4: obtaining the end point of the ith sub-path according to the method from step 5.1 to step 5.3Mapped to confusion location point->
Step six: generating a start query time;
vehicle A calculates the query time of the a-1 th query before sending the a-th query requestWherein (1)>And->Represents the start time and the end time of the a-1 st query respectively, thereby obtaining the query time of the previous a-1 st query and forming a query time set +.>
Forming a travel time set from travel times on I sub-paths Representing the travel time of the ith sub-path;
obtaining the start time of the vehicle A at the a-th query by using the formulas (2) - (5)
In the formulas (2) to (5),representing the average value of the set of time periods T; />Representing a travel time set T l Average value of (2);a query time representing the a-th query;
step seven: obtaining traffic information;
step 7.1: vehicle A starts the inquiry time according to the a-th inquiryTransmitting the confusion location point +_ to the traffic monitoring server>And->
Step 7.2: traffic monitoring server query pathAnd returns to vehicle a.
In this embodiment, an electronic device includes a memory for storing a program supporting the processor to execute the above method, and a processor configured to execute the program stored in the memory.
In this embodiment, a computer-readable storage medium stores a computer program that, when executed by a processor, performs the steps of the method described above.

Claims (3)

1. The high-efficiency privacy protection method for the traffic monitoring service of the Internet of vehicles is characterized by being applied to a network environment consisting of a trusted third party, a traffic monitoring server, a map server and all vehicles, and comprises the following steps of:
step one: registering a vehicle;
step 1.1: each vehicle, the map server and the traffic monitoring server respectively provide identity authentication and a registration request for the trusted third party;
step 1.2: the trusted third party respectively verifies the identities of the corresponding vehicle, the map server and the traffic monitoring server, issues certificates to the corresponding vehicle, map server and traffic monitoring server when verification passes, and ignores corresponding requests when verification fails;
step two: path segmentation;
each vehicle uniformly divides the total travel path of the vehicle into I sub-paths;
step three: generating a position point set;
step 3.1: when the vehicle A is located in the ith-1 th sub-path, the vehicle A is respectively located at the start point of the ith sub-pathCircle with circle center and radius r +.>Randomly selecting k starting point position sets { p }, on 1 ，p 2 ，...，p k -a }; wherein the radius r is generated according to a given privacy budget epsilon and through Gamma distribution; p is p k Expressed as starting point +.>A circle with the center of the circle>A kth position on; i epsilon [1, I]；
Step 3.2: vehicle a generates an endpoint in the ith sub-path in the manner of step 3.1Circle with circle center and radius rEnd position set { p' 1 ，p′ 2 ，...，p′ k -a }; wherein p' k Expressed as endpoint +.>A circle with the center of the circle>A kth position on;
step 3.3: vehicle A sends { p } to the map server 1 ，p 2 ，...，p k Sum { p' 1 ，p′ 2 ，...，p′ k }；
Step four: generating a real path set;
step 4.1: map server receives { p } 1 ，p 2 ，...，p k Sum { p' 1 ，p′ 2 ，...，p′ k After } query from the mth origin position p m To the nth starting position p n Existing origin real path<p m ，p n >And from the mth end position p' m To the nth end position p' n Is the terminal real path of (a)<p′ m ，p′ n >；
Respectively taking the real paths of the starting points<p m ，p n >And destination real path<p′ m ，p′ n >Correspondingly adding the real starting point path set P and the real end point path set P'; m, n E [1, k ]]；
Step 4.2: the map server sends P and P' to the vehicle A;
step five: generating an confusion position;
step 5.1: start point for the ith sub-pathVehicle A will be round->Divided into a plurality of grids, wherein,let->Representation comprising the endpoints->Is to superimpose the set of true paths P on the grid +.>Applying;
step 5.2: if in the real path set P<p m ，p n >And grid ofCrossing according to the starting point->And a true path<p m ，p n >Euclidean distance between them, using formula (1) will +>Mapping to confusion location points->After that, step 5.4 is performed:
in the formula (1), the components are as follows,indicates the start point +.>Mapping to confusion location points->S represents the probability that the set of true paths P falls on the grid +.>A set of path points in (a);
if there is no path or grid in the real path set PIf the two are intersected, the step 5.3 is carried out;
step 5.3: according to other grids andif yes, obtaining the confusion position points mapped by the starting points of the corresponding grids according to the process of the step 5.2, otherwise, continuing to access grids farther until grids intersected with the paths in the real path set P are found;
step 5.4: obtaining the end point of the ith sub-path according to the method from step 5.1 to step 5.3Mapped to confusing location points
Step six: generating a start query time;
vehicle A calculates the query time of the a-1 th query before sending the a-th query requestWherein (1)>And->Represents the start time and the end time of the a-1 st query respectively, thereby obtaining the query time of the previous a-1 st query and forming a query time set +.>
Forming a travel time set from travel times on I sub-paths Representing the travel time of the ith sub-path;
obtaining the start time of the vehicle A at the a-th query by using the formulas (2) - (5)
In the formulas (2) to (5),representing the average value of the set of time periods T; />An average value representing the travel time set Tl;a query time representing the a-th query;
step seven: obtaining traffic information;
step 7.1: vehicle A starts the inquiry time according to the a-th inquiryTransmitting confusion location points to traffic monitoring serverAnd->
Step 7.2: traffic monitoring server query pathAnd returns to vehicle a.
2. An electronic device comprising a memory and a processor, wherein the memory is configured to store a program that supports the processor to perform the efficient privacy preserving method of claim 1, the processor being configured to execute the program stored in the memory.
3. A computer readable storage medium having a computer program stored thereon, characterized in that the computer program when executed by a processor performs the steps of the efficient privacy preserving method of claim 1.
CN202310550336.4A 2023-05-16 2023-05-16 Efficient privacy protection method for traffic monitoring service of Internet of vehicles Active CN116527276B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310550336.4A CN116527276B (en) 2023-05-16 2023-05-16 Efficient privacy protection method for traffic monitoring service of Internet of vehicles

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310550336.4A CN116527276B (en) 2023-05-16 2023-05-16 Efficient privacy protection method for traffic monitoring service of Internet of vehicles

Publications (2)

Publication Number Publication Date
CN116527276A CN116527276A (en) 2023-08-01
CN116527276B true CN116527276B (en) 2024-03-19

Family

ID=87402918

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310550336.4A Active CN116527276B (en) 2023-05-16 2023-05-16 Efficient privacy protection method for traffic monitoring service of Internet of vehicles

Country Status (1)

Country Link
CN (1) CN116527276B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106529336A (en) * 2016-11-16 2017-03-22 西安电子科技大学 False trajectory privacy protection method based on time-space correlation
WO2022082893A1 (en) * 2020-10-22 2022-04-28 香港中文大学（深圳） Privacy blockchain-based internet of vehicles protection method, and mobile terminal
CN114969805A (en) * 2022-04-18 2022-08-30 中移互联网有限公司 Service query method and device, electronic equipment and storage medium
CN115002753A (en) * 2022-06-21 2022-09-02 贵州财经大学 False location privacy protection method, system, medium, and device based on obfuscated queries

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106529336A (en) * 2016-11-16 2017-03-22 西安电子科技大学 False trajectory privacy protection method based on time-space correlation
WO2022082893A1 (en) * 2020-10-22 2022-04-28 香港中文大学（深圳） Privacy blockchain-based internet of vehicles protection method, and mobile terminal
CN114969805A (en) * 2022-04-18 2022-08-30 中移互联网有限公司 Service query method and device, electronic equipment and storage medium
CN115002753A (en) * 2022-06-21 2022-09-02 贵州财经大学 False location privacy protection method, system, medium, and device based on obfuscated queries

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
RATE: A RSU-Aided Scheme for Data-Centric Trust Establishment in VANETs;Aifeng Wu等;2011 7th International Conference on Wireless Communications, Networking and Mobile Computing;20111010;7900-7913 *

Also Published As

Publication number Publication date
CN116527276A (en) 2023-08-01

Similar Documents

Publication Publication Date Title
CN107228676B (en) Map updates from connected vehicle queues
US11280620B2 (en) Method, apparatus, and system for providing a campaign management platform to update map data
US11118916B2 (en) Method, apparatus, and system for providing a campaign management platform to discover map data
US20230057394A1 (en) Cooperative vehicle-infrastructure processing method and apparatus, electronic device, and storage medium
US20180113880A1 (en) Method and apparatus for hierarchical clustering of geographical data
CN111561937A (en) Sensor fusion for accurate positioning
US11408739B2 (en) Location correction utilizing vehicle communication networks
EP3696509B1 (en) Method, apparatus, and system for providing a campaign management platform to validate map data
US20120221230A1 (en) Method and system for generating and supplying traffic-relevant information
US11283620B2 (en) Method, apparatus, and system for providing a homomorphic cryptosystem
CN104185149B (en) It is a kind of to realize the method and device interacted between on-vehicle positioning terminal
EP3696767B1 (en) Method, apparatus, and system for providing an interface for publishing sensor data requests in campaign management platform
CN108234611A (en) traffic information sharing method and system
KR102467375B1 (en) Systems and methods for improved traffic situation visualization
US10957195B2 (en) Apparatuses, systems, and methods for graphical progress interfaces for dynamic transportation networks
JP4456667B2 (en) Navigation device
CN111414558B (en) Navigation route sending method, navigation route displaying method, navigation route sending device, navigation route displaying server and navigation route displaying medium
CN111291775B (en) Vehicle positioning method, device and system
US20220082394A1 (en) Method and apparatus for ridesharing pickup wait time prediction
US11921890B2 (en) Method and apparatus for trajectory anonymization based on a trajectory exchange twist
CN116527276B (en) Efficient privacy protection method for traffic monitoring service of Internet of vehicles
CN106468556A (en) A kind of running information is shared, methods of exhibiting and device
CN116817950A (en) Path planning method, apparatus, device, system, storage medium and program product
US11248916B2 (en) Enhanced vehicle operation
US20220318279A1 (en) Providing a resilient application programming interface for geographic services

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant