Visible to the public Verifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability

TitleVerifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability
Publication TypeConference Paper
Year of Publication2016
AuthorsRen, Yanli, Ding, Ning, Zhang, Xinpeng, Lu, Haining, Gu, Dawu
Conference NameProceedings of the 11th ACM on Asia Conference on Computer and Communications Security
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4233-9
Keywordscheckability, 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.

URLhttp://doi.acm.org/10.1145/2897845.2897881
DOI10.1145/2897845.2897881
Citation Keyren_verifiable_2016