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

Breaking the $$1/\lambda $$-Rate Barrier for Arithmetic Garbling

Geoffroy Couteau, Carmit Hazay, Aditya Hegde, Naman Kumar

Published Jan 1, 2025• 5 citations
Publisher
DOI
10.1007/978-3-031-91095-1_7

Related papers

Toward Malicious Constant-Rate 2PC via Arithmetic Garbling

Carmit Hazay, Yibin Yang

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

On Multiparty Garbling of Arithmetic Circuits

Aner Ben-Efraim

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

Garbling Scheme for Formulas with Constant Size of Garbled Gates

Carmen Kempka, Ryo Kikuchi, Susumu Kiyoshima +1 more

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

Fast Garbling of Circuits Under Standard Assumptions

Shay Gueron, Yehuda Lindell, Ariel Nof +1 more

Journal of Cryptology•Dec 11, 2017•21 citations

Dishonest Majority Multi-party Arithmetic Garbling with Constant Rate

顾天瑶, Hanjun Li, Elaine Shi

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

When Quantum Arithmetic Doesn't Add Up

Science•Sep 27, 2007•0 citations
Breaking the 1/λ1/\lambda 1/λ-Rate Barrier for Arithmetic Garbling