• Publications
  • Influence
Software protection and simulation on oblivious RAMs
TLDR
This paper shows how to do an on-line simulation of an arbitrary RAM by a probabilistic oblivious RAM with a polylogaithmic slowdown in the running time, and shows that a logarithmic slowdown is a lower bound.
Public Key Encryption with Keyword Search
TLDR
This work defines and construct a mechanism that enables Alice to provide a key to the gateway that enables the gateway to test whether the word “urgent” is a keyword in the email without learning anything else about the email.
Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data
TLDR
This work proposes two primitives: a fuzzy extractor extracts nearly uniform randomness R from its biometric input; the extraction is error-tolerant in the sense that R will be the same even if the input changes, as long as it remains reasonably close to the original.
Searchable symmetric encryption: improved definitions and efficient constructions
TLDR
This paper formally defines SSE in the multi-user setting, and presents an efficient construction that achieves better performance than simply using access control mechanisms.
Searchable symmetric encryption: Improved definitions and efficient constructions
TLDR
This paper begins by reviewing existing notions of security and proposes new and stronger security definitions, and presents two constructions that show secure under these new definitions and are more efficient than all previous constructions.
Replication is not needed: single database, computationally-private information retrieval
TLDR
Based on the quadratic residuosity assumption, a single database, computationally private information retrieval scheme with O(n/sup /spl epsiv//) communication complexity for any /spl Epsiv/>0.0 is presented.
Attribute-based encryption with non-monotonic access structures
TLDR
An Attribute-Based Encryption scheme that allows a user's private key to be expressed in terms of any access formula over attributes based on the Decisional Bilinear Diffie-Hellman (BDH) assumption is constructed.
Universally composable two-party and multi-party secure computation
TLDR
It is shown how to securely realize any multi-party functionality in a universally composable way, regardless of the number of corrupted participants, which implies that security is preserved under concurrent composition of an unbounded number of protocol executions.
Efficient Password-Authenticated Key Exchange Using Human-Memorable Passwords
TLDR
This work shows an efficient, 3-round, password-authenticated key exchange protocol with human-memorable passwords which is provably secure under the Decisional Diffie-Hellman assumption, yet requires only (roughly) 8 times more computation than "standard" Diffie -Hellman key exchange (which provides no authentication at all).
Circular-Secure Encryption from Decision Diffie-Hellman
TLDR
A public-key encryption system that remains secure even encrypting messages that depend on the secret keys in use, and is circular-secure against chosen-plaintext attacks under the Decision Diffie-Hellman assumption.
...
1
2
3
4
5
...