Privacy Preserving Data Mining
- Yehuda Lindell, Benny Pinkas
- Computer ScienceJournal of Cryptology
- 20 August 2000
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.
Introduction to Modern Cryptography
- Jonathan Katz, Yehuda Lindell
- Computer Science, Mathematics
- 2007
This book discusses Private-Key (Symmetric) Cryptography, Number Theory and Cryptographic Hardness Assumptions, and the Random-Oracle Model in Detail.
Universally composable two-party and multi-party secure computation
- R. Canetti, Yehuda Lindell, R. Ostrovsky, A. Sahai
- Computer Science, MathematicsSymposium on the Theory of Computing
- 19 May 2002
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.
Secure Multiparty Computation for Privacy-Preserving Data Mining
- Yehuda Lindell, Benny Pinkas
- Computer Science, MathematicsIACR Cryptology ePrint Archive
- 1 April 2009
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.
High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority
- Toshinori Araki, Jun Furukawa, Yehuda Lindell, Ariel Nof, Kazuma Ohara
- Computer Science, MathematicsIACR Cryptology ePrint Archive
- 24 October 2016
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.
A Framework for Password-Based Authenticated Key Exchange
- R. Gennaro, Yehuda Lindell
- Computer Science, MathematicsInternational Conference on the Theory and…
- 4 May 2003
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.
A Proof of Security of Yao’s Protocol for Two-Party Computation
- Yehuda Lindell, Benny Pinkas
- Computer Science, MathematicsJournal of Cryptology
- 6 April 2009
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.
Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Y. Aumann, Yehuda Lindell
- Computer Science, MathematicsJournal of Cryptology
- 21 February 2007
The notion of covert adversaries is introduced, which is believed to faithfully models the adversarial behavior in many commercial, political, and social settings and it is shown that it is possible to obtain highly efficient protocols that are secure against such adversaries.
More efficient oblivious transfer and extensions for faster secure computation
- Gilad Asharov, Yehuda Lindell, T. Schneider, Michael Zohner
- Computer Science, MathematicsConference on Computer and Communications…
- 4 November 2013
This work proposes a novel OT protocol with security in the standard model and improves OT extensions with respect to communication complexity, computation complexity, and scalability and demonstrates the importance of correctly implementing OT within secure computation protocols by presenting an attack on the FastGC framework.
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Yehuda Lindell, Benny Pinkas
- Computer Science, MathematicsJournal of Cryptology
- 20 May 2007
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.
...
...