Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

High Throughput Secure MPC over Small Population in Hybrid Networks (Extended Abstract)

Ashish Choudhury, Aditya Hegde

Published Jan 1, 2020• 0 citations
Publisher
DOI
10.1007/978-3-030-65277-7_37

Related papers

Perfectly-Secure Asynchronous MPC for General Adversaries (Extended Abstract)

Ashish Choudhury, Nikhil Pappu

Lecture notes in computer science•Jan 1, 2020•5 citations

Network Agnostic MPC with Statistical Security

Ananya Appan, Ashish Choudhury

arXiv:2306.01401•Lecture notes in computer science•Jan 1, 2023•8 citations

Perfectly-Secure MPC for Small Number of Parties

Ashish Choudhury, Arpita Patra

Synthesis lectures on distributed computing theory•Jan 1, 2022•0 citations

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

Lecture notes in computer science•Jan 1, 2019•26 citations

Accelerating Secure (2+1)-Party Computation by Insecure but Efficient Building Blocks

Keitaro Hiwatashi, Ken Ogura, Satsuya Ohata +1 more

Secure multi-party computation (MPC) is a cryptographic tool that enables a set of parties to compute a function jointly while keeping each input secret. Since MPC based on secret sharing (SS) achieves high throughput and works fast, many applications have been developed. However, SS-based MPC requires many communication rounds in general, and this becomes a performance bottleneck in real-world applications under high-latency networks. In this paper, we propose SS-based secure three-party computation with almost no preprocessing based on our new (small-)constant-round fundamental gates, by revisiting a framework in a few previous works where a number of parties are assisted by another party who may partially learn secret information. Instead of ordinary logical gates, our fundamental gate is an efficient Equality, for which the result leaks to the third party, and we develop novel two-round constructions of secure building-block protocols (LessThan Comparison, RightShift, Table LookUp, etc.) from the insecure Equality. To show the practicality of our protocols, we implement a secure exact edit distance protocol for two genome strings. Our experiments show that in some network setting our protocol is about 2 times faster (14 times faster taking preprocessing into consideration) than the state-of-the-art SS-based protocol (Ohata and Nuida, FC 2020).

ACM Asia Conference on Computer and Communications Security (ASIA CCS)•May 24, 2021•3 citations

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

Journal of Cryptology•Mar 22, 2023•4 citations
Secure multi-party computation (MPC) is a cryptographic tool that enables a set of parties to compute a function jointly while keeping each input secret. Since MPC based on secret sharing (SS) achieves high throughput and works fast, many applications have been developed. However, SS-based MPC requires many communication rounds in general, and this becomes a performance bottleneck in real-world applications under high-latency networks. In this paper, we propose SS-based secure three-party computation with almost no preprocessing based on our new (small-)constant-round fundamental gates, by revisiting a framework in a few previous works where a number of parties are assisted by another party who may partially learn secret information. Instead of ordinary logical gates, our fundamental gate is an efficient Equality, for which the result leaks to the third party, and we develop novel two-round constructions of secure building-block protocols (LessThan Comparison, RightShift, Table LookUp, etc.) from the insecure Equality. To show the practicality of our protocols, we implement a secure exact edit distance protocol for two genome strings. Our experiments show that in some network setting our protocol is about 2 times faster (14 times faster taking preprocessing into consideration) than the state-of-the-art SS-based protocol (Ohata and Nuida, FC 2020).