A minimal model for secure computation (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Protecting data privacy in private information retrieval schemes
STOC '98 Proceedings of the thirtieth 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
An architecture for privacy-preserving mining of client information
CRPIT '14 Proceedings of the IEEE international conference on Privacy, security and data mining - Volume 14
Assuring privacy when big brother is watching
DMKD '03 Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
A privacy-preserving index for range queries
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
Privacy-Preserving Policy-Based Information Transfer
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
Almost optimal private information retrieval
PET'02 Proceedings of the 2nd international conference on Privacy enhancing technologies
Efficient privacy-preserving similar document detection
The VLDB Journal — The International Journal on Very Large Data Bases
Privacy-preserving queries over relational databases
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
BotGrep: finding P2P bots with structured graph analysis
USENIX Security'10 Proceedings of the 19th USENIX conference on Security
Secure set intersection with untrusted hardware tokens
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Private search in the real world
Proceedings of the 27th Annual Computer Security Applications Conference
Collusion-resistant outsourcing of private set intersection
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Outsourced symmetric private information retrieval
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Private database queries using somewhat homomorphic encryption
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
DupLESS: server-aided encryption for deduplicated storage
SEC'13 Proceedings of the 22nd USENIX conference on Security
Supporting concurrency and multiple indexes in private access to outsourced data
Journal of Computer Security - Research in Computer Security and Privacy: Emerging Trends
| Hi-index | 0.00 |
The need for privacy-preserving sharing of sensitive information occurs in many different and realistic everyday scenarios, ranging from national security to social networking. A typical setting involves two parties: one seeks information from the other without revealing the interest while the latter is either willing, or compelled, to share only the requested information. This poses two challenges: (1) how to enable sharing such that parties learn no information beyond what they are entitled to, and (2) how to do so efficiently, in real-world practical terms. This paper explores the notion of Privacy-Preserving Sharing of Sensitive Information (PPSSI), and provides a concrete and efficient instantiation, modeled in the context of simple database querying. Proposed approach functions as a privacy shield to protect parties from disclosing more than the required minimum of their respective sensitive information. PPSSI deployment prompts several challenges, which are addressed in this paper. Extensive experimental results attest to the practicality of attained privacy features and show that our approach incurs quite low overhead (e.g., 10% slower than standard MySQL).