Skip to search formSkip to main contentSkip to account menu

Privacy Preserving Data Mining

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.
View on Springer (opens in a new tab)

Introduction to Modern Cryptography

This book discusses Private-Key (Symmetric) Cryptography, Number Theory and Cryptographic Hardness Assumptions, and the Random-Oracle Model in Detail.
View Paper (opens in a new tab)

Universally composable two-party and multi-party secure computation

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.
View on ACM (opens in a new tab)

Secure Multiparty Computation for Privacy-Preserving Data Mining

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.
View PDF (opens in a new tab)

High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

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.
View on ACM (opens in a new tab)

A Framework for Password-Based Authenticated Key Exchange

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.
View via Publisher (opens in a new tab)

A Proof of Security of Yao’s Protocol for Two-Party Computation

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.
View on Springer (opens in a new tab)

Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries

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.
View on Springer (opens in a new tab)

More efficient oblivious transfer and extensions for faster secure computation

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.
View on ACM (opens in a new tab)

An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries

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.
View on Springer (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)