Thomas Schneider

Publications
Influence

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

Daniel Demmler, Thomas Schneider, Michael Zohner
Computer Science
NDSS
1 February 2015

We introduce an abstract language that is compiled into a protocol representation, thereby relieving a developer from having to specify the functionality in the protocol’s (often complex) underlying representation. Expand

Improved Garbled Circuit: Free XOR Gates and Applications

V. Kolesnikov, Thomas Schneider
Mathematics, Computer Science
ICALP
7 July 2008

We present a new garbled circuit construction for two-party secure function evaluation (SFE). Expand

Secure Two-Party Computation is Practical

Benny Pinkas, Thomas Schneider, N. Smart, S. C. Williams
Computer Science
IACR Cryptol. ePrint Arch.
2 December 2009

In this paper we describe an implementation of the two-party case, using Yao's garbled circuits, and present various algorithmic protocol improvements. Expand

TASTY: tool for automating secure two-party computations

Wilko Henecka, S. Kögl, A. Sadeghi, Thomas Schneider, Immo Wehrenberg
Computer Science
CCS '10
4 October 2010

We present TASTY, a novel tool for automating, generating, executing, benchmarking, and comparing, efficient secure two-party computation protocols. Expand

Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima

V. Kolesnikov, A. Sadeghi, Thomas Schneider
Computer Science
IACR Cryptol. ePrint Arch.
23 November 2009

We consider generic Garbled Circuit (GC)-based techniques for Secure Function Evaluation (SFE) in the semi-honest model. Expand

Efficient Privacy-Preserving Face Recognition

A. Sadeghi, Thomas Schneider, Immo Wehrenberg
Computer Science
ICISC
2 December 2009

We present a privacy-preserving face recognition scheme that substantially improves over previouswork in terms of communication-and computation efficiency: the most recent proposal of Erkin et al. (PETS'09) requires O(log M) rounds to recognize a face in a database of M faces. Expand

Chameleon: A Hybrid Secure Computation Framework for Machine Learning Applications

M. Riazi, Christian Weinert, O. Tkachenko, Ebrahim M. Songhori, Thomas Schneider, F. Koushanfar
Computer Science
IACR Cryptol. ePrint Arch.
10 January 2018

We present Chameleon, a novel hybrid (mixed-protocol) framework for secure function evaluation (SFE) which enables two parties to jointly compute a function without disclosing their private inputs. Expand

Ciphers for MPC and FHE

Martin R. Albrecht, C. Rechberger, Thomas Schneider, Tyge Tiessen, Michael Zohner
Computer Science
IACR Cryptol. ePrint Arch.
26 April 2015

We propose a new way of designing a cipher where most of the cryptographically relevant work would be performed as linear operations and the use of non-linear operations is minimized. Expand

More efficient oblivious transfer and extensions for faster secure computation

Gilad Asharov, Yehuda Lindell, Thomas Schneider, Michael Zohner
Computer Science
CCS
4 November 2013

In this work we present optimizations and efficient implementations of OT and OT extensions in the semi-honest model and improve OT extensions with respect to communication complexity, computation complexity, and scalability. Expand

Faster Private Set Intersection Based on OT Extension

Benny Pinkas, Thomas Schneider, Michael Zohner
Computer Science
USENIX Security Symposium
20 August 2014

We give an overview on existing efficient PSI protocols that are secure against semi-honest adversaries. Expand

Recommended Authors