Oblivious Linear Group Actions and Applications
Nuttapong Attrapadung, Goichiro Hanaoka, Takahiro Matsuda, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt, Tadanori Teruya, Kazunari Tozawa
摘要
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,
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper5
- MUSES: Efficient Multi-User Searchable Encrypted DatabaseTung Le, Rouzbeh Behnia, Jorge Guajardo, Thang HoangUSENIX Security 2024 · 被引用 11 次
- Secure Parallel Computation on Privately Partitioned Data and ApplicationsNuttapong Attrapadung, Hiraku Morita, Kazuma Ohara, Jacob C. N. Schuldt 等CCS 2022 · 被引用 7 次
- Secret-Shared Shuffle with Malicious SecurityXiangfu Song, Dong Yin, Jianli Bai, Changyu Dong 等NDSS 2024
- Comet: Accelerating Private Inference for Large Language Model by Predicting Activation SparsityGuang Yan, Yuhui Zhang, Zimu Guo, Lutan Zhao 等S&P 2025
- Doppio: Communication-Efficient and Secure Multi-Party Shuffle Differential PrivacyWentao Dong, Yang Cao, Cong Wang, Wei-Bin LeeVLDB 2026
它引用的顶会 Paper3
- SecureML: A System for Scalable Privacy-Preserving Machine LearningPayman Mohassel, Yupeng ZhangS&P 2017 · 被引用 2,107 次
- ABY3: A Mixed Protocol Framework for Machine LearningPayman Mohassel, Peter RindalCCS 2018 · 被引用 898 次
- Function Secret Sharing for Mixed-Mode and Fixed-Point Secure ComputationElette Boyle, Nishanth Chandran, Niv Gilboa, Divya Gupta 等EUROCRYPT 2021 · 被引用 135 次
相关 Paper
- 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 等CCS 2024 · 被引用 5 次
- Efficient Secure Three-Party Sorting with Applications to Data Analysis and Heavy HittersGilad Asharov, Koki Hamada, Dai Ikarashi, Ryo Kikuchi 等CCS 2022 · 被引用 30 次
- Authenticated Garbling and Efficient Maliciously Secure Two-Party ComputationXiao Wang, Samuel Ranellucci, Jonathan KatzCCS 2017 · 被引用 212 次
- Private Information Retrieval with Sublinear Online TimeHenry Corrigan-Gibbs, Dmitry KoganEUROCRYPT 2020 · 被引用 105 次
