A privacy-preserving online car-hailing service method based on secure multi-party computing

Abstract

This invention discloses a privacy-preserving ride-hailing service method based on secure multi-party computation, belonging to the field of network security technology. The method includes: the passenger sending their encrypted location to an intelligent road testing device and a service provider; the intelligent road testing device broadcasting a ride request to every available driver within its coverage area, and the driver sending their encrypted vehicle location to the intelligent road testing device and the service provider; the intelligent road testing device and the service provider obtaining corresponding road distance shares based on the encrypted passenger and vehicle locations, combined with a random shared vector and each party's respective MAC share; both parties calculating a distance calculation check value based on the road distance share, the random shared vector, and the MAC share; and the passenger determining the appropriateness of the dispatch based on the distance calculation check value. This invention significantly reduces the computational complexity of distance calculation on the server and, through verifiable two-party computation technology, ensures that the ride-hailing system matches passengers with the optimal driver.

Description

Technical Field

[0001] The present invention belongs to the field of network security technology, and in particular relates to a privacy-protected online car-hailing service method based on secure multi-party computing. Background Art

[0002] Due to their convenience, flexibility and price transparency, ride-hailing services are growing in popularity, serving tens of millions of users around the world every day.

[0003] Ride matching is a feature frequently used by passengers in online ride-hailing services. It can efficiently and quickly match passengers with the nearest drivers, greatly reducing passengers' waiting time while increasing drivers' income. This feature relies on passengers and drivers sending real-time location information to the ride-hailing system. According to current research, many popular online ride-hailing apps widely collect users' location privacy data. Given that online ride-hailing services are not completely trustworthy, this privacy data may be illegally analyzed or illegally sold to advertisers.

[0004] In order to solve the above problems, many privacy protection technology solutions based on cryptography have been proposed in the prior art, such as homomorphic encryption, double trapdoor public key encryption and differential privacy. However, these solutions have certain limitations for optimizing ride matching:

[0005] 1. The matching accuracy is not optimal;

[0006] 2. Rely on heavy cryptography to process ride requests and ride responses;

[0007] 3. Unable to provide passenger verification capabilities.

[0008] In real life, low matching accuracy not only causes unnecessary waiting time for passengers, but also reduces the overall service experience. At the same time, the widespread use of encryption technology not only increases the computing cost of online car-hailing servers, but is also not friendly to users with limited computing resources. In addition, verification capabilities can ensure that the driver matched to the passenger by the ride-hailing system is the best, preventing the ride-hailing system from sending drivers who are far away. Summary of the invention

[0009] In order to solve the above technical problems, the present invention proposes a privacy-preserving online car-hailing service method based on secure multi-party computing to solve the problems existing in the above-mentioned prior art.

[0010] To achieve the above objectives, the present invention provides a privacy-preserving online car-hailing service method based on secure multi-party computing, comprising:

[0011] The passenger terminal encrypts the passenger location and sends it to the intelligent road test equipment and service provider;

[0012] After receiving the passenger's location, the intelligent road test device broadcasts the ride request instruction to each available driver in the coverage area and sends different random permutation indexes. After receiving the information, the driver encrypts the vehicle location and sends it to the intelligent road test device and service provider;

[0013] The intelligent road test device and the service provider obtain the road distance share corresponding to the intelligent road test device and the service provider based on the encrypted information of the passenger position and the vehicle position, combined with the random sharing vector and the MAC share of each party;

[0014] The intelligent road test device and the service provider respectively calculate a distance calculation check value based on the road distance share, the random public number, and the MAC share; the intelligent road test device and the service provider respectively obtain the shortest road distance between the available driver and the passenger and the random arrangement index of the corresponding driver, and transmit them together with the distance calculation check value to the passenger terminal;

[0015] The passenger side determines whether the dispatch is reasonable based on the distance calculation check value, the shortest road distance processed by the commitment function, and the random arrangement index of the corresponding driver side.

[0016] Optionally, the method further includes initializing the vehicle system before running, and the process includes:

[0017] The service provider sets the embedding space of the road network, the word length of the data to be operated, the security parameter, the first output pseudo-random generator, the second output pseudo-random generator, and the random seed generation algorithm;

[0018] Divide the area according to the coverage of the intelligent drive test equipment;

[0019] The intelligent drive test device and the service provider agree on the random shared vector, the random public number, and the random shared value based on the number of operations.

[0020] Optionally, the process of encrypting the location between the passenger and driver includes:

[0021] Based on the self-position and road network embedding technology, the corresponding embedded space vector representations are obtained respectively; based on the random seed generation algorithm, the passenger random seed and the driver random seed are generated, and two random vectors are generated based on the passenger random seed and the driver random seed respectively; the passenger side and the driver side encrypt the corresponding embedded space vector representations through the two random vectors, and obtain the ride request and ride response in turn.

[0022] Optionally, the area is determined according to the own location, and the corresponding intelligent road test equipment is found according to the area, and the ride request and the ride response are sent to the intelligent road test equipment, and the passenger random seed and the driver random seed are sent to the service provider.

[0023] Optionally, the service provider calculates the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver respectively based on the random seed corresponding to the passenger side and the random seed corresponding to the driver side.

[0024] Optionally, the process of obtaining the road distance share includes:

[0025] The service provider obtains an additive shared vector based on the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver, processes the additive shared vector using the random shared vector as a mask, and sends the processed vector to the intelligent road test device;

[0026] The intelligent drive test device performs masking processing using the random shared vector after subtracting the ride request from the passenger response, and sends the result to the service provider;

[0027] The intelligent road test equipment and the service provider locally add the obtained share of the addition sharing vector to their own MAC share to obtain the corresponding share of the road distance between the passenger and the available driver.

[0028] Optionally, the process of calculating the distance calculation check value includes:

[0029] Calculate the dot product of the road distance share and the random public number to obtain the total number of drivers and passengers. The dot product of the road distance vector on the ring is used to obtain the road distance share of each driver and passenger. The share value of the road distance vector on the ring is used to calculate the distance between each passenger and driver based on the share value and the random public number. The service provider and the intelligent road test equipment share the share of each passenger and driver based on the random sharing value. The service provider and the intelligent road test device calculate the scalar product of the MAC vectors of the road distances of all passengers and drivers in the system, and encrypt the share value of the scalar product of the road distances of all passengers and drivers based on the received share value, MAC share, its own private key, the scalar product of the MAC vectors of the road distances of all passengers and drivers, and the scalar product of the MAC vectors of all drivers and passengers. The distance calculation check value is obtained by calculating the dot product of the road distance vectors on the ring.

[0030] Optionally, the passenger side sums the distance calculation check values ​​of both parties to determine whether it is 0. If it is 0, the road distance calculated by the service provider and the intelligent road test equipment is correct; the passenger side determines whether the shortest road distance processed by the commitment function and the random arrangement index sent by the service provider and the intelligent road test equipment are the same. If they are the same, the order is reasonable.

[0031] Compared with the prior art, the present invention has the following advantages and technical effects:

[0032] The present invention uses road network embedding technology to represent the locations of passengers and drivers with high-dimensional vectors, thereby realizing accurate distance calculation between users in the road network. By adopting secret sharing instead of cumbersome encrypted upload of locations, the computational burden on the user side is reduced. At the same time, the computational complexity of distance calculation on the server of the online car-hailing provider is reduced. The verifiable two-party computing technology enables passengers to verify the correctness of road distance calculation and matching results at a fixed communication cost, that is, to ensure that the driver matched to the passenger by the ride system is the best. The present invention is the first solution to support passengers in verifying whether the dispatch is reasonable, solving the problem of opacity in traditional ride matching. BRIEF DESCRIPTION OF THE DRAWINGS

[0033] The drawings constituting a part of the present application are used to provide a further understanding of the present application. The illustrative embodiments and descriptions of the present application are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings:

[0034] Figure 1 A schematic diagram of the system structure of an embodiment of the present invention;

[0035] Figure 2 The figure is a complete flow chart of the riding system according to an embodiment of the present invention. DETAILED DESCRIPTION

[0036] It should be noted that, in the absence of conflict, the embodiments and features in the embodiments of the present application can be combined with each other. The present application will be described in detail below with reference to the accompanying drawings and in combination with the embodiments.

[0037] It should be noted that the steps shown in the flowcharts of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and that, although a logical order is shown in the flowcharts, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0038] Embodiment 1

[0039] like Figure 1 As shown, the key roles and components included in this embodiment are as follows:

[0040] Service Provider (ORH): performs online ride matching upon receiving ride request / response from passenger / driver and selects the nearest driver to provide service to the passenger;

[0041] Smart Road Test Unit (RSU): It is an edge node deployed by the vehicle management agency and is equipped with sufficient computing and communication capabilities. It receives real-time ride requests / responses from passengers / drivers in its coverage area and collaborates with the online car-hailing provider's server to perform ride matching calculations. In addition, it can communicate with each other and is responsible for generating road networks and dividing areas. Smart road test units and service providers do not interfere with each other.

[0042] Passenger: uploads its currently processed location information to the local RSU and ORH server to request nearby available cars, that is, to issue a ride request. The passenger can also verify whether the final matching result and the calculated ride distance are correct to decide whether to continue or give up the ride process.

[0043] Driver: Waiting for the local RSU to issue a ride request, that is, waiting for the dispatch. If there is a ride request, the driver will upload the processed location information, that is, the ride response, to the local RSU and ORH server. The driver also regularly updates the ORH server and local RSU about his current location.

[0044] The meanings of the letters and formulas in this embodiment are as follows:

[0045] : Embedding space of road networks;

[0046] : The word length of the data to be operated;

[0047] : Security parameters;

[0048] :It means the model The integer ring of ; used to limit the parameter range;

[0049] :express Model The numbers on the integer ring of ;

[0050] : the dimension of the vector;

[0051] : Indicates the driver, Indicates Available drivers;

[0052] : The number of available drivers;

[0053] : Randomly permute the index ;

[0054] : The i-th region, each region is controlled by one RSU, and the number of regions is determined by the management agency;

[0055] : The area where the passenger is located;

[0056] : No. Areas where available drivers are located;

[0057] : Two computationally secure and deterministic output pseudo-random generators;

[0058] : random seed for the passenger's pseudo-random generator;

[0059] : No. The random seed for the pseudo-random generator of available drivers;

[0060] : Algorithm for generating random seeds;

[0061] : Input seed output dimensional random vector;

[0062] : Input seed output dimensional random vector;

[0063] The same goes for drivers; , ;

[0064] : Indicates the current passenger's boarding position;

[0065] :Indicates the available driver locations;

[0066] : Road network embedding technology can convert two-dimensional position coordinates into high-dimensional ones. This technology can be completed efficiently by users; output embedding space vector representation;

[0067] : The passenger's current boarding location dimensional embedding space vector (simply understood as the representation of the passenger's position);

[0068] : No. Available drivers at current location dimensional embedding space vector;

[0069] :Indicates the To simplify the description, we use Represents the ORH server, Indicates nearby RSU;

[0070] : A verified random shared value, Indicates Participants have a share of It does not know the value of ; Indicates The private key of each participant. Similarly, it represents the i-th participant . , called The i-th MAC share of It is called The i-th MAC share of , the true value can be restored by adding up the shares of each participant.

[0071] : Verified random sharing dimensional vector, which is used to mask the privacy data later. Vector Some participants know it, but other participants do not.

[0072] : The coin tossing function generates a random public number, which requires at least two parties to complete. is a vector consisting of t composition.

[0073] : Commitment function, which can prevent participants from denying their commitment.

[0074] like Figure 2 As shown, this embodiment provides a privacy-preserving online car-hailing service method based on secure multi-party computing, including:

[0075] The passenger terminal encrypts the passenger location and sends it to the intelligent road test equipment and service provider;

[0076] The intelligent road test device broadcasts the encrypted passenger location to each available driver in the coverage area and sends different random permutation indexes. After receiving the information, the driver encrypts the vehicle location and sends it to the intelligent road test device and service provider.

[0077] The intelligent road test device and the service provider obtain the road distance share corresponding to the intelligent road test device and the service provider based on the encrypted information of the passenger position and the vehicle position, combined with the random sharing vector and the MAC share of each party;

[0078] The intelligent road test device and the service provider respectively calculate a distance calculation check value based on the road distance share, the random public number, and the MAC share; the intelligent road test device and the service provider respectively obtain the shortest road distance between the available driver and the passenger and the random arrangement index of the corresponding driver, and transmit them together with the distance calculation check value to the passenger terminal;

[0079] The passenger side determines whether the dispatch is reasonable based on the distance calculation check value, the shortest road distance processed by the commitment function, and the random arrangement index of the corresponding driver side.

[0080] The method further includes initializing the vehicle system before running. In some specific embodiments, the process includes:

[0081] The service provider sets the embedding space of the road network, the word length of the data to be operated, the security parameter, the first output pseudo-random generator, the second output pseudo-random generator, and the random seed generation algorithm;

[0082] Divide the area according to the coverage of the intelligent drive test equipment;

[0083] The intelligent drive test device and the service provider agree on the random shared vector, the random public number, and the random shared value based on the number of operations.

[0084] Specifically, during the system initialization phase, the ORH server is responsible for generating , RSUs are responsible for generating In addition, both parties need to work together to generate the required number of This stage can be completed in an offline phase, such as a time period when there are few taxis.

[0085] The following steps must be completed online.

[0086] In some specific embodiments,

[0087] The process of encrypting the location between the passenger and driver includes:

[0088] Based on the self-position and road network embedding technology, the corresponding embedded space vector representations are obtained respectively; based on the random seed generation algorithm, the passenger random seed and the driver random seed are generated, and two random vectors are generated based on the passenger random seed and the driver random seed respectively; the passenger side and the driver side encrypt the corresponding embedded space vector representations through the two random vectors, and obtain the ride request and ride response in turn.

[0089] The area where the vehicle is located is determined according to the location of the vehicle, and the corresponding intelligent road test device is found according to the area where the vehicle is located. The boarding request and the boarding response are sent to the intelligent road test device, and the passenger random seed and the driver random seed are sent to the service provider.

[0090] Specifically, in order to hail a nearby car, passengers need to upload their location using secret sharing technology. As a ride request, she / he first determines the area where she / he is located. ,turn up . Then use Generate seeds and calculate random vectors These vectors are used to mask , generating a ride request , another ride request is a random seed ,in, Send to , Send to This is done to reduce passenger communication. This can be done in the offline phase to reduce the computation time in the online phase. Finally, the passenger will and Send to and . Here the location upload is completed and the passenger's location privacy is protected ( and cannot collude), because of Available calculation .

[0091] Specifically, after receiving a passenger's ride request, The ride demand instructions will be broadcast to its coverage area Each available driver in the Available drivers who receive the broadcast also need to upload their own locations using secret sharing technology. Consistent with the process of generating a ride request, two ride responses are generated. and , and send it to and .

[0092] In some specific embodiments, the service provider calculates the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver respectively based on the random seed corresponding to the passenger side and the random seed corresponding to the driver side.

[0093] In some specific embodiments, the process of obtaining the road distance share includes: the service provider obtains an additive sharing vector based on the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver, processes the additive sharing vector using the random sharing vector as a mask, and sends it to the intelligent road test device; the intelligent road test device subtracts the ride request from the passenger response, uses the random sharing vector for mask processing, and sends it to the service provider; the intelligent road test device and the service provider respectively locally add the obtained share of the additive sharing vector to their own MAC share to obtain the corresponding road distance share between the passenger and the available driver.

[0094] Specifically, in the ride matching calculation stage, and Execute the protocol shown in the figure below. First, during initialization, Efficient calculation and Then, to be able to safely calculate the road distance between passengers and available drivers and facilitate the next phase of implementation, and Need to generate a verified addition shared vector Specifically, in the input stage, for , Use its verified random shared vector as a mask and compute Then send to . that is At the same time, Compute locally (MAC share). Here we get In the addition stage, using the , both parties only need to add their shares to the MAC share in their respective local areas to obtain the road distance between the passenger and the available driver. For ease of description, we use To express In the output phase, both parties share all the road distances between passengers and available drivers. Send to the other party and get . This one belongs to The vector on the ring, The purpose is to remove the high-order s bits to improve security and prevent the high-order values ​​from being leaked. Calculation is for safety, but the end result is This ring, that is, The implementation process is as follows:

[0095] initialization: The operation is as follows:

[0096] 1. Calculation ;

[0097] 2. Calculation ;

[0098] enter: For sharing :

[0099] 1. send Give , in There is no reuse of masks;

[0100] 2. Compute locally ;

[0101] Addition: To safely calculate the road distance between a passenger and an available driver, both parties need to have local:

[0102] 1. ;

[0103] 2. ;

[0104] Output: Output matching calculation results:

[0105] 1. For i∈{1,2}, For each Send Vector Give ;

[0106] 2. For i∈{1,2}, calculate .

[0107] In some specific embodiments, the process of calculating the distance calculation check value includes:

[0108] Calculate the dot product of the road distance share and the random public number to obtain the total number of drivers and passengers. The dot product of the road distance vector on the ring; based on the road distance share, the The share value of the road distance vector on the ring is used to calculate the distance between each passenger and driver based on the share value and the random public number. The service provider and the intelligent road test equipment share the share of each passenger and driver based on the random sharing value. The service provider and the intelligent road test device calculate the scalar product of the MAC vectors of the road distances of all passengers and drivers in the system, and encrypt the share value of the scalar product of the road distances of all passengers and drivers based on the received share value, MAC share, its own private key, the scalar product of the MAC vectors of the road distances of all passengers and drivers, and the scalar product of the MAC vectors of all drivers and passengers. The distance calculation check value is obtained by calculating the dot product of the road distance vectors on the ring.

[0109] In some specific embodiments, the passenger end sums the distance calculation check values ​​of both parties to determine whether it is 0. If it is 0, the road distance calculated by the service provider and the intelligent road test device is correct; the passenger end determines whether the shortest road distance processed by the commitment function and the random arrangement index sent by the service provider and the intelligent road test device are the same. If they are the same, the dispatch is reasonable.

[0110] Specifically, we enter the verification phase. and Execute the protocol shown in the figure below to generate and provide data to passengers to verify the correctness of road distance calculation and matching results. Corresponding , calculate their dot product get , Indicates The first vector A random number, For all drivers and passengers in the system The dot product of the road distance vectors on the ring is compressed into a single number to reduce the cost of subsequent communication. , For the Driver and passenger The i-th share of the road distance vector on the ring), , For all passengers and drivers in the system The i-th share of the product of the distances between roads on the ring, , add here It is to cover up Prevent information leakage and Send to the other party. At this point, both parties can get Next, both parties need to calculate locally and , and Make a commitment. express The i-th MAC share at the j-th position in the vector. represents the scalar product of the MAC vectors of the road distances of all passengers and drivers in the system, It is the distance calculation check value used to ensure the correctness of the calculated data. The use of commitment can prevent the participants from denying. , both parties select the available driver with the shortest road distance to the passenger and the random index of the driver . Also committed to it .let , Check the value for the order. Finally, both parties will Sent to passenger. Passenger verification Is it 0? If it is 0, it means and The calculated road distance is correct. Verify Can prevent Send drivers who are farther away to serve passengers. The implementation process is as follows:

[0111] Input: verified random shared value , , where i∈{1,2};

[0112] Output:

[0113] 1. Both parties calculate locally ;

[0114] 2. calculate and ,Then send Give ;

[0115] 3. Calculation by both parties ;

[0116] 4. calculate and ,Then right Make a commitment ;

[0117] 5. According to , Both parties locally select the road distance of the nearest driver and the random index corresponding to the driver , and commit to it ,let ;

[0118] 6. send to the passenger, who then verifies the equation and .

[0119] The present invention can simultaneously meet the five criteria of location privacy protection, high matching accuracy, high computing efficiency, computing correctness and matching result verification by combining road network embedding technology, improved secret sharing and secure two-party computing. The present invention can well reduce the computing burden of users and the burden of ORH servers, and can prevent some malicious behaviors of ORH servers.

[0120] The above are only preferred specific implementations of the present application, but the protection scope of the present application is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present application should be included in the protection scope of the present application. Therefore, the protection scope of the present application should be based on the protection scope of the claims.

Claims

1. A privacy-preserving online car-hailing service method based on secure multi-party computing, characterized in that: The following steps are involved: The passenger terminal encrypts the passenger location and sends it to the intelligent road test equipment and service provider; After receiving the passenger's location, the intelligent road test device broadcasts the ride request instruction to each available driver in the coverage area and sends different random permutation indexes. After receiving the information, the driver encrypts the vehicle location and sends it to the intelligent road test device and service provider; The intelligent road test device and the service provider obtain the road distance share corresponding to the intelligent road test device and the service provider based on the encrypted information of the passenger position and the vehicle position, combined with the random sharing vector and the MAC share of each party; The intelligent road test device and the service provider respectively calculate a distance calculation check value based on the road distance share, the random public number, and the MAC share; the intelligent road test device and the service provider respectively obtain the shortest road distance between the available driver and the passenger and the random arrangement index of the corresponding driver, and transmit them together with the distance calculation check value to the passenger terminal; The passenger side determines whether the dispatch is reasonable based on the distance calculation check value, the shortest road distance processed by the commitment function, and the random arrangement index of the corresponding driver side.

2. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 1 is characterized in that: The method also includes initializing the vehicle system before running, and the process includes: The service provider sets the embedding space of the road network, the word length of the data to be operated, the security parameter, the first output pseudo-random generator, the second output pseudo-random generator, and the random seed generation algorithm; Divide the area according to the coverage of the intelligent drive test equipment; The intelligent drive test device and the service provider agree on the random shared vector, the random public number, and the random shared value based on the number of operations.

3. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 1 is characterized in that: The process of encrypting the location between the passenger and driver includes: Based on the self-position and road network embedding technology, the corresponding embedded space vector representations are obtained respectively; based on the random seed generation algorithm, the passenger random seed and the driver random seed are generated, and two random vectors are generated based on the passenger random seed and the driver random seed respectively; the passenger side and the driver side encrypt the corresponding embedded space vector representations through the two random vectors, and obtain the ride request and ride response in turn.

4. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 3 is characterized in that: The area where the vehicle is located is determined according to the location of the vehicle, and the corresponding intelligent road test device is found according to the area where the vehicle is located. The boarding request and the boarding response are sent to the intelligent road test device, and the passenger random seed and the driver random seed are sent to the service provider.

5. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 1 is characterized in that: The service provider calculates the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver respectively based on the random seed corresponding to the passenger side and the random seed corresponding to the driver side.

6. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 5 is characterized in that: The process of obtaining road distance share includes: The service provider obtains an additive shared vector based on the high-dimensional position vector representation of the passenger and the high-dimensional position vector representation of the driver, processes the additive shared vector using the random shared vector as a mask, and sends the processed vector to the intelligent road test device; The intelligent drive test device performs masking processing using the random shared vector after subtracting the ride request from the passenger response, and sends the result to the service provider; The intelligent road test equipment and the service provider locally add the obtained share of the addition sharing vector to their own MAC share to obtain the corresponding share of the road distance between the passenger and the available driver.

7. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 1 is characterized in that: The process of calculating the distance calculation check value includes: Calculate the dot product of the road distance share and the random public number to obtain the total number of drivers and passengers. The dot product of the road distance vector on the ring is used to obtain the road distance share of each driver and passenger. The share value of the road distance vector on the ring is used to calculate the distance between each passenger and driver based on the share value and the random public number. The service provider and the intelligent road test equipment share the share of each passenger and driver based on the random sharing value. The service provider and the intelligent road test device calculate the scalar product of the MAC vectors of the road distances of all passengers and drivers in the system, and encrypt the share value of the scalar product of the road distances of all passengers and drivers based on the received share value, MAC share, its own private key, the scalar product of the MAC vectors of the road distances of all passengers and drivers, and the scalar product of the MAC vectors of all drivers and passengers. The distance calculation check value is obtained by calculating the dot product of the road distance vectors on the ring.

8. The privacy-preserving online car-hailing service method based on secure multi-party computing according to claim 7 is characterized in that: The passenger end sums the distance calculation check values ​​of both parties to determine whether it is 0. If it is 0, the road distance calculated by the service provider and the intelligent road test equipment is correct; The passenger side determines whether the shortest road distance processed by the commitment function and the random arrangement index sent by the service provider and the intelligent road test device are the same. If they are the same, the dispatch is reasonable.

Images