Public key encryption with keyword search (PEKS) allows users to search on encrypted data without leaking the keyword information from the ciphertexts. But it does not preserve keyword privacy within the trapdoors, because an adversary (e.g., untrusted server) might launch inside keyword-guessing attacks (IKGA) to guess keywords from the trapdoors. In recent years, public key authenticated encryption with keyword search (PAEKS) has become a promising primitive to counter the IKGA. However, existing PAEKS schemes focus on the concrete construction of PAEKS, making them unable to support modular construction, intuitive proof, or flexible extension. In this paper, our proposal called “StopGuess” is the first elegant framework to achieve the above-mentioned features. StopGuess provides a general solution to eliminate IKGA, and we can construct a bundle of PAEKS schemes from different cryptographic assumptions under the framework. To show its feasibility, we present two generic constructions of PAEKS and their (pairing-based and lattice-based) instantiations in a significantly simpler and more modular manner. Besides, without additional costs, we extend PAEKS to achieve anonymity which preserves the identity of users; we integrate it with symmetric encryption to support data retrieval functionality which makes it practical in resource-constrained applications.

带关键字搜索的公钥加密 (PEKS) 允许用户搜索加密数据，而不会泄露密文中的关键字信息。但它不能保护陷门内的关键字隐私，因为对手（例如，不受信任的服务器）可能会发起内部关键字猜测攻击（IKGA）以从陷门中猜测关键字。近年来，带有关键字搜索的公钥认证加密（PAEKS）已成为对抗 IKGA 的一种有前途的原语。然而，现有的PAEKS方案侧重于PAEKS的具体构建，使得它们无法支持模块化构建、直观证明或灵活扩展。在本文中，我们的提案“StopGuess”是第一个实现上述功能的优雅框架。StopGuess提供了消除IKGA的通用解决方案，我们可以在该框架下根据不同的密码学假设构建一系列PAEKS方案。为了证明其可行性，我们以更简单、更模块化的方式提出了 PAEKS 的两种通用结构及其（基于配对和基于格的）实例。此外，在不增加成本的情况下，我们扩展PAEKS以实现匿名，从而保留用户的身份；我们将其与对称加密集成以支持数据检索功能，这使其在资源受限的应用程序中实用。