Fully secure IBE with tighter reduction in prime order bilinear groups

0Citations
Citations of this article
15Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper present an identity-based encryption (IBE) scheme with full security in prime order bilinear groups by using dual pairing vector space. The security of our scheme is based upon decisional linear and three party Diffie-Hellman assumption by adapting the dual system encryption. We obtain a tighter security reduction compared to previous works based on dual system encryption. The loss for security reduction of our scheme is O(q1), where q1 is the number of key queries in Phase 1.

Cite

CITATION STYLE

APA

Zhang, J., Ge, A., Xiao, S., & Ma, C. (2016). Fully secure IBE with tighter reduction in prime order bilinear groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9543, pp. 260–268). Springer Verlag. https://doi.org/10.1007/978-3-319-29814-6_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free