Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

On the Bottleneck Complexity of MPC with Correlated Randomness

Claudio Orlandi, Divya Ravi, Peter Schöll

Published Jan 1, 2022• 2 citations
Publisher
DOI
10.1007/978-3-030-97121-2_8

Related papers

On the Correlation Complexity of MPC with Cheater Identification

Nicholas Brandt, Sven Maier, Tobias Müller +1 more

Lecture notes in computer science•Nov 30, 2023•0 citations

On the Round Complexity of Dishonest-Majority MPC

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

Lecture notes in computer science•Oct 30, 2026•0 citations

On Linear Communication Complexity for (Maximally) Fluid MPC

Alexander Bienstock, Daniel E. Escudero, Antigoni Polychroniadou

Lecture notes in computer science•Jan 1, 2023•14 citations

On the Round Complexity of Black-Box Secure MPC

Yuval Ishai, Dakshita Khurana, Amit Sahai +1 more

Lecture notes in computer science•Jan 1, 2021•19 citations

Computational Irrelevancy: Bridging the Gap Between Pseudo- and Real Randomness in MPC Protocols

Nariyasu Heseri, Koji Nuida

Lecture notes in computer science•Jan 1, 2022•1 citation

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Ignacio Cascudo, Ronald Cramer, Chaoping Xing +1 more

Lecture notes in computer science•Jan 1, 2018•65 citations