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 Actively-Secure Elementary MPC Reductions

Benny Applebaum, Aarushi Goel

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-3-030-90459-3_24

Related papers

Actively Secure MPC with O(|C|) Computation and Communication via CRT

Alexander Bienstock, Daniel Escudero, Antigoni Polychroniadou

Lecture notes in computer science•Jan 1, 2026•0 citations

Efficient, Actively Secure MPC with a Dishonest Majority: A Survey

Emmanuela Orsini

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

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

Benny Applebaum, Eliran Kachlon, Arpita Patra

IEEE Conference Proceedings•Jan 1, 2020•0 citations

Yet Another Compiler for Active Security or: Efficient MPC Over Arbitrary Rings

Ivan Damgård, Claudio Orlandi, Mark Simkin

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

Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT)

Carmit Hazay, Emmanuela Orsini, Peter Schöll +1 more

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

New Upper and Lower Bounds for Perfectly Secure MPC

Ivan Damgård, Shravani Patil, Arpita Patra +1 more

Lecture notes in computer science•Jan 1, 2026•0 citations