Verifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability
Title | Verifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability |
Publication Type | Conference Paper |
Year of Publication | 2016 |
Authors | Ren, Yanli, Ding, Ning, Zhang, Xinpeng, Lu, Haining, Gu, Dawu |
Conference Name | Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security |
Publisher | ACM |
Conference Location | New York, NY, USA |
ISBN Number | 978-1-4503-4233-9 |
Keywords | checkability, exponentiation, modular exponentiations, outsourcing computation, pubcrawl, Resiliency, verifiable |
Abstract | The problem of securely outsourcing computation has received widespread attention due to the development of cloud computing and mobile devices. In this paper, we first propose a secure verifiable outsourcing algorithm of single modular exponentiation based on the one-malicious model of two untrusted servers. The outsourcer could detect any failure with probability 1 if one of the servers misbehaves. We also present the other verifiable outsourcing algorithm for multiple modular exponentiations based on the same model. Compared with the state-of-the-art algorithms, the proposed algorithms improve both checkability and efficiency for the outsourcer. Finally, we utilize the proposed algorithms as two subroutines to achieve outsource-secure polynomial evaluation and ciphertext-policy attributed-based encryption (CP-ABE) scheme with verifiable outsourced encryption and decryption. |
URL | http://doi.acm.org/10.1145/2897845.2897881 |
DOI | 10.1145/2897845.2897881 |
Citation Key | ren_verifiable_2016 |