Paper Info
Title
Verifiable Outsourcing Algorithms for Modular Exponentiations with Improved Checkability.
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.
Year
DOI
Venue
2016
10.1145/2897845.2897881
AsiaCCS
Keywords
Field
DocType
Cloud computing, Verifiable computation, Outsourcing algorithm, Modular exponentiation
Polynomial,Computer science,Computer security,Server,Outsourcing,Algorithm,Theoretical computer science,Encryption,Verifiable secret sharing,Modular design,Modular exponentiation,Cloud computing
Conference
Citations 
PageRank 
References 
6
0.46
21
Authors
5
Name
Order
Citations
PageRank
Yanli Ren124724.83
Ning Ding2508.35
Xinpeng Zhang32541174.68
Haining Lu4202.35
Dawu Gu5644103.50