Lecture notes in computer science

Communication-Efficient MPC for General Adversary Structures

Joshua Lampkins, Rafail Ostrovsky

Published Jan 1, 2014• 4 citations

Related papers

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

Ananya Appan, Anirudh Chandramouli, Ashish Choudhury

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

Ashish Choudhury, Nikhil Pappu

Perfectly-Secure MPC Tolerating General Adversaries

Ashish Choudhury, Arpita Patra

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

Dana Dachman-Soled

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

Karim Eldefrawy, Seoyeon Hwang, Rafail Ostrovsky +1 more

Multiplicative Depth Independent & Efficient MPC in the Presence of Mixed Adversary.

Achintya Desai, S. Sundar Raj, Kannan Srinathan