Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Dan Boneh is active.

Publication


Featured researches published by Dan Boneh.


SIAM Journal on Computing | 2003

Identity-Based Encryption from the Weil Pairing

Dan Boneh; Matthew K. Franklin

We propose a fully functional identity-based encryption (IBE) scheme. The scheme has chosen ciphertext security in the random oracle model assuming a variant of the computational Diffie--Hellman problem. Our system is based on bilinear maps between groups. The Weil pairing on elliptic curves is an example of such a map. We give precise definitions for secure IBE schemes and give several applications for such systems.


theory and application of cryptographic techniques | 2004

Public Key Encryption with Keyword Search

Dan Boneh; Giovanni Di Crescenzo; Rafail Ostrovsky; Giuseppe Persiano

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 email gateway wants to test whether the email contains the keyword “urgent” so that it could route the email accordingly. Alice, on the other hand does not wish to give the gateway the ability to decrypt all her messages. We define 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. We refer to this mechanism as Public Key Encryption with keyword Search. As another example, consider a mail server that stores various messages publicly encrypted for Alice by others. Using our mechanism Alice can send the mail server a key that will enable the server to identify all messages containing some specific keyword, but learn nothing else. We define the concept of public key encryption with keyword search and give several constructions.


international cryptology conference | 2004

Short Group Signatures

Dan Boneh; Xavier Boyen; Hovav Shacham

We construct a short group signature scheme. Signatures in our scheme are approximately the size of a standard RSA signature with the same security. Security of our group signature is based on the Strong Diffie-Hellman assumption and a new assumption in bilinear groups called the Decision Linear assumption. We prove security of our system, in the random oracle model, using a variant of the security definition for group signatures recently given by Bellare, Micciancio, and Warinschi.


theory and application of cryptographic techniques | 2004

Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles

Dan Boneh; Xavier Boyen

We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model. Selective identity secure IBE is a slightly weaker security model than the standard security model for IBE. In this model the adversary must commit ahead of time to the identity that it intends to attack, whereas in the standard model the adversary is allowed to choose this identity adaptively. Our first secure IBE system extends to give a selective identity Hierarchical IBE secure without random oracles.


theory and application of cryptographic techniques | 1997

On the importance of checking cryptographic protocols for faults

Dan Boneh; Richard A. DeMillo; Richard J. Lipton

A sound pressure level meter adapted for use in monitoring noise levels, particularly for use by law enforcement agencies wherein the device includes means for providing a logarithmic indication of the root mean square value of ambient sound pressure levels and wherein means are provided for holding and displaying a maximum sound pressure level detected over a given period of time and for providing an alarm when a detected level exceeds a predetermined threshold level.


theory of cryptography conference | 2005

Evaluating 2-DNF formulas on ciphertexts

Dan Boneh; Eu-Jin Goh; Kobbi Nissim

Let ψ be a 2-DNF formula on boolean variables x1,...,xn ∈ {0,1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1,...,xn. In other words, given the encryption of the bits x1,...,xn, anyone can create the encryption of ψ(x1,...,xn). More generally, we can evaluate quadratic multi-variate polynomials on ciphertexts provided the resulting value falls within a small set. We present a number of applications of the system: In a database of size n, the total communication in the basic step of the Kushilevitz-Ostrovsky PIR protocol is reduced from


IEEE Transactions on Information Theory | 1998

Collusion-secure fingerprinting for digital data

Dan Boneh; James Shaw

\sqrt{n}


Archive | 2003

Advances in Cryptology - CRYPTO 2003

Dan Boneh

to


international cryptology conference | 2005

Collusion resistant broadcast encryption with short ciphertexts and private keys

Dan Boneh; Craig Gentry; Brent Waters

\sqrt[3]{n}


Journal of Cryptology | 2004

Short Signatures from the Weil Pairing

Dan Boneh; Ben Lynn; Hovav Shacham

. An efficient election system based on homomorphic encryption where voters do not need to include non-interactive zero knowledge proofs that their ballots are valid. The election system is proved secure without random oracles but still efficient. A protocol for universally verifiable computation.

Collaboration


Dive into the Dan Boneh's collaboration.

Top Co-Authors

Avatar

Xavier Boyen

Queensland University of Technology

View shared research outputs
Top Co-Authors

Avatar

Brent Waters

University of Texas at Austin

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Amit Sahai

University of California

View shared research outputs
Top Co-Authors

Avatar

Collin Jackson

Carnegie Mellon University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Hovav Shacham

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge