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 …

Trident: Efficient 4pc framework for privacy preserving machine learning

H Chaudhari, R Rachuri, A Suresh - arXiv preprint arXiv:1912.02631, 2019 - arxiv.org
Machine learning has started to be deployed in fields such as healthcare and finance, which
propelled the need for and growth of privacy-preserving machine learning (PPML). We …

BLAZE: blazing fast privacy-preserving machine learning

A Patra, A Suresh - arXiv preprint arXiv:2005.09042, 2020 - arxiv.org
Machine learning tools have illustrated their potential in many significant sectors such as
healthcare and finance, to aide in deriving useful inferences. The sensitive and confidential …

FIN: practical signature-free asynchronous common subset in constant time

S Duan, X Wang, H Zhang - Proceedings of the 2023 ACM SIGSAC …, 2023 - dl.acm.org
Asynchronous common subset (ACS) is a powerful paradigm enabling applications such as
Byzantine fault-tolerance (BFT) and multi-party computation (MPC). The most efficient ACS …

Cybersecurity challenges in the age of AI: theoretical approaches and practical solutions

BT Familoni - Computer Science & IT Research Journal, 2024 - fepbl.com
In the ever-evolving landscape of cybersecurity, the proliferation of artificial intelligence (AI)
technologies introduces both promising advancements and daunting challenges. This paper …

Asynchronous Distributed Key Generation for Computationally-Secure Randomness, Consensus, and Threshold Signatures.

E Kokoris Kogias, D Malkhi, A Spiegelman - Proceedings of the 2020 …, 2020 - dl.acm.org
In this paper, we present the first Asynchronous Distributed Key Generation (ADKG)
algorithm which is also the first distributed key generation algorithm that can generate …

ASTRA: high throughput 3pc over rings with application to secure prediction

H Chaudhari, A Choudhury, A Patra… - Proceedings of the 2019 …, 2019 - dl.acm.org
The concrete efficiency of secure computation has been the focus of many recent works. In
this work, we present concretely-efficient protocols for secure 3-party computation (3PC) …

Pace: Fully parallelizable bft from reproposable byzantine agreement

H Zhang, S Duan - Proceedings of the 2022 ACM SIGSAC Conference …, 2022 - dl.acm.org
The classic asynchronous Byzantine fault tolerance (BFT) framework of Ben-Or, Kemler, and
Rabin (BKR) and its descendants rely on reliable broadcast (RBC) and asynchronous binary …

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 …

Fast batched asynchronous distributed key generation

J Groth, V Shoup - Annual International Conference on the Theory and …, 2024 - Springer
We present new protocols for threshold Schnorr signatures that work in an asynchronous
communication setting, providing robustness and optimal resilience. These protocols …