#### Filter Results:

- Full text PDF available (59)

#### Publication Year

1998

2017

- This year (2)
- Last five years (20)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Dan Boneh, Xavier Boyen
- EUROCRYPT
- 2004

We construct two efficient Identity Based Encryption (IBE) systems that are selective identity secure without the random oracle model in groups equipped with a bilinear map. 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… (More)

- Dan Boneh, Xavier Boyen, Eu-Jin Goh
- EUROCRYPT
- 2005

We present a Hierarchical Identity Based Encryption (HIBE) system where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations , regardless of the hierarchy depth. Encryption is as efficient as in other HIBE systems. We prove that the scheme is selective-ID secure in the standard model and fully… (More)

- Dan Boneh, Xavier Boyen, Hovav Shacham
- CRYPTO
- 2004

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 bilin-ear groups called the Decision Linear assumption. We prove security of our system, in the random… (More)

- Dan Boneh, Xavier Boyen
- IACR Cryptology ePrint Archive
- 2004

We describe a short signature scheme which is existentially unforgeable under a chosen message attack without using random oracles. The security of our scheme depends on a new complexity assumption we call the Strong Diffie-Hellman assumption. This assumption has similar properties to the Strong RSA assumption, hence the name. Strong RSA was previously used… (More)

- Xavier Boyen, Daphne Koller
- UAI
- 1998

The monitoring and control of any dynamic system depends crucially on the ability to reason about its current status and its future trajectory. In the case of a stochastic system, these tasks typically involve the use of a belief state—a probability distribution over the state of the process at a given point in time. Unfortunately, the state spaces of… (More)

- Dan Boneh, Xavier Boyen
- IACR Cryptology ePrint Archive
- 2004

We present a fully secure Identity Based Encryption scheme whose proof of security does not rely on the random oracle heuristic. Security is based on the Decision Bilinear Diffie-Hellman assumption. This solves an open problem posed by Boneh and Franklin in 2001.

- Xavier Boyen, Qixiang Mei, Brent Waters
- ACM Conference on Computer and Communications…
- 2005

We describe a new encryption technique that is secure in the standard model against chosen ciphertext attacks. We base our method on two very efficient Identity-Based Encryption (IBE) schemes without random oracles due to Boneh and Boyen, and Waters.Unlike previous CCA2-secure cryptosystems that use IBE as a black box, our approach is very simple and… (More)

- Dan Boneh, Xavier Boyen
- J. Cryptology
- 2008

We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in groups equipped with an efficient bilinear map, or, more generally, an algorithm for the Decision Diffie-Hellman problem. The security of our scheme depends on a new intractability… (More)

- Shweta Agrawal, Dan Boneh, Xavier Boyen
- EUROCRYPT
- 2010

We construct an efficient identity based encryption system based on the standard learning with errors (LWE) problem. Our security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor enables the real system to generate short vectors in… (More)

- Xavier Boyen, Brent Waters
- CRYPTO
- 2006

We present an identity-based cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with small ciphertexts of size linear in the depth of the hierarchy.… (More)