A survey on perfectly secure verifiable secret-sharing
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 …
is used as a building block in several distributed computing tasks, such as Byzantine …
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 …
VOL. 64 | NO. 1 review articles DISTRIBUTED COMPUTING CONSIDERS the scenario where a …
Improved primitives for MPC over mixed arithmetic-binary circuits
This work introduces novel techniques to improve the translation between arithmetic and
binary data types in secure multi-party computation. We introduce a new approach to …
binary data types in secure multi-party computation. We introduce a new approach to …
Fast large-scale honest-majority MPC for malicious adversaries
K Chida, K Hamada, D Ikarashi, R Kikuchi… - Journal of …, 2023 - Springer
Protocols for secure multiparty computation enable a set of parties to compute a function of
their inputs without revealing anything but the output. The security properties of the protocol …
their inputs without revealing anything but the output. The security properties of the protocol …
Zero-knowledge proofs on secret-shared data via fully linear PCPs
We introduce and study the notion of fully linear probabilistically checkable proof systems. In
such a proof system, the verifier can make a small number of linear queries that apply jointly …
such a proof system, the verifier can make a small number of linear queries that apply jointly …
Experimenting with collaborative {zk-SNARKs}:{Zero-Knowledge} proofs for distributed secrets
A zk-SNARK is a powerful cryptographic primitive that provides a succinct and efficiently
checkable argument that the prover has a witness to a public NP statement, without …
checkable argument that the prover has a witness to a public NP statement, without …
Concretely efficient secure multi-party computation protocols: survey and more
D Feng, K Yang - Security and Safety, 2022 - sands.edpsciences.org
Secure multi-party computation (MPC) allows a set of parties to jointly compute a function on
their private inputs, and reveals nothing but the output of the function. In the last decade …
their private inputs, and reveals nothing but the output of the function. In the last decade …
Practical asynchronous high-threshold distributed key generation and distributed polynomial sampling
Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems
without a trusted party. DKG is an essential building block to many decentralized protocols …
without a trusted party. DKG is an essential building block to many decentralized protocols …
CodedPrivateML: A fast and privacy-preserving framework for distributed machine learning
How to train a machine learning model while keeping the data private and secure? We
present CodedPrivateML, a fast and scalable approach to this critical problem …
present CodedPrivateML, a fast and scalable approach to this critical problem …
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 …
preserving communication systems. However, in this paper, we argue that existing MPC …