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

Maintaining Sublinear Locality Over Time: Adaptively Secure MPC on a Reusable Hidden Graph

Elette Boyle, Ran Cohen, Pierre Meyer

Published Jan 1, 2026• 1 citation
Publisher
DOI
10.1007/978-3-032-25324-8_19

Related papers

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

Lecture notes in computer science•Jan 1, 2019•26 citations

Adaptively Secure MPC with Sublinear Communication Complexity

Ran Cohen, Abhi A. Shelat, Daniel Wichs

Journal of Cryptology•Mar 22, 2023•4 citations

Adaptive Security, Erasures, and Network Assumptions in Communication-Local MPC

Nishanth Chandran, Juan A. Garay, Ankit Kumar Misra +2 more

Lecture notes in computer science•Dec 2, 2024•1 citation

On Communication-Efficient Asynchronous MPC with Adaptive Security

Annick Chopard, Martin Hirt, Chen-Da Liu-Zhang

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

Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation

Sanjam Garg, Antigoni Polychroniadou

Lecture notes in computer science•Jan 1, 2015•52 citations

Information-Theoretic 2-Round MPC Without Round Collapsing: Adaptive Security, and More

Huijia Lin, Tianren Liu, Hoeteck Wee

Lecture notes in computer science•Jan 1, 2020•6 citations