VSSTPM: Verifiable simulation-secure threshold public key encryption scheme from standard module-LWE for IoT gateway-based applications

Abstract

The Internet of Things (IoT) has become an integral part of daily life, making the protection of user privacy increasingly important. In gateway-based IoT systems, user data is transmitted through gateways to platforms, pushing the data to various applications, widely used in smart cities, industrial IoT, smart farms, healthcare IoT, and other fields. Threshold Public Key Encryption (TPKE) provides a method to distribute private keys for decryption, enabling joint decryption by multiple parties, thus ensuring data security during gateway transmission, platform storage, and application access. However, existing TPKE schemes face several limitations, including vulnerability to quantum attacks, failure to meet Simulation-Security (SS) requirements, lack of verifiability, and inefficiency, which results in gateway-based IoT systems still being not secure and efficient enough. To address these challenges, we propose a Verifiable Simulation-Secure Threshold PKE scheme based on standard Module-LWE (VSSTPM). Our scheme resists quantum attacks, achieves SS, and incorporates Non-Interactive Zero-Knowledge (NIZK) proofs. Implementation and performance evaluations demonstrate that VSSTPM offers 112-bit quantum security and outperforms existing TPKE schemes in terms of efficiency. Compared to the ECC-based TPKE scheme, our scheme reduces the time cost for decryption participants by 72.66%, and the decryption verification of their scheme is 11 times slower than ours. Compared with the latest lattice-based TPKE scheme, our scheme reduces the time overhead by 90% and 48.9% in system user encryption and decryption verification, respectively, and their scheme is 13 times slower than ours in terms of decryption participants.

Keywords

IoT gateway / TPKE / Simulation-security / Verifiable / Standard module-LWE problem / NIZK proof / 112-Bit quantum security

References

[1] C. Lin, D. He, N. Kumar, K.-K.R. Choo, A. Vinel, X. Huang, Security and privacy for the Internet of drones: challenges and solutions, IEEE Commun. Mag. 56 (1) (2018) 64-69.

[2] D. He, N. Kumar, J.-H. Lee, Privacy-preserving data aggregation scheme against in-ternal attackers in smart grids, Wirel. Netw. 22 (2016) 491-502.

[3] R. Amin, S.H. Islam, G. Biswas, M.K. Khan, N. Kumar, An efficient and practical smart card based anonymity preserving user authentication scheme for tmis using elliptic curve cryptography, J. Med. Syst. 39 (2015) 1-18.

[4] S. Challa, A.K. Das, V. Odelu, N. Kumar, S. Kumari, M.K. Khan, A.V. Vasilakos, An ef-ficient ecc-based provably secure three-factor user authentication and key agreement protocol for wireless healthcare sensor networks, Comput. Electr. Eng. 69 (2018) 534-554.

[5] J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J.M. Schanck, P. Schwabe, G. Seiler, D. Stehlé, Crystals-kyber: a cca-secure module-lattice-based kem, in: 2018 IEEE European Symposium on Security and Privacy (EuroS&P), IEEE, 2018, pp. 353-367.

[6] L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, P. Schwabe, G. Seiler, D. Stehlé, Crystals-dilithium: a lattice-based digital signature scheme, IACR Trans. Cryptogr. Hardw. Embed. Syst. (2018) 238-268.

[7] P.-A. Fouque, J. Hoffstein, P. Kirchner, V. Lyubashevsky, T. Pornin, T. Prest, T. Ricos-set, G. Seiler, W. Whyte, Z. Zhang, et al., Falcon: fast-Fourier lattice-based compact signatures over ntru, Submission to the NIST’s post-quantum cryptography standard-ization process, 36 (5) (2018) 1-75.

[8] Y. Zhang, D. He, M.S. Obaidat, P. Vijayakumar, K.-F. Hsiao, Efficient identity-based distributed decryption scheme for electronic personal health record sharing system, IEEE J. Sel. Areas Commun. 39 (2) (2020) 384-395.

[9] C. Peng, J. Chen, P. Vijayakumar, N. Kumar, D. He, Efficient distributed decryption scheme for iot gateway-based applications, ACM Trans. Internet Technol. (TOIT) 21 (1) (2021) 1-23.

[10] D.F. Aranha, C. Baum, K. Gjøsteen, T. Silde,Verifiable mix-nets and distributed decryption for voting from lattice-based assumptions, in:Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security, 2023, pp. 1467-1481.

[11] D. Micciancio, A. Suhl, Simulation-secure threshold PKE from LWE with polynomial modulus, Cryptology ePrint Archive, https://ia.cr/2023/1728.

[12] H. Okada, T. Takagi, Simulation-secure threshold PLE from standard (ring-)LWE, Cryptology ePrint Archive, https://ia.cr/2024/239.

[13] D. Boneh, M. Franklin, Identity-based encryption from the Weil pairing, in: Annual International Cryptology Conference, Springer, 2001, pp. 213-229.

[14] U.M. Maurer, Towards the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms, in: Annual International Cryptology Conference, Springer, 1994, pp. 271-281.

[15] O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM (JACM) 56 (6) (2009) 1-40.

[16] Z. Brakerski, A. Langlois, C. Peikert, O. Regev, D. Stehlé,Classical hardness of learn-ing with errors, in:Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, pp. 575-584.

[17] Z. Brakerski, C. Gentry, V. Vaikuntanathan, (Leveled) fully homomorphic encryption without bootstrapping, ACM Trans. Comput. Theory (TOCT) 6 (3) (2014) 1-36.

[18] V. Lyubashevsky, G. Neven, One-shot verifiable encryption from lattices, in: Ad-vances in Cryptology-EUROCRYPT 2017: 36 th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part I, Paris, France, April 30-May 4, 2017, vol. 36, Springer, 2017, pp. 293-323.

[19] D. Boneh, X. Boyen, S. Halevi, Chosen ciphertext secure public key threshold en-cryption without random oracles, in: Cryptographers’ Track at the RSA Conference, Springer, 2006, pp. 226-243.

[20] R. Canetti, S. Goldwasser, An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack, in: International Conference on the The-ory and Applications of Cryptographic Techniques, Springer, 1999, pp. 90-106.

[21] A. De Santis, Y. Desmedt, Y. Frankel, M. Yung,How to share a function securely, in:Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994, pp. 522-533.

[22] Y. Desmedt, Threshold cryptosystems, in: International Workshop on the Theory and Application of Cryptographic Techniques, Springer, 1992, pp. 1-14.

[23] Y. Frankel, A practical protocol for large group oriented networks, in: Advances in Cryptology—EUROCRYPT’89: Workshop on the Theory and Application of Crypto-graphic Techniques Houthalen, Proceedings, Belgium, April 10-13, 1989, vol. 8, Springer, 1990, pp. 56-61.

[24] V. Shoup, R. Gennaro, Securing threshold cryptosystems against chosen ciphertext attack, in: International Conference on the Theory and Applications of Cryptographic Techniques, Springer, 1998, pp. 1-16.

[25] S. Badrinarayanan, A. Jain, N. Manohar, A. Sahai, Secure mpc: laziness leads to god,in: Advances in Cryptology-ASIACRYPT 2020: 26th International Conference on the Theory and Application of Cryptology and Information Security, Proceed-ings, Part III, Daejeon, South Korea, December 7-11, 2020, vol. 26, Springer, 2020, pp. 120-150.

[26] S. Dov Gordon, F.-H. Liu, E. Shi, Constant-round mpc with fairness and guarantee of output delivery, in: Advances in Cryptology-CRYPTO 2015: 35 th Annual Cryptol-ogy Conference, Proceedings, Part II, Santa Barbara, CA, USA, August 16-20, 2015, vol. 35, Springer, 2015, pp. 63-82.

[27] S. Garg, C. Gentry, S. Halevi, M. Raykova, Two-round secure mpc from indistin-guishability obfuscation, in: Theory of Cryptography Conference, Springer, 2014, pp. 74-94.

[28] D. Boneh, R. Gennaro, S. Goldfeder, A. Jain, S. Kim, P.M. Rasmussen, A. Sahai, Threshold cryptosystems from threshold fully homomorphic encryption, in: Ad-vances in Cryptology-CRYPTO 2018: 38th Annual International Cryptology Con-ference, Proceedings, Part I, Santa Barbara, CA, USA, August 19-23, 2018, vol. 38, Springer, 2018, pp. 565-596.

[29] L. Brandão, R. Peralta, Nist first call for multi-party threshold schemes, https://doi.org/10.6028/NIST.IR.8214C.ipd, 2023.

[30] R. Bendlin, I. Damgård, Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems, in: Theory of Cryptography Conference, Springer, 2010, pp. 201-218.

[31] G. Asharov, A. Jain, A. López-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Mul-tiparty computation with low communication, computation and interaction via threshold fhe,in: Advances in Cryptology-EUROCRYPT 2012: 31st Annual Interna-tional Conference on the Theory and Applications of Cryptographic Techniques, Pro-ceedings, Cambridge, UK, April 15-19, 2012, vol. 31, Springer, 2012, pp. 483-501.

[32] S. Chowdhury, S. Sinha, A. Singh, S. Mishra, C. Chaudhary, S. Patranabis, P. Mukher-jee, A. Chatterjee, D. Mukhopadhyay, Efficient threshold fhe with application to real-time systems, IACR Cryptol. ePrint Arch. 2022 ( 2022) 1625.

[33] K. Boudgoust, P. Scholl, Simple threshold (fully homomorphic) encryption from lwe with polynomial modulus,in: International Conference on the Theory and Applica-tion of Cryptology and Information Security, Springer, 2023, pp. 371-404.

[34] T. Prest, Sharper bounds in lattice-based cryptography using the Rényi divergence, in: Advances in Cryptology-ASIACRYPT 2017: 23 rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings, Part I, Hong Kong, China, December 3-7, 2017, vol. 23, Springer, 2017, pp. 347-374.

[35] S. Bai, T. Lepoint, A. Roux-Langlois, A. Sakzad, D. Stehlé, R. Steinfeld, Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance, J. Cryptol. 31 (2018) 610-640.

[36] A. Langlois, D. Stehlé, Worst-case to average-case reductions for module lattices, Des. Codes Cryptogr. 75 (3) (2015) 565-599.

[37] P.K. Chithaluru, M.S. Khan, M. Kumar, T. Stephan, Eth-leach: an energy enhanced threshold routing protocol for wsns, Int. J. Commun. Syst. 34 (12) (2021) e4881.

[38] P. Bedi, S. Das, S. Goyal, A.S. Rajawat, M. Kumar, Energy-efficient and congestion-thermal aware routing protocol for wban, Wirel. Pers. Commun. 137 (4) (2024) 2167-2197.

[39] P. Narsimhulu, P. Chithaluru, F. Al-Turjman, V. Guda, S. Inturi, T. Stephan, M. Kumar, An intelligent fl-based vehicle route optimization protocol for green and sustainable iot connected iov, Internet of Things 27 (2024) 101240.

[40] S. Tumula, N. Rama Devi, Y. Ramadevi, E. Padmalatha, R. Uyyala, L. Abualigah, P. Chithaluru, M. Kumar, An enhanced bio-inspired energy-efficient localization rout-ing for mobile wireless sensor network, Int. J. Commun. Syst. (2024) e5803.

[41] A. Shamir, How to share a secret, Commun. ACM 22 (11) (1979) 612-613.

[42] M. Blum, P. Feldman, S. Micali, Non-interactive zero-knowledge and its applications, in: Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali, Association for Computing Machinery, New York, NY, USA, 2019, pp. 329-349.

[43] D. Micciancio, O. Regev, Worst-case to average-case reductions based on Gaussian measures, SIAM J. Comput. 37 (1) (2007) 267-302.

[44] M. Ajtai,Generating hard instances of lattice problems, in:Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, 1996, pp. 99-108.

[45] M.R. Albrecht, R. Player, S. Scott, On the concrete hardness of learning with errors, J. Math. Cryptol. 9 (3) (2015) 169-203.