Constructions of Unconditionally Secure Broadcast Encryption from Key Predistribution Systems with Trade-offs between Communication and Storage
Constructions of Unconditionally Secure Broadcast Encryption from Key Predistribution Systems with Trade-offs between Communication and Storage
复制标题
权衡通信与存储的密钥预分配系统无条件安全广播加密的构建
DOI：
10.1007/978-3-319-26059-4_27
复制
发表时间：
2015
期刊：
影响因子：
--
通讯作者：
J. Shikata
中科院分区：
文献类型：
--
作者：
Y. Watanabe;J. Shikata
一次性安全广播加密方案（BESs）允许发送方指定接收者的任意子集，以便只有指定的接收者才能解密密文。在本文中，我们首先展示了具有一般密文大小的BES的有效构造。具体来说，当密文大小等于明文大小的整数倍时，我们提出了密钥预分发系统BES的通用结构，并且我们的结构包括所有已知的结构。然而，在我们的构建方法中，有许多可能的kpi组合来实现BES，因此，我们展示了哪种组合是最好的，因为秘钥大小可以最小化。对具有任何密文大小的一次性安全BES所需的密钥大小进行严格约束仍然是一个有待解决的问题。我们的结果还意味着我们首先显示了一般密文大小的密钥大小的上界。
An-one-time secure broadcast encryption schemes (BESs) allows a sender to specifyanysubset of receivers so that only the specified recievers can decrypt a ciphertext. In this paper, we first show an efficient construction of a BES with general ciphertext sizes. Specifically, we propose a generic construction of a BES from key predistribution systems (KPSs) when its ciphertext size is equal to integer multiple of the plaintext size, and our construction includes all known constructions. However, there are many possible combinations of the KPSs to realize the BES in our construction methodology, and therefore, we show that which combination is the best one in the sense that secret-key size can be minimized.Deriving a tight bound on the secret-key size required for-one-time secure BES with any ciphertext size still remains an open problem.Our result also means that we first show an upper bound on the size of secret keys for general ciphertext sizes.