Advertisement

On the Security of Jhanwar-Barua Identity-Based Encryption Scheme

  • Adrian G. SchiporEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11359)

Abstract

In [3], Jhanwar and Barua presented an improvement of the Boneh-Gentry-Hamburg (BGH) scheme. In addition to reducing the time complexity of the algorithm to find a solution of the equation \(ax^2+Sy^2\equiv 1 \bmod n\), their scheme reduces the number of equations to be solved by combining existing solutions. In [2], Susilo et al. extended the Jhanwar-Barua scheme, reducing more the number of equations to be solved. This paper presents a security flaw that appears in both schemes and shows that they are not IND-ID-CPA secure.

Notes

Acknowledgment

I wish to thank to my supervisor, Prof. Dr. Ferucio Laurenţiu Ţiplea, for helping me by deducing the property (2) from the Sect. 3 (the case when R is not a quadratic residue), after the practical tests told us that the property should hold.

References

  1. 1.
    Boneh, D., Gentry, C., Hamburg, M.: Space-efficient identity based encryption without pairings. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 647–657. IEEE Computer Society, Washington (2007)Google Scholar
  2. 2.
    Elashry, I., Mu, Y., Susilo, W.: Jhanwar-Barua’s identity-based encryption revisited. In: Au, M.H., Carminati, B., Kuo, C.-C.J. (eds.) NSS 2014. LNCS, vol. 8792, pp. 271–284. Springer, Cham (2014).  https://doi.org/10.1007/978-3-319-11698-3_21CrossRefGoogle Scholar
  3. 3.
    Jhanwar, M.P., Barua, R.: A variant of Boneh-Gentry-Hamburg’s pairing-free identity based encryption scheme. In: Yung, M., Liu, P., Lin, D. (eds.) Inscrypt 2008. LNCS, vol. 5487, pp. 314–331. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-01440-6_25CrossRefGoogle Scholar
  4. 4.
    Boneh, D., Franklin, M.: Identity-based encryption from the Weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213–229. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-44647-8_13CrossRefGoogle Scholar
  5. 5.
    Damgård, I.B.: On the randomness of legendre and jacobi sequences. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 163–172. Springer, New York (1990).  https://doi.org/10.1007/0-387-34799-2_13CrossRefGoogle Scholar
  6. 6.
    Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47–53. Springer, Heidelberg (1985).  https://doi.org/10.1007/3-540-39568-7_5CrossRefGoogle Scholar
  7. 7.
    Cocks, C.: An identity based encryption scheme based on quadratic residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol. 2260, pp. 360–363. Springer, Heidelberg (2001).  https://doi.org/10.1007/3-540-45325-3_32CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Department of Computer Science“Al. I. Cuza” University of IașiIașiRomania

Personalised recommendations