标准模型下的带关键词搜索的广播认证加密：多用户、多挑战场景下的紧安全
A Broadcast Authenticated Encryption with Keyword Search in the Standard Model: Tightly Secure in Multi-User, Multi-Challenge Settings
查看机构详情
- Indian Institute of Technology, Jammu（印度理工学院詹穆分校）
机构由 AI 辅助整理，请以论文原文为准。
浏览论文内容
中文总结 AI 辅助
针对多用户、多挑战场景，提出BAEKS的安全定义与构造，基于MDDH假设实现紧安全，限制后得PAEKS，经实验验证，解决了现有方案未考虑现实场景功能需求的问题。
中文摘要 AI 辅助
然而，尚无已知工作在最现实的场景中考虑该功能需求。我们提出了多用户（含自适应腐败）和多挑战（以交错方式同时针对密文和陷门）场景下BAEKS的新安全定义，还研究了BAEKS的不可伪造性问题，实际上，我们的强隐藏要求已隐含了大量不可伪造性。随后，我们在双线性配对群中提出了新的BAEKS构造，证明该方案在（几乎）标准MDDH假设下实现了自适应紧全隐藏安全；将此BAEKS构造限制为单接收者模式，还得到了高效且紧安全的PAEKS构造，我们进一步运行实验以实现并评估该方案。
英文摘要
However, no known work considered the functionality requirement in its most realistic setting. We propose a new security definition of BAEKS in the multi-user (with adaptive corruptions) and multi-challenge (both in terms of ciphertext and trapdoor in an interleaved manner) settings. We also study the question of the unforgeability of BAEKS. In fact, our strong hiding requirement already implies a significant amount of unforgeability. We then propose a new BAEKS construction in the bilinear pairing groups. We prove this scheme achieves adaptive tight full-hiding security under (almost) standard MDDH assumptions. Restricting our BAEKS construction for a single receiver also gives an efficient and tightly secure PAEKS construction. We further run experiments to implement and evaluate our scheme.
