ALGAES : An authenticated lattice-based generic asymmetric encryption scheme
*S. S. Aravind VishnuCorresponding authorss_aravindvishnu@cb.amrita.eduAmrita School of EngineeringTIFAC-CORE in Cyber Security, Amrita Vishwa Vidyapeetham, Coimbatore Campus, Amritanagar P. OEttimadai, Tamil Nadu, 641112, India0000-0002-2374-5764View full profile → , M. Sethumadhavanm_sethu@cb.amrita.eduAmrita School of EngineeringTIFAC-CORE in Cyber Security, Amrita Vishwa Vidyapeetham, Coimbatore Campus, Amritanagar P. OEttimadai, Tamil Nadu, 641112, India0000-0001-5476-5461View full profile → , K. V. Lakshmykv_lakshmy@cb.amrita.eduAmrita School of EngineeringTIFAC-CORE in Cyber Security, Amrita Vishwa Vidyapeetham, Coimbatore Campus, Amritanagar P. OEttimadai, Tamil Nadu, 641112, India0000-0001-5344-2855View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Feb 2025
- Published Online:
- 12 May 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2580
- Pages:
- 2831–2844
Abstract
In this article, we propose a generic hybrid encryption scheme providing entity authentication. The scheme is based on lossy trapdoor functions relying on the hardness of the Learning With Errors problem. The construction can be used on a number of different security requirements with minimal reconfiguration. It ensures entity authentication and ciphertext integrity while providing security against adaptive chosen ciphertext attacks in the standard model. As a desired characteristic of schemes providing entity authentication, we prove the strong unforgeability under chosen message attack for the construction. In addition, the scheme is post-quantum secure based on the hardness of the underlying assumption.
Keywords
Subject Classifications
References
[1] C. Peikert et al., “A decade of lattice cryptography,” Foundations and trends in theoretical computer science, vol. 10, no. 4, pp. 283–424 (2016).
[2] V. Shoup, “Using hash functions as a hedge against chosen ciphertext attack,” in International Conference on the Theory and Applications of Cryptographic Techniques, pp. 275–288, Springer (2000).
[3] E. Fujisaki and T. Okamoto, “Secure integration of asymmetric and symmetric encryption schemes,” Journal of cryptology, vol. 26, no. 1, pp. 80–101 (2013).
[4] C. Peikert and B. Waters, “Lossy trapdoor functions and their applications,” SIAM Journal on Computing, vol. 40, no. 6, pp. 1803–1844 (2011).
[5] N. Alamati, H. Montgomery, S. Patranabis, and A. Roy, “Minicrypt primitives with algebraic structure and applications,” Journal of Cryptology, vol. 36, no. 1, pp. 1–106 (2023).
[6] V. Goyal, O. Pandey, and S. Richelson, “Textbook nonmalleable commitments,” in Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, pp. 1128–1141 (2016).
[7] M. Bellare, D. Hofheinz, and S. Yilek, “Possibility and impossibility results for encryption and commitment secure under selective opening,” in Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 1–35, Springer (2009).
[8] S. Katsumata, T. Tomita, and S. Yamada, “Direct computation of branching programs and its applications to more efficient lattice-based cryptography,” Designs, Codes and Cryptography, vol. 91, no. 2, pp. 391–431 (2023).
[9] G. Bertoni, J. Daemen, M. Peeters, and G. Van Assche, “Sponge functions,” in ECRYPT hash workshop, vol. 2007, Citeseer (2007).
[10] G. Bertoni, J. Daemen, M. Peeters, and G. V. Assche, “Keccak,” in Annual international conference on the theory and applications of cryptographic techniques, pp. 313–314, Springer (2013).
[11] Y. Zheng, “Digital signcryption or how to achieve cost (signature & encryption) ≪ cost (signature)+ cost (encryption),” in Annual international cryptology conference, pp. 165–179, Springer (1997).
[12] P. Megha Mukundan, S. Manayankath, C. Srinivasan, and M. Sethumadhavan, “Hash-one: a lightweight cryptographic hash function,” IET Information Security, vol. 10, no. 5, pp. 225–231 (2016).
[13] S. Aravind Vishnu, I. Praveen, and M. Sethumadhavan, “An IND-CCA2 Secure Certificateless Hybrid Signcryption,” Wireless Personal Communications, vol. 119, no. 4, pp. 3589–3608 (2021).
[14] K. Prasad and H. Mahato, “Cryptography using generalized fibonacci matrices with affine-hill cipher,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 25, no. 8, pp. 2341–2352 (2022).
[15] I. Ali, T. Lawrence, A. A. Omala, and F. Li, “An efficient hybrid signcryption scheme with conditional privacypreservation for heterogeneous vehicular communication in vanets,” IEEE Transactions on Vehicular Technology, vol. 69, no. 10, pp. 11266–11280 (2020).
[16] A. Elkhalil, J. zhang, R. Elhabob, and N. Eltayieb, “Poosc: Provably online/offline signcryption scheme for vehicular communication in vanets,” Computing, vol. 105, no. 11, pp. 2539–2561 (2023).
[17] I. Praveen, K. Rajeev, and M. Sethumadhavan, “An authenticated key agreement scheme using vector decomposition,” Defence Science Journal, vol. 66, no. 6, p. 594 (2016).
[18] I. Praveen, S. A. Vishnu, and M. Sethumadhavan, “An efficient composable 1-out-of-2 oblivious transfer scheme using vector decomposition,” International Journal of Advanced Intelligence Paradigms, vol. 27, no. 2, pp. 178–194 (2024).
[19] Y. Dodis, R. Ostrovsky, L. Reyzin, and A. Smith, “Fuzzy extractors: How to generate strong keys from biometrics and other noisy data,” SIAM journal on computing, vol. 38, no. 1, pp. 97–139 (2008).
[20] T. E. Bjørstad and A. W. Dent, “Building better signcryption schemes with tag-kems,” in Public Key Cryptography-PKC 2006: 9th International Conference on Theory and Practice in Public-Key Cryptography, New York, NY, USA, April 24-26, 2006. Proceedings 9, pp. 491–507, Springer (2006).
[21] O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” Journal of the ACM (JACM), vol. 56, no. 6, pp. 1–40 (2009).
[22] X. Liu, Z. Wang, Y. Ye, and F. Li, “An efficient and practical certificateless signcryption scheme for wireless body area networks,” Computer Communications, vol. 162, pp. 169–178 (2020).
[23] Y. Zhou, B. Yang, and W. Zhang, “Provably secure and efficient certificateless generalized signcryption,” Chinese Journal of Computers, vol. 39, no. 3, pp. 543–551 (2016).
[24] F. Zhou, Y. Li, and Y. Ding, “Practical v2i secure communication schemes for heterogeneous vanets,” Applied Sciences, vol. 9, no. 15, p. 3131 (2019).
[25] I. Ullah, A. Alomari, N. Ul Amin, M. A. Khan, and H. Khattak, “An energy efficient and formally secured certificate-based signcryption for wireless body area networks with the internet of things,” Electronics, vol. 8, no. 10, p. 1171 (2019).
[26] M. E. S. Saeed, Q. Liu, G. Tian, B. Gao, and F. Li, “Hoosc: heterogeneous online/offline signcryption for the internet of things,” Wireless Networks, vol. 24, pp. 3141–3160 (2018).
[27] B. Zhang, Z. Jia, and C. Zhao, “An efficient certificateless generalized signcryption scheme,” Security and Communication Networks, vol. 2018 (2018).
[28] F. Li and P. Xiong, “Practical secure communication for integrating wireless sensor networks into the internet of things,” IEEE Sensors Journal, vol. 13, no. 10, pp. 3677–3684 (2013).
