Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ARPITA PATRA:
All reports by Author Arpita Patra:

TR23-031 | 23rd March 2023
Benny Applebaum, Eliran Kachlon, Arpita Patra

The Round Complexity of Statistical MPC with Optimal Resiliency

In STOC 1989, Rabin and Ben-Or (RB) established an important milestone in the fields of cryptography and distributed computing by showing that every functionality can be computed with statistical (information-theoretic) security in the presence of an active (aka Byzantine) rushing adversary that controls up to half of the parties. We ... more >>>


TR20-076 | 17th May 2020
Benny Applebaum, Eliran Kachlon, Arpita Patra

The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency

In STOC 1988, Ben-Or, Goldwasser, and Wigderson (BGW) established an important milestone in the fields of cryptography and distributed computing by showing that every functionality can be computed with perfect (information-theoretic and error-free) security at the presence of an active (aka Byzantine) rushing adversary that controls up to $n/3$ of ... more >>>




ISSN 1433-8092 | Imprint