Recently, Yang et al. introduced an efficient searchable encryption scheme titled "Dynamic Consensus Committee-Based for Secure Data Sharing With Authorized Multi-Receiver Searchable Encryption (DCC-SE)," published in IEEE Transactions on Information Forensics and Security (DOI: 10.1109/TIFS.2023.3305183). According to the authors, DCC-SE meets various security requirements, especially the keyword trapdoor indistinguishability against chosen keyword attacks (KT-IND-CKA). In this letter, however, we reveal a significant vulnerability of DCC-SE: any users involved in the system can execute attacks against KT-IND-CKA security. This flaw potentially results in the unintended disclosure of sensitive keyword information related to the documents. We present a detailed cryptanalysis on DCC-SE. In addition, to address this vulnerability, we discuss the root cause and identify a flaw in the security proof of DCC-SE. Subsequently, we provide a solution that effectively addresses this concern without significantly increasing computational overhead.

翻译：最近，Yang等人提出了一种高效的可搜索加密方案，题为“基于动态共识委员会的多接收者授权可搜索加密安全数据共享（DCC-SE）”，发表于《IEEE信息取证与安全汇刊》（DOI: 10.1109/TIFS.2023.3305183）。据作者所述，DCC-SE能够满足多项安全要求，尤其是针对选择关键词攻击的关键词陷门不可区分性（KT-IND-CKA）。然而，在本评述中，我们揭示了DCC-SE的一个重大漏洞：系统中任意用户均可对KT-IND-CKA安全性发起攻击。该缺陷可能导致与文档相关的敏感关键词信息意外泄露。我们对DCC-SE进行了详细的密码分析。此外，为应对这一漏洞，我们探讨了其根本原因，并指认了DCC-SE安全证明中的缺陷。随后，我们提出了一种解决方案，该方案在未显著增加计算开销的前提下有效解决了该问题。