Browse > Article

An Efficient Group Key Management Scheme using Counting Bloom Filter in VANET  

Lee, SuYoun (백석문화대학교 인터넷정보학부)
Ahn, HyoBeom (공주대학교 정보통신공학부)
Publication Information
Convergence Security Journal / v.13, no.4, 2013 , pp. 47-52 More about this Journal
Abstract
VANET(Vehicular Ad-hoc Network) is a kind of ad hoc networks which is consist of intelligence vehicular ad nodes, and has become a hot emerging research project in many fields. It provides traffic safety, cooperative driving and etc. but has also some security problems that can be occurred in general ad hoc networks. In VANET, it has been studies that group signature method for user privacy. However, among a group of group key generation phase and group key update phase, RSU(Road-Side Unit) and the computational overhead of the vehicle occur. In this paper, we propose an efficient group key management techniques with CBF(Counting Bloom Filter). Our group key management method is reduced to the computational overhead of RSU and vehicles at the group key generation and renewal stage. In addition, our method is a technique to update group key itself.
Keywords
VANET; Counting Bloom Filer; Group Key Management;
Citations & Related Records
연도 인용수 순위
  • Reference
1 M..raya and J.Hubaux, "Securing vehicular ad hoc networks," J. of Computer Security, vol. 15, no. 1, pp. 39-68, Jan.2007
2 X. Lin, X. Sun, P,-H, Ho and X. Shen, "GSIS: A Secure and Privacy Preserving Protocol for Vehicular Communications", IEEE Trans, on Vehicular Technology, vol, 56, no.6, pp.3442-3456, 2007.   DOI
3 D. Boneh and H. Shacham,"Group signatures with verifier-local revocation," CCS 2004, pp.168-177 ,2004
4 6. A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Internet Mathematics, 1(4):485-509, 2004.   DOI
5 B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal," The bloomier filter : an efficient data structure for static support lookup tables," in SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (Philadelphia, PA, USA), pp.30-39, Society for Industrial and Applied Mathematics, 2004.
6 B. Chazelle, J. Kilian, R. Rubinfeld, and A. Tal," The bloomier filter : an efficient data structure for static support lookup tables," in SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, (Philadelphia, PA, USA), pp.30-39, Society for Industrial and Applied Mathematics, 2004.
7 B. H. Bloom, "Space/time trade-offs in hash coding with allowable errors," Communications of the ACM, vol.13, pp.422-426, 1970.   DOI