Searching for authors named Benny Pinkas – sorted by Relevance.
33 documents found, showing 1 through 10.
Next 10 →
-
Efficient State Updates for Key Management
- …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. When users leave or join the group, the group key must be changed, and a very common method of managi…
- Cited by 4 (0 self) – Add To MetaCart
-
Cryptographic Techniques for Privacy-Preserving 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 was shown that non-trusting parties can jointly compute functions of their different inputs while ensuring that no party learns anything …
- Cited by 29 (0 self) – Add To MetaCart
-
Secure Multiparty Computation for Privacy-Preserving Data Mining
- …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 definitions and constructions for secure multiparty computation, we discuss the issue of efficiency and demon…
- Add To MetaCart
-
Efficient Trace and Revoke Schemes
- …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 illegal decryption device, and (3) revoke these keys as to render the device dysfunctional. We start b…
- Cited by 37 (1 self) – Add To MetaCart
-
Secure and efficient metering
- … 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, it is desired to count the number of clients that were served by a server. A major possible applicatio…
- Cited by 23 (2 self) – Add To MetaCart
-
Distributed Oblivious Transfer
- …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 these servers in order to run the oblivious transfer protocol. These distributed oblivious transfer protocols…
- Cited by 11 (0 self) – Add To MetaCart
-
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 of semi-honest adversaries, and can be transformed into a protocol that achieves security against malicious adver…
- Cited by 9 (3 self) – Add To MetaCart
-
Threshold Traitor Tracing
- …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). Previous tracing schemes were designed to operate against any decoder which decrypts with a non-negligible s…
- Cited by 25 (3 self) – Add To MetaCart
-
Oblivious Polynomial Evaluation
- …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 (α) and the sender learns nothing. We describe efficient constructions for this protocol, which are b…
- Cited by 5 (1 self) – Add To MetaCart
-
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 human recipient who does not use any trusted computational device. The problem of authentication arises for…
- Cited by 22 (1 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
