• Publications
  • Influence
ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation
TLDR
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
  • 326
  • 72
  • PDF
More efficient oblivious transfer and extensions for faster secure computation
TLDR
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
  • 255
  • 24
  • PDF
Ciphers for MPC and FHE
TLDR
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
  • 166
  • 24
  • PDF
Faster Private Set Intersection Based on OT Extension
TLDR
We give an overview on existing efficient PSI protocols that are secure against semi-honest adversaries. Expand
  • 177
  • 20
  • PDF
Phasing: Private Set Intersection Using Permutation-based Hashing
TLDR
We describe a new approach for designing PSI protocols based on permutation-based hashing, which enables to reduce the length of items mapped to bins while ensuring that no collisions occur. Expand
  • 133
  • 20
  • PDF
Scalable Private Set Intersection Based on OT Extension
TLDR
This paper is a combined and extended version of [Pinkas et al. 2014] (USENIX 2014) with substantial improvements summarized in §1.4. Expand
  • 111
  • 17
  • PDF
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries
TLDR
Oblivious transfer (OT) is one of the most fundamental primitives in cryptography and is widely used in protocols for secure two-party and multi-party computation. Expand
  • 82
  • 7
  • PDF
GSHADE: faster privacy-preserving distance computation and biometric identification
TLDR
We introduce a generalization of the SHADE protocol, called GSHADE, that enables privacy-preserving computation of several distance metrics, including (normalized) Hamming distance, Euclidean distance, Mahalanobis distance, and scalar product. Expand
  • 62
  • 7
  • PDF
Intelligent Machine Homicide - Breaking Cryptographic Devices Using Support Vector Machines
TLDR
In this contribution we propose the so-called SVM attack, a profiling based side channel attack, which uses the machine learning algorithm support vector machines (SVM) in order to recover a cryptographic secret. Expand
  • 117
  • 5
More Efficient Oblivious Transfer Extensions
TLDR
In this work, we improve OT extensions with respect to communication complexity, computation complexity, and scalability in the semi-honest, covert, and malicious model. Expand
  • 33
  • 4
  • PDF