• Publications
  • Influence
Dynamic searchable symmetric encryption
TLDR
This work proposes the first SSE scheme to satisfy all the properties of searchable symmetric encryption and extends the inverted index approach in several non-trivial ways and introduces new techniques for the design of SSE. Expand
Dynamic provable data possession
TLDR
A definitional framework and efficient constructions for dynamic provable data possession (DPDP), which extends the PDP model to support provable updates to stored data, and uses a new version of authenticated dictionaries based on rank information. Expand
Hawk: The Blockchain Model of Cryptography and Privacy-Preserving Smart Contracts
TLDR
Hawk is a decentralized smart contract system that does not store financial transactions in the clear on the blockchain, thus retaining transactional privacy from the public's view, and is the first to formalize the blockchain model of cryptography. Expand
Practical Dynamic Searchable Encryption with Small Leakage
TLDR
This paper proposes the first DSSE scheme that achieves the best of both worlds, i.e., both small leakage and efficiency, and provides an implementation of the scheme, showing its practical efficiency. Expand
Parallel and Dynamic Searchable Symmetric Encryption
TLDR
A new method for constructing sub-linear SSE schemes that enjoys a strong notion of security, namely security against adaptive chosen-keyword attacks, and can be implemented efficiently in external memory with logarithmic I/O overhead. Expand
Practical dynamic proofs of retrievability
TLDR
This work proposes a dynamic PoR scheme with constant client storage whose bandwidth cost is comparable to a Merkle hash tree, thus being very practical and shows how to make the scheme publicly verifiable, providing the first dynamic Po R scheme with such a property. Expand
All Your Queries Are Belong to Us: The Power of File-Injection Attacks on Searchable Encryption
TLDR
This work thoroughly study file-injection attacks on the query privacy of singlekeyword and conjunctive searchable encryption schemes, and shows such attacks can reveal the client’s queries in their entirety using very few injected files, even for SE schemes having low leakage. Expand
Optimal Verification of Operations on Dynamic Sets
TLDR
New authenticated data structures are presented that allow any entity to publicly verify a proof attesting the correctness of primitive set operations such as intersection, union, subset and set difference, based on the bilinear q-strong Diffie-Hellman assumption. Expand
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption
TLDR
An asymptotically efficient oblivious RAM ORAM protocol providing oblivious access read and write of a memory index y in exactly two rounds that gives rise to a 4-round symmetric searchable encryption scheme where search is sublinear in the worst case and the search pattern is not leaked. Expand
Signatures of Correct Computation
TLDR
Signatures of Correct Computation is introduced, a new model for verifying dynamic computations in cloud settings and it is shown that signatures of correct computation imply Publicly Verifiable Computation (PVC), a model recently introduced in several concurrent and independent works. Expand
...
1
2
3
4
5
...