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

Peeking Into the Future: MPC Resilient to Super-Rushing Adversaries

Gilad Asharov, Anirudh Chandramouli, Ran Cohen, Yuval Ishai

Published Jan 1, 2025• 2 citations
Publisher
DOI
10.1007/978-3-031-91092-0_14

Related papers

Revisiting the Efficiency of Asynchronous MPC with Optimal Resilience Against General Adversaries

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

Journal of Cryptology•Apr 24, 2023•2 citations

Perfectly-Secure MPC Tolerating General Adversaries

Ashish Choudhury, Arpita Patra

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

Towards Achieving Asynchronous MPC with Linear Communication and Optimal Resilience

Vipul Goyal, Chen-Da Liu-Zhang, Yifan Song

Lecture notes in computer science•Jan 1, 2024•14 citations

Communication-Efficient MPC for General Adversary Structures

Joshua Lampkins, Rafail Ostrovsky

Lecture notes in computer science•Jan 1, 2014•4 citations

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Daniel Genkin, Koki Hamada +4 more

Lecture notes in computer science•Jan 1, 2018•145 citations

Fast Large-Scale Honest-Majority MPC for Malicious Adversaries

Koji Chida, Koki Hamada, Dai Ikarashi +4 more

Journal of Cryptology•Apr 18, 2023•15 citations