Lecture notes in computer science

On the Round Complexity of Fully Secure Solitary MPC with Honest Majority

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee, Divya Ravi

Published Jan 1, 2023• 3 citations

Publisher

DOI: 10.1007/978-3-031-48618-0_5

Related papers

On Fully-Secure Honest Majority MPC Without $$n^2$$ Round Overhead

Daniel E. Escudero, Serge Fehr

Lecture notes in computer scienceJan 1, 20232 citations

Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security

Benny Applebaum, Eliran Kachlon, Arpita Patra

Lecture notes in computer scienceJan 1, 20226 citations

On Fully Secure MPC with Solitary Output

Shai Halevi, Yuval Ishai, Eyal Kushilevitz Z +2 more

Lecture notes in computer scienceJan 1, 201913 citations

On the Round Complexity of Dishonest-Majority MPC

Ran Cohen, Daniel E. Collins, Pouyan Forghani +2 more

Lecture notes in computer scienceOct 30, 20260 citations

Actively Secure MPC in the Dishonest Majority Setting: Achieving Constant Complexity in Online Communication, Computation Per Gate, Rounds, and Private Input Size

Seung Hwan Lee, Jaesang Noh, Taejeong Kim +2 more

Lecture notes in computer scienceJan 1, 20250 citations

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Lecture notes in computer scienceJan 1, 202119 citations