Abstract
Provable Data Possession (PDP) allows a file owner to outsource her files to a storage server such that a verifier can check the integrity of the outsourced file. Public verifiable PDP schemes allow any one other than the file owner to be a verifier. At the client side (file owner or verifier), a substantial number of modular exponentiations is often required. In this paper we make PDP more practical via proposing a protocol to securely outsource the (most generic) variable-exponent variable-base exponentiations in one untrusted program model. Our protocol demonstrates advantages in efficiency or privacy over existing protocols coping with only special cases in two or single untrusted program model. We then apply our generic protocol to Shacham-Waters PDP and a variant of Yuan-Yu PDP. The analyses show that our protocol makes PDP much more efficient at the client side. © 2014 Springer International Publishing Switzerland.
Original language | English |
---|---|
Title of host publication | Computer Security, ESORICS 2014 |
Subtitle of host publication | 19th European Symposium on Research in Compter Security, Proceedings |
Publisher | Springer Verlag |
Pages | 326-343 |
Volume | 8712 LNCS |
ISBN (Print) | 9783319112022 |
DOIs | |
Publication status | Published - 7 Sept 2014 |
Event | 19th European Symposium on Research in Computer Security, ESORICS 2014 - Wroclaw, Poland Duration: 7 Sept 2014 → 11 Sept 2014 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 8712 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 19th European Symposium on Research in Computer Security, ESORICS 2014 |
---|---|
Country/Territory | Poland |
City | Wroclaw |
Period | 7/09/14 → 11/09/14 |
Research Keywords
- cloud storage
- modular exponentiation
- offloading computation
- provable Data Possession
- verifiable computation