한국정보보호학회:학술대회논문집 (Proceedings of the Korea Institutes of Information Security and Cryptology Conference)

한국정보보호학회 (Korea Institute of Information Security and Cryptology)
권호 표지

블룸 필터를 이용한 다수의 메시지 인증코드의 표현

Representation of Multiple Message Authentication Codes using Bloom Filters

  • 손주형 (서울대학교 전기, 컴퓨터 공학부) ;
  • 서승우 (서울대학교 전기, 컴퓨터 공학부) ;
  • 강유 (KT연구소 정보보호단) ;
  • 최진기 (KT연구소 정보보호단) ;
  • 문호건 (KT연구소 정보보호단) ;
  • 이명수 (KT연구소 정보보호단)
  • Son Ju-Hyung (School of EECS, Seoul National University) ;
  • Seo Seung-Woo (School of EECS, Seoul National University) ;
  • Kang Yu (KT Information Security Center, Korea Telecom.) ;
  • Choe Jin-Gi (KT Information Security Center, Korea Telecom.) ;
  • Moon Ho-Kun (KT Information Security Center, Korea Telecom.) ;
  • Lee Myuong-Soo (KT Information Security Center, Korea Telecom.)
  • 발행 : 2006.06.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

Multiple Message Authentication Codes can be represented by one of the Short MAC, Bloom Filter or Compressed Bloom Filler to reduce communication overheads. However, this will inevitably increase false positive rate (fpr) which is a false authentication probability of adversarial messages in trade-off of communication efficiency. While the simple short MAC scheme has the lowest fpr, one cannot choose arbitrary authenticator size. Bloom filter, randomized data structure often used for membership queries, can represent multiple MACs more flexibly with slightly higher fpr. Furthermore, compressed Bloom filter has the same fpr with the short MAC while maintaining its flexibility. Through our detailed analysis, we show that pros and cons of the three schemes are scenario specific. Therefore one can choose appropriate scheme under given parameters to achieve both communication efficiency and security based on our results.

키워드