• Publications
  • Influence
Visual Cryptography
TLDR
In this paper we consider a new type of cryptographic scheme, which can decode concealed images without any cryptographic computations. Expand
Rank aggregation methods for the Web
TLDR
We consider the problem of combining ranking results from various sources. Expand
Revocation and Tracing Schemes for Stateless Receivers
TLDR
We deal with the problem of a center sending a message to a group of users such that some subset of the users is considered revoked and should not be able to obtain the content of the message. Expand
Our Data, Ourselves: Privacy Via Distributed Noise Generation
TLDR
In this work we provide efficient distributed protocols for generating shares of random noise, secure against malicious participants. Expand
Optimal aggregation algorithms for middleware
TLDR
We show that TA is optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability worst-case sense, but over every database. Expand
Non-malleable cryptography
TLDR
The notion of non-malleable cryptography, an extension of semantically secure cryptography, is defined. Expand
Optimal aggregation algorithms for middleware
TLDR
We analyze an elegant and remarkably simple algorithm (“the threshold algorithm”, or TA) that is optimal in a much stronger sense than FA. Expand
Broadcast Encryption
TLDR
We present several schemes that allow a center to broadcast a secret to any subset of privileged users out of a universe of size n so that coalitions of k users not in the privileged set cannot learn the secret. Expand
Efficient oblivious transfer protocols
TLDR
This paper presents several significant improvements to oblivious transfer protocols of strings, and in particular:(i) Improving the efficiency of applications which many invocationsof oblivious transfer. (ii) Providing the first two-round OT protocol whose security analysis does not invoke the random oraclemodel. Expand
Untraceable Electronic Cash
TLDR
An electronic cash protocol including the steps of using a one-way function f1 to generate an image f1 (x1) from a preimage x1 ; sending the image in an unblinded form to a second party; and receiving a note including a digital signature, wherein the note represents a commitment by the second party to credit a predetermined amount of money to a first party. Expand
...
1
2
3
4
5
...