Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical Key Assignment Schemes
Key Indistinguishability vs. Strong Key Indistinguishability for Hierarchical Key Assignment Schemes
复制标题
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Arcangelo Castiglione;A. D. Santis;B. Masucci
中科院分区：
文献类型：
--
作者：
Arcangelo Castiglione;A. D. Santis;B. Masucci
分层密钥分配方案是一种将一些私有信息和加密密钥分配给部分有序层次结构中的一组类的方法，以这种方式，较高类的私有信息可以用于导出层次结构中较低的所有类的密钥。在本文中，我们分析了层次密钥分配方案的安全性，根据不同的概念：安全性方面的密钥不可否认性和对密钥恢复，以及最近提出的两个概念的安全性方面的强密钥不可否认性和对强密钥恢复。我们首先探讨所有的安全概念之间的关系，特别是，我们证明了安全方面的强密钥不可否认性是不强于一个方面的关键不可否认性。之后，我们提出了一个一般的建设产生一个层次的密钥分配方案提供安全性对强密钥恢复，任何层次的密钥分配方案，保证安全对密钥恢复。
A hierarchical key assignment scheme is a method to assign some private information and encryption keys to a set of classes in a partially ordered hierarchy, in such a way that the private information of a higher class can be used to derive the keys of all classes lower down in the hierarchy. In this paper we analyze the security of hierarchical key assignment schemes according to different notions: security with respect to key indistinguishability and against key recovery, as well as the two recently proposed notions of security with respect to strong key indistinguishability and against strong key recovery. We first explore the relations between all security notions and, in particular, we prove that security with respect to strong key indistinguishability is not stronger than the one with respect to key indistinguishability. Afterwards, we propose a general construction yielding a hierarchical key assignment scheme offering security against strong key recovery, given any hierarchical key assignment scheme which guarantees security against key recovery.