Convergence Security Journal (융합보안논문지)

Korea convergence Security Association (한국융합보안학회)
권호 표지

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

VANET에서 카운팅 블룸 필터를 사용한 효율적인 그룹 키 관리 기법

  • 이수연 (백석문화대학교 인터넷정보학부) ;
  • 안효범 (공주대학교 정보통신공학부)
  • Received : 2013.09.03
  • Accepted : 2013.09.23
  • Published : 2013.09.30
Download PDF
⟨ Previous Next ⟩

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.

VANET(Vehicular Ad-hoc Network)은 원활한 교통 소통, 사고 방지 등 여러 가지 편리한 기능들을 제공하지만 그 기반을 애드혹 네트워크에 두고 있기 때문에 애드혹 망에서 발생하는 보안 문제를 가지고 있다. VANET에서 사용자의 프라이버시를 보호하기 위해 그룹 서명방식 등이 연구되어졌다. 그러나 그룹 간에 그룹 키 생성 단계 및 그룹 키 갱신단계에서 RSU(Road-Side Unit) 및 차량의 계산상 오버헤드가 발생한다. 본 논문에서는 효율적인 그룹 키 관리 기술을 제안한다. 즉, 그룹 키 생성 및 갱신 단계에서 CBF(Counting Bloom Filter)를 사용하므로 RSU 및 차량의 계산상 오버헤드를 감소시킨다. 또한, RSU와 차량에서 그룹 키를 자체적으로 갱신하여 관리하는 기법이다.

Keywords

References

  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. https://doi.org/10.1109/TVT.2007.906878
  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. https://doi.org/10.1080/15427951.2004.10129096
  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. https://doi.org/10.1145/362686.362692