• Publications
  • Influence
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
TLDR
In this paper, we construct efficient secure protocols for set intersection and pattern matching, in contrast to previous protocols that are based on polynomials. Expand
  • 259
  • 22
  • PDF
Complete Fairness in Secure Two-Party Computation
TLDR
In the setting of secure two-party computation, two mutually distrusting parties wish to compute some function of their inputs while preserving, to the extent possible, various security properties such as privacy, correctness, and more. Expand
  • 119
  • 19
  • PDF
Efficient Secure Two-Party Protocols: Techniques and Constructions
TLDR
This book is essential for practitioners and researchers in the field of secure protocols, particularly those with a focus on efficiency, and for researchers inthe area of privacy-preserving data mining. Expand
  • 219
  • 15
Efficient Set Operations in the Presence of Malicious Adversaries
TLDR
We revisit the problem of constructing efficient secure two-party protocols for the problems of set intersection and set union, focusing on the model of malicious parties. Expand
  • 146
  • 15
  • PDF
Ligero: Lightweight Sublinear Arguments Without a Trusted Setup
TLDR
We design and implement a simple zero-knowledge argument protocol for NP whose communication complexity is proportional to the square-root of the verification circuit size. Expand
  • 121
  • 15
  • PDF
Towards a Game Theoretic View of Secure Computation
TLDR
We demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security in a natural setting where existing notions of fairness are provably impossible. Expand
  • 78
  • 13
Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
TLDR
We propose a protocol for the problem of secure two-party pattern matching, where Alice holds a text t∈{0,1}∗ of length n, while Bob has a pattern p∈{\0,2} of length m. Expand
  • 65
  • 8
  • PDF
Low Cost Constant Round MPC Combining BMR and Oblivious Transfer
TLDR
We present two new universally composable, actively secure, constant round multi-party protocols for generating BMR garbled circuits with free-XOR and reduced costs. Expand
  • 51
  • 8
  • PDF
Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
  • Carmit Hazay
  • Mathematics, Computer Science
  • Journal of Cryptology
  • 1 April 2018
TLDR
We study the two fundamental functionalities oblivious polynomial evaluation in the exponent and set-intersection and introduce a new technique for designing efficient secure protocols for these problems (and others). Expand
  • 35
  • 8
  • PDF
Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
TLDR
The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Expand
  • 50
  • 7
  • PDF
...
1
2
3
4
5
...