Reference : New Algorithms for Secure Outsourcing of Modular Exponentiations
Scientific journals : Article
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/18025
New Algorithms for Secure Outsourcing of Modular Exponentiations
English
Chen, Xiaofeng mailto []
Li, Jin mailto []
Ma, Jianfeng mailto []
Tang, Qiang mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
Lou, Wenjing mailto []
Jul-2014
IEEE Trans. Parallel Distrib. Syst.
IEEE
25
9
2386-2396
Yes (verified by ORBilu)
International
1045-9219
[en] computation outsourcing ; exponentiation ; provable security
[en] With the rapid development in availability of cloud services, the techniques for securely outsourcing the prohibitively expensive computations to untrusted servers are getting more and more attentions in the scientific community. Exponentiations modulo a large prime have been considered the most expensive operation in discrete-logarithm based cryptographic protocols, and the computationally limited devices such as RFID tags or smartcard may be incapable to accomplish these operations. Therefore, it is meaningful to present an efficient method to securely outsource most of this work-load to (untrusted) cloud servers. In this paper, we propose a new secure outsourcing algorithm for (variable-exponent, variable-base) exponentiation modular a prime in the two untrusted program model. Compared with the state-of-the-art algorithm \cite{HL05}, the proposed algorithm is superior in both efficiency and checkability. We then utilize this algorithm as a subroutine to achieve outsource-secure Cramer-Shoup encryptions and Schnorr signatures. Besides, we propose the first outsource-secure and efficient algorithm for simultaneous modular exponentiations. Moreover, we formally prove that both the algorithms can achieve the desired security notions. We also provide the experimental evaluation that demonstrates the efficiency and effectiveness of the proposed outsourcing algorithms and schemes.
SnT
Researchers
http://hdl.handle.net/10993/18025
10.1109/TPDS.2013.180
http://www.computer.org/csdl/trans/td/preprint/06567860-abs.html

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
06567860.pdfPublisher postprint511.23 kBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.