返回
Constructing cascade bloom filters for efficient access enforcement
DOI:10.1016/j.cose.2018.09.015.png)
摘要
En 中文
We address access enforcement - the process of determining whether a request for access to a resource by a principal should be granted. While access enforcement is essential to security, it must not unduly impact performance. Consequently, we address the issue of time and space-efficient access enforcement, and in particular, study a particular data structure, the Cascade Bloom filter, in this context. The Cascade Bloom filter is a generalization of the well-known Bloom filter, which is used for time- and space-efficient membership-checking in a set, while allowing for a non-zero probability of false positives. We consider the problems, in practice, of constructing Bloom, and Cascade Bloom filters, with our particular application, access enforcement, in mind. We identify the computational complexity of the underlying problems, and propose concrete algorithms to construct instances of the data structures. We have implemented our algorithms, and conducted empirical assessments, which also we discuss in this paper. Our code is available for public download. As such, our work is a contribution to efficient access enforcement. (C) 2018 Elsevier Ltd. All rights reserved.
Keyword:
PROTECTION
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
5.4
论文数:
4.6K
被引数:
1.4W
机构
引用论文
A whitelist-based countermeasure scheme using a Bloom filter against SIP flooding attacks
COMPUTERS & SECURITY
IF5.4
Cancelable multi-biometrics: Mixing iris-codes based on adaptive bloom filters
COMPUTERS & SECURITY
IF5.4
Providing robust security measures to Bloom filter based biometric template protection schemes
COMPUTERS & SECURITY
IF5.4
没有更多内容

