New efficient identity based encryption without pairings

  • Jingang LiuEmail author
  • Lishan Ke
Original Research


Identity based encryption (IBE) schemes were first constructed with, and often have been since, bilinear mappings (a.k.a. pairings) on elliptic curves. But the multiply and exponent operation using pairings is slowly and inefficiency in implementation. There were, however, some successful attempts to construct IBE schemes based on more traditional number theoretic problems. Unfortunately, most of the proposed schemes are impractical as a result of bandwidth utilization or the time complexity of performance. By this work, we present a new efficient IBE scheme without pairings, which is inspired from the trapdoor technique rooted in composite residuosity class problem. Firstly, our converted basic IBE scheme is proven, in the random oracle model, secure against chosen-plaintext attacks (CPA) under the assumptions that the decision composite residuosity and decision partial discrete logarithm problems are intractable. Moreover, we employ the technique of Fujisaki–Okamoto to transform the basic scheme into enhanced one for resisting chosen-ciphertext attacks (CCA).


Identity based encryption Composite degree residuosity Provable security Random oracle 



The authors would like to thank the anonymous referees for their fruitful comments that improved the presentation of this paper. This work has been partially supported by the Graduate Innovation Foundation of Guangzhou University Project (Project no. 2017GDJC-D04).


  1. Ateniese G, Gasti P (2009) Universally anonymous ibe based on the quadratic residuosity assumption. In: Cryptographers’ track at the RSA conference, Springer, pp 32–47.
  2. Bellare M, Boldyreva A, Desai A, Pointcheval D (2001) Key-privacy in public-key encryption. In: International conference on the theory and application of cryptology and information security, Springer, pp 566–582.
  3. Boneh D, Franklin M (2001) Identity-based encryption from the weil pairing. In: Annual international cryptology conference, Springer, pp 213–229.
  4. Boneh D, Katz J (2005) Improved efficiency for cca-secure cryptosystems built using identity-based encryption. In: Cryptographers’ track at the RSA conference, Springer, pp 87–103.
  5. Boneh D, Di Crescenzo G, Ostrovsky R, Persiano G (2001) Public key encryption with keyword search. In: EUROCRYPT 2004, p 506.
  6. Boneh D, Gentry C, Hamburg M (2007) Space-efficient identity based encryptionwithout pairings. In: 48th annual IEEE symposium on foundations of computer science, 2007, FOCS’07, IEEE, pp 647–657,
  7. Boneh D, LaVigne R, Sabin M (2013) Identity-based encryption with eth residuosity and its incompressibility. In: Autumn 2013 TRUST conferenceGoogle Scholar
  8. Bresson E, Catalano D, Pointcheval D (2003) A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications. In: International conference on the theory and application of cryptology and information security, Springer, pp 37–54.
  9. Canetti R, Goldreich O, Halevi S (2004) The random oracle methodology, revisited. J ACM 51(4):557–594. MathSciNetCrossRefzbMATHGoogle Scholar
  10. Canetti R, Halevi S, Katz J (2007) A forward-secure public-key encryption scheme. J Cryptol 20(3):265–294. MathSciNetCrossRefzbMATHGoogle Scholar
  11. Chen X, Li J, Weng J, Ma J, Lou W (2016) Verifiable computation over large database with incremental updates. IEEE Trans Comput 65(10):3184–3195. MathSciNetCrossRefzbMATHGoogle Scholar
  12. Clear M, Tewari H, McGoldrick C (2014) Anonymous ibe from quadratic residuosity with improved performance. In: International conference on cryptology in Africa, Springer, pp 377–397.
  13. Cocks C (2001) An identity based encryption scheme based on quadratic residues. In: IMA international conference on cryptography and coding, Springer, pp 360–363.
  14. Cramer R, Shoup V (2002) Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Advances in cryptology–EUROCRYPT 2002.
  15. Desmedt Y, Quisquater JJ (1986) Public-key systems based on the difficulty of tampering (is there a difference between des and rsa?). In: Advances in cryptology–CRYPTO’86, Springer, pp 111–117.
  16. Döttling N, Garg S (2017) Identity-based encryption from the diffie–hellman assumption. In: Annual international cryptology conference, Springer, pp 537–569.
  17. Fujisaki E, Okamoto T (1999) How to enhance the security of public-key encryption at minimum cost. In: International workshop on public key cryptography, Springer, pp 53–68.
  18. Gentry C, Peikert C, Vaikuntanathan V (2008) Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the fortieth annual ACM symposium on Theory of computing, ACM, pp 197–206.
  19. Huang Z, Liu S, Mao X, Chen K, Li J (2017) Insight of the protection for data security under selective opening attacks. Inf Sci 412:223–241. CrossRefGoogle Scholar
  20. Li J, Li J, Chen X, Jia C, Lou W (2015) Identity-based encryption with outsourced revocation in cloud computing. IEEE Trans Comput 64(2):425–437. MathSciNetCrossRefzbMATHGoogle Scholar
  21. Liu D, Dai Y, Luan T, Yu S et al (2015) Personalized search over encrypted data with efficient and secure updates in mobile clouds. IEEE Trans Emerg Top Comput.
  22. Meshram C (2015) An efficient id-based cryptographic encryption based on discrete logarithm problem and integer factorization problem. Inf Process Lett 115(2):351–358. MathSciNetCrossRefzbMATHGoogle Scholar
  23. Paillier P (1999) Public-key cryptosystems based on composite degree residuosity classes. In: Advances in cryptology–EUROCRYPT’99, Springer, pp 223–238.
  24. Pan G, Lei H, Deng Y, Fan L, Yang J, Chen Y, Ding Z (2016) On secrecy performance of miso swipt systems with tas and imperfect csi. IEEE Trans Commun 64(9):3831–3843. CrossRefGoogle Scholar
  25. Paterson KG, Srinivasan S (2009) On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups. Des Codes Cryptogr 52(2):219–241. MathSciNetCrossRefzbMATHGoogle Scholar
  26. Rackoff C, Simon D (1992) Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Advances in cryptology–CRYPTO’91, Springer, pp 433–444.
  27. Shamir A (1985) Identity-based cryptosystems and signature schemes. In: Advances in cryptology, Springer, pp 47–53.
  28. Shen H, Gao C, He D, Wu L (2015) New biometrics-based authentication scheme for multi-server environment in critical systems. J Ambient Intell Hum Comput 6(6):825–834. CrossRefGoogle Scholar
  29. Tanaka H (1987) A realization scheme for the identity-based cryptosystem. In: Advances in cryptology–CRYPTO’87, Springer, pp 340–349.
  30. Wang XA, Ma J, Xhafa F, Zhang M, Luo X (2017a) Cost-effective secure e-health cloud system using identity based cryptographic techniques. Future Gener Comput Syst 67:242–254. CrossRefGoogle Scholar
  31. Wang XA, Xhafa F, Ma J, Cao Y, Tang D (2017b) Reusable garbled gates for new fully homomorphic encryption service. Int J Web Grid Serv 13(1):25–48. CrossRefGoogle Scholar
  32. Waters B (2005) Efficient identity-based encryption without random oracles. In: Advances in cryptology-EUROCRYPT 2005, pp 557–557.
  33. Xu J, Wei L, Zhang Y, Wang A, Zhou F, Gao CZ (2018) Dynamic fully homomorphic encryption-based merkle tree for lightweight streaming authenticated data structures. J Netw Comput Appl.

Copyright information

© Springer-Verlag GmbH Germany, part of Springer Nature 2018

Authors and Affiliations

  1. 1.School of Mathematics and Information ScienceGuangzhou UniversityGuangzhouPeople’s Republic of China

Personalised recommendations