Lecture notes in computer science

On Fully Secure MPC with Solitary Output

Shai Halevi, Yuval Ishai, Eyal Kushilevitz Z, Nikolaos Makriyannis, Tal Rabin

Published Jan 1, 2019• 13 citations

Publisher

DOI: 10.1007/978-3-030-36030-6_13

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

Fully-Secure MPC with Minimal Trust

Yuval Ishai, Arpita Patra, Sikhar Patranabis +2 more

Lecture notes in computer scienceJan 1, 20224 citations

Scaling Fully Secure MPC via Robust Recursive Search and Gap Amplification

Matan Hamilis, Ariel Nof

Lecture notes in computer scienceJan 1, 20260 citations

On Secure Computation of Solitary Output Functionalities with and Without Broadcast

Bar Alon, Eran Omri

Lecture notes in computer scienceJan 1, 20230 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

Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensions

Anders Dalskov, Daniel E. Escudero, Ariel Nof

Lecture notes in computer scienceJan 1, 202413 citations