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

Network and Distributed System Security Symposium

Pushing the Communication Barrier in Secure Computation using Lookup Tables

Ghada Dessouky, Farinaz Koushanfar, Ahmad‐Reza Sadeghi, Thomas H. Schneider, Shaza Zeitouni, Michael Zohner

Published Jan 1, 2017• 63 citations
Publisher

Abstract

Author(s): Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, Shaza Zeitouni, Michael Zohner Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Secure two-party computation (S2PC) allows two parties to compute a function on their joint inputs while leaking only the output of the function. At … Continued

DOI
10.14722/ndss.2017.23097

Related papers

ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation

Daniel Demmler, Thomas H. Schneider, Michael Zohner

Author(s): Daniel Demmler, Thomas Schneider, Michael Zohner Download: Paper (PDF) Date: 7 Feb 2015 Document Type: Briefing Papers Additional Documents: Slides Associated Event: NDSS Symposium 2015 Abstract: Secure computation enables multiple mutually distrusting parties to jointly evaluate functions on their private inputs without revealing anything but the result. Generic secure computation protocols in the semi-honest … Continued

Network and Distributed System Security Symposium•Jan 1, 2015•849 citations

Pushing the Communication Barrier in Secure Computation using Lookup Tables.

Ghada Dessouky, Farinaz Koushanfar, Ahmad‐Reza Sadeghi +3 more

•Jan 1, 2018•0 citations

Engineering secure two-party computation protocols: design, optimization, and applications of efficient secure function evaluation / Thomas Schneider

Thomas H. Schneider

•Jan 1, 2012•0 citations

TASTY

Wilko Henecka, Stefan K ögl, Ahmad‐Reza Sadeghi +2 more

Secure two-party computation allows two untrusting parties to jointly compute an arbitrary function on their respective private inputs while revealing no information beyond the outcome. Existing cryptographic compilers can automatically generate secure computation protocols from high-level specifications, but are often limited in their use and efficiency of generated protocols as they are based on either garbled circuits or (additively) homomorphic encryption only.

ACM SIGSAC Conference on Computer and Communications Security (CCS)•Oct 4, 2010•356 citations

On the Communication Complexity of Secure Multi-Party Computation With Aborts

James Bartusek, Thiago Bergamaschi, Seri Khoury +2 more

A central goal of cryptography is Secure Multi-party Computation (MPC), where n parties desire to compute a function of their joint inputs without letting any party learn about the inputs of its peers. Unfortunately, it is well-known that MPC guaranteeing output delivery to every party is infeasible when a majority of the parties are malicious. In fact, parties operating over a point-to-point network (i.e., without access to a broadcast channel) cannot even reach an agreement on the output when more than one third of the parties are malicious (Lamport, Shostak, and Pease, JACM 1980).

arXiv:2406.06914•ACM Symposium on Principles of Distributed Computing (PODC)•Jun 5, 2024•0 citations

Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO

Jesper Buus Nielsen, Thomas H. Schneider, Roberto Trifiletti

Author(s): Jesper Buus Nielsen, Thomas Schneider, Roberto Trifiletti Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Asymptotically more efficient than on the circuit level. Since then the LEGO approach has been improved upon in several theoretical works, but never implemented. In this paper we describe further … Continued

Network and Distributed System Security Symposium•Jan 1, 2017•50 citations
Author(s): Ghada Dessouky, Farinaz Koushanfar, Ahmad-Reza Sadeghi, Thomas Schneider, Shaza Zeitouni, Michael Zohner Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Secure two-party computation (S2PC) allows two parties to compute a function on their joint inputs while leaking only the output of the function. At … Continued
A central goal of cryptography is Secure Multi-party Computation (MPC), where n parties desire to compute a function of their joint inputs without letting any party learn about the inputs of its peers. Unfortunately, it is well-known that MPC guaranteeing output delivery to every party is infeasible when a majority of the parties are malicious. In fact, parties operating over a point-to-point network (i.e., without access to a broadcast channel) cannot even reach an agreement on the output when more than one third of the parties are malicious (Lamport, Shostak, and Pease, JACM 1980).