发表机构
Indian Institute of Technology Jammu（詹穆印度理工学院）
机构由 AI 辅助整理，请以论文原文为准。AI 中文总结
针对现有大宇宙子集谓词加密缺乏CCA安全且密文或密钥非恒定大小的问题，提出首个常数大小密文和密钥的CCA安全构造，并黑盒转换为CCA安全的WIBE等原语。
AI 中文摘要
Katz等人（CANS'17）引入了子集谓词加密（SPE）。该方案是广播加密的推广，因为它在加密域中模拟了子集包含谓词。他们提出了两种在小宇宙设置下选择性IND-CPA安全的SPE构造。他们还展示了SPE到已知原语（如WIBE和ABE）的一些黑盒转换，以确立SPE结构的丰富性。Chatterjee和Mukherjee（RSA'19）提出了两种在大宇宙设置下的SPE构造。他们的第一种构造实现了常数大小的密文和秘密密钥，但仅在选择性安全的一个受限版本下被证明安全。尽管第二种构造实现了自适应安全性，但密文大小依赖于数据属性集的大小。此外，这两种构造都没有实现CCA安全性。在这项工作中，我们提出了第一个具有常数大小密文和密钥的大宇宙CCA安全子集谓词加密。我们证明该构造在标准子群决策问题下实现了标准选择性安全。最后，我们通过黑盒转换将我们极其高效的SPE转换为第一个具有常数大小密文和密钥的CCA安全WIBE、WKD-IBE等。
英文摘要
Katz et al. (CANS'17) introduced Subset Predicate Encryption (SPE). This scheme is a generalization of broadcast encryption as it emulates the \emph{subset containment} predicate in the encrypted domain. They proposed two selectively IND-CPA secure SPE constructions in the small universe setting. They also showed some black-box transformations of SPE to well-known primitives like WIBE and ABE to establish the richness of the SPE structure. Chatterjee and Mukherjee (RSA'19) proposed two SPE constructions in the large-universe setting. Their first construction achieved constant-size ciphertexts and secret keys, but it is proven secure in a restricted version of selective security. Although the second construction achieves adaptive security, the ciphertext size depends on the size of the data-attribute set. Furthermore, neither of these two constructions achieves CCA security. In this work, we propose the first large-universe CCA-secure subset predicate encryption with constant-size ciphertext and secret keys. We prove this construction achieves standard selective security under the standard subgroup decision problems. Finally, we transform our extremely efficient SPE into the first CCA-secure WIBE, WKD-IBE, etc., with constant-size ciphertexts and secret keys via black-box transformations.
