Quantitative system performance: computer system analysis using queueing network models
Quantitative system performance: computer system analysis using queueing network models
Software protection and simulation on oblivious RAMs
Journal of the ACM (JACM)
Computationally private information retrieval (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Upper Bound on Communication Complexity of Private Information Retrieval
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Balancing confidentiality and efficiency in untrusted relational DBMSs
Proceedings of the 10th ACM conference on Computer and communications security
Order preserving encryption for numeric data
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Modeling and assessing inference exposure in encrypted databases
ACM Transactions on Information and System Security (TISSEC)
Journal of Cognitive Neuroscience
Building castles out of mud: practical access pattern privacy and correctness on untrusted storage
Proceedings of the 15th ACM conference on Computer and communications security
Privacy-Aware Biometrics: Design and Implementation of a Multimodal Verification System
ACSAC '08 Proceedings of the 2008 Annual Computer Security Applications Conference
Data protection in outsourcing scenarios: issues and directions
ASIACCS '10 Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security
Computationally private information retrieval with polylogarithmic communication
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Efficient and Private Access to Outsourced Data
ICDCS '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems
Efficient techniques for privacy-preserving sharing of sensitive information
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
A comprehensive framework for secure query processing on relational data in the cloud
SDM'11 Proceedings of the 8th VLDB international conference on Secure data management
A light-weight solution to preservation of access pattern privacy in un-trusted clouds
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Supporting concurrency in private data outsourcing
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Designing secure indexes for encrypted databases
DBSec'05 Proceedings of the 19th annual IFIP WG 11.3 working conference on Data and Applications Security
Database Access Pattern Protection Without Full-Shuffles
IEEE Transactions on Information Forensics and Security
Managing and accessing data in the cloud: Privacy risks and approaches
CRISIS '12 Proceedings of the 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS)
Hi-index | 0.00 |
Data outsourcing has recently emerged as a successful solution allowing individuals and organizations to delegate data and service management to external third parties. A major challenge in the data outsourcing scenario is how to guarantee proper privacy protection against the external server. Recent promising approaches rely on the organization of data in indexing structures that use encryption and the dynamic allocation of encrypted data to physical blocks for destroying the otherwise static relationship between data and the blocks in which they are stored. However, dynamic data allocation implies the need to re-write blocks at every read access, thus requesting exclusive locks that can affect concurrency. Also, these solutions only support search conditions on the values of the attribute used for building the indexing structure.In this paper, we present an approach that overcomes such limitations by extending the recently proposed shuffle index structure with support for concurrency and multiple indexes. Support for concurrency relies on the use of several differential versions of the data index that are periodically reconciled and applied to the main data structure. Support for multiple indexes relies on the definition of secondary shuffle indexes that are then combined with the primary index in a single data structure whose content and allocation is unintelligible to the server. We show how using such differential versions and combined index structure guarantees privacy, provides support for concurrent accesses and multiple search conditions, and considerably increases the performance of the system and the applicability of the proposed solution.