Efficient Secure Aggregation in VANETs Using Fully Homomorphic Encryption (FHE)

被引:0
|
作者
N. K. Prema
机构
[1] Annai Teresa College of Engineering,Department of Computer Science and Engineering
来源
关键词
Fully homomorphic encryption; Communication overhead; VANETs; Paillier cryptosystem;
D O I
暂无
中图分类号
学科分类号
摘要
The data aggregation is used generally in VANETs to preserve the user information and reduces the traffic due to packets of high frequency data. The data aggregation schemes performing multiple operations, usually undergoes problem related to message complexity, which leads to increased communication and storage overhead. This case is true in case of message transmitted frequently from a vehicle to provide communication in vehicular adhoc networks. Fully homomorphic encryption (FHE) lacks efficiency due to severe communicationoverhead problem. Hence, this paper improves the privacy of nodes in vehicular networks with reduced communication overhead. To achieve such concerns in VANETs, homomorphic encryption with pseudonym is utilized to carry the messages that tends to change with a desired frequency. The pseudonym changes often with vehicle mobility and the physical and logical address tends to vary over time. Here, the information of the vehicle relating its physical location and speed is made known globally in network, however, the information specific to vehicle and message transmitted is not known to the network. The message is encrypted with proposed Full homomorphic encryption (FHE) scheme to improve the security and reduce the overhead. Also, measures are taken such that the one pseudonym does not matches with the other pseudonym and makes the attacker ineffective for vehicle information tracking. The performance of the proposed FHE is compared with Paillier cryptosystem. It is found that the proposed method provides less communication overhead to transmit the message with improved security than with Paillier cryptosystem.
引用
收藏
页码:434 / 442
页数:8
相关论文
共 50 条
  • [1] Efficient Secure Aggregation in VANETs Using Fully Homomorphic Encryption (FHE)
    Prema, N. K.
    MOBILE NETWORKS & APPLICATIONS, 2019, 24 (02): : 434 - 442
  • [2] CCA-Secure Leveled FHE From Multi-Identity Fully Homomorphic Encryption
    Wang, Weili
    Hu, Bin
    Zhao, Xiufeng
    PROCEEDINGS OF THE 2017 2ND JOINT INTERNATIONAL INFORMATION TECHNOLOGY, MECHANICAL AND ELECTRONIC ENGINEERING CONFERENCE (JIMEC 2017), 2017, 62 : 512 - 516
  • [3] Guidance for Efficient Selection of Secure Parameters for Fully Homomorphic Encryption
    Kirshanova, Elena
    Marcolla, Chiara
    Rovira, Sergi
    PROGRESS IN CRYPTOLOGY, AFRICACRYPT 2024, 2024, 14861 : 376 - 400
  • [4] Secure signal processing using fully homomorphic encryption
    Shortell, Thomas
    Shokoufandeh, Ali
    IET INFORMATION SECURITY, 2020, 14 (01) : 51 - 59
  • [5] Secure Signal Processing Using Fully Homomorphic Encryption
    Shortell, Thomas
    Shokoufandeh, Ali
    ADVANCED CONCEPTS FOR INTELLIGENT VISION SYSTEMS, ACIVS 2015, 2015, 9386 : 93 - 104
  • [6] Secure Similarity Joins Using Fully Homomorphic Encryption
    Cruz, Mateus S. H.
    Amagasa, Toshiyuki
    Watanabe, Chiemi
    Lu, Wenjie
    Kitagawa, Hiroyuki
    19TH INTERNATIONAL CONFERENCE ON INFORMATION INTEGRATION AND WEB-BASED APPLICATIONS & SERVICES (IIWAS2017), 2017, : 224 - 233
  • [7] Secure Face Matching Using Fully Homomorphic Encryption
    Boddeti, Vishnu Naresh
    2018 IEEE 9TH INTERNATIONAL CONFERENCE ON BIOMETRICS THEORY, APPLICATIONS AND SYSTEMS (BTAS), 2018,
  • [8] Secure Fully Homomorphic Authenticated Encryption
    Kim, Jeongsu
    Yun, Aaram
    IEEE ACCESS, 2021, 9 : 107279 - 107297
  • [9] Secure Control of Linear Controllers Using Fully Homomorphic Encryption
    Pan, Jingshan
    Sui, Tongtong
    Liu, Wen
    Wang, Jizhi
    Kong, Lingrui
    Zhao, Yue
    Wei, Zhiqiang
    APPLIED SCIENCES-BASEL, 2023, 13 (24):
  • [10] Secure Tensor Decomposition Using Fully Homomorphic Encryption Scheme
    Kuang, Liwei
    Yang, Laurence T.
    Feng, Jun
    Dong, Mianxiong
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2018, 6 (03) : 868 - 878