Dan Boneh, Xavier Boyen  Home/Search
Context Related
| iacr.org/2004/173.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/search...ast=365&title=1 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: 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 decisional bilinear Di#e-Hellman assumption. Previous constructions of this type incurred a large penalty factor in the security reduction from the underlying complexity assumption. The security reduction of the present system is polynomial in all the parameters. (Update)
Similar documents based on text: More All
0.9: Secure Identity Based Encryption without Random Oracles - Boneh, Boyen (2004) (Correct)
0.8: Efficient Selective-ID Secure Identity Based Encryption.. - Boneh, Boyen (2004) (Correct)
0.7: Short Signatures without Random Oracles - Boneh, Boyen (2004) (Correct)
BibTeX entry: (Update)
Dan Boneh and Xavier Boyen. Secure identity based encryption without random oracles. In Matt Franklin, editor, Proceedings of Crypto 2004, LNCS. Springer-Verlag, 2004. http://citeseer.ist.psu.edu/boneh04secure.html More
@misc{ boneh04secure,
author = "D. Boneh and X. Boyen",
title = "Secure identity based encryption without random oracles",
text = "Dan Boneh and Xavier Boyen. Secure identity based encryption without random
oracles. In Matt Franklin, editor, Proceedings of Crypto 2004, LNCS. Springer-Verlag,
2004.",
year = "2004",
url = "citeseer.ist.psu.edu/boneh04secure.html" }
Citations (may not include all citations):659 Random oracle are practical: A paradigm for designing e#cien.. - Bellare, Rogaway - 1993
337 Identity-based encryption from the Weil pairing - Boneh, Franklin - 2001
337 Identity-based encryption from the Weil pairing - Boneh, Franklin - 2003
201 Identity-based cryptosystems and signature schemes (context) - Shamir - 1984
108 A one round protocol for tripartite Di#e-Hellman (context) - Joux - 2000
73 Cryptosystems based on pairings (context) - Sakai, Ohgishi et al. - 2000
60 An identity based encryption scheme based on quadratic resid.. (context) - ord - 2001
56 Hierarchical ID-based cryptography - Gentry, Silverberg - 2002
49 An identity-based signature from gap Di#e-Hellman groups - Cha, Cheon - 2003
44 Towards hierarchical identity-based encryption - Horwitz, Lynn - 2002
42 A forward-secure public-key encryption scheme - Canetti, Halevi et al. - 2003
37 Chosen-ciphertext security from identitybased encryption - Canetti, Halevi et al. - 2004
22 An uninstantiable randomoracle -model scheme for a hybrid-en.. (context) - Bellare, Boldyreva et al. - 2004
14 Multipurpose identity-based signcryption: A Swiss Army knife.. - Boyen - 2003
10 A realization scheme for the identity-based cryptosystem (context) - Tanaka - 1987
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://eprint.iacr.org/search.pl?last=365&title=1): More
Robust Software Tokens: Towards Securing a Digital Identity - Kwon (2001) (Correct)
On the Complexity of Matsui's Attack - Junod (2001) (Correct)
Constructing Pseudo-Random Permutations with a Prescribed.. - Naor, Reingold (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC