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

Full-Threshold Actively-Secure Multiparty Arithmetic Circuit Garbling

Eleftheria Makri, Tim Wood

Published Jan 1, 2021• 1 citation
Publisher
DOI
10.1007/978-3-030-88238-9_20

Related papers

On Multiparty Garbling of Arithmetic Circuits

Aner Ben-Efraim

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

Threshold Garbled Circuits and Ad Hoc Secure Computation

Michele Ciampi, Vipul Goyal, Rafail Ostrovsky

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

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model

Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam

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

Actively Secure Garbled Circuits with Constant Communication Overhead in the Plain Model

Carmit Hazay, Yuval Ishai, Muthuramakrishnan Venkitasubramaniam

Journal of Cryptology•Jun 8, 2023•3 citations

k-Round Multiparty Computation from k-Round Oblivious Transfer via Garbled Interactive Circuits

Fabrice Benhamouda, Huijia Lin

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

Efficient Multiparty Computation for Arithmetic Circuits against a Covert Majority

Isheeta Nargis, Payman Mohassel, Wayne Eberly

Lecture notes in computer science•Jan 1, 2013•3 citations