Privacy preserving schema and data matching
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
Privacy-Preserving Clustering with High Accuracy and Low Time Complexity
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Secure kNN computation on encrypted databases
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Formal anonymity models for efficient privacy-preserving joins
Data & Knowledge Engineering
Private record matching using differential privacy
Proceedings of the 13th International Conference on Extending Database Technology
Privacy-preserving matching of spatial datasets with protection against background knowledge
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Access Control for Databases: Concepts and Systems
Foundations and Trends in Databases
TrustedDB: a trusted hardware based database with privacy and data confidentiality
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Cooperative data access in multi-cloud environments
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Efficient and Practical Approach for Private Record Linkage
Journal of Data and Information Quality (JDIQ)
Secure multidimensional range queries over outsourced data
The VLDB Journal — The International Journal on Very Large Data Bases
Rule enforcement with third parties in secure cooperative data access
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 0.00 |
We present a secure network service for sovereign information sharing whose only trusted component is an off-theshelf secure coprocessor. The participating data providers send encrypted relations to the service that sends the encrypted results to the recipients. The technical challenge in implementing such a service arises from the limited capability of the secure coprocessors: they have small memory, no attached disk, and no facility for communicating directly with other machines in the network. The internal state of an ongoing computation within the secure coprocessor cannot be seen from outside, but its interactions with the server can be exploited by an adversary. We formulate the problem of computing join in this setting where the goal is to prevent information leakage through patterns in I/O while maximizing performance. We specify criteria for proving the security of a join algorithm and provide provably safe algorithms. These algorithms can be used to compute general joins involving arbitrary predicates and multiple sovereign databases. We thus enable a new class of applications requiring query processing across sovereign entities such that nothing apart from the result is revealed to the recipients.