Privacy-Preserving Outsourcing of Brute-Force Key Searches
Ghassan O. Karame and Srdjan Capkun and Ueli Maurer
In this work, we investigate the privacy-preserving prop- erties of encryption algorithms in the special case where encrypted data might be brute-force decrypted in a dis- tributed setting. For that purpose, we consider a prob- lem 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 intro- duce 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 encryp- tion 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.