CN107947942A - Vehicle position privacy protection method based on group ranking and prestige - Google Patents

Vehicle position privacy protection method based on group ranking and prestige Download PDF

Info

Publication number
CN107947942A
CN107947942A CN201711234735.0A CN201711234735A CN107947942A CN 107947942 A CN107947942 A CN 107947942A CN 201711234735 A CN201711234735 A CN 201711234735A CN 107947942 A CN107947942 A CN 107947942A
Authority
CN
China
Prior art keywords
vehicle
group
assumed name
message
leader
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.)
Granted
Application number
CN201711234735.0A
Other languages
Chinese (zh)
Other versions
CN107947942B (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.)
Anhui University
Original Assignee
Anhui University
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 Anhui University filed Critical Anhui University
Priority to CN201711234735.0A priority Critical patent/CN107947942B/en
Publication of CN107947942A publication Critical patent/CN107947942A/en
Application granted granted Critical
Publication of CN107947942B publication Critical patent/CN107947942B/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/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
    • H04L9/3255—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 using group based signatures, e.g. ring or threshold signatures
    • 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
    • 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
    • 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
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1051—Group master selection mechanisms
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Medical Informatics (AREA)
  • Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Theoretical Computer Science (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a kind of vehicle position privacy protection method based on group ranking and prestige, including herein below：More vehicle cooperations are encouraged to form the reputation model of group；Assess the privacy model of vehicle location privacy intensity；The formation of group creates a mechanism with dynamic mixing zone domain；Assumed name replaces mechanism.For any vehicle in vehicular ad hoc network network, when its assumed name is near the phase, according to the credit value of itself, actively group is established to control server request, server is controlled to distribute group's role of leaders for request vehicle, and according to the current location of request vehicle, one Mixed Zone of dynamic formation, other vehicles in Mixed Zone change assumed name to determine whether participating in cooperation, and can dynamically adjust the credit value of vehicle according to the credit value of oneself, privacy intensity, assumed name remaining time.The present invention can encourage more vehicles to add group, so that cooperation changes assumed name, ensure vehicle location privacy；Meanwhile vehicle does not have to keep silent status in the Mixed Zone of formation, but broadcast the message with group's identity, ensured the driving safety of vehicle；Furthermore it is possible to efficiently reduce resource overhead caused by non-essential frequently change assumed name.

Description

Vehicle position privacy protection method based on group ranking and prestige
Technical field
The present invention relates to car networking field of communication security, and in particular to a kind of vehicle location based on group ranking and prestige is hidden Private guard method.
Background technology
In recent years, vehicular ad hoc network has become the promising skill of the efficiency and level of security that improve transportation system Art problem and the extensive concern for causing the public.In vehicular ad hoc network, each vehicle communicates equipped with board units (OBU) Equipment, it allows them not only to communicate with one another, i.e., vehicle communicates with vehicle (V2V), and allow its with roadside infrastructure into Row communication, i.e., vehicle communicates with infrastructure (V2I)；Meanwhile vehicle is equipped with microprocessor unit, possesses certain calculating energy Power.Vehicle periodically broadcasts the message to surrounding vehicles, including position, speed, directional information, and surrounding vehicles are perceived with improving vehicle Degree, and the appearance of early warning dangerous situation.Stolen however, these message can be intercepted easily by attacker, attacker utilizes These message stolen track vehicle, so as to cause serious threat to vehicle location privacy.
To solve the problems, such as this, some scholars propose the scheme for establishing Mixed Zone, carry out location privacy protection, lead to Often, Mixed Zone is based on fixed position, using specific region as Mixed Zone, such as intersection or large-scale is stopped Parking lot.Vehicle changes assumed name in the region, to prevent attacker from following the trail of them.However, fixed Mixed Zone is due to its position The limitation put, vehicle must keep silent status in the region, it is difficult to meet the needs of flexibility.Therefore, dynamic creation mixes The thought for closing region is suggested, so as to expedite the emergence of out the assumed name change technique for being dynamically determined mixed zone.Pass through dynamic mixing zone domain side Method, vehicle can change assumed name with dynamic select position.Such as there is scholar to propose the dynamic position privacy mode based on density, appoint K-1 vehicle must has been fulfilled for around meaning vehicle, it is desirable to which cooperation changes assumed name to other vehicles together.It is however, some selfish Vehicle is reluctant to change assumed name for the consideration (such as limited assumed name, bandwidth) of number one, it is difficult to meet k- anonymities Demand, causes the probability of the hidden exposure in position of vehicle to greatly increase.In addition, vehicle is tracked in order to prevent, vehicle is in mixed zone Silent status is generally kept in domain, i.e. vehicle does not broadcast the message externally, also do not receive message, very big prestige is caused to traffic safety The side of body.
The content of the invention
Goal of the invention：It is an object of the invention to solve vehicle position privacy protection method in existing vehicular ad hoc network network to deposit Defect is being obtained, the number of vehicles such as cooperation change assumed name is less, causes the reduction of location privacy security；Reduce at the same time frequently non- The resource overhead that necessary assumed name change is brought, encourages more vehicle cooperations to change assumed name, improves the location privacy peace of vehicle Quan Xing；In addition, improving the defects of vehicle keeps silent status in Mixed Zone, vehicle can be broadcast the message with group's identity, be subtracted The hidden danger caused by traffic safety is lacked.
Technical solution：The present invention a kind of vehicle position privacy protection method based on group ranking and prestige, it is necessary to by The group ranking mechanism taken turns more forms Mixed Zone to change the assumed name of vehicle, comprises the following steps：
(1) it is equipped with vehicular ad hoc network network and weighs vehicle i location privacies strength model and credit value model；
Location privacy model is：
Wherein, Cooperate for kth wheeled vehicle i in the Mixed Zone that other vehicles are established Change the number of vehicles of assumed name, Pb→dIt is changed to the probability of new assumed name d from old assumed name b for vehicle, △ T are assumed name life cycle, △ (△ t are less with respect to the time used in △ T, can set a time range, such as 1 second to 30 for change assumed name remaining time threshold value by t Second, it also can therefrom appoint and take a value, such as 30 seconds), k changes number for assumed name,It is vehicle i in the position that kth wheel obtains Privacy intensity；
Reputation model is：Represent to add up to obtain by k assumed name change rear vehicle i The credit value obtained, wherein NTi zFor vehicle fleet in Mixed Zone,Represent the number of vehicles in z wheel cooperation change assumed names, z ≤k；
In above-mentioned model n equivalent to subscript value effect, scope from 1 toIt is assuming that mixed in entrance in kth wheel, vehicle i It is b to close the assumed name used before region, is had in the Mixed ZoneA vehicle more renews assumed name, and new assumed name is d, e, f, G, then the new assumed name of vehicle i is probably one in this 4 new assumed names, for attacker, successfully by new assumed name d and old vacation Associated probability, that is, the P of name bb→d=1/4.Pb→dIn the round of different change assumed names, its numerical value is different, is not one solid Definite value.
(2) when vehicle adds vehicular ad hoc network first, registered with the true identity of oneself to trust authority TA with obtain it is public/ Private key pair and its corresponding certificate；
(3) assume to calculate the assumed name remaining time of oneself in kth wheel, the microprocessor of vehicle iWhenWhen, Vehicle i serves as crowd leader GL to control server CS requests；
(4) group is established using itself as group leader's dynamic according to the foundation of group rule, vehicle i；
(5) region that group is formed in vehicle i builds Mixed Zone, and group members broadcast of the GL into Mixed Zone changes assumed name Message, the vehicle in Mixed Zone can be according to the assumed name remaining time of oneself, and the credit value and location privacy intensity of itself determine Whether participate in cooperation and change assumed name.
Further, in the step (1), it is that any vehicle in vehicular ad hoc network network sets one to control server CS Prestige threshold xi and location privacy intensity thresholdThe two threshold values are set according to the privacy class that user oneself wants to reach Fixed, with the difference of setting of the user to the two threshold values, the location privacy of acquisition can change therewith.
Further, when any vehicle of the step (2) adds vehicular ad hoc network network first, trust authority TA is the vehicle Distribute a certain number of assumed names, each assumed name has corresponding usage time, so as to vehicle during traveling with pseudonym identity Message is sent out, all message are intended to be encrypted or sign before transmitting.
Further, the detailed process of the step (3) is：
(3.1) whenWhen, vehicle i sends message request to control server CS through roadside unit R SU and serves as group's neck The person of leading GL, the message of transmission include the currently used assumed names of vehicle i, position, average speed and assumed name remaining time information；
(3.2) control server CS receives the message of vehicle i, verificationWhether set up, in the side of trust authority TA Help down, then response message is sent to vehicle i by roadside unit RSU, which includes the group's identity for distributing to vehicle i GID, symmetric key kGAnd certificate, control server CS preserved at the same time in local list the assumed name of vehicle i, group's identity GID and Certificate information；
(3.3) after vehicle i receives the response message of control server CS, asking from other vehicles is monitored with group's identity Seek addition message.
Further, the detailed process of the step (4) is：
(4.1) group leader GL periodically broadcasts group with group's identity GID and establishes message, and any vehicle j receives group's foundation Message, judges whether oneself has been crowd leader, if it is, vehicle j, which abandons group, establishes message, otherwise, vehicle j continues to sentence It is disconnected whether to receive the group from other crowd of leader GL and establish message, if it is, vehicle j equally abandons message, otherwise, vehicle Credit value Rs of the j further according to group leader GLGL, itself assumed name remaining timeThe credit value R of itselfjWith location privacy intensity BjTo determine whether adding the group that vehicle i is formed, become group members；This mode can effectively avoid one of group leader The problem of being the member of another group, while avoid a problem of vehicle adds multiple groups at the same time.
(4.2) R is worked asGLDuring >=ξ, vehicle j sends the request for adding group to group leader GL；Work as RGL<ξ andWhen, Vehicle j sends the request for adding group to group leader GL；Work as RGL<During ξ, if Rj<ξ andThen vehicle j is to group leader GL sends the request for adding group；Otherwise, until vehicle j assumed names are near the phase, group's neck is served as to control server CS active requests The person of leading；
Wherein, add the request message of group include assumed name, certificate that current vehicle uses,RjAnd Bj, group leader After GL receives the request message of addition group, the identity information of vehicle j is preserved, and response message, the response message are sent to vehicle j Including GID, kGAnd certificate；After vehicle j receives response message, verify group's identity and preserve kG；The vehicle in group will pass through k afterwardsG Coded communication, the vehicle in group are given out information to outside group with GID；It is the timeliness of guarantee message, every message in the above process In include timestamp information.
Further, the detailed process of the step (5) is：
(5.1) after group establishes, member at least NT in group is selectedi kThe critical zone of a vehicle size is as mixed zone Domain, afterwards all vehicles in this region complete as needed assumed name replacement, whereink△T-△t≤t<k△ T, PchpThe probability for changing assumed name for vehicle in Mixed Zone (such as may be set to 0.5, represent any vehicle in other vehicles The probability for having 50% in Mixed Zone changes assumed name)；It is to control server CS to be set for any vehicle in vehicular ad hoc network network Location privacy intensity threshold；
(5.2) group leader GL sends message by roadside unit RSU to control server CS, which includes group's identity GID and certificate, control server CS receive message and are verified, the group's identity that will be preserved in group's identity GID and local list GID is compared, if in the presence of, it was demonstrated that group leader GL is effective, replys response message to group leader GL, it is allowed to which group leads Person GL and group members change assumed name as needed；
(5.3) group leader GL kGEncryption changes the message of assumed name and broadcast, and the group members decryption in Mixed Zone disappears Breath, changes assumed name as needed；IfVehicle j calculates the R of oneselfjAnd Bj, participate in cooperation and change assumed name；Otherwise, car The R of jj<ξ andThen vehicle j equally calculates the credit value R of oneselfjWith location privacy intensity Bj, participate in cooperation and change Assumed name；Otherwise, vehicle j keeps assumed name constant, until assumed name is near the phase, is actively served as in next round to CS control server requests Group leader；
(5.4) primary group establish and its Mixed Zone in assumed name change procedure terminate, rear vehicle enter next round mistake Journey.
Beneficial effect：Compared with prior art, the present invention has the following advantages：
(1) invention introduces group ranking mechanism, vehicle to be broadcast the message with pseudonym identity in the process of moving, when vehicle from Oneself forms group or during as the member of other crowd, with group's identity assumed name can be replaced to broadcast the message, it is quiet that vehicle does not have to holding Silent state, reduces and is threatened caused by traffic safety, and the vehicle in additional mixing region is broadcast the message with group's identity, is enhanced The confusion of vehicle, so as to effectively resist the probability that attacker successfully follows the trail of.
(2) invention introduces the incentive mechanism of credit value, prestige initial value is put when vehicle has just added vehicular ad hoc network network For 0, than relatively low, vehicle will play an active part in cooperation and change assumed name vehicle location personal secrets to improve credit value at this time. During constantly participating in other vehicle cooperations change assumed name, its credit value can constantly add up, when credit value reaches specified threshold Value, illustrates that it is already engaged in and assumed name is varied multiple times, personal secrets are ensured, may not necessarily participate in assumed name replacement afterwards.
(3) present invention due to each car storage assumed name limitation, if frequently changing assumed name, quickly assumed name will by with It is complete.Therefore, the vehicle in the present invention in Mixed Zone need not all change assumed name, when only meeting the condition specified in scheme Just change assumed name, effectively reduce the resource overhead that change assumed name is brought.
Brief description of the drawings
Fig. 1 is the system model structure chart of the present invention；
Fig. 2 is the overall flow figure of the present invention；
Fig. 3 establishes process flow diagram flow chart for group in the present invention；
Fig. 4 changes process flow diagram flow chart for assumed name in the present invention.
Embodiment
Technical solution of the present invention is described in detail below, but protection scope of the present invention is not limited to the implementation Example.
Embodiment 1：
As shown in Fig. 2, a kind of vehicle position privacy protection method based on group ranking and prestige of the present invention, includes successively Following steps：
(1) model equipped with measurement vehicle i location privacy intensity in vehicular ad hoc network network is：
Wherein, Cooperate for kth wheeled vehicle i in the Mixed Zone that other vehicles are established Change the number of vehicles of assumed name, Pb→dThe probability of new assumed name d is changed to from old assumed name b for vehicle.
For example, the assumed name that vehicle uses before Mixed Zone is entered is b, the car of cooperation change assumed name in Mixed Zone Number is 6, and vehicle all continues to travel after leaving Mixed Zone with new assumed name, and the new assumed name of vehicle i may be 6 new false One in name, i.e.,△ T are assumed name life cycle, are arranged to 25 minutes, and △ t are change assumed name remaining time threshold Value, is arranged to 0.5 minute, and k changes number for assumed name, is arranged to 30,It is strong for the location privacy that is obtained in kth wheeled vehicle i Degree, its value and t, k andIt is related.
At the same time be equipped with weigh vehicle credit value model be：Represent by k Secondary assumed name change rear vehicle i adds up the credit value obtained, wherein NTi zFor vehicle fleet in Mixed Zone.
(2) when vehicle adds vehicular ad hoc network first, with the true identity of oneself to TA register with obtain public private key-pair and Its corresponding certificate, the initial position privacy intensity for setting vehicle i are 2, and initial credit value is 0.
(3) assume to calculate the assumed name remaining time of oneself in kth wheel, the microprocessor of vehicle iWhenWhen, Vehicle i serves as crowd leader (GL) to control server (CS) request, and CS is that the prestige threshold xi that each vehicle is set is 2.0, position Put privacy threshold valueFor 2.5.
(4) group is established using itself as group leader's dynamic according to the foundation of group rule, vehicle i.
(5) Mixed Zone is formed in group, group members broadcast of the GL into Mixed Zone changes assumed name message, Mixed Zone Interior vehicle can be according to the assumed name remaining time of oneself, and the credit value and location privacy intensity of itself decide whether that participating in cooperation changes Become assumed name.
Wherein assumed name life cycle, assumed name remaining time threshold value, location privacy intensity threshold can be adjusted suitably, mixed zone Number of vehicles in domain can meet the eye on every side the requirement of privacy confusion by adjusting Mixed Zone size.
The specific implementation process of step (3) is as follows：
1. work as Ti leftDuring≤△ t, vehicle i sends message request to CS through roadside unit (RSU) and serves as GL, and message includes Assumed name, position, average speed and assumed name remaining time information currently used vehicle i.
2.CS receives message, checks Ti leftWhether≤△ t set up, after being verified, with the help of TA, then by RSU Response message is sent to vehicle i, including group's identity (GID), the symmetric key (k for distributing to vehicle iG) and certificate, CS it is same When locally preserving assumed name, GID and the certificate of vehicle i.
3. vehicle i can be disappeared after receiving the response message of CS with request addition of group's identity monitoring from other vehicles Breath.
As shown in figure 3, the specific implementation process of step (4) is as follows：
1.GL is periodically broadcasted group with GID and establishes message, and any vehicle j receives message, judge oneself whether be Group leader；If it is vehicle j abandons message, and otherwise, vehicle j judges whether that receiving the group from other GL establishes message； If it is vehicle j equally abandons message, otherwise, credit value (Rs of the vehicle j further according to group leaderGL), itself assumed name it is remaining when BetweenCredit value (the R of itselfj) and location privacy intensity (Bj) to determine whether add the group that vehicle i is formed, become group Member.
2. work as RGLDuring >=ξ, vehicle j sends the request for adding group to GL, otherwise, works as RGL<During ξ, ifVehicle j The request for adding group is sent to GL, otherwise, works as RGL<During ξ, if Rj<ξ andVehicle j sends the request for adding group to GL, Otherwise, until vehicle j assumed names are near the phase, crowd leader is served as to CS active requests.
Wherein add the message of group include assumed name, certificate that current vehicle uses,RjAnd Bj, GL, which is received, adds group Message, preserve the identity information of vehicle j, and send response message to vehicle j to include GID, kG, certificate.Vehicle j receives response After message, verify group's identity and preserve kG.The vehicle in group can pass through k afterwardsGCoded communication, the vehicle in group is to outside group Given out information with GID.In addition, in order to ensure the timeliness of message, timestamp information is all included in every message.
As shown in figure 4, the specific implementation process of step (5) is as follows：
1. after group foundation, member at least NT in group is selectedi kThe critical zone of a vehicle is as Mixed Zone, Zhi Hou All vehicles in the region complete assumed name replacement as needed, whereink△T-△t≤t<K △ T, PchpIt is mixed The probability that vehicle in region changes assumed name is closed, P is setchp=0.5.
2.GL sends message by RSU to CS, including GID, certificate, CS receive message and be verified, by GID and local The GID preserved in list is compared, if in the presence of, it was demonstrated that GL is effective, replys response message to GL, it is allowed to GL and group members Change assumed name as needed.
3.GL kGEncryption changes the message of assumed name and broadcast, the group members decryption message in Mixed Zone, as needed Change assumed name.IfVehicle j calculates the R of oneselfjAnd Bj, participate in cooperation and change assumed name；Otherwise, the R of vehicle jj<ξ andThen vehicle j equally calculates the R of oneselfjAnd Bj, participate in cooperation and change assumed name；Otherwise, vehicle j keeps assumed name constant, directly To assumed name near the phase, actively crowd leader is served as to CS requests in next round.
4. primary group establish and its Mixed Zone in assumed name change procedure terminate, rear vehicle enter next round process.
It can be seen from above-described embodiment that the present invention uses credit mechanism, more vehicle cooperations are encouraged to change assumed name, The confusion of vehicle is considerably increased, the location privacy of vehicle has been effectively ensured, while it is false to reduce non-essential forcibly changing The wasting of resources caused by name.In addition, the present invention forms mixed zone according to vehicle space distribution characteristics, vehicle in a manner of group ranking Domain, vehicle replaces assumed name to send message with group's identity in group, can effectively reduce the probability that vehicle is tracked, and maintains higher Privacy performance.Vehicle need not keep silent status in group at the same time, can effectively ensure that the safety of vehicle in the process of moving.

Claims (6)

  1. A kind of 1. vehicle position privacy protection method based on group ranking and prestige, it is characterised in that：Comprise the following steps：
    (1) it is equipped with vehicular ad hoc network network and weighs vehicle i location privacies strength model and credit value model；
    Location privacy model is：
    Wherein, For kth wheeled vehicle i, cooperation changes in the Mixed Zone that other vehicles are established The number of vehicles of assumed name, Pb→dThe probability of new assumed name d is changed to from old assumed name b for vehicle, and△ T give birth to for assumed name Ordering the cycle, △ t are change assumed name remaining time threshold value, and k changes number for assumed name,It is vehicle i in the position that kth wheel obtains Privacy intensity；
    Reputation model is：Represent adding up what is obtained by k assumed name change rear vehicle i Credit value, whereinFor vehicle fleet in Mixed Zone；Represent the number of vehicles in z wheel cooperation change assumed names, z≤k；
    (2) when vehicle adds vehicular ad hoc network first, registered with the true identity of oneself to trust authority TA to obtain public/private key pair Pair and its corresponding certificate；
    (3) assume to calculate each assumed name remaining time of oneself in kth wheel, the microprocessor of vehicle iWhenWhen, Vehicle i serves as crowd leader GL to control server CS requests；
    (4) group is established using itself as group leader's dynamic according to the foundation of group rule, vehicle i；
    (5) region that group is formed in vehicle i builds Mixed Zone, and group members broadcast of the GL into Mixed Zone changes assumed name and disappears Cease, the vehicle in Mixed Zone can be according to the assumed name remaining time of oneself, and credit value and location privacy the intensity judgement of itself are No participation cooperation changes assumed name.
  2. 2. the vehicle position privacy protection method according to claim 1 based on group ranking and prestige, it is characterised in that：Institute State in step (1), it is that any vehicle in vehicular ad hoc network network sets prestige threshold xi and location privacy intensity to control server CS Threshold value
  3. 3. the vehicle position privacy protection method according to claim 1 based on group ranking and prestige, it is characterised in that：Institute When stating any vehicle of step (2) and adding vehicular ad hoc network network first, trust authority TA distributes a certain number of assumed names for the vehicle, Each assumed name has corresponding usage time △ T, so that vehicle is sent out message during traveling with pseudonym identity, owns Message is intended to be encrypted or sign before transmitting.
  4. 4. the vehicle position privacy protection method according to claim 1 based on group ranking and prestige, it is characterised in that：Institute The detailed process for stating step (3) is：
    (3.1) whenWhen, vehicle i sends message request to control server CS through roadside unit R SU and serves as crowd leader GL, the message of transmission include the currently used assumed names of vehicle i, position, average speed and assumed name remaining time information；
    (3.2) control server CS receives the message of vehicle i, verificationWhether set up, in the help of trust authority TA Under, then by roadside unit RSU to vehicle i send response message, the response message include distribute to vehicle i group's identity GID, Symmetric key kGAnd certificate, control server CS preserve assumed name, group's identity GID and the certificate of vehicle i in local list at the same time Information；
    (3.3) after vehicle i receives the response message of control server CS, the request from other vehicles is monitored with group's identity and is added Enter message.
  5. 5. the vehicle position privacy protection method according to claim 1 based on group ranking and prestige, it is characterised in that：Institute The detailed process for stating step (4) is：
    (4.1) group leader GL periodically broadcasts group with group's identity GID and establishes message, and any vehicle j receives group and establishes message, Judge whether oneself has been crowd leader, if it is, vehicle j, which abandons group, establishes message, otherwise, vehicle j, which continues judgement, is No to receive the group from other crowd of leader GL and establish message, if it is, vehicle j equally abandons message, otherwise, vehicle j is again According to the credit value R of group leader GLGL, itself assumed name remaining timeThe credit value R of itselfjWith location privacy intensity BjCome Judge whether to add the group that vehicle i is formed, become group members；
    (4.2) R is worked asGLDuring >=ξ, vehicle j sends the request for adding group to group leader GL；Work as RGL<ξ andWhen, vehicle j The request for adding group is sent to group leader GL；Work as RGL<During ξ, if Rj<ξ andThen vehicle j is sent to group leader GL Add the request of group；Otherwise, until vehicle j assumed names are near the phase, crowd leader, ξ are served as to control server CS active requests For prestige threshold value,For location privacy intensity threshold；
    Wherein, add the request message of group include assumed name, certificate that current vehicle uses,RjAnd Bj, group leader GL receipts To after adding the request message of group, the identity information of vehicle j is preserved, and response message is sent to vehicle j, which includes GID、kGAnd certificate；After vehicle j receives response message, verify group's identity and preserve kG；The vehicle in group will pass through k afterwardsGEncryption Communicate, the vehicle in group is given out information to outside group with GID；It is the timeliness of guarantee message in the above process, in every message Include timestamp information.
  6. 6. the vehicle position privacy protection method according to claim 1 based on group ranking and prestige, it is characterised in that：Institute The detailed process for stating step (5) is：
    (5.1) after group establishes, member at least NT in group is selectedi kThe critical zone of a vehicle size as Mixed Zone, it All vehicles in this region complete assumed name replacement as needed afterwards, whereink△T-△t≤t<K △ T, Pchp Change the probability of assumed name for vehicle in Mixed Zone；It is to control server CS to be set for any vehicle in vehicular ad hoc network network Location privacy intensity threshold；
    (5.2) group leader GL sends message by roadside unit RSU to control server CS, which includes group's identity GID And certificate, control server CS receive message and are verified, the group's identity GID that will be preserved in group's identity GID and local list It is compared, if in the presence of, it was demonstrated that group leader GL is effective, replys response message to group leader GL, it is allowed to group leader GL and group members change assumed name as needed；
    (5.3) group leader GL kGEncryption changes the message of assumed name and broadcast, the group members decryption message in Mixed Zone, root According to need change assumed name；IfVehicle j calculates the R of oneselfjAnd Bj, participate in cooperation and change assumed name；Otherwise, the R of vehicle jj <ξ andThen vehicle j equally calculates the credit value R of oneselfjWith location privacy intensity Bj, participate in cooperation and change assumed name；It is no Then, vehicle j keeps assumed name constant, and until assumed name is near the phase, actively group leader is served as to CS control server requests in next round Person；
    (5.4) primary group establish and its Mixed Zone in assumed name change procedure terminate, rear vehicle enter next round process.
CN201711234735.0A 2017-11-30 2017-11-30 Vehicle position privacy protection method based on group ranking and prestige Active CN107947942B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711234735.0A CN107947942B (en) 2017-11-30 2017-11-30 Vehicle position privacy protection method based on group ranking and prestige

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711234735.0A CN107947942B (en) 2017-11-30 2017-11-30 Vehicle position privacy protection method based on group ranking and prestige

Publications (2)

Publication Number Publication Date
CN107947942A true CN107947942A (en) 2018-04-20
CN107947942B CN107947942B (en) 2019-08-27

Family

ID=61947917

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711234735.0A Active CN107947942B (en) 2017-11-30 2017-11-30 Vehicle position privacy protection method based on group ranking and prestige

Country Status (1)

Country Link
CN (1) CN107947942B (en)

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108769926A (en) * 2018-05-16 2018-11-06 电子科技大学 Car networking method for secret protection based on quorum-sensing system layer and car networking framework
WO2019041896A1 (en) * 2017-09-04 2019-03-07 东北大学 Virtual mix-zone-based vanet position privacy protection system and method
CN109561383A (en) * 2018-12-17 2019-04-02 昆明理工大学 A kind of location privacy protection method based on dynamic assumed name exchange area
CN110034958A (en) * 2019-04-02 2019-07-19 浙江工商大学 Car networking assumed name change excitation algorithm and variation based on SGUM theory
CN110430567A (en) * 2019-07-31 2019-11-08 福建师范大学 A kind of car networking assumed name replacing options based on game theory analysis
CN112351408A (en) * 2021-01-08 2021-02-09 北京电信易通信息技术股份有限公司 Data safety transmission method and system for intelligent network-connected electric vehicle
CN112969173A (en) * 2021-02-01 2021-06-15 河南工学院 Location privacy protection method and system in 5G vehicle-mounted network based on virtual vehicle
CN114051235A (en) * 2021-08-28 2022-02-15 北京工业大学 Vehicle track privacy protection method in Internet of vehicles scene
US20220174479A1 (en) * 2019-12-09 2022-06-02 Intel Corporation Privacy protection mechanisms for connected vehicles

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103338444A (en) * 2013-05-15 2013-10-02 浙江工商大学 Vehicle position privacy protection method of vehicular ad hoc network
CN103781067A (en) * 2014-03-03 2014-05-07 南京理工大学 Authentication switching method with privacy protection in LTE (long term evolution)/LTE-A (LTE-advanced) network
CN106027519A (en) * 2016-05-18 2016-10-12 安徽大学 Efficient condition privacy protection and security authentication method in internet of vehicles

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103338444A (en) * 2013-05-15 2013-10-02 浙江工商大学 Vehicle position privacy protection method of vehicular ad hoc network
CN103781067A (en) * 2014-03-03 2014-05-07 南京理工大学 Authentication switching method with privacy protection in LTE (long term evolution)/LTE-A (LTE-advanced) network
CN106027519A (en) * 2016-05-18 2016-10-12 安徽大学 Efficient condition privacy protection and security authentication method in internet of vehicles

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
KRISHNA SAMPIGETHAYA 等: "AMOEBA:Robust Location Privacy Scheme for VANET", 《EEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS》 *

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019041896A1 (en) * 2017-09-04 2019-03-07 东北大学 Virtual mix-zone-based vanet position privacy protection system and method
CN108769926A (en) * 2018-05-16 2018-11-06 电子科技大学 Car networking method for secret protection based on quorum-sensing system layer and car networking framework
CN108769926B (en) * 2018-05-16 2020-10-23 电子科技大学 Group perception layer-based car networking privacy protection method and car networking framework
CN109561383A (en) * 2018-12-17 2019-04-02 昆明理工大学 A kind of location privacy protection method based on dynamic assumed name exchange area
CN110034958A (en) * 2019-04-02 2019-07-19 浙江工商大学 Car networking assumed name change excitation algorithm and variation based on SGUM theory
CN110034958B (en) * 2019-04-02 2022-11-11 浙江工商大学 Vehicle networking pseudonym change incentive algorithm and change method based on SGUM theory
CN110430567A (en) * 2019-07-31 2019-11-08 福建师范大学 A kind of car networking assumed name replacing options based on game theory analysis
CN110430567B (en) * 2019-07-31 2023-03-24 福建师范大学 Internet of vehicles pseudonym replacement method based on game analysis
US20220174479A1 (en) * 2019-12-09 2022-06-02 Intel Corporation Privacy protection mechanisms for connected vehicles
US11889300B2 (en) * 2019-12-09 2024-01-30 Intel Corporation Privacy protection mechanisms for connected vehicles
CN112351408A (en) * 2021-01-08 2021-02-09 北京电信易通信息技术股份有限公司 Data safety transmission method and system for intelligent network-connected electric vehicle
CN112969173B (en) * 2021-02-01 2022-08-30 河南工学院 Position privacy protection method and system in 5G vehicle-mounted network based on virtual vehicle
CN112969173A (en) * 2021-02-01 2021-06-15 河南工学院 Location privacy protection method and system in 5G vehicle-mounted network based on virtual vehicle
CN114051235A (en) * 2021-08-28 2022-02-15 北京工业大学 Vehicle track privacy protection method in Internet of vehicles scene
CN114051235B (en) * 2021-08-28 2024-03-29 北京工业大学 Vehicle track privacy protection method in Internet of vehicles scene

Also Published As

Publication number Publication date
CN107947942B (en) 2019-08-27

Similar Documents

Publication Publication Date Title
CN107947942B (en) Vehicle position privacy protection method based on group ranking and prestige
Sharma et al. A survey on internet of vehicles: Applications, security issues & solutions
Alnasser et al. Cyber security challenges and solutions for V2X communications: A survey
Jesudoss et al. Stimulating truth-telling and cooperation among nodes in VANETs through payment and punishment scheme
Wang et al. Challenges and solutions in autonomous driving: A blockchain approach
Lu et al. Anonymity analysis on social spot based pseudonym changing for location privacy in VANETs
CN106572088B (en) A kind of vehicular ad hoc network assumed name transform method based on Virtual User
CN106027233A (en) Method for designing vehicle network group negotiation communication protocol
CN110034958B (en) Vehicle networking pseudonym change incentive algorithm and change method based on SGUM theory
CN113905351B (en) Internet of vehicles authentication method based on block chain and confidential calculation
Safavat et al. On the elliptic curve cryptography for privacy-aware secure ACO-AODV routing in intent-based internet of vehicles for smart cities
Hu et al. Vtrust: a robust trust framework for relay selection in hybrid vehicular communications
Hao et al. URLLC resource slicing and scheduling for trustworthy 6G vehicular services: A federated reinforcement learning approach
CN116321147A (en) Zero trust-based multi-attribute terminal identity authentication method and system
de Almeida et al. Doctrams: a decentralized and offline community-based traffic monitoring system
Ghourab et al. Blockchain-guided dynamic best-relay selection for trustworthy vehicular communication
Truong et al. Trust evaluation for data exchange in vehicular networks
CN114578847A (en) Unmanned aerial vehicle collaborative data verification system and method based on automatic driving vehicle networking
CN116668987B (en) Side chain-based internet of vehicles data sharing method and system
Ganesh et al. Performance and analysis of advanced and enhanced security protocol for vehicular ad hoc networks (VANETs)
Raya Data-centric trust in ephemeral networks
Hou et al. MPoR: A Modified Consensus for Blockchain‐Based Internet of Vehicles
Kait et al. Fuzzy logic‐based trusted routing protocol using vehicular cloud networks for smart cities
Ltifi et al. Smart trust management for vehicular networks
Lokhande et al. SPHA-VC: Secure passengers health assessment via vehicular communications

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