ID-based threshold decryption without random oracles and its application in key escrow
InfoSecu '04 Proceedings of the 3rd international conference on Information security
An efficient identity-based signature scheme with batch verifications
InfoScale '06 Proceedings of the 1st international conference on Scalable information systems
Attribute-based encryption for fine-grained access control of encrypted data
Proceedings of the 13th ACM conference on Computer and communications security
Forward-secure signatures with untrusted update
Proceedings of the 13th ACM conference on Computer and communications security
Provably-secure time-bound hierarchical key assignment schemes
Proceedings of the 13th ACM conference on Computer and communications security
A New Practical Limited Identity-Based Encryption Scheme
Fundamenta Informaticae
Identity-based encryption with efficient revocation
Proceedings of the 15th ACM conference on Computer and communications security
Black-box accountable authority identity-based encryption
Proceedings of the 15th ACM conference on Computer and communications security
Traitor tracing with constant size ciphertext
Proceedings of the 15th ACM conference on Computer and communications security
Multi-use unidirectional proxy re-signatures
Proceedings of the 15th ACM conference on Computer and communications security
Outsourcing the decryption of ABE ciphertexts
SEC'11 Proceedings of the 20th USENIX conference on Security
Identity-Based encryption gone wild
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Reconsideration on the security of the boneh-franklin identity-based encryption scheme
INDOCRYPT'05 Proceedings of the 6th international conference on Cryptology in India
Public-Key encryption from ID-Based encryption without one-time signature
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part I
On the joint security of encryption and signature, revisited
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Expressive encryption systems from lattices
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Forward-Secure Identity-Based Public-Key Encryption without Random Oracles
Fundamenta Informaticae
Fully secure hidden vector encryption under standard assumptions
Information Sciences: an International Journal
Signatures of correct computation
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
Server-aided identity-based anonymous broadcast encryption
International Journal of Security and Networks
Privacy-preserving audit for broker-based health information exchange
Proceedings of the 4th ACM conference on Data and application security and privacy
Anonymous broadcast encryption with an untrusted gateway
International Journal of Security and Networks
| Hi-index | 0.00 |
We construct two efficient Identity-Based Encryption (IBE) systems that admit selective-identity security reductions without random oracles 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 intends to attack, whereas in an adaptive-identity attack the adversary is allowed to choose this identity adaptively. Our first system—BB1—is based on the well studied decisional bilinear Diffie–Hellman assumption, and extends naturally to systems with hierarchical identities, or HIBE. Our second system—BB2—is based on a stronger assumption which we call the Bilinear Diffie–Hellman Inversion assumption and provides another approach to building IBE systems. Our first system, BB1, is very versatile and well suited for practical applications: the basic hierarchical construction can be efficiently secured against chosen-ciphertext attacks, and further extended to support efficient non-interactive threshold decryption, among others, all without using random oracles. Both systems, BB1 and BB2, can be modified generically to provide “full” IBE security (i.e., against adaptive-identity attacks), either using random oracles, or in the standard model at the expense of a non-polynomial but easy-to-compensate security reduction.