We investigate the problem of securely outsourcing modular exponentiations to a single, malicious computational resource. We revisit recently proposed schemes using single server and analyse them against two fundamental security properties, namely privacy of inputs and verifiability of outputs. Interestingly, we observe that the chosen schemes do not appear to meet both the security properties. In fact we present a simple polynomial-time attack on each algorithm, allowing the malicious server either to recover a secret input or to convincingly fool the client with wrong outputs. Then we provide a fix to the identified problem in the ExpSOS scheme. With our fix and without pre-processing, the improved scheme becomes the best to-date outsourcing scheme for single-server case. Finally we present the first precomputation-free single-server algorithm, πExpSOS for simultaneous exponentiations, thereby solving an important problem formulated in [6].
CITATION STYLE
Rangasamy, J., & Kuppusamy, L. (2018). Revisiting single-server algorithms for outsourcing modular exponentiation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11356 LNCS, pp. 3–20). Springer Verlag. https://doi.org/10.1007/978-3-030-05378-9_1
Mendeley helps you to discover research relevant for your work.