Key Recovery Using Noised Secret Sharing with Discounts over Large Clouds
Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2013), Key Recovery Using Noised Secret Sharing with Discounts over Large Clouds, in Chang, L.W.; Srivastava, Jaideep; Zhan, Justin, 2013 International Conference on Social Computing (SocialCom), IEEE : Piscataway, NJ, p. 700-707. 10.1109/SocialCom.2013.105
TypeCommunication / Conférence
Conference title2013 International Conference on Social Computing (SocialCom)
Conference cityWashington, DC
Conference countryUnited States
Book title2013 International Conference on Social Computing (SocialCom)
Book authorChang, L.W.; Srivastava, Jaideep; Zhan, Justin
Number of pages1094
MetadataShow full item record
Interdisciplinary Center for Economic Science, George Mason University
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)Encryption key loss problem is the Achilles's heel of cryptography. Key escrow helps, but favors disclosures. Schemes for recoverable encryption keys through noised secret sharing alleviate the dilemma. Key owner escrows a specifically encrypted backup. The recovery needs a large cloud. Cloud cost, money trail should rarefy illegal attempts. We now propose noised secret sharing schemes supporting discounts. The recovery request with discount code lowers the recovery complexity, easily by orders of magnitude. A smaller cloud may suffice for the same recovery timing. Alternatively, same cloud may provide faster recovery etc. Our schemes appear useful for users attracted to Big Data, but afraid of possibly humongous consequences of the key loss or data disclosure.
Subjects / KeywordsBig data; Key recovery; Privacy; Noise; Complexity theory; Timing; Encryption; Information management; Data handling
Showing items related by title and author.