Lightweight Proofs of Retrievability for Electronic Evidence in Cloud

• Main Authors: Hongyao Deng, Xiuli Song
• Format: Article
• Language: English
• Published: MDPI AG 2013-07-01
• Series: Information
• Subjects: cloud storage; proofs of retrievability; Nyberg-Rueppel signature; electronic evidence preservation; computation and storage costs
• Online Access: http://www.mdpi.com/2078-2489/4/3/262

Proofs of Retrievability (PoR) is one of the basic functions of electronic evidence preservation center in cloud. This paper proposes two PoR schemes to execute the workflow of evidence preservation center, which are named Finer Grained Proofs of Retrievability (FG-PoR) and More Lightweight Proofs of Retrievability (ML-PoR). The two PoR schemes do not use multi-replication technology or erasure code technology, but employ the verification tags and signatures to implement provable data possession and data recovery dual functions. When some data blocks have been lost in Archive Storage Area (ASA), FG-PoR can recover each data block of evidence matrix, but ML-PoR can only recover a column of evidence matrix. The analysis results show our two PoR schemes do not only provide the integrity verification guarantee but also have robust recovery guarantee to electronic evidence in cloud. The two schemes can allow for lower computation and storage costs than other similar schemes; moreover, ML-PoR can provide lower costs than FG-PoR.