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

Dishonest Majority Multi-party Arithmetic Garbling with Constant Rate

顾天瑶, Hanjun Li, Elaine Shi

Published Jan 1, 2026• 0 citations
Publisher
DOI
10.1007/978-3-032-35418-1_19

Related papers

Round Efficiency of Multi-party Computation with a Dishonest Majority

Jonathan I. Katz, Rafail Ostrovsky, Adam Smith

Lecture notes in computer science•Jan 1, 2003•95 citations

Adaptively Secure Multi-Party Computation with Dishonest Majority

Sanjam Garg, Amit Sahai

Lecture notes in computer science•Jan 1, 2012•32 citations

Dishonest Majority Multi-Party Computation for Binary Circuits

Enrique Larraia, Emmanuela Orsini, Nigel Paul Smart

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

Toward Malicious Constant-Rate 2PC via Arithmetic Garbling

Carmit Hazay, Yibin Yang

Lecture notes in computer science•Jan 1, 2024•7 citations

Efficient Large-Scale Multi-party Computation Based on Garbled Circuit

Zhusen Liu, Jiafei Wu, Zhe Liu

Lecture notes in computer science•Oct 24, 2024•1 citation

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.

Jonathan I. Katz, Samuel Ranellucci, Xiao Shaun Wang

•Jan 1, 2017•3 citations