Utilizing linear subspaces to improve cloud security

Zage, David John; Obert, James

doi:10.1109/dsnw.2012.6264692

Cited by 3 publications

(2 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this approach, an algebraic-based encoding solution, Matrix Block Chaining (MBC), is used to "maintain data security and protocol performance when encoding large files. The design of MBC allows for encoding multiple partitions of the original data in parallel as subsequent encoding operations are not dependent on the output of previous encoding steps" [32]. Their technique was developed specifically for cloud storage, however, and as such does not maintain data availability in a compromised environment.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Percival: A searchable secret-split datastore

Frank

Thurlow

Kroeger

et al. 2015

2015 31st Symposium on Mass Storage Systems and Technologies (MSST)

View full text Add to dashboard Cite

Abstract-Maintaining information privacy is challenging when sharing data across a distributed long-term datastore. In such applications, secret splitting the data across independent sites has been shown to be a superior alternative to fixed-key encryption; it improves reliability, reduces the risk of insider threat, and removes the issues surrounding key management. However, the inherent security of such a datastore normally precludes it from being directly searched without reassembling the data; this, however, is neither computationally feasible nor without risk since reassembly introduces a single point of compromise. As a result, the secret-split data must be pre-indexed in some way in order to facilitate searching. Previously, fixed-key encryption has also been used to securely pre-index the data, but in addition to key management issues, it is not well suited for long term applications.To meet these needs, we have developed Percival: a novel system that enables searching a secret-split datastore while maintaining information privacy. We leverage salted hashing, performed within hardware security modules, to access prerecorded queries that have been secret split and stored in a distributed environment; this keeps the bulk of the work on each client, and the data custodians blinded to both the contents of a query as well as its results. Furthermore, Percival does not rely on the datastore's exact implementation. The result is a flexible design that can be applied to both new and existing secret-split datastores. When testing Percival on a corpus of approximately one million files, it was found that the average search operation completed in less than one second.

show abstract

Section: Related Workmentioning

confidence: 99%

“…An alternative to secret-split datastores was developed by Zage et al [32]. In this approach, an algebraic-based encoding solution, Matrix Block Chaining (MBC), is used to "maintain data security and protocol performance when encoding large files.…”

Section: Related Workmentioning

confidence: 99%