@inproceedings{oai:ynu.repo.nii.ac.jp:02001033,
 author = {Hyungrok, Jo and Junji, Shikata},
 book = {Information Security Applications : 24th International Conference, WISA 2023, Jeju Island, South Korea, August 23–25, 2023, Revised Selected Papers},
 month = {Jan, Jan},
 note = {A Bloom filter, originally proposed by Bloom in 1970, is a probabilistic data structure used to determine membership in a set with enduring false positive errors. Due to the trade-off between space efficiency and the probability of false positive errors, Bloom filters have found numerous applications in network systems and various fields of information sciences. Chazelle et al. [6] extended this concept to a more versatile data structure known as the Bloomier filter, capable of encoding arbitrary functions. With Bloomier filters, it becomes possible to associate values with specific elements of the domain, enabling more generalized use. In this paper, we propose a variant of Charles and Chellapilla’s scheme [5] that utilizes minimal perfect hashings. Specifically, instead of using bipartite random graphs like existing Bloomier filters, we present a space-efficient Bloomier filter with faster creation time based on an analysis of 3-hypergraphs, in comparison to previous results., Information Security Applications 24th International Conference, WISA 2023, Jeju Island, South Korea, August 23–25, 2023,},
 pages = {16--26},
 publisher = {Springer},
 title = {Bloomier Filters on 3-Hypergraphs},
 year = {2024, 2024}
}