Recoverable Encryption through Noised Secret over a Large Cloud

Autor: Thomas Schwarz Sj, Sushil Jajodia, Witold Litwin
Přispěvatelé: George Mason University [Fairfax], Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision (LAMSADE), Université Paris Dauphine-PSL, Université Paris sciences et lettres (PSL)-Université Paris sciences et lettres (PSL)-Centre National de la Recherche Scientifique (CNRS), Universidad Católica del Uruguay
Rok vydání: 2012
Předmět:
Zdroj: Lecture Notes in Computer Science ISBN: 9783642323430
Globe
Lecture Notes in Computer Science
5th International Conference on Data Mangement in Cloud, Grid and P2P System (Globe 2012)
5th International Conference on Data Mangement in Cloud, Grid and P2P System (Globe 2012), Sep 2012, Vienne, Austria. pp.13-24
DOI: 10.1007/978-3-642-32344-7_2
Popis: The safety of keys is the Achilles' heel of cryptography. A key backup at an escrow service lowers the risk of loosing the key, but increases the danger of key disclosure. We propose Recoverable Encryption (RE) schemes that alleviate the dilemma. RE encrypts a backup of the key in a manner that restricts practical recovery by an escrow service to one using a large cloud. For example, a cloud with ten thousand nodes could recover a key in at most 10 minutes with an average recovery time of five minutes. A recovery attempt at the escrow agency, using a small cluster, would require seventy days with an average of thirty five days. Large clouds have become available even to private persons, but their pay-for-use structure makes their use for illegal purposes too dangerous. We show the feaibility of two RE schemes and give conditions for their deployment.
Databáze: OpenAIRE