Peer-to-Peer Secure Multi-Party Numerical Computation Facing Malicious Adversaries (2009)
Bickson, Danny, Reinman, Tzachy, Dolev, Danny, Pinkas, Benny
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering,...
The Design and Implementation of Protocol-Based Hidden Key Recovery (2008)
Eu-jin Goh, Dan Boneh, Benny Pinkas
Abstract. We show how to add key recovery to existing security protocols such as SSL/TLS and SSH without changing the protocol. Our key recovery designs possess the following novel features: (1) The...
Fair Secure Two-Party Computation Extended Abstract (2008)
Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol...
Peer-to-Peer Secure Multi-Party Numerical Computation (2008)
Bickson, Danny, Bezman, Genia, Dolev, Danny, Pinkas, Benny
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collaborative filtering,...
Joan Feigenbaum, Benny Pinkas, Felipe Saint Jean, Raphael S. Ryger
We describe the design and implementation of a system for conducting surveys while hiding the information provided by the respondents. We use the CRA Taulbee Survey of faculty salaries in computer...
Fair Secure Two-Party Computation Extended Abstract (2008)
Abstract. We demonstrate a transformation of Yao’s protocol for secure two-party computation to a fair protocol in which neither party gains any substantial advantage by terminating the protocol...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2008)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
Abstract We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popularcombinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party,...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2008)
Ronen Gradwohl, Moni Naor, Benny Pinkas
We consider various cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. The cryptographic protocols are direct and efficient, and the physical...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2008)
Ronen Gradwohl, Moni Naor, Benny Pinkas
We consider various cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. The cryptographic protocols are direct and efficient, and the physical...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2008)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the...
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
xi as the keyword and pi as the payload (database record). A query froma client is a searchword
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2008)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
Abstract. We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another...
Secure Multiparty Computation for Privacy-Preserving Data Mining (2008)
In this paper, we survey the basic paradigms and notions of secure multiparty computation and discuss their relevance to the field of privacy-preserving data mining. In addition to reviewing...
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
Abstract---Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing...
We describe a new construction for 1-out-of-N oblivious transfer which is highly ecient { it requires only log N executions of a 1-out-of-2 oblivious transfer protocol. We also present a construction...
Benny Chor, Moni Naor, Benny Pinkas
We give cryptographic schemes that help trace the source of leaks when sensitive or proprietary data is made available to a large set of parties. A very relevant application is in the context of pay...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2007)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the...
Prof Danny Dolev, Dr. Benny Pinkas, Danny Dolev, Zvi Gutterman, Benny Pinkas, Scott Kirkpatrick
I would like to thank my advisors for their support, insight, and patience:
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2007)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
Abstract We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popularcombinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party,...
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 of...
Cryptographic and Physical Zero-Knowledge Proof Systems for Solutions of Sudoku Puzzles (2007)
Ronen Gradwohl, Moni Naor, Benny Pinkas, Guy N. Rothblum
We consider cryptographic and physical zero-knowledge proof schemes for Sudoku, a popular combinatorial puzzle. We discuss methods that allow one party, the prover, to convince another party, the...
Leo Dorrendorf, Zvi Gutterman, Benny Pinkas
The pseudo-random number generator (PRNG) used by the Windows operating system is the most commonly used PRNG. The pseudo-randomness of the output of this generator is crucial for the security of...
Analysis of the Linux Random Number Generator (2006)
Zvi Gutterman Safend, Zvi Gutterman, Tzachy Reinman, Benny Pinkas
Linux is the most popular open source project. The Linux random number generator is part of the kernel of all Linux distributions and is based on generating randomness from entropy of operating...
Oblivious Polynomial Evaluation (2006)
Oblivious polynomial evaluation is a protocol involving two parties, a sender whose input is a polynomial P, and a receiver whose input is a value α. At the end of the protocol the receiver learns P...
Keyword Search and Oblivious Pseudorandom Functions (2005)
Michael J. Freedman, Yuval Ishai, Benny Pinkas, Omer Reingold
We study the problem of privacy-preserving access to a database.
Secure computation of the k th -ranked element (2004)
Gagan Aggarwal, Nina Mishra, Benny Pinkas
Abstract. Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the k th-ranked element of the union of the datasets, e.g. the median of the...
In the mid 1980’s, 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 a...
Secure computation of the k th -ranked element (2004)
Gagan Aggarwal, Nina Mishra, Benny Pinkas
Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the k th-ranked element of the union of the datasets, e.g. the median of the values in...
Fairplay — a secure two-party computation system (2004)
Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure twoparty computation a realistic paradigm. Yet, thus far, interest in this paradigm has...
Efficient private matching and set intersection (2004)
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
Abstract. We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has many...
Efficient state updates for key management (2004)
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed to use the content....
Fairplay - A Secure Two-Party Computation System (2004)
Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure two-party computation a realistic paradigm. Yet, thus far, interest in this paradigm has...
Fairplay - A Secure Two-Party Computation System (2004)
Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure twoparty computation a realistic paradigm. Yet, thus far, interest in this paradigm has...
Fairplay — a secure two-party computation system (2004)
Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure two-party computation a realistic paradigm. Yet, thus far, interest in this paradigm has...
Efficient state updates for key management (2004)
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed to use the content....
A Proof of Yao’s Protocol for Secure Two-Party Computation (2004)
In the mid 1980’s, 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 a...
Fairplay - A Secure Two-Party Computation System (2004)
Dahlia Malkhi, Noam Nisan, Benny Pinkas, Yaron Sella
Advances in modern cryptography coupled with rapid growth in processing and communication speeds make secure two-party computation a realistic paradigm. Yet, thus far, interest in this paradigm has...
Secure computation of the k th -ranked element (2004)
Gagan Aggarwal, Nina Mishra, Benny Pinkas
Abstract. Given two or more parties possessing large, confidential datasets, we consider the problem of securely computing the k th-ranked element of the union of the datasets, e.g. the median of the...
The Design and Implementation of Protocol-Based Hidden Key Recovery (2003)
Eu-jin Goh, P. Golle, B. Pinkas, D. Boneh, Benny Pinkas
We show how to add key recovery to existing security protocols such as SSL/TLS and SSH without changing the protocol. Our key recovery designs possess the following novel features: (1) The Key...
Certified Email with a Light On-line Trusted Third Party: Design and Implementation (2002)
Abadi, Martn, Glew, Neal, Horne, Bill, Pinkas, Benny
This paper presents a new protocol for certified email. The protocol aims to combine security, scalability, easy implementation, and viable deployment. The protocol relies on a light on-line trusted...
Cryptographic Techniques For Privacy-Preserving Data Mining (2002)
cryptography, privacy, data mining Research in secure distributed computation, which was done as part of a larger body of research in the theory of cryptography, has achieved remarkable results. It...
Combining Public Key Cryptosystems (2001)
It is a maxim of sound computer-security practice that a cryptographic key should have only a single use. For example, an RSA key pair should be used only for public-key encryption or only for...
Escrow services and incentives in peer-to-peer networks (2001)
Bill Horne, Benny Pinkas, Tomas Sander
Distribution of content, such as music, remains one of the main drivers of P2P development. Subscription-based services are currently receiving a lot of attention from the content industry as a...
Combining Public Key Cryptosystems (2001)
Abstract It is a maxim of sound computer-security practice that a cryptographic key should have only a single use. For example, an RSA key pair should be used only for public-key encryption or only...
Efficient State Updates for Key Management (2001)
Encryption is widely used to enforce usage rules for digital content. In many scenarios content is encrypted using a group key which is known to a group of users that are allowed to use the content....
Privacy preserving data mining (2000)
Yehuda Lindell, Rehovot Israel, Benny Pinkas
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 mining algorithm on...
Privacy preserving data mining (2000)
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 mining algorithm on...
Efficient Trace and Revoke Schemes (2000)
Our goal is to design encryption schemes for mass distribution of data in which it is possible to (1) deter users from leaking their personal keys, (2) trace which users leaked keys to construct an...
Privacy preserving data mining (2000)
Yehuda Lindell, Rehovot Israel, Benny Pinkas
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,...
Privacy Preserving Data Mining (2000)
. 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...
Efficient Trace and Revoke Schemes (2000)
Our goal is to design encryption schemes for mass distribution of data in which it is possible to (1) deter users from leaking their personal keys, (2) trace which users leaked keys to construct an...
Efficient Trace and Revoke Schemes (2000)
Our goal is to design encryption schemes for mass distribution of data that enable to (1) deter users from leaking their personal keys, (2) trace the identities of users whose keys were used to...
Multicast security: A taxonomy and some efficient constructions (1999)
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
Abstract—Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing...
Privacy preserving auctions and mechanism design (1999)
Moni Naor, Benny Pinkas, Reuben Sumner
We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential...
Distributed pseudo-random functions and KDCs (1999)
Moni Naor, Benny Pinkas, Omer Reingold
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers...
Distributed pseudo-random functions and KDCs (1999)
Moni Naor, Benny Pinkas, Omer Reingold
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers...
Privacy preserving auctions and mechanism design (1999)
Moni Naor, Benny Pinkas, Reuben Sumner
We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential...
Privacy Preserving Auctions and Mechanism Design (1999)
Moni Naor, Benny Pinkas, Reuben Sumner
We suggest an architecture for executing protocols for auctions and, more generally, mechanism design. Our goal is to preserve the privacy of the inputs of the participants (so that no nonessential...
Multicast Security: A Taxonomy and Some Efficient Constructions (1999)
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing security...
Oblivious Transfer with Adaptive Queries (1999)
. We provide protocols for the following two-party problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an adaptive...
Multicast Security: A Taxonomy and Some Efficient Constructions (1999)
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing security...
Multicast security: A taxonomy and some efficient constructions (1999)
Ran Canetti, Juan Garay, Gene Itkis, Daniele Micciancio, Moni Naor, Benny Pinkas
Abstract—Multicast communication is becoming the basis for a growing number of applications. It is therefore critical to provide sound security mechanisms for multicast communication. Yet, existing...
Oblivious transfer with adaptive queries (1999)
Abstract. We provide protocols for the following two-party problem: One party, the sender, has N values and the other party, the receiver, would like to learn k of them, deciding which ones in an...
Secure and e cient metering (1998)
Abstract. We consider an environment inwhichmany servers serve an even larger number of clients (e.g. the web), and it is required to meter the interaction between servers and clients. More speci...
Threshold Traitor Tracing (1998)
Abstract. This work presents threshold tracing schemes. Tracing schemes trace the source of keys which are used in pirate decoders for sensitive or proprietary data (such as pay-TV programs)....
Secure and Efficient Metering (1998)
. We consider an environment in which many servers serve an even larger number of clients (e.g. the web), and it is required to meter the interaction between servers and clients. More specifically,...
Secure and Efficient Metering (1998)
. We consider an environment in which many servers serve an even larger number of clients (e.g. the web), and it is required to meter the interaction between servers and clients. More specifically,...
Visual authentication and identification (1997)
The problems of authentication and identification have received wide interest in cryptographic research. However, there has been no satisfactory solution for the problem of authentication by a human...
Visual authentication and identification (1997)
The problems of authentication and identification have received wide interest in cryptographic research. However, there has been no satisfactory solution for the problem of authentication by a human...
Distributed oblivious transfer (1976)
Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of...
Distributed oblivious transfer (1976)
Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of...
Distributed oblivious transfer (1976)
Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of...
Distributed oblivious transfer (1976)
Abstract. This work describes distributed protocols for oblivious transfer, in which the role of the sender is divided between several servers, and a chooser (receiver) must contact a threshold of...
On the Security of Pay-Per-Click and Other Web Advertising Schemes
Vinod Anupam, Alain Mayer, Kobbi Nissim, Benny Pinkas, Michael K. Reiter
We present a hit inflation attack on pay-per-click Web advertising schemes. Our attack is virtually impossible for the program provider to detect conclusively, regardless of whether the provider is a...
. This work presents threshold tracing schemes. Tracing schemes trace the source of keys which are used in pirate decoders for sensitive or proprietary data (such as pay-TV programs). Previous...
Visual Authentication and Identification
. The problems of authentication and identification have received wide interest in cryptographic research. However, there has been no satisfactory solution for the problem of authentication by a...