File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Anonymous Counting Problem in Trust Level Warning System for VANET

TitleAnonymous Counting Problem in Trust Level Warning System for VANET
Authors
KeywordsVehicles
Vehicular ad hoc networks
Privacy
Alarm systems
Roads
Issue Date2019
PublisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25
Citation
IEEE Transactions on Vehicular Technology, 2019, v. 68 n. 1, p. 34-48 How to Cite?
AbstractUsing vehicular ad-hoc network, smart vehicles can detect dangerous events on the road and announce warnings to other vehicles to ensure road safety. The other vehicles nearby may receive the warning messages and accordingly choose a different route. But, because of the presence of malicious users on the road and errors in the detection system, some warning messages may prove dubious. Therefore, to distinguish between genuine and dubious messages, an element of trust has to be infused into the warning system. One common approach for this is to enable the receivers count the popularity of the reports of a warning event, i.e., the trust level. Once the trust level meets a predefined threshold, the vehicle's on-board unit will trust the warning event and warn the driver. Yet, owing to security and privacy concerns, anonymous counting problem does exist, because it is hard to fulfill both anonymity and counting requirements. In this paper, the authors define the anonymous counting problem and then propose a conditional distinguishable pseudo identities scheme that achieves conditional anonymity to overcome the counting problem. To achieve this feature of pseudo identities, time slot was added to minimize the influence of the adversary. Randomized batch verification was applied to enhance efficiency. Furthermore, it is shown how to achieve those features and provide proof on pairing equations. Finally, the time complexity of the proposed scheme was analyzed and its performance evaluated by Simulation of Urban Mobility.
Persistent Identifierhttp://hdl.handle.net/10722/277571
ISSN
2017 Impact Factor: 4.432
2015 SCImago Journal Rankings: 1.203

 

DC FieldValueLanguage
dc.contributor.authorYEUNG, CY-
dc.contributor.authorHui, LCK-
dc.contributor.authorChim, TW-
dc.contributor.authorYiu, SM-
dc.contributor.authorZENG, G-
dc.contributor.authorChen, J-
dc.date.accessioned2019-09-20T08:53:35Z-
dc.date.available2019-09-20T08:53:35Z-
dc.date.issued2019-
dc.identifier.citationIEEE Transactions on Vehicular Technology, 2019, v. 68 n. 1, p. 34-48-
dc.identifier.issn0018-9545-
dc.identifier.urihttp://hdl.handle.net/10722/277571-
dc.description.abstractUsing vehicular ad-hoc network, smart vehicles can detect dangerous events on the road and announce warnings to other vehicles to ensure road safety. The other vehicles nearby may receive the warning messages and accordingly choose a different route. But, because of the presence of malicious users on the road and errors in the detection system, some warning messages may prove dubious. Therefore, to distinguish between genuine and dubious messages, an element of trust has to be infused into the warning system. One common approach for this is to enable the receivers count the popularity of the reports of a warning event, i.e., the trust level. Once the trust level meets a predefined threshold, the vehicle's on-board unit will trust the warning event and warn the driver. Yet, owing to security and privacy concerns, anonymous counting problem does exist, because it is hard to fulfill both anonymity and counting requirements. In this paper, the authors define the anonymous counting problem and then propose a conditional distinguishable pseudo identities scheme that achieves conditional anonymity to overcome the counting problem. To achieve this feature of pseudo identities, time slot was added to minimize the influence of the adversary. Randomized batch verification was applied to enhance efficiency. Furthermore, it is shown how to achieve those features and provide proof on pairing equations. Finally, the time complexity of the proposed scheme was analyzed and its performance evaluated by Simulation of Urban Mobility.-
dc.languageeng-
dc.publisherInstitute of Electrical and Electronics Engineers. The Journal's web site is located at http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=25-
dc.relation.ispartofIEEE Transactions on Vehicular Technology-
dc.rightsIEEE Transactions on Vehicular Technology. Copyright © Institute of Electrical and Electronics Engineers.-
dc.rights©2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.-
dc.subjectVehicles-
dc.subjectVehicular ad hoc networks-
dc.subjectPrivacy-
dc.subjectAlarm systems-
dc.subjectRoads-
dc.titleAnonymous Counting Problem in Trust Level Warning System for VANET-
dc.typeArticle-
dc.identifier.emailHui, LCK: hui@cs.hku.hk-
dc.identifier.emailChim, TW: twchim@cs.hku.hk-
dc.identifier.emailYiu, SM: smyiu@cs.hku.hk-
dc.identifier.authorityHui, LCK=rp00120-
dc.identifier.authorityChim, TW=rp01844-
dc.identifier.authorityYiu, SM=rp00207-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TVT.2018.2884899-
dc.identifier.scopuseid_2-s2.0-85058084678-
dc.identifier.hkuros305932-
dc.identifier.volume68-
dc.identifier.issue1-
dc.identifier.spage34-
dc.identifier.epage48-
dc.publisher.placeUnited States-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats