New Algorithms for Secure Outsourcing of Modular Exponentiations

• Published in: IEEE transactions on parallel and distributed systems Vol. 25; no. 9; pp. 2386 - 2396
• Main Authors: Chen, Xiaofeng, Li, Jin, Ma, Jianfeng, Tang, Qiang, Lou, Wenjing
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.09.2014; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Cloud computing; Communities; Computational modeling; Cryptography; Educational institutions; Modular; modular exponentiation; outsource-secure algorithms; Outsourcing; Servers; Software; Tags
• ISSN: 1045-9219; 1558-2183
• DOI: 10.1109/TPDS.2013.180

With the rapid development of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attention in the scientific community. Exponentiations modulo a large prime have been considered the most expensive operations in discrete-logarithm-based cryptographic protocols, and they may be burdensome for the resource-limited devices such as RFID tags or smartcards. Therefore, it is important to present an efficient method to securely outsource such operations to (untrusted) cloud servers. In this paper, we propose a new secure outsourcing algorithm for (variable-exponent, variable-base) exponentiation modulo a prime in the two untrusted program model. Compared with the state-of-the-art algorithm, the proposed algorithm is superior in both efficiency and checkability. Based on this algorithm, we show how to achieve outsource-secure Cramer-Shoup encryptions and Schnorr signatures. We then propose the first efficient outsource-secure algorithm for simultaneous modular exponentiations. Finally, we provide the experimental evaluation that demonstrates the efficiency and effectiveness of the proposed outsourcing algorithms and schemes.