Secure Automated Valet Parking: A Privacy-Preserving Reservation Scheme for Autonomous Vehicles

被引:88
作者
Huang, Cheng [1 ]
Lu, Rongxing [2 ]
Lin, Xiaodong [3 ]
Shen, Xuemin [1 ]
机构
[1] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
[2] Univ New Brunswick, Fac Comp Sci, Fredericton, NB E3B 5A3, Canada
[3] Wilfrid Laurier Univ, Dept Phys & Comp Sci, Waterloo, ON N2L 3C5, Canada
关键词
Automated valet parking; anonymity; location privacy; parking reservation; autonomous vehicles; SIGNATURE;
D O I
10.1109/TVT.2018.2870167
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
It is believed that automated valet parking (AVP) system has great potential to mitigate the parking headache for the future smart city, as it can provide on-demand parking services, bringing immense benefits from energy saving for vehicles to time saving for drivers. For an AVP system, parking reservation is an indispensable part so that vehicles can accomplish automated parking in accordance with the reserved parking information. However, the reservation requests may not only reveal the driver identity, but also disclose higher sensitive locations, e.g., the most visited places, which are of great concerns to users. To deal with this challenge, the anonymous techniques can be naturally applied during parking reservation, but directly applying the anonymous techniques in AVP will introduce a new security issue, i.e., the anonymous user may maliciously crash the AVP system by repetitively sending the reservation requests, which is called "double-reservation attack." In this paper, we propose a new privacy-preserving reservation scheme for securing AVP system. Specifically, each anonymous user must have only one valid reservation token at any moment, and the token can only be used for hooking one vacant parking space once. The proposed scheme does not only preserve the user's identity privacy and location privacy but also prevents the "double-reservation attack" based on several elegant building blocks, i.e., zero-knowledge proofs of knowledge and proxy resignature. Detailed security analysis confirms the security properties of our proposed scheme. In addition, extensive simulations are conducted to compare our proposed scheme with three previous schemes, and the experiment results demonstrate that our scheme is also much efficient in a WiFi-based testbed.
引用
收藏
页码:11169 / 11180
页数:12
相关论文
共 37 条
[1]   An Efficient Blacklistable Anonymous Credentials without TTPs Using Pairing-Based Accumulator [J].
Aikou, Yuu ;
Sadiah, Shahidatul ;
Nakanishi, Toru .
2017 IEEE 31ST INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS (AINA), 2017, :780-786
[2]  
Andres M. E., 2013, P ACM SIGSAC C COMP, P901
[3]  
[Anonymous], 2007, 2007 IEEE Conference on Computer Vision and Pattern Recognition, DOI DOI 10.1109/CVPR.2007.383413
[4]  
Au M. H., 2008, REP 2018 136, P1
[5]  
Au Man Ho, 2012, 2012 NETW DISTR SYST, P1
[6]  
Banzhaf H, 2017, IEEE INT VEH SYM, P1827, DOI 10.1109/IVS.2017.7995971
[7]  
Bertozzi M, 2015, IEEE INT VEH SYM, P132, DOI 10.1109/IVS.2015.7225675
[8]   Short blind signatures [J].
Blazy, Olivier ;
Fuchsbauer, Georg ;
Pointcheval, David ;
VergnauD, Damien .
JOURNAL OF COMPUTER SECURITY, 2013, 21 (05) :627-661
[9]   Short group signatures [J].
Boneh, D ;
Boyen, X ;
Shacham, H .
ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 :41-55
[10]  
Camenisch J, 2004, LECT NOTES COMPUT SC, V3152, P56