On Message Length Efficiency of Two Security Schemes using Bloom Filter


The KIPS Transactions:PartC, Vol. 19, No. 3, pp. 173-178, Jun. 2012
10.3745/KIPSTC.2012.19.3.173,   PDF Download:

Abstract

Recent two security schemes showed that a bloom filter can reduce a message length required for representing multiple MACs. The schemes, however, made message length comparison without considering security level. Since the MAC is intended for security, it is important to let multiple MACs and the bloom filter have the same level of security for making message length comparison. In this paper, we analyze the message length efficiency of bloom filter, compressed bloom filter and multiple MACs, letting them have the same security level.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
Y. J. Maeng, J. I. Kang, D. H. Nyang, K. H. Lee, "On Message Length Efficiency of Two Security Schemes using Bloom Filter," The KIPS Transactions:PartC, vol. 19, no. 3, pp. 173-178, 2012. DOI: 10.3745/KIPSTC.2012.19.3.173.

[ACM Style]
Young Jae Maeng, Jeon Il Kang, Dae Hun Nyang, and Kyung Hee Lee. 2012. On Message Length Efficiency of Two Security Schemes using Bloom Filter. The KIPS Transactions:PartC, 19, 3, (2012), 173-178. DOI: 10.3745/KIPSTC.2012.19.3.173.