We study the problem of searching on data that is encrypted using a public key system.
Consider user Bob who sends email to user Alice encrypted under Alice's public key. An …

In 1998, Blaze, Bleumer, and Strauss (BBS) proposed an application called atomic proxy re-
encryption, in which a semitrusted proxy converts a ciphertext for Alice into a ciphertext for …

Today's technical and legal landscape presents formidable challenges to personal data
privacy. First, our increasing reliance on Web services causes personal data to be cached …

We introduce the notion of certificate-based encryption. In this model, a certificate—or, more
generally, a signature—acts not only as a certificate but also as a decryption key. To decrypt …

Recent targeted attacks have increased significantly in sophistication, undermining the
fundamental assumptions on which most cryptographic primitives rely for security. For …

Cloud storage auditing is viewed as an important service to verify the integrity of the data in
public cloud. Current auditing protocols are all based on the assumption that the client's …

We construct functional encryption schemes for polynomial-time computable functions
secure against an a-priori bounded polynomial number of collusions. Our constructions …

System logs are the greatest forensics assets that capture how an operating system or a
program behaves. System logs are often the next immediate attack target once a system is …

In this work we revisit and formally study the notion of proxy cryptography. Intuitively, various
proxy functions allow two cooperating parties F (the “FBI”) and P (the “proxy”) to duplicate …

Abstract In ACM CCS 2008, Boldyreva et al. proposed an elegant way of achieving an
Identity-based Encryption (IBE) with efficient revocation, which we call revocable IBE (RIBE) …