26.08.2016 Views

trademark

2c2kIhh

2c2kIhh

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

3.0 Secure Data Storage and Transactions Logs (cont.)<br />

3.5 Apply lazy revocation and key rotation<br />

3.5.1 Why?<br />

To improve scalability.<br />

3.5.2 How?<br />

• Use lazy revocation (i.e. delay re-encryption until a file is updated in order to make<br />

revocation operation less expensive).<br />

• To implement lazy revocation, generate a new filegroup for all the files that are modified<br />

following a revocation and then move files to this new filegroup as files get re-encrypted.<br />

This process raises two issues, as stated below:<br />

Issue: There is an increase in the number of keys in the system following each<br />

revocation.<br />

Solution: Relate the keys of the filegroups that are involved.<br />

Issue: Because file sets that are re-encrypted following successive revocations are<br />

not really contained within each other, it becomes increasingly difficult to determine<br />

which filegroup a file should be assigned to when it is re-encrypted.<br />

Solution: Use key rotation. Set up the keys so that files are always (re)encrypted with<br />

the keys of the latest filegroup. This ensures that users are required to remember only<br />

the latest keys and derive previous ones when necessary.<br />

3.6 Implement proof of retrievability (POR) or provable<br />

data possession (PDP) methods with high probability<br />

3.6.1 Why?<br />

To enable a user to reliably verify that data uploaded to the cloud is actually available and<br />

intact, without requiring expensive communication overhead<br />

3.6.2 How?<br />

Ateniese et al. [ABC+07] introduced a model for provable data possession (PDP) that allows a<br />

user that has stored data at an untrusted server to verify that the server possesses the original<br />

data without retrieving it. The model generates probabilistic proof of possession by sampling<br />

random sets of blocks from the server, which drastically increases efficiency. The user<br />

maintains a constant amount of metadata to verify the proof. The challenge/response protocol<br />

transmits a small, constant amount of data, which minimizes network communication.<br />

CLOUD SECURITY ALLIANCE Big Data Working Group Guidance<br />

© Copyright 2016, Cloud Security Alliance. All rights reserved.<br />

19

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!