Abstract

In this paper, we present a comprehensive picture and the state of the art of Identity Based Cryptography (IBC) and their security implications with applications. First, we introduce the basic concepts of security and principles of cryptography and then move into identity-based cryptography, an overview of its development process and research progress. We explain identity-based encryption (IBE) schemes and identity-based signature (IBS) schemes and their security analysis. Later, we discuss the hierarchical identity-based encryption (HIBE) present in standard model as well as in random oracle model. We also discuss Revocable Identity Based Encryption (RIBE) schemes from the view point of security models and constructions. We review several encryption schemes and their advantages and disadvantages along with their efficiency and security considerations

References

• A. Shamir, Identity-based Cryptosystems and Signature Schemes, Proceedings of CRYPTO ’84, LNCS 196, pages 47–53, Springer-Verlag, 1984.
• D. Boneh and M. Franklin, Identity-Based Encryption from the Weil Pairing, Proceedings of CRYPTO 2001, LNCS 2139, pages 213–229, Springer-Verlag, 2001.
• A. Joux, One Round Protocol for Tripartite Diffie-Hellman, Algorithmic Number Theory Symposium – Proceedings of ANTS 2002, LNCS 1838, pages 385–394, Springer-Verlag, 2000.
• J.Baek and Y.Zheng, Identity-Based Threshold Decryption, Public Key Cryptography – Proceedings of PKC 2004, LNCS 2947, pages 262-276, Springer-Verlag, 2004.
• F. Hess, Efficient Identity Based Signature Schemes Based on Pairings, Selected Areas in Cryptography – Proceedings of SAC 2002,LNCS 2595, pages 310–324, Springer-Verlag, 2002.
• F. Zhang and K. Kim, ID-based Blind Signature and Ring Signature from Pairings, Advances in Cryptology – Proceedings of ASIACRYPT 2002, LNCS 2501, pages 533–547, Springer-Verlag, 2002.
• Yacobi, Yacov, A Note on the Bi-Linear Diffie-Hellman Assumption, Cryptology, ePrint Archive, Report 2002/113.
• L.C. Guillou and J.-J. Quisquatar. A “paradoxical” identity-based signature scheme resulting from zero- knowledge. In Advances in Cryptology-Crypto’88 , LNCS 0403, pp. 216-231, Springer-Verlag, 1990.
• F. Hess. Efficient Identity Based Signature Schemes Based on Pairings. In Selected Areas in Cryptography-SAC’02, LNCS 2595, pp.310-324, Springer- Verlag, 2003.
• R. Sakai, K. Ohgishi and M. Kasahara. Cryptosysytems based on pairing. In Symposium on Cryptography and Information Security-SCIS’00, 2000.
• K. G. Paterson. ID-based signatures from pairings on elliptic curves, Cryptology ePrint Archive, Report 2002/004, 2002. http://eprint.iacr.org/2002/004.
• J. Cha and J.H. Cheon. An Identity-Based Signature from Gap Diffie-Hellman Groups. In Public Key Cryptography-PKC’03, LNCS 2567, pp.18-30, Springer-Verlag, 2003.
• J. H. Cheon, Y. Kim, H. J. Yoon, A New ID-based Signature with Batch Verification, Cryptology ePrint Archive, Report 2004/131, 2004. http://eprint.iacr.org/2004/131.
• X. Yi, An Identity-Based Signature Scheme From the Weil Pairing, IEEE Communication Letters, 7(2):76-78, IEEE, 2003.
• X. Chen, F. Zhang, K. Kim, A New ID-based Group Signature Scheme from Bilinear Pairings, In Proceedings of WISA’03, LNCS 2908, pp.585-592, Springer-Verlag, 2003.
• Y. Hanaoka, G. Hanaoka, J. Shikata, and H. Imai, “Identity-based hierarchical strongly key-insulated encryption and its application,” in ASIACRYPT (Lecture Notes in Computer Science), vol. 3788, B. K. Roy, Ed. Berlin, Germany: Springer-Verlag, 2005, pp. 495–514.
• R. Canetti, S. Halevi, and J. Katz, “A forward-secure public-keyencryption scheme,” J. Cryptol., vol. 20, no. 3, pp. 265–294, Jun. 2007.
• A. Boldyreva, V. Goyal, and V. Kumar, “Identity-based encryption with efficient revocation,” in Proc. 15th ACM CCS, 2008, pp. 417–426.
• B. Libert and D. Vergnaud, “Adaptive-ID secure revocable identity-based encryption,” in CT-RSA (Lecture Notes in Computer Science), vol. 5473, M. Fischlin, Ed. Berlin, Germany: Springer-Verlag, 2009, pp. 1–15.
• J. Chen, H. W. Lim, S. Ling, H. Wang, and K. Nguyen, “Revocable identity-based encryption from lattices,” in Information Security and Privacy (Lecture Notes in Computer Science), vol. 7372, W. Susilo,Y. Mu, and J. Seberry, Eds. Berlin, Germany: Springer-Verlag, 2012, pp. 390–403.
• B. Waters, “Efficient identity-based encryption without random oracles,” in EUROCRYPT (Lecture Notes in Computer Science), vol. 3494, R. Cramer, Ed. Berlin, Germany: Springer-Verlag, 2005, pp. 114–127.
• J. M. González-Nieto, M. Manulis, and D. Sun, “Fully private revocable predicate encryption,” in Information Security and Privacy (Lecture Notes in Computer Science), vol. 7372, W. Susilo, Y. Mu, and J. Seberry, Eds. Berlin, Germany: Springer-Verlag, 2012, pp. 350–363.
• J. H. Seo and K. Emura, “Revocable identity-based encryption revisited: Security model and construction,” in Public-Key Cryptography (Lecture Notes in Computer Science), vol. 7778, K. Kurosawa and G. Hanaoka, Eds. Berlin, Germany: Springer-Verlag, 2013, pp. 216–234.