Abstract

Plaintext-checkable encryption (PCE) can support searches over ciphertext by directly using plaintext. The functionality of a search is modeled by a specific check algorithm that takes a pair of target plaintext and ciphertext as input and returns 1 if the correct decryption result of the ciphertext is identical to the target plaintext. A trivial solution is to use an existing scheme (e.g., deterministic RSA) to achieve this, but there is no security guarantee with this method. Previous rigorous works have either relied on some mathematical structures to build PCE that can proven in the standard model or can be generic, as in the random oracle model. Hence, in this work, we aim to construct PCE that can be proven in the standard model by using standard primitives in a modular way in two steps. The first step is to present a warm-up construction of PCE from hash garbling and hash functions whose security is only proven in the random oracle model. The second step is to provide a full-fledged construction based on the warm-up, with slight modifications for achieving security in the standard model. Finally, we show the feasibility of the proposed construction through experiments.

中文翻译：

---

标准模型中明文可检查加密的概念上简单且通用的构造

摘要

明文可查加密（PCE）可以支持直接使用明文对密文进行搜索。搜索的功能由特定的检查算法建模，该算法将一对目标明文和密文作为输入，如果密文的正确解密结果与目标明文相同，则返回 1。一个简单的解决方案是使用现有的方案（例如，确定性RSA）来实现这一点，但这种方法没有安全保证。以前的严格工作要么依赖于一些数学结构来构建可以在标准模型中证明的PCE，要么可以是通用的，如随机预言模型。因此，在这项工作中，我们的目标是通过使用标准原语以模块化方式分两步构建可以在标准模型中证明的PCE。第一步是从哈希混淆和哈希函数中提出 PCE 的预热构造，其安全性仅在随机预言模型中得到证明。第二步是在预热的基础上提供成熟的构造，并稍加修改以实现标准模型中的安全性。最后，我们通过实验证明了所提出的结构的可行性。