USENIX Security2026Top-tier venue
SophOMR: Improved Oblivious Message Retrieval from SIMD-Aware Homomorphic Compression
Keewoo Lee, Yongdong Yeo
Abstract
Privacy-preserving blockchains and private messaging services that ensure receiver-privacy face a significant UX challenge: each client must scan every payload posted on the public bulletin board to avoid missing messages intended for them. Oblivious Message Retrieval (OMR) addresses this issue by securely outsourcing this expensive scanning process to a service provider using Homomorphic Encryption (HE).
In this work, we propose a new OMR scheme that substantially improves upon the previous state-of-the-art, PerfOMR (USENIX Security'24). Our implementation demonstrates reductions of 3.4x in runtime, 2.2x in digest size, and 1.5x in key size, in a scenario with 65536 payloads (each 612 bytes), of which up to 50 are pertinent. At the core of these improvements is a new homomorphic compression mechanism, where ciphertexts of length proportional to the number of total payloads are compressed into a digest whose length is proportional to the upper bound on the number of pertinent payloads. Unlike previous approaches, our scheme fully exploits the native homomorphic SIMD structure of the underlying HE scheme, significantly enhancing efficiency. In the setting described above, our compression scheme achieves 7.5x speedup compared to PerfOMR.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers2
- PerfOMR: Oblivious Message Retrieval with Reduced Communication and ComputationZeyu Liu, Eran Tromer, Yunhao WangUSENIX Security 2024 · 16 citations
- Oblivious SignalingMirza Kamrul Bashar Shuhan, Foteini Baldimtsi, Giuseppe AtenieseUSENIX Security 2026
Builds on14
- GAZELLE: A Low Latency Framework for Secure Neural Network InferenceChiraag Juvekar, Vinod Vaikuntanathan, Anantha P. ChandrakasanUSENIX Security 2018 · 1,075 citations
- PIR with Compressed Queries and Amortized Query ProcessingSebastian Angel, Hao Chen, Kim Laine, Srinath T. V. SettyS&P 2018 · 353 citations
- Efficient Multi-Key Homomorphic Encryption with Packed Ciphertexts with Application to Oblivious Neural Network InferenceHao Chen, Wei Dai, Miran Kim, Yongsoo SongCCS 2019 · 235 citations
- PEGASUS: Bridging Polynomial and Non-polynomial Evaluations in Homomorphic EncryptionWen-jie Lu, Zhicong Huang, Cheng Hong, Yiping Ma et al.S&P 2021 · 139 citations
- Oblivious Message RetrievalZeyu Liu, Eran TromerCRYPTO 2022 · 28 citations
Related papers
- InstantOMR: Oblivious Message Retrieval with Low Latency and Optimal ParallelizabilityHaofei Liang, Zeyu Liu, Eran Tromer, Xiang Xie et al.USENIX Security 2026
- Group Oblivious Message RetrievalZeyu Liu, Eran Tromer, Yunhao WangS&P 2024 · 24 citations
- HomeRun: High-efficiency Oblivious Message Retrieval, UnrestrictedYanxue Jia, Varun Madathil, Aniket KateCCS 2024 · 8 citations
- StOMR: Stateful Oblivious Message RetrievalCharles Gouert, Keewoo Lee, Dimitris Mouris, Yiannis Tselekounis et al.CCS 2026
- UnifOMR: Oblivious Message Retrieval with Near-optimal Concrete EfficiencyBen Fisch, Zeyu Liu, Eran Tromer, Yunhao WangCCS 2026
