
Open access
Datum
2010Typ
- Report
ETH Bibliographie
yes
Altmetrics
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 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. Mehr anzeigen
Persistenter Link
https://doi.org/10.3929/ethz-a-006851009Publikationsstatus
publishedZeitschrift / Serie
Technical Report / ETH Zurich, Department of Computer ScienceBand
Verlag
ETH, Department of Computer ScienceOrganisationseinheit
02150 - Dep. Informatik / Dep. of Computer Science
Anmerkungen
Technical Reports D-INFK.ETH Bibliographie
yes
Altmetrics