Network and Distributed System Security Symposium

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

Jesper Buus Nielsen, Thomas H. Schneider, Roberto Trifiletti

Published Jan 1, 2017• 50 citations

Abstract

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

DOI: 10.14722/ndss.2017.23075

Related papers

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

Jesper Buus Nielsen, Thomas H. Schneider, Roberto Trifiletti

Jan 1, 20161 citation

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

Thomas H. Schneider

Jan 1, 20120 citations

Pushing the Communication Barrier in Secure Computation using Lookup Tables

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

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

Network and Distributed System Security SymposiumJan 1, 201763 citations

Faster LEGO-based Secure Computation without Homomorphic Commitments.

Ruiyu Zhu, Yan Huang

Jan 1, 20171 citation

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 SymposiumJan 1, 2015849 citations

Fast Actively Secure OT Extension for Short Secrets

Arpita Patra, Pratik Sarkar, Ajith Suresh

Author(s): Arpita Patra, Pratik Sarkar, Ajith Suresh Download: Paper (PDF) Date: 27 Feb 2017 Document Type: Reports Additional Documents: Slides Video Associated Event: NDSS Symposium 2017 Abstract: Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems … Continued

arXiv:1911.08834Network and Distributed System Security SymposiumJan 1, 201711 citations