Skip to main content
SpringerLink
Log in

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

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Dhand G, Tyagi SS (2016) Data aggregation techniques in WSN: survey. Procedia Computer Science 92:378–384

    Article  Google Scholar 

  2. Tonyali S, Akkaya K, Saputro N, Uluagac AS, Nojoumian M (2017) Privacy-preserving protocols for secure and reliable data aggregation in IoT-enabled Smart Metering systems. Future Generation Computer Systems

  3. Raya M, Aziz A, Hubaux JP (2006, September) Efficient secure aggregation in VANETs. In Proceedings of the 3rd international workshop on vehicular ad hoc networks. ACM, New York, pp 67–75

  4. Hariss K, Noura H, Samhat AE (2017) Fully enhanced homomorphic encryption algorithm of MORE approach for real world applications. Journal of Information Security and Applications 34:233–242

  5. Goyal N, Dave M, Verma AK (2017) Data aggregation in underwater wireless sensor network: recent approaches and issues. Journal of King Saud University-Computer and Information Sciences. https://doi.org/10.1016/j.jksuci.2017.04.007

  6. Song J, He C, Yang F, Zhang H (2016) A privacy-preserving distance-based incentive scheme in opportunistic VANETs. Security and Communication Networks 9(15):2789–2801

    Article  Google Scholar 

  7. Stehlé D, Steinfeld R (2010) Faster fully homomorphic encryption. Advances in Cryptology-ASIACRYPT 2010, pp. 377–394

  8. Coron JS, Mandal A, Naccache D, Tibouchi M (2011). Fully Homomorphic Encryption over the Integers with Shorter Public Keys. In Crypto Vol. 6841, pp. 487–504

  9. Coron JS, Naccache D, Tibouchi M (2012). Public Key Compression and Modulus Switching for Fully Homomorphic Encryption over the Integers. In EUROCRYPT (Vol. 7237, pp. 446–464)

  10. Gentry C, Halevi S (2011) Implementing Gentry's Fully-Homomorphic Encryption Scheme. In EUROCRYPT (Vol. 6632, pp. 129–148)

  11. Gentry C, Halevi S, Smart NP (2012) Fully homomorphic encryption with polylog overhead. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 465–482). Springer, Berlin, Heidelberg

  12. Chen Y, Nguyen PQ (2012) Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. In EUROCRYPT (Vol. 7237, pp. 502–519)

  13. Fan J, Vercauteren F (2012) Somewhat Practical Fully Homomorphic Encryption. IACR Cryptology ePrint Archive, 2012, p.144

  14. Gentry C, Halevi S, Smart N (2012) Better bootstrapping in fully homomorphic encryption. Public Key Cryptography–PKC 2012:1–16

    MathSciNet  MATH  Google Scholar 

  15. Fau S, Sirdey R, Fontaine C, Aguilar-Melchor C, Gogniat G (2013), Towards practical program execution over fully homomorphic encryption schemes. In P2P, Parallel, Grid, Cloud and Internet Computing (3PGCIC), 2013 Eighth International Conference on (pp. 284–290). IEEE

  16. Brakerski Z, Gentry C, Vaikuntanathan V (2014) (leveled) fully homomorphic encryption without bootstrapping. ACM Transactions on Computation Theory (TOCT) 6(3):13

    MathSciNet  MATH  Google Scholar 

  17. Brakerski Z, Vaikuntanathan V (2014) Efficient fully homomorphic encryption from (standard) LWE. SIAM J Comput 43(2):831–871

    Article  MathSciNet  MATH  Google Scholar 

  18. Boneh D, Gentry C, Gorbunov S, Halevi S, Nikolaenko V, Segev G, Vaikuntanathan V, Vinayagamurthy D (2014). Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits. In Annual International Conference on the Theory and Applications of Cryptographic Techniques (pp. 533–556). Springer, Berlin, Heidelberg

  19. Wang W, Hu Y, Chen L, Huang X, Sunar B (2015) Exploring the feasibility of fully homomorphic encryption. IEEE Trans Comput 64(3):698–706

    Article  MathSciNet  MATH  Google Scholar 

  20. Jain A, Rasmussen PM, Sahai A (2017) Threshold Fully Homomorphic Encryption. IACR Cryptology ePrint Archive, 2017, p.257

  21. Canetti R, Raghuraman S, Richelson S, Vaikuntanathan V (2017). Chosen-Ciphertext Secure Fully Homomorphic Encryption. In IACR International Workshop on Public Key Cryptography (pp. 213–240). Springer, Berlin, Heidelberg

  22. Kogos KG, Filippova KS, Epishkina AV (2017), Fully homomorphic encryption schemes: The state of the art. In Young Researchers in Electrical and Electronic Engineering (EIConRus), 2017 IEEE Conference of Russian (pp. 463–466). IEEE

  23. Tamayo-Rios M, Faugère JC, Perret L, Ho, PH, Zhang R (2017). Fully Homomorphic Encryption Using Multivariate Polynomials. IACR Eprint, 458

  24. Ding W, Yan Z, Deng RH (2017) Encrypted data processing with homomorphic re-encryption. Inf Sci 409:35–55

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Annai Teresa College of Engineering, Villupuram District, Thirunavalur, Tamilnadu, 607 204, India

    N. K. Prema

Authors
  1. N. K. Prema
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to N. K. Prema.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Prema, N.K. Efficient Secure Aggregation in VANETs Using Fully Homomorphic Encryption (FHE). Mobile Netw Appl 24, 434–442 (2019). https://doi.org/10.1007/s11036-018-1095-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-018-1095-y

Keywords

Search

Navigation