• Publications
  • Influence
Introduction to Modern Cryptography
Preface I. Introduction and Classical Cryptography Introduction Cryptography and Modern Cryptography The Setting of Private-Key Encryption Historical Ciphers and Their Cryptanalysis Principles ofExpand
  • 1,658
  • 181
Privacy Preserving Data Mining
Abstract. In this paper we address the issue of privacy preserving data mining. Specifically, we consider a scenario in which two parties owning confidential databases wish to run a data miningExpand
  • 1,832
  • 102
Universally composable two-party and multi-party secure computation
We show how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants. That is, we consider a multi-party network with openExpand
  • 604
  • 54
Privacy Preserving Data Mining
In this paper we introduce the concept of privacy preserving data mining. In our model, two parties owning confidential databases wish to run a data mining algorithm on the union of their databases,Expand
  • 848
  • 51
Secure Multiparty Computation for Privacy-Preserving Data Mining
In this paper, we survey the basic paradigms and notions of secure mul- tiparty computation and discuss their relevance to the fleld of privacy-preserving data mining. In addition to reviewingExpand
  • 565
  • 45
A Framework for Password-Based Authenticated Key Exchange
In this paper we present a general framework for passwordbased authenticated key exchange protocols, in the common reference string model. Our protocol is actually an abstraction of the key exchangeExpand
  • 301
  • 41
A Proof of Security of Yao’s Protocol for Two-Party Computation
In the mid 1980s, Yao presented a constant-round protocol for securely computing any two-party functionality in the presence of semi-honest adversaries (FOCS 1986). In this paper, we provide aExpand
  • 501
  • 30
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
In this paper, we describe a new information-theoretic protocol (and a computationally-secure variant) for secure three-party computation with an honest majority. The protocol has very minimalExpand
  • 141
  • 28
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
We show an efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries. Yao’s original protocol is only secure in the presence ofExpand
  • 245
  • 25
A Statistical Theory for Quantitative Association Rules
Association rules are a key data-mining tool and as such have been well researched. So far, this research has focused predominantly on databases containing categorical data only. However, manyExpand
  • 229
  • 24