Oblivious Linear Group Actions and Applications
Nuttapong Attrapadung, Goichiro Hanaoka, Takahiro Matsuda, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt, Tadanori Teruya, Kazunari Tozawa
Abstract
In this paper we propose efficient two-party protocols for obliviously applying a (possibly random) linear group action to a data set. Our protocols capture various applications such as oblivious shuffles, circular shifts, matrix multiplications, to name just a few. A notable feature enjoyed by our protocols, is that they admit a roundoptimal (more precisely, one-round) online computation phase, once an input-independent off-line computation phase has been completed. Our oblivious shuffle is the first to achieve a round-optimal online phase. The most efficient instantiations of our protocols are obtained in the so-called client-aided client-server setting, where the offline phase is run by a semi-honest input party (client) who will then distribute the generated correlated randomness to the computing parties (servers). When comparing the total running time to the previous best two-party oblivious shuffle protocol by Chase et al. (Asiacrypt 2020), our shuffle protocol in this client-aided setting is up to 105 times and 152 times faster, in the LAN and WAN setting, respectively. We additionally show how the Chase et al. protocol (which is a standard two-party protocol) can be modified to leverage the advantages of the client-aided setting, but show that, even doing so, our scheme is still two times faster in the online phase and 1.34 times faster in total on average.
An additional feature of our protocols is that they allow to re-invoke a previously generated group action, or its inverse, in subsequent runs. This allows us to utilize randomize-then-reveal techniques, which are crucial for constructing efficient protocols in complex applications. As an application, we construct a new oblivious sorting protocol implementing radix sort. Our protocol is based on a similar approach to the three-party protocol by Chida et al. (IACR ePrint 2019/965), but using our oblivious shuffle as a building block as well as various optimizations, we obtain a two-party protocol (in the client-aided setting) with improved online running time and a reduced number of rounds. As other applications,
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 9b0fea42-cd0e-4f79-baaa-59b4489e94c5Cited by top-tier papers5
- MUSES: Efficient Multi-User Searchable Encrypted DatabaseTung Le, Rouzbeh Behnia, Jorge Guajardo, Thang HoangUSENIX Security 2024 · 11 citations
- Secure Parallel Computation on Privately Partitioned Data and ApplicationsNuttapong Attrapadung, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt et al.CCS 2022 · 7 citations
- Secret-Shared Shuffle with Malicious SecurityXiangfu Song, Dong Yin, Jianli Bai, Changyu Dong et al.NDSS 2024
- Comet: Accelerating Private Inference for Large Language Model by Predicting Activation SparsityGuang Yan, Yuhui Zhang, Zimu Guo, Lutan Zhao et al.S&P 2025
- Doppio: Communication-Efficient and Secure Multi-Party Shuffle Differential PrivacyWentao Dong, Yang Cao, Cong Wang, Wei-Bin LeeVLDB 2026
Builds on3
- SecureML: A System for Scalable Privacy-Preserving Machine LearningPayman Mohassel, Yupeng ZhangS&P 2017 · 2,107 citations
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 898 citations
- Function Secret Sharing for Mixed-Mode and Fixed-Point Secure ComputationElette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta et al.EUROCRYPT 2021 · 135 citations
Related papers
- FLOSS: Fast Linear Online Secret-Shared ShufflingIan Chang, Sela Navot, Alex Ozdemir, Nirvan TyagiUSENIX Security 2026
- Secure Sorting and Selection via Function Secret SharingAmit Agarwal, Elette Boyle, Nishanth Chandran, Niv Gilboa et al.CCS 2024 · 5 citations
- Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy HittersGilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi et al.CCS 2022 · 30 citations
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 212 citations
- Private Information Retrieval with Sublinear Online TimeHenry Corrigan-Gibbs, Dmitry KoganEUROCRYPT 2020 · 105 citations
