Lecture notes in computer science

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

Published Jan 1, 2022• 6 citations

Publisher

DOI: 10.1007/978-3-031-22365-5_4

Related papers

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

Saikrishna Badrinarayanan, Peihan Miao, Pratyay Mukherjee +1 more

Lecture notes in computer scienceJan 1, 20233 citations

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

Daniel E. Escudero, Serge Fehr

Lecture notes in computer scienceJan 1, 20232 citations

Honest Majority MPC with $$\tilde{O}(|C|)$$ Communication in Minicrypt

Yifan Song, Xiangtao Ye

Lecture notes in computer scienceJan 1, 20252 citations

Achieving Guaranteed Output Delivery MPC with Constant Rounds and Linear Communication in Minicrypt

Junru Li, Yifan Song

Lecture notes in computer scienceJan 1, 20260 citations

Round-Optimal Secure Multiparty Computation with Honest Majority

Prabhanjan Ananth, Arka Rai Choudhuri, Aarushi Goel +1 more

Lecture notes in computer scienceJan 1, 201847 citations

Broadcast-Optimal Two Round MPC with an Honest Majority.

Ivan Damgård, Bernardo Magri, Luisa Siniscalchi +1 more

Jan 1, 20200 citations