CN114866294B - Network vehicle-closing communication method of cloud supervision - Google Patents
Network vehicle-closing communication method of cloud supervision Download PDFInfo
- Publication number
- CN114866294B CN114866294B CN202210416095.XA CN202210416095A CN114866294B CN 114866294 B CN114866294 B CN 114866294B CN 202210416095 A CN202210416095 A CN 202210416095A CN 114866294 B CN114866294 B CN 114866294B
- Authority
- CN
- China
- Prior art keywords
- passenger
- service provider
- driver
- aid
- cloud
- 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
Links
Classifications
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0407—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the identity of one or more communicating identities is hidden
- H04L63/0421—Anonymous communication, i.e. the party's identifiers are hidden from the other party or parties, e.g. using an anonymizer
-
- G—PHYSICS
- G07—CHECKING-DEVICES
- G07B—TICKET-ISSUING APPARATUS; FARE-REGISTERING APPARATUS; FRANKING APPARATUS
- G07B13/00—Taximeters
-
- 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/04—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks
- H04L63/0428—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload
- H04L63/0435—Network architectures or network communication protocols for network security for providing a confidential data exchange among entities communicating through data packet networks wherein the data content is protected, e.g. by encrypting or encapsulating the payload wherein the sending and receiving network entities apply symmetric encryption, i.e. same key used for encryption and decryption
-
- 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/083—Network architectures or network communication protocols for network security for authentication of entities using passwords
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/26—Special purpose or proprietary protocols or architectures
-
- 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/3247—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 digital signatures
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computing Systems (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Traffic Control Systems (AREA)
Abstract
本发明公开了一种具有云监管的网约车协议，该协议包括：初始化阶段，监管云构建并发布相关安全参数；注册阶段，用于司机、乘客以及服务提供商完成进入系统前的身份验证；路网嵌入阶段，服务商在该阶段对路网进行初始化设置；匹配阶段，在该阶段实现司机与乘客的隐私保护性匹配；收费阶段，乘客为自己所使用的服务付费。本发明利用Paillier同态加密以及路网嵌入算法实现了具有云监管的网约车匹配，协议中的服务提供商能在不获取司机和乘客信息的前提下完成匹配计算，从而有效保护了司机和乘客的隐私安全。
The invention discloses an online car-hailing protocol with cloud supervision. The protocol includes: an initialization stage, where the supervision cloud builds and releases relevant security parameters; and a registration stage, where drivers, passengers and service providers complete identity verification before entering the system. ; The road network embedding stage, where the service provider initializes the road network; the matching stage, where the privacy-protective matching of drivers and passengers is achieved; the charging stage, where passengers pay for the services they use. The present invention uses Paillier homomorphic encryption and road network embedding algorithm to realize online car-hailing matching with cloud supervision. The service provider in the agreement can complete the matching calculation without obtaining the information of the driver and passengers, thereby effectively protecting the driver and passengers. Passenger privacy and security.
Description
Technical Field
The invention relates to the field of intelligent transportation, in particular to a network appointment vehicle protocol with cloud supervision.
Background
The net car is an emerging trip mode, and the application of the net car provides convenience for work and life of people. However, in many network taxi applications at present, a service provider grasps a large amount of information of a user, including identity information of a driver and a passenger, travel route information of the passenger, and the like, which poses a great threat to privacy security of the user. Therefore, it is necessary to design a network taxi-contract protocol with supervision Fang Yun to separate information storage from matching calculation, and the trusted supervision keeps the identity information of the user, so that the service provider is only responsible for matching calculation. In addition, privacy in the matching process of a driver and a passenger is required to be enhanced, and travel data of the passenger is required to be protected.
Disclosure of Invention
The invention aims to provide a network bus agreement with cloud supervision, which can protect identity information of drivers and passengers and travel data of the passengers while meeting travel demands of people, and realize privacy protection of the drivers and the passengers.
In the system designed by the invention, the safety of the system and the information storage of the user are responsible by the supervision cloud, and the matching calculation of the driver and the passengers is born by the service provider.
After the supervision cloud completes the system initialization setting, the service provider, the driver and the passenger need to use real identity registration at the supervision cloud, so that a public and private key pair is obtained, in addition, the supervision cloud negotiates a symmetric key with the passenger for encrypting the communication content, and then the service provider performs road network embedding setting. In the early stage of matching, the driver needs to periodically query its own position coordinates and calculate its own high-dimensional distance vector, and then encrypt the calculated vector and send it to the service provider along with the information of the area where the driver is located, and the service provider stores the information.
When a passenger needs to take a car, the passenger needs to calculate and encrypt a high-dimensional distance vector according to own getting-on and getting-off places, and sends the located area information to a service provider. After receiving the request of the passengers, the service provider matches the vehicles according to the areas, then homomorphism calculation is carried out on the high-dimensional distance vector of each driver and the high-dimensional distance vector of the boarding place of the passengers, and the result is sent to the supervision cloud for decryption after calculation is completed. The supervisory cloud obtains the appropriate vehicles from the decrypted results and returns information to the passengers through the service provider for confirmation, and after the passenger confirms, the selected vehicles are returned, and the boarding and alighting places are encrypted by using the secret key negotiated with the driver. The service provider sends the encrypted boarding and alighting places to the corresponding drivers according to the confirmation information, the drivers decrypt the boarding and alighting places of the passengers and calculate high-dimensional distance vectors according to the boarding and alighting places, after the passengers get on the bus, the drivers send the calculated high-dimensional distance vectors and verification codes informed by the passengers to the service provider, the service provider sends results to the supervision cloud after homomorphic calculation, the supervision cloud verifies and charges the passengers, and the service flow of the network bus is completed.
The achievement of the object of the invention is that an inventive charging phase is provided in the protocol, said charging phase comprising the steps of:
(1) Monitoring cloud operationDecrypting and unpacking the result and then according to +.>Selecting a suitable driver;
(2) The supervisory cloud obtains the corresponding information of the selected driver according to the pseudonym, then selects an authentication code for the passenger, and encrypts the information using a key negotiated with the passenger, [ info ] d ,code] sym ＝E sym ((info d ,code),k r ) Then { AID d ,AID r ,[info d ,code] sym Send { AID } to service provider, and then the service provider sends { AID }, which is then used to send { AID }, to the service provider d ,A d ,[info d ,code] sym Transmitting the information to a passenger client for confirmation;
(3) Passenger client pass through run D sym ([info d ,code] sym ,k r ) After decrypting the information for the passenger, if the passenger confirms the riding, the passenger client estimates the price according to the journey of the passenger, and encrypts the getting-on and getting-off information and the estimated price respectively, [ l ] r ] sym ＝E sym ((l r ),H 4 (b r A d ) (wherein)Randomly generated by passenger clients, after which B is calculated r ＝b r P)，E pa (cost r ,pk pa ) Last passenger client pair m' r ＝{AID r ,AID d ,[l r ] sym ,[cost r ],B r Signature and send { m' r ,φ r ',t' r -providing the service provider;
(4) Service provider save [ cost ] r ]Will { [ l ] r ] sym ,B r Transmit to AID d Corresponding driver client, driver client run (l r )＝D sym ([l r ] sym ,a d B r ) Decrypting the information of getting on or off the passenger for the driver, and then calculatingEncrypted high-dimensional distance vector of getting-on and getting-off positions of passengersThe driver client then evaluates the passenger's journey and encrypts the estimated price [ cost ]' r ]＝E pa (cost' r ,pk pa ) Driver client sends->To service provider->Homomorphic calculation is carried out and submitted to a supervision cloud to verify whether the getting-on and getting-off places of the two parties are corresponding and whether the valuation exceeds the error, and if the places are wrong or the valuation exceeds the error, the two parties are informed to cancel the order; after waiting for the passenger to get on, the driver informs the verification code of the code, encrypts the code through the client of the driver, [ code ]']＝E pa (code',pk pa ) And for m' d ＝{AID d ,[code']Signed and then send the message { m' d ,φ' d ,t' d -forwarding to a service provider, the service provider to a supervisory cloud;
(5) Supervisory cloud decryption [ code ]']Judging and storing [ code ]]Whether equal. When the passenger arrives at the destination, the driver calculates the encrypted high-dimensional distance vector again according to the coordinates of the current passenger getting-off placeAnd transmitting to a service provider the encrypted high-dimensional distance vector of the departure place coordinates transmitted when matching with the passenger>Homomorphic calculation is carried out, then the service provider gives the calculation result to the supervision cloud for decryption and verification, and if the calculation result passes, the passenger is charged.
The invention also provides a preferred registration phase comprising the steps of:
(1) Service provider registration:
the service provider will be true identity information RID sp Is sent to a supervision cloud, which stores information and runs PartialKeyGen (params, s, RID) i )→(AID i ,T i ,D i ) Generating pseudonym AID for service provider sp Kana validity period T sp Partial public and private key D sp ＝(d sp ,R sp ) The method comprises the steps of carrying out a first treatment on the surface of the The supervisory cloud then transmits (AID) over the secure channel sp ,T sp ,D sp ) Is sent to the service provider who rerun userkegen (params, D) i ,AID i )→(sk i ,pk i ) Generating a complete public-private key pair (pk sp ,sk sp )。
(2) Driver registration:
the driver will be true identity information and vehicle information info d Is sent to the supervision cloud, thereby obtaining the pseudonym and part of public and private keys generated by the supervision cloud for the driver, and the driver receives (AID d ,T d ,D d ) After which a complete public-private key pair (pk) is generated d ,sk d )。
(3) Passenger registration:
the passenger will be true identity information and vehicle information info r Transmitting to the supervision cloud to obtain the pseudonym, partial public and private keys and symmetric encryption key k generated by the supervision cloud for the passengers r The supervisory cloud will (AID r ,T r ,D r ,k r ) Is sent to the passenger, and the passenger generates a complete public and private key pair (pk r ,sk r )。
Drawings
FIG. 1 is a schematic diagram of a system model of the present invention;
FIG. 2 is a system initialization flow chart of the present invention;
FIG. 3 is a flow chart of driver and passenger matching in the present invention;
fig. 4 is a passenger payment flow chart in the present invention.
Detailed Description
Further details of the implementation of the present invention are provided below.
Functional function description:
this section describes the functional functions used in the system, which are mainly divided into 4 aspects: paillier encryption, signature verification (ECC), road network embedding, and matching computation.
Paillier encryption:
(1)KeyGen pa (1 λ )→(pk,sk)：
description of the function: and inputting the security parameters, and generating public and private key pairs by the running function.
Description of the shape parameters:
| 1 λ | security parameters. |
Return value description:
| pk | a public key. |
| sk | A private key. |
Description of algorithm:
(a) Two primes p, q are chosen and n=p×q, λ=lcm (p-1, q-1) is calculated.
(b) Random selectionMeet gcd (L #)g λ modN 2 ) N) =1, where L (x) = (x-1)/N.
(c) A public key pk= (N, g) is generated, and a private key sk=λ.
(2)E pa (m,pk)→c：
Description of the function: the plaintext and the public key are input, and the running function returns the ciphertext.
Description of the shape parameters:
| m | the message is in plain text. |
| pk | Slightly omitted |
Return value description:
| c | encrypted ciphertext. |
Description of algorithm:
a) Let m.epsilon.Z N Randomly select
b) Calculating ciphertext
(3)D pa (c,sk)→m：
Description of the function:
and inputting the ciphertext and the private key, and returning the decrypted plaintext by the running function.
Description of the shape parameters:
| c | slightly omitted |
| sk | Slightly omitted |
Return value description:
| m | slightly omitted |
Description of algorithm:
calculation of
2. Signature verification (ECC):
(1)MasterKeyGen(1 λ )→(params,s)：
description of the function:
and inputting security parameters, performing security initialization setting on the system by the running function, and returning the public parameters and the main private key of the system by the running function.
Description of the shape parameters:
| 1 λ | security parameters. |
Return value description:
(2)PartialKeyGen(params,s,RID i )→(AID i ,T i ,D i )：
description of the function:
the public parameters, the system master key and the true identity of the driver or passenger are entered and the running function returns the pseudonym, the validity period of the pseudonym and part of the private key.
Description of the shape parameters:
| params | slightly omitted |
| s | Slightly omitted |
| RID i | True identity information of the driver or passenger. |
Return value description:
(3)UserKeyGen(params,D i ,AID i )→(sk i ,pk i )：
description of the function:
and inputting public parameters, partial private keys and pseudonyms, and returning the complete public and private key pairs by the running function.
Description of the shape parameters:
| params | slightly omitted |
| D i | Slightly omitted |
| AID i | Slightly omitted |
Return value description:
(4)Sign(params,sk i ,m i ||t i )→(φ i )：
description of the function:
the public parameters, private key, message to be sent, and timestamp are entered, and then the run function returns a signature of the message.
Description of the shape parameters:
| params | slightly omitted |
| sk i | Slightly omitted |
| m i ||t i | A message that needs to be sent and a timestamp. |
Return value description:
| φ i | signature of the message. Phi (phi) i ＝(Y i ,w i )。 |
Description of algorithm:
(a) Random selectionAnd calculate Y i ＝y i P。
(b) Calculation u i ＝H 2 (m i ,AID i ,pk i ,t i ,Y i ) And h 3i ＝H 3 (m i ,AID i ,pk i ,t i )。
(c) Then calculate w i ＝[u i y i +h 3i (x i +d i )]modq。
(d) Most preferably, the first to fourthPost output phi i ＝(Y i ,w i ) As a signature for messages and timestamps.
(5)Verify(φ i ,m i ||t i ,pk i ,AID i )→(true or false)：
Description of the function:
the received message is input and the running function verifies the validity of the signature.
Description of the shape parameters:
| φ i | slightly omitted |
| m i ||t i | Slightly omitted |
| pk i | Slightly omitted |
| AID i | Slightly omitted |
Return value description:
description of algorithm:
(a) Calculate h 1i ＝H 1 (AID i ,R i ,P pub )、u i ＝H 2 (m i ,AID i ,pk i ,t i ,Y i ) H 3i ＝H 3 (m i ,AID i ,pk i ,t i )。
(b) Judging w i P-u i Y i ＝h 3i (X i +R i +h 1i P pub ) Whether or not it is.
3. Road network embedding:
(1)GenDimensionalSet(n,V,E)→(R)：
description of the function:
and inputting the size n of the intersection and road end set V and the road section set E, and returning the running function to the high-dimensional embedded network space.
Description of the shape parameters:
| n | the size of set V. |
| V | Intersection and collection of road segments. |
| E | And connecting the road section collection of two intersections (ends) in V. |
Return value description:
(2)GenEembedRoadNet(V,R)→(S)：
description of the function:
the method comprises the steps of inputting a set of intersections (ends) and embedding the high-dimension into a network space, and returning a high-dimension distance vector of each intersection (end) in the set V by an operation function.
Description of the shape parameters:
| V | slightly omitted |
| R | Slightly omitted |
Return value description:
| S | the high-dimensional distance vectors for each intersection (end) in set V. |
Description of algorithm:
(a) For V ε V, V i,j E R, V to V i,j Is defined as
(b)s v ∈S，s v ＝<dist R (v,V 1,1 ),...,dist R (v,V i,j ),...,dist R (v,V α,β )>，S＝{s v |v∈V}。
4. Matching calculation:
(1)GenEncryptedsl(l,S,pk)→([s l ])：
description of the shape parameters:
| l | and (5) position coordinates. |
| S | Slightly omitted |
| pk | A public key for encryption. |
Return value description:
| [s l ] | encrypted s l 。 |
Description of algorithm:
(a) Inputting a position coordinate l, if l is V, s l ＝s v (l=v); if it isl belongs to road section (v) s ,v d ) E a point on E, then calculate s l 。
s l ＝<...,dist R (l,V i,j )＝min{dist R (l,v s )+dist R (v s ,V i,j ),dist R (l,v d )
+dist R (v d ,V i,j )},...>。
(b) Encryption s l Is [ s ] l ]，[s l ]＝E pa (dist R (l,V i,j ),pk)。
(2)
Description of the function:
inputting encryption s of multiple drivers and one passenger l And the number of bits occupied by the distance value, the function will calculate and return a set of distance vectors between each driver and passenger based on the homomorphism of the Paillier encryption system.
Description of the shape parameters:
return value description:
description of algorithm:
wherein 2 is μ So that the distance calculation value is a positive number.
(3)
Description of the function:
and inputting the distance vector set, the bit length of the system parameter N and the bit number occupied by the distance value, and returning the packed ciphertext by the running function.
Description of the shape parameters:
return value description:
description of algorithm:
(a) Calculate the cipher text number p=nbitlen/μ that a slot can pack.
(b) From the slaveSelecting tau (tau is more than or equal to 0 and less than or equal to rho) ciphertext and packaging by the following method:
(c) Final output of function and packing result
(4)
Description of the function:
and inputting the packed ciphertext set and the number of the ciphertext packed in one slot, and returning the plaintext of the unpacked distance value by the running function.
Description of the shape parameters:
return value description:
description of algorithm:
(a) DecryptionAnd obtaining the packed distance value.
(b) According toUnpacking the distance value to obtain +.>
Second, detailed flow description:
the section introduces a network taxi-closing protocol of cloud supervision, and the introduction is divided into five stages according to the execution sequence of the protocol: (1) an initialization Phase (Setup Phase); (3) a registration phase (Registration Phase); (3) A road network embedding stage (Road Network Embedding Phase); (4) a matching stage (Ride Matching Phase); (5) charging Phase (Charge Phase).
(1) An initialization stage:
supervision cloud run MasterKeyGen (1) λ ) Generating public parameter params and system public-private key pair (pk pa ,sk pa ) The method comprises the steps of carrying out a first treatment on the surface of the The supervisory cloud then selects a symmetric encryption algorithm and uses E sym (m,k)→(c)，D sym (c, k) → (m) respectively represent symmetric encryption and decryption processes.
(2) Registration:
(a) Service provider registration:
the service provider will be true identity information RID sp Is sent to a supervision cloud, which stores information and runs PartialKeyGen (params, s, RID) i )→(AID i ,T i ,D i ) Generating pseudonym AID for service provider sp Kana validity period T sp Partial public and private key D sp ＝(d sp ,R sp ). The supervisory cloud then transmits (AID) over the secure channel sp ,T sp ,D sp ) Is sent to the service provider who rerun userkegen (params, D) i ,AID i )→(sk i ,pk i ) Generating a complete public-private key pair (pk sp ,sk sp )。
(b) Driver registration:
the driver will be true identity information and vehicle information info d Is sent to the supervision cloud, thereby obtaining the pseudonym and part of public and private keys generated by the supervision cloud for the driver, and the driver receives (AID d ,T d ,D d ) After which a complete public-private key pair (pk) is generated d ,sk d )。
(c) Passenger registration:
the passenger will be true identity information and vehicle information info r Transmitting to the supervision cloud to obtain the pseudonym, partial public and private keys and symmetric encryption key k generated by the supervision cloud for the passengers r The supervisory cloud will (AID r ,T r ,D r ,k r ) Is sent to the passenger, and the passenger generates a complete public and private key pair (pk r ,sk r )。
(3) Road network embedding stage:
the service provider converts the road network (V, E) into a distance vector set s= { S about V by running gendimension set (n, V, E) → (R) and geneembeddroadnet (V, R) → (S) v V e V; the service provider then divides the road network (V, E) into different sets of regions g= { z i } 1≤i≤n And publishes (S, G).
(4) Matching:
(a) The driver waiting for a match first acquires his own position coordinates l driver GenEncryptedsl (l, S, pk) was run → ([ S) l ]) Obtaining an encrypted high-dimensional distance vector of its own coordinates(use of pk) pa Encryption) and then select the area z where the user is currently located d E G, last driver random choice ∈G>Calculation A d ＝a d P. The driver periodically performs the above operation and constructs a message +.>Generating a time stamp t d Run Sign (params, sk) i ,m i ||t i )→(φ i ) Signature it and finally send { m } d ,φ d ,t d And to the service provider.
(b) Service providers operate by running Verify (phi) i ,m i ||t i ,pk i ,AID i ) The (true or false) verifies the information sent by the driver, if the message is correct, stores the update m d 。
(c) When a passenger needs to take a car, the passenger first selects the getting-on and getting-off position l of the passenger r ＝(l r_up ,l r_down ) GenEncryptedsl (l, S, pk) was run → ([ S) l ]) Encrypted high-dimensional distance vector for calculating on-off positions respectivelyThe passenger then selects the zone z in which the passenger is currently located r E G, and constructs a message ∈G>Generating a time stamp t r Run Sign (params, sk) i ,m i ||t i )→(φ i ) Generating signature, and finally sending bus taking matching request { m } to service provider r ,φ r ,t r }。
(d) The service provider checks the validity of the signature of the request sent by the passenger and if it passes, it is determined according to z r (z r ＝z d ) Extracting the corresponding driver transmission from the databaseAnd obtain the bit number mu occupied by the distance value, runInputting the passenger boarding position and the encrypted distance vector of the driverHomomorphism meterCalculating the distance vector +.>Last service provider store m r And run +.>And Verify (phi) i ,m i ||t i ,pk i ,AID i ) The → (true or false) pair +.>Carry out the package signature and then will ∈ ->And sending the information to the supervision cloud.
(5) Charging stage:
(a) Monitoring cloud operationDecrypting and unpacking the result and then according to +.>A suitable driver is selected.
(b) The supervisory cloud obtains the corresponding information of the selected driver according to the pseudonym, then selects an authentication code for the passenger, and encrypts the information using a key negotiated with the passenger, [ info ] d ,code] sym ＝E sym ((info d ,code),k r ) Then { AID d ,[info d ,code] sym Send { AID } to service provider, and then the service provider sends { AID }, which is then used to send { AID }, to the service provider d ,A d ,[info d ,code] sym And (c) sending the confirmation to the passenger.
(c) Passenger passing D sym ([info d ,code] sym ,k r ) After decrypting the information, if the riding is confirmed, the journey of the driver is estimated, the information of getting on or off the driver and the estimated price are encrypted, [ l ] r ] sym ＝E sym ((l r ),H 4 (b r A d ) (wherein)Randomly selected by the passenger, the passenger recalculates B r ＝b r P)，E pa (cost r ,pk pa ) And for m' r ＝{AID r ,AID d ,[l r ] sym ,[cost r ]Signed and then sent { m' r ,φ r ',t' r And to the service provider.
(d) The service provider will { [ l ] r ] sym ,B r Is sent to the driver, who decrypts the information (l r )＝D sym ([l r ] sym ,a d B r ) Estimating price and encrypting E pa (cost d ,pk pa ) Then respectively calculating the encrypted high-dimensional distance vectors of the getting-on and getting-off positions of the passengersSend->To service provider->And carrying out homomorphic calculation and delivering the homomorphic calculation to the supervision cloud to verify whether the getting-on and getting-off places of the two parties are corresponding and whether the valuation exceeds the error, and if the places are wrong or the valuation exceeds the error, informing the two parties to cancel the order. After waiting for the passenger to get on the bus and informing the verification code, the driver gives a corresponding m' d ＝{AID d ,[code]}([code]＝E pa (code,pk pa ) Signed and send message { m' d ,φ' d ,t' d And the information is sent to the service provider and then sent to the supervision cloud by the service provider. Supervision cloud decryption [ code ]]Judging whether the codes are equal to the stored codes, after the passenger arrives at the destination, calculating a distance vector according to the coordinates by the driver again, sending the distance vector to a service provider for homomorphic calculation, if the distance vector is matched with the stored codes, carrying out supervision cloud verification, and if the distance vector is matched with the stored codes, charging the passenger。
The invention has the technical characteristics and beneficial effects that:
the invention utilizes the addition homomorphism of the Paillier encryption algorithm to ensure that the service provider cannot know the calculated content when carrying out the matching calculation, thereby effectively protecting the privacy security of drivers and passengers. In addition, the protocol also uses a road network embedding technology to convert the road network into a high-dimensional space, and the shortest distance calculation of two points in the network can be converted into simple calculation supported by the existing encryption primitives.
Claims (1)
1. The network taxi communication method of cloud supervision comprises supervision cloud, service provider, client and network taxi protocol, and is characterized in that the charging stage in the network taxi protocol comprises the following steps:
(1) Supervision cloud runs DeAndUnpacking ({ [ s) ldistance ] packing },sk,τ)→({s ldistance -j) decrypting and unpacking the result, then according toSelecting a suitable driver;
(2) The supervisory cloud obtains the corresponding information of the selected driver according to the pseudonym, then selects an authentication code for the passenger, and encrypts the information using a key negotiated with the passenger, [ info ] d ,code] sym ＝E sym ((info d ,code),k r ) Then { AID d ,AID r ,[info d ,code] sym Send { AID } to service provider, and then the service provider sends { AID }, which is then used to send { AID }, to the service provider d ,A d ,[info d ,code] sym Transmitting the information to a passenger client for confirmation;
(3) Passenger client pass through run D sym ([info d ,code] sym ,k r ) After decrypting the information for the passenger, if the passenger confirms the riding, the passenger client estimates the price according to the journey of the passenger, and encrypts the getting-on and getting-off information and the estimated price respectively, [ l ] r ] sym ＝E sym ((l r ),H 4 (b r A d ) (wherein)Randomly generated by passenger clients, after which B is calculated r ＝b r P)，E pa (cost r ,pk pa ) Last passenger client pair m' r ＝{AID r ,AID d ,[l r ] sym ,[cost r ],B r Signature and send { m' r ,φ' r ,t' r -providing the service provider;
(4) Service provider save [ cost ] r ]Will { [ l ] r ] sym ,B r Transmit to AID d Corresponding driver client, driver client run (l r )＝D sym ([l r ] sym ,a d B r ) Decrypting the information of getting on and off the passengers for the driver, and then respectively calculating the encrypted high-dimensional distance vectors of the getting on and off positions of the passengersThe driver client then evaluates the passenger's journey and encrypts the estimated price [ cost ]' r ]＝E pa (cost' r ,pk pa ) Driver client sends->To service provider->Homomorphic calculation is carried out and submitted to a supervision cloud to verify whether the getting-on and getting-off places of the two parties are corresponding and whether the valuation exceeds the error, and if the places are wrong or the valuation exceeds the error, the two parties are informed to cancel the order; after waiting for the passenger to get on, the driver informs the verification code of the code, encrypts the code through the client of the driver, [ code ]']＝E pa (code',pk pa ) And for m' d ＝{AID d ,[code']Signed and then send the message { m' d ,φ' d ,t' d Service provider, serviceThe provider forwards the data to the supervision cloud;
(5) Supervisory cloud decryption [ code ]']Judging and storing [ code ]]Whether or not they are equal; when the passenger arrives at the destination, the driver calculates the encrypted high-dimensional distance vector again according to the coordinates of the current passenger getting-off placeAnd transmitting to a service provider the encrypted high-dimensional distance vector of the departure place coordinates transmitted when matching with the passenger>Homomorphic calculation is carried out, then the service provider delivers the calculation result to the supervision cloud for decryption and verification, and if the calculation result passes, the passenger is charged;
the registration stage in the network taxi appointment protocol comprises the following steps:
(1) Service provider registration:
the service provider will be true identity information RID sp Is sent to a supervision cloud, which stores information and runs PartialKeyGen (params, s, RID) i )→(AID i ,T i ,D i ) Generating pseudonym AID for service provider sp Kana validity period T sp Partial public and private key D sp ＝(d sp ,R sp ) The method comprises the steps of carrying out a first treatment on the surface of the The supervisory cloud then transmits (AID) over the secure channel sp ,T sp ,D sp ) Is sent to the service provider who rerun userkegen (params, D) i ,AID i )→(sk i ,pk i ) Generating a complete public-private key pair (pk sp ,sk sp )；
(2) Driver registration:
the driver will be true identity information and vehicle information info d Is sent to the supervision cloud, thereby obtaining the pseudonym and part of public and private keys generated by the supervision cloud for the driver, and the driver receives (AID d ,T d ,D d ) After which a complete public-private key pair (pk) is generated d ,sk d )；
(3) Passenger registration:
the passenger will trust the true identityInformation and vehicle information info r Transmitting to the supervision cloud to obtain the pseudonym, partial public and private keys and symmetric encryption key k generated by the supervision cloud for the passengers r The supervisory cloud will (AID r ,T r ,D r ,k r ) Is sent to the passenger, and the passenger generates a complete public and private key pair (pk r ,sk r )。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210416095.XA CN114866294B (en) | 2022-04-20 | 2022-04-20 | Network vehicle-closing communication method of cloud supervision |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210416095.XA CN114866294B (en) | 2022-04-20 | 2022-04-20 | Network vehicle-closing communication method of cloud supervision |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114866294A CN114866294A (en) | 2022-08-05 |
| CN114866294B true CN114866294B (en) | 2023-09-08 |
Family
ID=82632132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210416095.XA Active CN114866294B (en) | 2022-04-20 | 2022-04-20 | Network vehicle-closing communication method of cloud supervision |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114866294B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115550910B (en) * | 2022-10-04 | 2024-03-15 | 北京师范大学 | An online taxi-hailing method that protects users’ geographical location privacy |
| CN118803743B (en) * | 2024-09-12 | 2024-12-13 | 暨南大学 | Privacy protection network vehicle-booking service method based on secure multiparty calculation |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9697503B1 (en) * | 2011-04-22 | 2017-07-04 | Angel A. Penilla | Methods and systems for providing recommendations to vehicle users to handle alerts associated with the vehicle and a bidding market place for handling alerts/service of the vehicle |
| CN109345438A (en) * | 2018-10-11 | 2019-02-15 | 北京理工大学 | A privacy-protected alliance taxi-hailing method and system |
| CN113273146A (en) * | 2018-07-10 | 2021-08-17 | 力士塔有限公司 | Decentralized network security privacy network for cloud communication, computing and global e-commerce |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9818088B2 (en) * | 2011-04-22 | 2017-11-14 | Emerging Automotive, Llc | Vehicles and cloud systems for providing recommendations to vehicle users to handle alerts associated with the vehicle |
-
2022
- 2022-04-20 CN CN202210416095.XA patent/CN114866294B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9697503B1 (en) * | 2011-04-22 | 2017-07-04 | Angel A. Penilla | Methods and systems for providing recommendations to vehicle users to handle alerts associated with the vehicle and a bidding market place for handling alerts/service of the vehicle |
| CN113273146A (en) * | 2018-07-10 | 2021-08-17 | 力士塔有限公司 | Decentralized network security privacy network for cloud communication, computing and global e-commerce |
| CN109345438A (en) * | 2018-10-11 | 2019-02-15 | 北京理工大学 | A privacy-protected alliance taxi-hailing method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114866294A (en) | 2022-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Basudan et al. | A privacy-preserving vehicular crowdsensing-based road surface condition monitoring system using fog computing | |
| US6298153B1 (en) | Digital signature method and information communication system and apparatus using such method | |
| CN110166228B (en) | Privacy protection method based on certificate-free ring signcryption in vehicle-mounted self-organizing network | |
| CN109033862B (en) | A kind of distributed vehicle electronic system information security protection method | |
| CN109194523B (en) | Multi-party diagnostic model fusion method and system for privacy protection, cloud server | |
| CN114866294B (en) | Network vehicle-closing communication method of cloud supervision | |
| CN110365485A (en) | A user privacy protection scheme for car-hailing based on blockchain | |
| Baee et al. | ALI: Anonymous lightweight inter-vehicle broadcast authentication with encryption | |
| CN106452762A (en) | Identity-based high-efficiency data transmission method in vehicular ad hoc network | |
| CN107979840A (en) | A kind of the car networking V2I Verification Systems and method of Key-insulated safety | |
| CN104394000A (en) | Batched certification method based on pseudonym verification public key in vehicle-mounted network | |
| CN111212400B (en) | Anti-quantum computing internet-of-vehicle system based on secret sharing and mobile terminal and authentication method thereof | |
| CN108234445B (en) | Cloud establishment of privacy protection in vehicle cloud and data security transmission method | |
| CN105959117A (en) | Cuckoo filter-based vehicle-mounted ad hoc network security authentication method | |
| CN108933665B (en) | Approach of Lightweight V2I Group Communication Authentication Protocol in VANETs | |
| CN111159766A (en) | An online car-hailing service method, system and storage medium with privacy protection | |
| US11265161B2 (en) | System and method for computing an escrow session key and a private session key for encoding digital communications between two devices | |
| CN117714111A (en) | Network vehicle-appointment communication method and system based on cloud supervision | |
| CN112804646B (en) | Location service algorithm based on re-encryption and pseudonym exchange | |
| Yeh et al. | Secure IoT-based, incentive-aware emergency personnel dispatching scheme with weighted fine-grained access control | |
| KR20060078768A (en) | Key Recovery System Using Distributed Registration of User Private Key and Its Method | |
| CN119095031A (en) | A lightweight certificateless signature method based on blockchain in Internet of Vehicles | |
| Leaby et al. | Towards design strong emergency and COVID-19 authentication scheme in VANET | |
| Olakanmi et al. | A trust based secure and privacy aware framework for efficient taxi and car sharing system | |
| CN113691958A (en) | SM 9-based V2X identity authentication method |
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 |