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 条
  • [1] [Anonymous], IEEE T DEPEND SEC CO
  • [2] Blake IF, 2004, LECT NOTES COMPUT SC, V3329, P515
  • [3] Geographic routing protocols for Vehicular Ad hoc NETworks (VANETs): A survey
    Boussoufa-Lahlah, Souaad
    Semchedine, Fouzi
    Bouallouche-Medjkoune, Louiza
    [J]. VEHICULAR COMMUNICATIONS, 2018, 11 : 20 - 31
  • [4] Camenisch J, 2007, LECT NOTES COMPUT SC, V4515, P573
  • [5] Quantum computation of discrete logarithms in semigroups
    Childs, Andrew M.
    Ivanyos, Gabor
    [J]. JOURNAL OF MATHEMATICAL CRYPTOLOGY, 2014, 8 (04) : 405 - 416
  • [6] Dixon J. D, 2020, ELECT J COMBINATORIC, V15
  • [7] COMPRESSIVE SENSING TECHNIQUES FOR NEXT-GENERATION WIRELESS COMMUNICATIONS
    Gao, Zhen
    Dai, Linglong
    Han, Shuangfeng
    I, Chih-Lin
    Wang, Zhaocheng
    Hanzo, Lajos
    [J]. IEEE WIRELESS COMMUNICATIONS, 2018, 25 (03) : 144 - 153
  • [8] Edge Computing-Based Security Framework for Big Data Analytics in VANETs
    Garg, Sahil
    Singh, Amritpal
    Kaur, Kuljeet
    Aujla, Gagangeet Singh
    Batra, Shalini
    Kumar, Neeraj
    Obaidat, M. S.
    [J]. IEEE NETWORK, 2019, 33 (02): : 72 - 81
  • [9] New public key cryptosystems based on non-Abelian factorization problems
    Gu, Lize
    Wang, Licheng
    Ota, Kaoru
    Dong, Mianxiong
    Cao, Zhenfu
    Yang, Yixian
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2013, 6 (07) : 912 - 922
  • [10] Habeeb M., 2013, P INT C APPL CRYPT N P INT C APPL CRYPT N