Skip to search formSkip to main contentSkip to account menu

Software protection and simulation on oblivious RAMs

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.
View on ACM (opens in a new tab)

Searchable symmetric encryption: improved definitions and efficient constructions

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.
View on ACM (opens in a new tab)

Public Key Encryption with Keyword Search

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.
View via Publisher (opens in a new tab)

Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data

We provide formal definitions and efficient secure techniques for turning biometric information into keys usable for any cryptographic application, and reliably and securely authenticating…
View PDF on arXiv (opens in a new tab)

Replication is not needed: single database, computationally-private information retrieval

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.
View on IEEE (opens in a new tab)

Attribute-based encryption with non-monotonic access structures

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.
View on ACM (opens in a new tab)

Universally composable two-party and multi-party secure computation

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.
View on ACM (opens in a new tab)

Deniable Encryption

Simple constructions that transform sender-deniable schemes into receiver-deniability schemes and vice-versa are described, with respect to schemes that encrypt only one bit at a time.
View via Publisher (opens in a new tab)

Circular-Secure Encryption from Decision Diffie-Hellman

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.
View via Publisher (opens in a new tab)

The Effectiveness of Lloyd-Type Methods for the k-Means Problem

This work investigates variants of Lloyd's heuristic for clustering high dimensional data in an attempt to explain its popularity (a half century after its introduction) among practitioners, and proposes and justifies a clusterability criterion for data sets.
View on ACM (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)