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

Communication-Efficient MPC for General Adversary Structures

Joshua Lampkins, Rafail Ostrovsky

Published Jan 1, 2014• 4 citations
Publisher
DOI
10.1007/978-3-319-10879-7_10

Related papers

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

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

arXiv:2205.13169•Journal of Cryptology•Apr 24, 2023•2 citations

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

Ashish Choudhury, Nikhil Pappu

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

On Communication-Efficient Asynchronous MPC with Adaptive Security

Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang

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

Perfectly-Secure MPC Tolerating General Adversaries

Ashish Choudhury, Arpita Patra

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

Communication-Efficient (Proactive) Secure Computation for Dynamic General Adversary Structures and Dynamic Groups

Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky +1 more

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

Revisiting Fairness in MPC: Polynomial Number of Parties and General Adversarial Structures

Dana Dachman-Soled

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