A survey on perfectly secure verifiable secret-sharing

A Chandramouli, A Choudhury, A Patra - ACM Computing Surveys …, 2022 - dl.acm.org
Verifiable Secret-Sharing (VSS) is a fundamental primitive in secure distributed computing. It
is used as a building block in several distributed computing tasks, such as Byzantine …

Honeybadgermpc and asynchromix: Practical asynchronous mpc and its application to anonymous communication

D Lu, T Yurek, S Kulshreshtha, R Govind… - Proceedings of the …, 2019 - dl.acm.org
Multiparty computation as a service (MPSaaS) is a promising approach for building privacy-
preserving communication systems. However, in this paper, we argue that existing MPC …

Towards achieving asynchronous MPC with linear communication and optimal resilience

V Goyal, CD Liu-Zhang, Y Song - Annual International Cryptology …, 2024 - Springer
Secure multi-party computation (MPC) allows a set of n parties to jointly compute a function
over their private inputs. The seminal works of Ben-Or, Canetti and Goldreich [STOC'93] and …

Asynchronous byzantine agreement with subquadratic communication

E Blum, J Katz, CD Liu-Zhang, J Loss - … , NC, USA, November 16–19, 2020 …, 2020 - Springer
Understanding the communication complexity of Byzantine agreement (BA) is a fundamental
problem in distributed computing. In particular, for protocols involving a large number of …

hbacss: How to robustly share many secrets

T Yurek, L Luo, J Fairoze, A Kate, A Miller - Cryptology ePrint Archive, 2021 - eprint.iacr.org
Despite significant recent progress toward making multi-party computation (MPC) practical,
no existing MPC library offers complete robustness---meaning guaranteed output delivery …

Helium: Scalable MPC among lightweight participants and under churn

C Mouchet, S Chatel, A Pyrgelis… - Proceedings of the 2024 on …, 2024 - dl.acm.org
We introduce Helium, a novel framework that supports scalable secure multiparty
computation (MPC) for lightweight participants and tolerates churn. Helium relies on …

Network-agnostic security comes (almost) for free in DKG and MPC

R Bacho, D Collins, CD Liu-Zhang, J Loss - Annual International …, 2023 - Springer
Distributed key generation (DKG) protocols are an essential building block for threshold
cryptosystems. Many DKG protocols tolerate up to ts< n/2 corruptions assuming a well …

Linear-communication asynchronous complete secret sharing with optimal resilience

X Ji, J Li, Y Song - Annual International Cryptology Conference, 2024 - Springer
Secure multiparty computation (MPC) allows a set of n parties to jointly compute a function
on their private inputs. In this work, we focus on the information-theoretic MPC in the …

An efficient framework for unconditionally secure multiparty computation

A Choudhury, A Patra - IEEE Transactions on Information …, 2016 - ieeexplore.ieee.org
parties to securely compute an agreed function f over some finite field in the presence of a
computationally unbounded adversary, who can maliciously corrupt any t out of the n …

[PDF][PDF] Multiparty homomorphic encryption: From theory to practice

CV Mouchet - 2023 - infoscience.epfl.ch
Multiparty homomorphic encryption (MHE) enables a group of parties to encrypt data in a
way that (i) enables the evaluation of functions directly over its ciphertexts and (ii) enforces a …