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

Garbled Circuits Checking Garbled Circuits: More Efficient and Secure Two-Party Computation

Payman Mohassel, Ben Riva

Published Jan 1, 2013• 64 citations
Publisher
DOI
10.1007/978-3-642-40084-1_3

Related papers

Secure Two-Party Computation Using an Efficient Garbled Circuit by Reducing Data Transfer

Mohammad Hossein Yalame, Mohammad-Hossein Farzam, Siavash Bayat-Sarmadi

Communications in computer and information science•Jan 1, 2017•5 citations

Improved Secure Two-Party Computation via Information-Theoretic Garbled Circuits

Vladimir Kolesnikov, Ranjit Kumaresan

Lecture notes in computer science•Jan 1, 2012•14 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

Efficient Secure Computation with Garbled Circuits

Yan Huang, Chih-Hao Shen, David Evans +2 more

Lecture notes in computer science•Jan 1, 2011•146 citations

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation

Jonathan I. Katz, Samuel Ranellucci, Mike Rosulek +1 more

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

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

Jonathan I. Katz, Samuel Ranellucci, Xiao Shaun Wang

•Jan 1, 2017•3 citations