Oblivious Transfer for Privacy-Preserving in VANET's Feature Matching

被引:17
作者
Wang, Xianmin [1 ,2 ]
Kuang, Xiaohui [3 ]
Li, Jin [1 ]
Li, Jing [1 ]
Chen, Xiaofeng [4 ]
Liu, Zheli [5 ,6 ,7 ]
机构
[1] Guangzhou Univ, Sch Comp Sci, Guangzhou 510006, Peoples R China
[2] Chinese Acad Sci, State Key Lab Informat Secur, Beijing 100864, Peoples R China
[3] Natl Key Lab Sci & Technol Informat Syst Secur, Beijing 100029, Peoples R China
[4] Xidian Univ, State Key Lab Integrated Serv Networks ISN, Xian 710071, Peoples R China
[5] Nankai Univ, Coll Comp & Control Engn, Tianjin 300071, Peoples R China
[6] Nankai Univ, Coll Cyber Sci, Tianjin 300071, Peoples R China
[7] Nankai Univ, Coll Comp Sci, Tianjin Key Lab Network & Data Secur Technol, Tianjin 300071, Peoples R China
基金
中国国家自然科学基金;
关键词
VANET; oblivious transfer; privacy-preserving; group factorization problem; group ring; FACTORIZATION; PROTOCOLS; SCHEME;
D O I
10.1109/TITS.2020.2973738
中图分类号
TU [建筑科学];
学科分类号
0813 ;
摘要
In the feature matching of some Vehicular Ad Hoc Network (VANET) technologies, users' privacy disclosure issue has seriously threatened personal safety and caused considerable economic loss. In this paper, we proposed Oblivious Transfer (OT) protocol and Private Set Intersection (PSI) protocol to protect the users' privacy in the situation of VANET's feature matching. In our schema, an efficient k-out-of-n OT protocol is constructed. Then, this OT protocol is adopted to give a PSI protocol with equality test. Based on the PSI protocol, the two parties of VANET can obtain the intersection of their characteristic sets and any information outside such intersection is unavailable. Accordingly, internal attacker fails to get any useful information from the two parties in the feature matching, and the two parties cannot obtain extra data of each other. Moreover, to reduce the computational cost of the OT protocol, the non-communicative algebraic structure-group ring Z(q)[S-m] is employed. In addition, we analyzed that the proposed scheme does not use complex calculations and can resist against the current quantum attacks.
引用
收藏
页码:4359 / 4366
页数:8
相关论文
共 32 条
  • [11] An Efficient Cryptosystem for Video Surveillance in the Internet of Things Environment
    Hamza, Rafik
    Hassan, Alzubair
    Huang, Teng
    Ke, Lishan
    Yan, Hongyang
    [J]. COMPLEXITY, 2019, 2019
  • [12] VANet security challenges and solutions: A survey
    Hasrouny, Hamssa
    Samhat, Abed Ellatif
    Bassil, Carole
    Laouiti, Anis
    [J]. VEHICULAR COMMUNICATIONS, 2017, 7 : 7 - 20
  • [13] An Efficient Outsourced Privacy Preserving Machine Learning Scheme With Public Verifiability
    Hassan, Alzubair
    Hamza, Rafik
    Yan, Hongyang
    Li, Ping
    [J]. IEEE ACCESS, 2019, 7 (146322-146330) : 146322 - 146330
  • [14] Huang H.-F., 2007, APPL MATH SCI, V1, P311
  • [15] Anonymous Communication via Anonymous Identity-Based Encryption and Its Application in IoT
    Jiang, Liaoliang
    Li, Tong
    Li, Xuan
    Atiquzzaman, Mohammed
    Ahmad, Haseeb
    Wang, Xianmin
    [J]. WIRELESS COMMUNICATIONS & MOBILE COMPUTING, 2018,
  • [16] Kahrobaei D, 2013, GROUPS COMPLEX CRYPT, V5
  • [17] A Public Key Cryptosystem Based on Non-abelian Finite Groups
    Lempken, Wolfgang
    van Trung, Tran
    Magliveras, Spyros S.
    Wei, Wandi
    [J]. JOURNAL OF CRYPTOLOGY, 2009, 22 (01) : 62 - 74
  • [18] Multi-level multi-secret sharing scheme for decentralized e-voting in cloud computing
    Li, Jing
    Wang, Xianmin
    Huang, Zhengan
    Wang, Licheng
    Xiang, Yang
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2019, 130 (91-97) : 91 - 97
  • [19] Lipmaa H, 2008, LECT NOTES COMPUT SC, V5222, P441, DOI 10.1007/978-3-540-85886-7_30
  • [20] Improving Test Chip Design Efficiency via Machine Learning
    Liu, Zeye
    Huang, Qicheng
    Fang, Chenlei
    Blanton, R. D.
    [J]. 2019 IEEE INTERNATIONAL TEST CONFERENCE (ITC), 2019,