REPRESENTATION OF MULTIPLE MESSAGE AUTHENTICATION CODES USING BLOOM FILTERS

Multiple Message Authentication Codes can be represented by one of theShort MAC, Bloom Filter or Compressed Bloom Filter to reduce communication overheads. However, this will inevitably increasefalse 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.