Horizontal federated recommender system: A survey

L Wang, H Zhou, Y Bao, X Yan, G Shen… - ACM Computing …, 2024 - dl.acm.org
Due to underlying privacy-sensitive information in user-item interaction data, the risk of
privacy leakage exists in the centralized-training recommender system (RecSys). To this …

MP-SPDZ: A versatile framework for multi-party computation

M Keller - Proceedings of the 2020 ACM SIGSAC conference on …, 2020 - dl.acm.org
Multi-Protocol SPDZ (MP-SPDZ) is a fork of SPDZ-2 (Keller et al., CCS'13), an
implementation of the multi-party computation (MPC) protocol called SPDZ (Damgård et al …

Secure multiparty computation

Y Lindell - Communications of the ACM, 2020 - dl.acm.org
Secure multiparty computation Page 1 86 COMMUNICATIONS OF THE ACM | JANUARY 2021 |
VOL. 64 | NO. 1 review articles DISTRIBUTED COMPUTING CONSIDERS the scenario where a …

{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation

A Patra, T Schneider, A Suresh, H Yalame - 30th USENIX Security …, 2021 - usenix.org
Secure Multi-party Computation (MPC) allows a set of mutually distrusting parties to jointly
evaluate a function on their private inputs while maintaining input privacy. In this work, we …

A pragmatic introduction to secure multi-party computation

D Evans, V Kolesnikov, M Rosulek - Foundations and Trends® …, 2018 - nowpublishers.com
Secure multi-party computation (MPC) has evolved from a theoretical curiosity in the 1980s
to a tool for building real systems today. Over the past decade, MPC has been one of the …

A survey of oblivious transfer protocol

VK Yadav, N Andola, S Verma… - ACM Computing Surveys …, 2022 - dl.acm.org
Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide
range of applications such as secure multi-party computation, private information retrieval …

Cryptography from pseudorandom quantum states

P Ananth, L Qian, H Yuen - Annual International Cryptology Conference, 2022 - Springer
Pseudorandom states, introduced by Ji, Liu and Song (Crypto'18), are efficiently-computable
quantum states that are computationally indistinguishable from Haar-random states. One …

Prio: Private, robust, and scalable computation of aggregate statistics

H Corrigan-Gibbs, D Boneh - 14th USENIX symposium on networked …, 2017 - usenix.org
This paper presents Prio, a privacy-preserving system for the collection of aggregate
statistics. Each Prio client holds a private data value (eg, its current location), and a small set …

High-throughput semi-honest secure three-party computation with an honest majority

T Araki, J Furukawa, Y Lindell, A Nof… - Proceedings of the 2016 …, 2016 - dl.acm.org
In this paper, we describe a new information-theoretic protocol (and a computationally-
secure variant) for secure three-party computation with an honest majority. The protocol has …

Fiat-Shamir: from practice to theory

R Canetti, Y Chen, J Holmgren, A Lombardi… - Proceedings of the 51st …, 2019 - dl.acm.org
We give new instantiations of the Fiat-Shamir transform using explicit, efficiently computable
hash functions. We improve over prior work by reducing the security of these protocols to …