LH*—a scalable, distributed data structure
ACM Transactions on Database Systems (TODS)
Flexible support for multiple access control policies
ACM Transactions on Database Systems (TODS)
Network security: PRIVATE communication in a PUBLIC world
Network security: PRIVATE communication in a PUBLIC world
LH*RS---a highly-available scalable distributed data structure
ACM Transactions on Database Systems (TODS)
The case for RAMClouds: scalable high-performance storage entirely in DRAM
ACM SIGOPS Operating Systems Review
Encryption policies for regulating access to outsourced data
ACM Transactions on Database Systems (TODS)
LH*RE: A Scalable Distributed Data Structure with Recoverable Encryption
CLOUD '10 Proceedings of the 2010 IEEE 3rd International Conference on Cloud Computing
Distributed and secure access control in P2P databases
DBSec'10 Proceedings of the 24th annual IFIP WG 11.3 working conference on Data and applications security and privacy
Clasas: A Key-Store for the Cloud
MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Preserving Privacy in Data Outsourcing
Preserving Privacy in Data Outsourcing
Recoverable encryption through a noised secret over a large cloud
Transactions on Large-Scale Data- and Knowledge-centered systems IX
| Hi-index | 0.00 |
We propose a scheme using client-side encryption with symmetric keys for the privacy of data outsourced to the cloud for selected readers. The scheme is safe under the most popular "honest, but curious" model. Readers get the keys from access grants or have them cached. LH* files store cloud data and metadata. Diffie-Hellman scheme authenticates clients. Every client can read any data, but only a grantee decrypts the content. Access to data is usually the fastest possible that is two messages and the decryption, regardless of the cloud scale up. Data or grant creation or update costs are also constant with a few messages and fast processing. All these features serve our main goal: the search speed and scalability yet unmatched to our best knowledge. The scheme is finally intentionally very simple.