Cryptology ePrint Archive: Report 2014/748

Efficient and Verifiable Algorithms for Secure Outsourcing of Cryptographic Computations

Mehmet Sabır Kiraz and Osmanbey Uzunkol

Abstract: Reducing computational cost of cryptographic computations for resource-constrained devices is an active research area. One of the practical solutions is to securely outsource the computations to an external and more powerful cloud server. Modular exponentiations are the most expensive computation from the cryptographic point of view. Therefore, outsourcing modular exponentiations to a single, external and potentially untrusted cloud server while ensuring the security and privacy provide an efficient solution. In this paper, we propose new efficient outsourcing algorithms for modular exponentiations using only one untrusted cloud server. These algorithms cover public-base & private-exponent, private-base & public-exponent, private-base & privateexponent, and more generally private-base & private-exponents simultaneous modular exponentiations. Our algorithms are the most efficient solutions utilizing only one single untrusted server with best checkability probabilities. Furthermore, unlike existing schemes, which have fixed checkability probability, our algorithms provide adjustable predetermined checkability parameters. Finally, we apply our algorithms to outsource Oblivious Transfer Protocols and Blind Signatures which are expensive primitives in modern cryptography.

Category / Keywords: Secure outsourcing algorithms, Modular exponentiation, Mobile computing, Secure cloud computing, Privacy.

Date: received 26 Sep 2014, last revised 9 Sep 2015

Contact author: mehmet kiraz at tubitak gov tr

Available format(s): PDF | BibTeX Citation

Note: Algorithm is explained in more details. Typos are removed.

Version: 20150909:090523 (All versions of this report)

Short URL: ia.cr/2014/748

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]