### Efficient and Secure Delegation of Group Exponentiation to a Single Server

Bren Cavallo, Giovanni Di Crescenzo, Delaram Kahrobaei, and Vladimir Shpilrain

##### Abstract

We consider the problem of delegating computation of group operations from a computationally weaker client holding an input and a description of a function, to a {\em single} computationally stronger server holding a description of the same function. Solutions need to satisfy natural correctness, security, privacy and efficiency requirements. We obtain delegated computation protocols for the following functions, defined for an {\em arbitrary} commutative group: \begin{enumerate} \item Group inverses, with security and privacy holding against any computationally unrestricted malicious server. \item Group exponentiation, with security and privacy holding against any computationally unrestricted partially honest" server. \item Group exponentiation, with security and privacy holding against any polynomial-time malicious server, under a pseudorandom generation assumption, and security holding with constant probability. \end{enumerate}

Available format(s)
Category
Cryptographic protocols
Publication info
Preprint. MINOR revision.
Contact author(s)
shpilrain @ yahoo com
History
2015-05-05: revised
See all versions
Short URL
https://ia.cr/2015/206

CC BY

BibTeX

@misc{cryptoeprint:2015/206,
author = {Bren Cavallo and Giovanni Di Crescenzo and Delaram Kahrobaei and Vladimir Shpilrain},
title = {Efficient and Secure Delegation of Group Exponentiation to a Single Server},
howpublished = {Cryptology ePrint Archive, Paper 2015/206},
year = {2015},
note = {\url{https://eprint.iacr.org/2015/206}},
url = {https://eprint.iacr.org/2015/206}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.