Cloud-assisted Outsourcing of Modular Exponentiation Calculation

Shuai Zhang

doi:10.62051/ijcsit.v5n2.11

Authors

Shuai Zhang

DOI:

https://doi.org/10.62051/ijcsit.v5n2.11

Keywords:

Modular Exponentiation, Outsourced Computation, Secure Multi-party Computation, Montgomery Algorithm

Abstract

With the rapid development of cloud computing and cluster computing, outsourced computation has become an important means for resource-constrained devices to complete complex tasks, and the outsourcing of modular exponentiation operations has attracted much attention. However, outsourced computation faces security challenges such as privacy, verifiability, and efficiency. This paper reviews existing privacy - preserving schemes for modular exponentiation outsourcing and proposes a privacy - preserving modular exponentiation outsourcing scheme based on secure multi - party computation for a dual - server model. This scheme designs a secure multi - party computation protocol using the Montgomery algorithm to accelerate modular exponentiation outsourcing and improve efficiency. It can protect the entire process of the modular exponentiation outsourcing algorithm, the privacy of data owner information, and the final computation results. Meanwhile, the system model, threat model, and design goals are elaborated in detail, and the correctness, security analysis, and experimental comparison of the scheme are carried out. The research shows that this scheme can ensure accurate and secure computations while achieving high efficiency, providing a more reliable solution for modular exponentiation outsourcing.

Downloads

Download data is not yet available.

References

[1] S. Subashini, V. Kavitha, A survey on security issues in service delivery models of cloud computing, Journal of Network and Computer Applications 34 (2011) 1–11.

[2] D. Zissis, D. Lekkas, Addressing cloud computing security issues, Future Generation Computer Systems 28 (2012) 583–592.

[3] J. Wang, H. Ma, Q. Tang, J. Wang, Efficient verifiable fuzzy keyword search over encrypted data in cloud computing, Computer Science and Information Systems 10 (2013) 667–684.

[4] X. Chen, J. Li, J. Ma, et al., New algorithms for secure outsourcing of modular exponentiations, IEEE Transactions on Parallel and Distributed Systems 25 (2013) 2386–2396.

[5] Y. Ren, N. Ding, X. Zhang, et al., Verifiable outsourcing algorithms for modular exponentiations with improved checkability, in: Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security, Association for Computing Machinery, ACM, New York, NY, USA, 2016, pp. 293–303.

[6] L. Kuppusamy, J. Rangasamy, Crt-based outsourcing algorithms for modular exponentiations, in: International Conference on Cryptology in India, Springer, Springer, Cham, 2016, pp. 81–98.

[7] S. Hohenberger, A. Lysyanskaya, How to securely outsource cryptographic computations, in: Theory of Cryptography Conference, Springer, Berlin, Heidelberg, 2005, pp. 264–282.

[8] X. Ma, J. Li, F. Zhang, Outsourcing computation of modular exponentiations in cloud computing, Cluster Computing 16 (2013) 787–796.

[9] J. Ye, J. Wang, Secure outsourcing of modular exponentiation with single untrusted server, in: Proceedings of the 2015 18th International Conference on Network-Based Information Systems, IEEE, Taiwan, 2015, pp. 643–645.

[10] J. Liu, B. Yang, A new algorithm for secure outsourcing composite modular exponentiation, in: Proceedings of the 2015 2nd International Conference on Information Science and Control Engineering, IEEE, Shanghai, China, 2015, pp. 461–465.

[11] Y. Ma, H. Tian, B. Wei, Secure modular exponentiation outsource with two untrusted programs and improved checkability, Journal of Information Science & Engineering 32 (2016).

[12] R. Yanli, D. Min, Q. Zhenxing, Z. Xinpeng, F. Guorui, Efficient algorithm for secure outsourcing of modular exponentiation with single server, IEEE Transactions on Cloud Computing PP (2018) 1–1.

[13] O. Uzunkol, J. Rangasamy, L. Kuppusamy, Hide the modulus: A secure non-interactive fully verifiable delegation scheme for modular exponentiations via crt, in: Proceedings of the International Conference on Information Security, Springer, Cham, 2018, pp. 250–267.

[14] M. V. Dijk, D. Clarke, B. Gassend, et al., Speeding up exponentiation using an untrusted computational resource, Designs, Codes and Cryptography 39 (2006) 253–273.

[15] Y. Wang, Q. Wu, D. S. Wong, et al., Securely outsourcing exponentiations with single untrusted program for cloud storage, in: European Symposium on Research in Computer Security, Springer, Cham, 2014, pp. 326–343.

[16] C. Chevalier, F. Laguillaumie, D. Vergnaud, Privately outsourcing exponentiation to a single server: Cryptanalysis and optimal constructions, Algorithmica (2020) 1–44.

[17] J. Liu, B. Yang, Z. Du, Outsourcing of verifiable composite modular exponentiations, in: Proceedings of the 5th International Conference on Intelligent Networking and Collaborative Systems, IEEE, Xi’an, China, 2013, pp. 546–551. 15.

[18] C. Xiang, C. Tang, Verifiable and Secure Outsourcing Schemes of Modular Exponentiations Using One Untrusted Cloud Server and Their Application, Technical Report 2014/500, IACR Cryptology ePrint Archive, 2014. URL: https://eprint.iacr.org/2014/500.pdf.

[19] C.Xiang, C. Tang, Efficientoutsourcing schemes of modular exponentiations with checkability for untrusted cloud server, Journal of Ambient Intelligence and Humanized Computing 6 (2015) 131–139.

[20] Y. Ding, Z. Xu, J. Ye, et al., Secure outsourcing of modular exponentiations under single untrusted programme model, Journal of Computer and System Sciences 90 (2017) 1–13.

[21] J. Cai, Y. Ren, T. Jiang, Verifiable outsourcing computation of modular exponentiations with single server, IJ Network Security 19 (2017) 449–457.

[22] K. Zhou, M. H. Afifi, J. Ren, Expsos: Secure and verifiable outsourcing of exponentiation operations for mobile cloud computing, IEEE Transactions on Information Forensics and Security 12 (2017) 2518–2531.

[23] S. Li, L. Huang, A. Fu, et al., Cexp: Secure and verifiable outsourcing of composite modular exponentiation with single untrusted server, Digital Communications and Networks 3 (2017) 236–241.

[24] J. Rangasamy, L. Kuppusamy, Revisiting single-server algorithms for outsourcing modular exponentiation, in: International Conference on Cryptology in India, Springer, 2018, pp. 3–20.

[25] Y. Zhu, A. Fu, S. Yu, et al., New algorithm for secure outsourcing of modular exponentiation with optimal checkability based on single untrusted server, in: 2018 IEEE International Conference on Communications (ICC), IEEE, Kansas City, MO, 2018, pp. 1–6.

[26] A. Fu, Y. Zhu, G. Yang, et al., Secure outsourcing algorithms of modular exponentiations with optimal checkability based on a single untrusted cloud server, Cluster Computing 21 (2018) 1933–1947.

[27] A. Fu, S. Li, S. Yu, et al., Privacy-preserving composite modular exponentiation outsourcing with optimal checkability in single untrusted cloud server, Journal of Network and Computer Applications 118 (2018) 102–112.

[28] Q. Su, R. Zhang, R. Xue, Secure outsourcing algorithms for composite modular exponentiation based on single untrusted cloud, The Computer Journal 63 (2020) 1271–1271.

[29] Q. Hu, M. Duan, Z. Yang, et al., Efficient parallel secure outsourcing of modular exponentiation to cloud for iot applications, IEEE Internet of Things Journal (2020).

[30] D. Xu, Y. Ren, X. Li, et al., Efficient and secure outsourcing of modular exponentiation based on smart contract, International Journal of Network Security 22 (2020) 934–944.

[31] H. Li, J. Yu, H. Zhang, et al., Privacy-preserving and distributed algorithms for modular exponentiation in iot with edge computing assistance, IEEE Internet of Things Journal 7 (2020) 8769–8779.

[32] P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation 44 (1985) 519–521. URL: https://api. semanticscholar.org/CorpusID:119574413.

[33] D. Beaver, Efficient multiparty protocols using circuit randomization, in: Advances in Cryptology—CRYPTO’91: Proceedings 11, Springer, 1992, pp. 420–432.

[34] Z. Xia, Q. Gu, W. Zhou, L. Xiong, J. Weng, N. Xiong, Str: Secure computation on additive shares using the share-transform-reveal strategy, IEEE Transactions on Computers (2021)