Abstract
In this work, we investigate the privacy-preserving properties of encryption algorithms in the special case where encrypted data might be brute-force decrypted in a distributed setting. For that purpose, we consider a problem where a supervisor holds a ciphertext and wants to search for the corresponding key assisted by a set of helper nodes, without the nodes learning any information about the plaintext or the decryption key. We call this a privacy-preserving cryptographic key search. We provide a model for privacy-preserving cryptographic searches and we introduce two types of privacy-preserving key search problems: plaintext-hiding and key-hiding cryptographic search. We show that a number of private-key and public-key encryption schemes enable the construction of efficient privacy-preserving solvers for plaintext hiding searches. We also discuss possible constructions of privacy-preserving solvers for key-hiding cryptographic searches. Our results highlight the need to consider the property of enabling efficient privacy-preserving solvers as an additional criterion for choosing which cryptographic algorithm to use.
Original language | English |
---|---|
Title of host publication | CCSW'11 - Proceedings of the 3rd ACM Workshop on Cloud Computing Security Workshop |
Pages | 101-112 |
Number of pages | 12 |
DOIs | |
Publication status | Published - 2011 |
Event | 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW'11, Co-located with the 18th ACM Conference on Computer and Communications Security, CCS 2011 - Chicago, IL, United States Duration: 21 Oct 2011 → 21 Oct 2011 |
Other
Other | 3rd ACM Workshop on Cloud Computing Security Workshop, CCSW'11, Co-located with the 18th ACM Conference on Computer and Communications Security, CCS 2011 |
---|---|
Country/Territory | United States |
City | Chicago, IL |
Period | 21/10/11 → 21/10/11 |
Keywords
- Brute-force key search
- Distributed computing
- Privacy-preserving solvers