Outsourcing Modular Exponentiation in Cryptographic Web Applications

Pascal Mainini; Rolf Haenni

Paper 2018/300

Outsourcing Modular Exponentiation in Cryptographic Web Applications

Pascal Mainini and Rolf Haenni

Abstract

Modern web applications using advanced cryptographic methods may need to calculate a large number of modular exponentiations. Performing such calculations in the web browser efficiently is a known problem. We propose a solution to this problem based on outsourcing the computational effort to untrusted exponentiation servers. We present several efficient outsourcing protocols for different settings and a practical implementation consisting of a JavaScript client library and a server application. Compared to browser-only computation, our solution improves the overall computation time by an order of magnitude. This is an extended version of a paper accepted and presented at the Voting’18 workshop of the Financial Cryptography and Data Security 2018 conference. It will be included in the conference’s LNCS proceedings and available on the Springer web site.

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Published elsewhere. Major revision. 22th International Conference on Financial Cryptography and Data Security (FC 2018)
Keywords: Internet voting Modular exponentiations JavaScript cryptography Outsourcing algorithms
Contact author(s): pascal mainini @ bfh ch
History: 2018-04-02: received
Short URL: https://ia.cr/2018/300
License: CC BY

BibTeX

@misc{cryptoeprint:2018/300,
      author = {Pascal Mainini and Rolf Haenni},
      title = {Outsourcing Modular Exponentiation in Cryptographic Web Applications},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/300},
      year = {2018},
      url = {https://eprint.iacr.org/2018/300}
}