SEEK: Secure and Efficient Encrypted Keyword Search For Privacy-Preserving Messaging Protocols
Researchers propose SEEK, a homomorphic-encryption plus 2PC protocol for encrypted keyword search that hides keywords while detecting matches.
SEEK partitions messages into ciphertext fragments with minimum sufficient overlap and homomorphically correlates them using encrypted keyword trapdoors, combined with 2PC-based selected decoding, blinded zero testing, and secure aggregation. It reduces sender-side encryption and upload overhead by up to two orders of magnitude over state-of-the-art baselines and computes correlations up to 5.47x faster, revealing only the keyword presence bit while hiding contents, counts, and locations. A prototype achieves 1.92 seconds online computation per search on a weekly messaging history and is realized as a web and cross-platform mobile application.
- Combines homomorphic encryption with two-party computation for keyword search
- Cuts sender-side encryption and upload overhead by up to two orders of magnitude
- Reveals only match presence, hiding keyword, contents, counts, and locations
- Achieves 100% accuracy under case variations with 1.92 s per search
From the original article
1 min read at arxiv.orgEncrypted 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).
By Soumyadyuti Ghosh · arxiv.org
A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.