- 期刊
- OpenAccess
Secure Modular Exponentiation Outsource With Two Untrusted Programs and Improved Checkability
摘要
With the development of cloud computing, more and more mobile devices have the requirement to outsource expensive computations in an untrusted environment. Among all such computations, exponentiations modulo a large prime are basic and frequent operations in many discrete-logarithm-based cryptographic protocols. Currently the most efficient outsourcing algorithm of modular exponentiations is under a one-malicious version of a two-untrusted-program assumption. And the result of the algorithm is checkable with a probability at most 2/3. We here propose an efficient algorithm under a two-untrusted- program assumption and improve the probability of checkability to be about 1-2/3s for a suitable s configured by a client. Further, we provide practical results to show the energy saving about outsourcing modular exponentiations.
延伸閱讀
- Yu, C. M. (2004). A Quantum Cryptosystem with Perfect Secrecy and Message Authentication [master's thesis, National Taiwan University]. Airiti Library. https://doi.org/10.6342/NTU.2004.10040
- Yang, J., Li, Y., & Ren, Y. (2019). Novel and Secure Outsourcing Algorithms for Multiple Bilinear Pairings with Single Untrusted Server. International Journal of Network Security, 21(5), 872-880. https://doi.org/10.6633/IJNS.201909_21(5).20
- Qi, X., Zheng, Y., & Tian, C. (2022). A Note on Two Outsourcing Algorithms of Modular Exponentiations. International Journal of Network Security, 24(5), 797-801. https://doi.org/10.6633/IJNS.202209_24(5).03
- Huang, L. S. (2013). A Study of Fast Modular Exponentiation [doctoral dissertation, Tamkang University]. Airiti Library. https://doi.org/10.6846/TKU.2013.01286
- Liu, L., & Cheng, B. (2022). A Note on One Outsourcing Algorithm for Modular Exponentiations. International Journal of Network Security, 24(6), 1076-1080. https://doi.org/10.6633/IJNS.202211_24(6).12