• Publications
  • Influence
Introduction to Modern Cryptography
TLDR
This book discusses Private-Key (Symmetric) Cryptography, Number Theory and Cryptographic Hardness Assumptions, and the Random-Oracle Model in Detail. Expand
Privacy Preserving Data Mining
TLDR
This work considers a scenario in which two parties owning confidential databases wish to run a data mining algorithm on the union of their databases, without revealing any unnecessary information, and proposes a protocol that is considerably more efficient than generic solutions and demands both very few rounds of communication and reasonable bandwidth. Expand
Universally composable two-party and multi-party secure computation
TLDR
It is shown how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants, which implies that security is preserved under concurrent composition of an unbounded number of protocol executions. Expand
Secure Multiparty Computation for Privacy-Preserving Data Mining
TLDR
The issue of e-ciency is discussed and the di-cul- ties involved in constructing highly e-cient protocols are demonstrated and the relationship between secure multiparty computation and privacy-preserving data mining is discussed. Expand
Privacy Preserving Data Mining
TLDR
This paper introduces the concept of privacy preserving data mining, and presents a solution that is considerably more efficient than generic solutions, and demonstrates that secure multi-party computation can be made practical, even for complex problems and large inputs. Expand
A Framework for Password-Based Authenticated Key Exchange
TLDR
This paper presents a general framework for passwordbased authenticated key exchange protocols, in the common reference string model, based on the recently introduced notion of smooth projective hashing by Cramer and Shoup, and obtains a modular protocol that can be described using just three high-level cryptographic tools. Expand
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
TLDR
A new information-theoretic protocol for secure three-party computation with an honest majority and a Kerberos extension that replaces the ticket-granting-ticket encryption on the Key Distribution Center in MIT-Kerberos with the protocol, using keys/ passwords that are shared between the servers. Expand
A Proof of Security of Yao’s Protocol for Two-Party Computation
TLDR
This paper provides a complete description of Yao’s protocol, along with a rigorous proof of security, for the first time that an explicitProof of security has been published. Expand
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
TLDR
An efficient secure two-party protocol, based on Yao’s construction, which provides security against malicious adversaries and combines techniques from folklore along with new techniques for efficiently proving consistency of inputs. Expand
Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
TLDR
The protocol for secure pattern matching and one of the protocols for set intersection achieve security against malicious adversaries under a relaxed definition where one corruption case is simulatable and, for the other, only privacy is guaranteed. Expand
...
1
2
3
4
5
...