SEREK is a practical and efficient encrypted keyword-search protocol for privacy-preserving messaging that combines homomorphic encryption with secure two-party computation (2PC) and achieves 100% accuracy under case variations that result in exact-matching failures, without requiring additional trapdoors or online communication.
Abstract
Encrypted communication protects sensitive user data but can facilitate harmful or unlawful exchanges, creating a trade-off between detecting dangerous messages and preserving end-user privacy. To address this, we propose SEEK, a practical and efficient encrypted keyword-search protocol for privacy-preserving messaging that combines homomorphic encryption with secure two-party computation (2PC). SEEK first partitions messages into ciphertext fragments with the minimum sufficient overlap, then homomorphically correlates them using encrypted keyword trapdoors. For long messages, this design can reduce sender-side encryption and upload overhead by up to two orders of magnitude over state-of-the-art baselines. It supports ASCII case-insensitive matching with one fixed-size encrypted trapdoor and one homomorphic multiplication per fragment, yielding up to 5.47x faster correlation computation than the strongest fragmentation-based baselines. SEEK then invokes 2PC-based selected decoding, blinded zero testing, and secure aggregation, revealing only the keyword presence-or-absence bit while hiding the keyword, its length, message contents, match counts, and locations. SEEK achieves 100% accuracy under case variations that result in exact-matching failures, without requiring additional trapdoors or online communication. We further realize SEEK as an end-to-end web and cross-platform mobile application. Prototype evaluation on a weekly messaging history yields an online computation time of 1.92 s per search, demonstrating the practical feasibility and efficiency of SEEK.
This scheme enables authorized recipients to securely recover the data encryption keys and decrypt the shared ciphertexts, thereby enabling flexible granting and revocation of search capabilities without re‐encrypting the stored data.
Rui-Jie Dong, Rang Zhou, Hui Zhang· Security and Privacy· 0 citations
A privacy-preserving, secure data-sharing framework tailored for edge-cloud collaborative architectures that minimizes the computational overhead on the terminal side while safeguarding user privacy, and effectively reduces the overhead associated with user joining and revocation within the same group.
Qi-Kun Zhang, Zheng Cai, Jinbo Feng et al.· Journal of King Saud Univers...· 0 citations
This work proposes a practical Ring Learning with Errors (Ring-LWE) public-key encryption scheme supporting public re-randomization without ciphertext growth.
D. Vodenicarevic, Andrei Fleiser, Pierre Seznec et al.· Journal of Cryptographic Eng...· 1 citation
The ABE-EKS framework is revisits and the proposed construction is adapted to the Type-3 pairing setting, which supports expressive access-control and keyword-search policies, Boolean keyword predicates, inequality comparisons, and trapdoor key delegation.
Koon-Ming Chan, Swee-Huay Heng, Syh-Yuan Tan et al.· Cryptography· 0 citations
These results quantify the performance distinction between the lower-latency KR-PEKS mode and the sender-authenticated searchable encryption provided by KR-PAEKS.