• Publications
  • Influence
Visual Cryptography
TLDR
A new type of cryptographic scheme, which can decode concealed images without any cryptographic computations, is considered, which is perfectly secure and very easy to implement.
Rank aggregation methods for the Web
TLDR
A set of techniques for the rank aggregation problem is developed and compared to that of well-known methods, to design rank aggregation techniques that can be used to combat spam in Web searches.
Our Data, Ourselves: Privacy Via Distributed Noise Generation
TLDR
This work provides efficient distributed protocols for generating shares of random noise, secure against malicious participants, and introduces a technique for distributing shares of many unbiased coins with fewer executions of verifiable secret sharing than would be needed using previous approaches.
Revocation and Tracing Schemes for Stateless Receivers
TLDR
The main improvements of these methods over previously suggested methods are reducing the message length to O(r) regardless of the coalition size while maintaining a single decryption at the user's end and providing a seamless integration between the revocation and tracing so that the tracing mechanisms does not require any change to the revocation algorithm.
Optimal aggregation algorithms for middleware
TLDR
An elegant and remarkably simple algorithm is analyzed that is optimal in a much stronger sense than FA, and is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability sense, but over every database.
Optimal aggregation algorithms for middleware
TLDR
An elegant and remarkably simple algorithm is analyzed that is optimal in a much stronger sense than FA, and is essentially optimal, not just for some monotone aggregation functions, but for all of them, and not just in a high-probability sense, but over every database.
Non-malleable cryptography
TLDR
Non-malleable schemes for each of the contexts of string commitment and zero-knowledge proofs of possession of knowledge, where a user need not know anything about the number or identity of other system users are presented.
Differential privacy under continual observation
TLDR
This work identifies the problem of maintaining a counter in a privacy preserving manner and shows its wide applicability to many different problems.
Efficient oblivious transfer protocols
TLDR
This paper presents several significant improvements to oblivious transfer protocols of strings, and in particular providing the first two-round OT protocol whose security analysis does not invoke the random oraclemodel.
Public-key cryptosystems provably secure against chosen ciphertext attacks
We show how to construct a public-key cryptosystem (as originally defined by DiNe and Hellman) secure against chosen ciphertezt attacks, given a public-key cryptosystern secure against passive
...
...