Paper 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.

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

Metadata
Available format(s)
PDF
Publication info
Preprint.
Keywords
Secure outsourcing algorithmsModular exponentiationMobile computingSecure cloud computingPrivacy.
Contact author(s)
mehmet kiraz @ tubitak gov tr
History
2015-09-09: last of 7 revisions
2014-09-26: received
See all versions
Short URL
https://ia.cr/2014/748
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2014/748,
      author = {Mehmet Sabır Kiraz and Osmanbey Uzunkol},
      title = {Efficient and Verifiable Algorithms for Secure Outsourcing of Cryptographic Computations},
      howpublished = {Cryptology ePrint Archive, Paper 2014/748},
      year = {2014},
      note = {\url{https://eprint.iacr.org/2014/748}},
      url = {https://eprint.iacr.org/2014/748}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.