MPC with low bottleneck-complexity: Information-theoretic security and more

H Keller, C Orlandi, A Paskin-Cherniavsky… - Cryptology ePrint …, 2023 - eprint.iacr.org
The bottleneck-complexity (BC) of secure multiparty computation (MPC) protocols is a
measure of the maximum number of bits which are sent and received by any party in a …

Actively Secure Polynomial Evaluation from Shared Polynomial Encodings

P Reisert, M Rivinius, T Krips, S Hasler… - … Conference on the Theory …, 2025 - Springer
Many of the currently best actively secure Multi-Party Computation (MPC) protocols like
SPDZ (Damgård et al., CRYPTO 2012) and improvements thereof use correlated …

On the bottleneck complexity of mpc with correlated randomness

C Orlandi, D Ravi, P Scholl - IACR International Conference on Public-Key …, 2022 - Springer
At ICALP 2018, Boyle et al. introduced the notion of the bottleneck complexity of a secure
multi-party computation (MPC) protocol. This measures the maximum communication …

Towards Optimal Non-interactive Secure Multiparty Computation for Abelian Programs

M Yoshida - 2024 IEEE International Symposium on …, 2024 - ieeexplore.ieee.org
Non-interactive secure multiparty computation is a method to share and compute a private
function f among n parties holding private inputs xi with 1< i< n in the information theoretical …

Arithmetic tuples for mpc

P Reisert, M Rivinius, T Krips, R Küsters - Cryptology ePrint Archive, 2022 - eprint.iacr.org
Some of the most efficient protocols for Multi-Party Computation (MPC) use a two-phase
approach where correlated randomness, in particular Beaver triples, is generated in the …

木状相互通信パターンにおける秘密計算プロトコル

三宅美歩, ミヤケミホ - mie-u.repo.nii.ac.jp
概 要近年, 情報技術はさまざまな分野で使用されている. 特に企業では, 顧客や社会のニーズに
応えるために人工知能などの先端技術や自社のデータの有効活用などが重要視されている. しかし …