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

关于密钥的压缩

On Compression of Cryptographic Keys

Aldar C-F. Chan

摘要:

任何安全系统都可以被建模为基于能力的访问控制系统,在该系统中,每个用户都被赋予一组他被授予访问权限的资源的密钥。在一些具有资源受限设备的大型系统中,例如传感器网络和RFID系统,设计对存储器或密钥存储成本敏感。以最小化用户的密钥存储量为目标,研究了基于密钥链接的密钥压缩,即在不影响安全性的前提下从一个密钥导出另一个密钥。导出了具有密钥导出的一般访问结构所需的密钥存储的下界。这个界证明了任何不权衡安全性的系统的理论极限,并且可以被视为负面结果,从而为安全权衡的设计提供基础。给出了一个基于伪随机函数的可证明安全的密钥链接方案。利用密钥链接框架,分析了文献中的一些密钥预分配方案。

英文摘要:

Any secured system can be modeled as a capability-based access control system in which each user is given a set of secret keys of the resources he is granted access to. In some large systems with resource-constrained devices, such as sensor networks and RFID systems, the design is sensitive to memory or key storage cost. With a goal to minimize the maximum users' key storage, key compression based on key linking, that is, deriving one key from another without compromising security, is studied. A lower bound on key storage needed for a general access structure with key derivation is derived. This bound demonstrates the theoretic limit of any systems which do not trade off security and can be treated as a negative result to provide ground for designs with security tradeoff. A concrete, provably secure key linking scheme based on pseudorandom functions is given. Using the key linking framework, a number of key pre-distribution schemes in the literature are analyzed.

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

↑