arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.01382cs.CRcs.DS
收藏

基于链的信息流策略密码执行的优化构造

Optimal Constructions for Chain-based Cryptographic Enforcement of Information Flow Policies

Jason Crampton, Naomi Farley, Gregory Gutin, Mark Jones

摘要:

信息流策略中的简单安全属性可以通过加密数据对象并向每个用户分发适当的秘密来实施。用户从秘密和公开可用的信息中导出合适的解密密钥。基于链的实施方案提供了一种不需要任何公共信息的加密实施的替代方法,其代价是用户可能需要多个秘密。对于给定的信息流策略,将存在许多不同的可能的基于链的实施方案。在本文中,我们提供了一个多项式时间算法选择一个基于链的计划,使用尽可能少的密钥。我们还计算了所需的秘密数量,并建立了任何用户所需的秘密数量的上限。

英文摘要:

The simple security property in an information flow policy can be enforced by encrypting data objects and distributing an appropriate secret to each user. A user derives a suitable decryption key from the secret and publicly available information. A chain-based enforcement scheme provides an alternative method of cryptographic enforcement that does not require any public information, the trade-off being that a user may require more than one secret. For a given information flow policy, there will be many different possible chain-based enforcement schemes. In this paper, we provide a polynomial-time algorithm for selecting a chain-based scheme which uses the minimum possible number of keys. We also compute the number of secrets that will be required and establish an upper bound on the number of secrets required by any user.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑