Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
Design of Simple and Efficient Revocation List Distribution in Urban Areas for VANET’s

Design of Simple and Efficient Revocation List Distribution in Urban Areas for VANET’s

Ratings: (0)|Views: 20 |Likes:
Published by ijcsis
Vehicular Ad hoc Networks is one of the most challenging research area in the field of Mobile Ad Hoc Networks, in this research we propose a flexible, simple, and scalable design for revocation list distribution in VANET, which will reduce channel overhead and eliminate the use of CRL. Also it will increase the security of the network and helps in identifying the adversary vehicles. We are proposing an idea for using geographical revocation information, and how to distribute it.
Vehicular Ad hoc Networks is one of the most challenging research area in the field of Mobile Ad Hoc Networks, in this research we propose a flexible, simple, and scalable design for revocation list distribution in VANET, which will reduce channel overhead and eliminate the use of CRL. Also it will increase the security of the network and helps in identifying the adversary vehicles. We are proposing an idea for using geographical revocation information, and how to distribute it.

More info:

Published by: ijcsis on Jun 30, 2010
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/12/2014

pdf

text

original

 
Design of Simple and Efficient Revocation List
Distribution in Urban areas for VANET’s
 
Ghassan Samara , Sureswaran Ramadas Wafaa A.H. Al-Salihy
National Advanced IPv6 Center, Universiti Sains Malaysia School of Computer Science, Universiti Sains MalaysiaPenang, Malaysia Penang, Malaysia
,
 
sures@nav6.orgwafaa@cs.usm.my
 Abstract-
Vehicular Ad hoc Networks is one of the mostchallenging research area in the field of Mobile AdHoc Networks, in this research we propose a flexible,simple, and scalable design for revocation listdistribution in VANET, which will reduce channeloverhead and eliminate the use of CRL. Also it willincrease the security of the network and helps inidentifying the adversary vehicles.We are proposing an idea for using geographicalrevocation information, and how to distribute it.
 Keywords- VANET, Certificate Distribution, CRL,Cluster, Neighbour Cluster Certificate List.
I.
 
I
NTRODUCTION
 VANET security has gained the most researchefforts in the past years; Certificate plays animportant role in network communication, any node
in the network can’t participate in the netw
ork without appropriate certificate, certificatedistribution is a tough task as a lot of considerationsappear like Processing overhead, network overhead,privacy etc.Dealing with certificate raises other important issuewhich is certificate revocation list (CRL) that causesnetwork overhead in VANET, a CRL is a listcontaining the serial numbers of all certificatesissued by a given certification authority (CA) thathave been revoked and have not yet expired. CRLmakes overhead and expensive to use especially inhigh mobile network.In this paper we concerned with certificaterevocation distribution, how to protect system fromadversary vehicles, how to distribute informationabout adversary vehicles (Revocation List), in sec. 2we analyze the current research efforts in area of VANET certificates, in sec. 3 we are addressing ourproposed network that contains solutions for currentsystem.II.
 
A
NALYSIS OF RELEVANT RESEARCH AREA
:CRL is the most and common solution for certificaterevocation and management, many papers tried toadapt the CRL solutions.Efforts made by [1] aiming to reduce the CRL byusing regional CA and using short lived certificatesfor traveling vehicles called FC, these certificatesmust be used in foreign territory and must be trackedand initiated by home CA, this solution needs to beused for large geographical area, like countries, butin this case the CRL will be huge, and if the area is
smaller, many CF’s will be created, and the tracking
will be costly, the result obtained by the author
thedistribution of CRL requires tens of minutes
”,
whichis too long time for a high and dense network likeVANET, the authors in [2] proposed an idea to easydisseminate the CRL, by deploying C2Ccommunication for distributing CRL, this will makefaster distribution, but still CRL has a huge size andrequire time and processing complexity to search in,another work in [3] , made many experiments on thesize of CRL and how to distribute the CRL in theVANET network, the result says, when the size of CRL is high, the delay time for receiving it will behigh, another idea proposed in [4] says that CRL willstore entries for less than one year, this idea used todecrease the size of CRL, but still suffer from hugesize, while Authors in [6] suggested a way toincrease the search in CRL by using Bloom filter, theproblem of bloom filter as it is probabilistic function,and may give wrong information, as the certificatemay not be in the list, and the result that thecertificate is in the list.The authors in [7] proposed the use of Bloom filterto store the revoked certificate, and dedicate the CRL just to sign the revocation key for each vehicle, theuse for Bloom filter will increase the speed forsearching in it, but still the idea is to use the CRL.The p
revious work and efforts didn’t eliminate the
Problems of CRL like Huge size, no central databasefor it, Channel, communication and processingoverhead.Authors in [7] proposed that each vehicle must bestored with approximately 25000 certificates, if eachcertificate has 100 bytes; you can imagine the size of CRL when revoking the information for just onevehicle, and how much time required for search in it.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 1, April 2010151http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
Authors in [9] introduce the use of temporarycertificates and credentials for each geographic areaso any new vehicle will not find any difficulty forcommunicating with current network, by creating
new certificates and ID’s,
but this solution requires adedicated work from CA to create and revokecertificates for each new coming and leaving vehicle.III.
 
P
ROPOSED
N
ETWORK
 Each vehicle equipped with Tamper proof device(TPD) which contains a set of private/ public keythat must be used for any communication in VANETnetwork, these keys provided by Central CertificateAuthority (CCA), each CCA is responsible fornumber of Local Certificate Authority (LCA) locatedin cluster [8], Each LCA is responsible for a specificcluster and its Road Side Units (RSU), TPD alsocontains certificate for ensuring the identity of thevehicle and allowing the vehicle to communicate.The idea is to use geographical information forcertificate, each 4 KM2 will be treated as a cluster,this cluster contains LCA, this LCA has the wholeinformation about it is cluster, and especially therevocation information for all the vehicle that travelsin this cluster, this information is collected fromRSU located in this cluster, and from another L
CA’s
located in neighbor clusters, see figure 1.Each LCA transmit its Local Cluster Certificate List(LCCL) that contains the revoked certificates from
its cluster to all nearest RSU’s that surround the
Local Certificate Authority (LCA), every minute, thelist is small as it contains just the revoked certificatefrom that cluster, so transmission is fast and notransmission overhead is produced.Each RSU contains two lists, first list is LCCL fromLCA of the cluster that RSU belongs to, this list isinserted into every incoming vehicle as a revocationlist, second list comes from neighbor LCA and calledNeighbor Cluster Certificate List (NCCL), and isused to be searched in by the RSU when new vehiclearrives at the border of the cluster to know if theincoming vehicle is adversary or not.The size of LCCL is quite small and will not exceedfew KB, while the size for CRL holding revocationinformation for just one vehicle will exceed 2 MB [7]
 A.
 
The protocol:
Each incoming vehicle to the road or to the cluster,
will interact with RSU, RSU’s will be located in the
beginning of each road/ cluster and on importantintersections as
“cluster 
guard
“,
and will be put ontraffic light, stop sign or street columns etc., theincoming vehicle must slow its speed, as it crossingan intersection, this will give the RSU theopportunity to interact with the incoming vehicle,the communication is very fast, and happened asfollows:1-
 
RSU takes the Public Key (PK) andcertificate of the vehicle.2-
 
RSU insert its PK, Cluster Signature andupdates the vehicle LCCL with the new onefor the current cluster.3-
 
RSU searches for the certificate in NCCL,to make sure that if the vehicle is adversaryor not.
Fig. 2: new vehicle arrives.
1-RSU takes PK and certificate of new vehicle2- RSU insert its PK and LCCL andCluster Signature.3- RSU search in NL for vehiclecertificate4- if certificate in NCCL informlocal and neighbor LCA
Fig. 1: Local CA Structure.
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 1, April 2010152http://sites.google.com/site/ijcsis/ISSN 1947-5500
 
 4-
 
If the certificate in NCCL, RSU will sends Addmessage to current LCA to add this adversary tolocal LCCL and sends Remove message to neighborLCA that vehicle come from to remove that vehiclefrom its LCCL, see figure 2, 3 and 4.
 
5-
 
Each LCA transmits the LCCL every one minute,but if it receives an Add request from RSU, it willadd the certificate to LCCL, LCA may receive morethan Add request from more than one RSU in thesame cluster, after adding new certificates toLCCL, LCA sends the updated LCCL to whole
Fig. 4: Neighbor Cluster.Fig. 3: the Cluster
(IJCSIS) International Journal of Computer Science and Information Security,Vol. 8, No. 1, April 2010153http://sites.google.com/site/ijcsis/ISSN 1947-5500

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->