Improved algorithm for secure outsourcing of modular exponentiations with high checkability
by Jun Ye; Xiaofeng Chen; Jianfeng Ma
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 23, No. 3/4, 2016

Abstract: With the development of cloud computing, outsourcing computation becomes a hot issue recently. Outsourcing computation allows a resource-constrained client to outsource the complicated computing tasks to a cloud server which is powerful but not honest. Modular exponentiation with a large modulus, which is considered as the most expensive operation in discrete logarithm based cryptographic protocols, has been widely used in public key cryptosystems for secure data communications. In this paper we put forth a new improved outsourcing algorithm for secure outsourcing of modular exponentiations. In the proposed algorithm, the modular exponentiations need to be computed are hidden to the malicious server. In the computation procedure, the server cannot obtain any information with respect to the input and output while the client can verify the returned result efficiently. Compared with the algorithms of Hohenberger and Lysyanskaya (2005) and Chen et al. (2012), ours are superior in checkability. In addition, the proposed algorithm can promote the efficiency of all security protocols based on discrete logarithm.

Online publication date: Mon, 26-Sep-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com