Verification and Provisional Privacy- Preservation Message Framework for VANETs

P. Sharmila, S. Mangaiarkarasi


The Vehicular Ad hoc Networks (VANETs), certification is an important protection service for together inter-vehicle and vehicle-roadside transportations. The VANET is an invention that utilizes moving vehicles as hubs in a network to make a portable network to give correspondence among vehicles. In this paper proposed a novel framework with preservation and repudiation (ACPN) for VANETs. The proposed ACPN gives the contingent vehicle secrecy to privacy preservation with traceability for the non-repudiation, on the off chance that noxious vehicles manhandle mysterious verification procedures to accomplish pernicious assaults. A RTA produces cryptographic space parameters for the RSUs and vehicles in its district, and conveys these keys to them over secure channels. It deals with a rundown of vehicles of which the investments have been denied, refreshes the rundown intermittently, and promotes the rundown to the network to segregate the traded off vehicles. On the off chance that a vehicle transmits false messages for malevolent purposes out and about, the RTA is in charge of following and distinguishing the wellspring of the messages to determine any debate. RTAs at various locales must be cross-certified. Along these lines, vehicles from various areas or diverse makers can be verified to each other by means of RTAs. Demonstrate the plausibility of ACPN as for the framework investigation on the destinations, for example, validation, privacy preservation, non-repudiation, time limitation, independency, accessibility and joining. In addition, the capacity and calculation over-head of ACPN is assessed by quantitative estimations in the execution assessment.

Full Text:



S.Zeadally et al., “Vehicular Ad Hoc Networks (VANETS): Status, Results, and Challenges,” Telecomm. Systems, vol. 50, no. 4, pp. 217-241, 2012.

F.Li and Y.Wang, “Routing in Vehicular Ad Hoc Networks: A Survey,” IEEE Vehicular Technology Magazine, vol. 2, no. 2, pp. 12- 22, June 2007.

M.Raya and J.Pierre, “Securing Vehicular Ad Hoc Networks,” J. Computer Security, vol. 15, no. 1, pp. 39-68, 2007.

X.Lin, “TSVC: Timed Efficient and Secure Vehicular Communica- tions with Privacy Preserving,” IEEE Trans. Wireless Comm., vol. 7, no. 12, pp. 4987-4998, Dec. 2008.

A.Studer et al., “Flexible, Extensible, and Efficient VANET Authentication,” J. Comm. and Networks, vol. 11, no. 6, pp. 574-588, 2009.

“IEEE 1609 Family of Standards for Wireless Access in Vehicular Environments (WAVE),” U.S. Dept. Transportation, 2009.

N.-W.Wang, Y.-M. Huang, and W.-M. Chen, “A Novel Secure Communication Scheme in Vehicular Ad Hoc Networks,” Com- puter Comm., vol. 31, pp. 2827-2837, 2008.

R.Lu et al., “ECPP: Efficient Conditional Privacy Preservation Protocol for Secure Vehicular Communications,” Proc. IEEE INFOCOM, pp. 1229-1237, 2008.

Y.Sun et al., “An Efficient Pseudonymous Authentication Scheme with Strong Privacy Preservation for Vehicular Communications,” IEEE Trans. Vehicular Technology, vol. 59, no. 7, pp. 3589-3603, Sept. 2010.

P.Kamat, A.Baliga, and W.Trappe, “An Identity-Based Security Framework for VANETs,” Proc. Third Int’l Workshop Vehicular Ad Hoc Networks (VANET), pp. 94-95, 2006.

B.Hoh et al., “Preserving Privacy in GPS Traces via UncertaintyAware Path Cloaking,” Proc. 14th ACM Conf. Computer and Comm. Security (CCS), pp. 161-171, 2009.

J.M.D.Fuentes, A.I.Gonzalez-Tablas, and A.Ribagorda, “Overview of Security Issues in Vehicular Ad-Hoc Networks,” Handbook of Research on Mobility and Computing, pp. 894-911, IGI Global Snippet, 2011.

B.Wu et al., “A survey of attacks and countermeasures in mobile ad hoc networks,” Signals Commun. Technol.-Wireless Netw. Security, pp. 103–135, 2007.

M.Riley, K.Akkaya, and K.Fong, “A Survey of Authentication Schemes for Vehicular Ad Hoc Networks,” Security Comm. Networks, vol. 4, no. 10, pp. 1137-1152, 2011.

R.A. Mollin, “RSA and Public-Key Cryptography,” Discrete Math. and Its Applications. Chapman and Hall/CRC, 2002.

R.L. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978.

J.Patarin, “Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms,” Proc. EUROCRYPT: 15th Ann. Int’l Conf. Theory and Application of Cryptographic Techniques, pp. 33-48, 1996.



  • There are currently no refbacks.

Comments on this article

View all comments

© International Journals of Advanced Research in Computer Science and Software Engineering (IJARCSSE)| All Rights Reserved | Powered by Advance Academic Publisher.