• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

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

View/Open
PID2896501 Big Data Final.pdf (266.6Kb)
Type
Communication / Conférence
Date
2013
Conference title
2013 International Conference on Social Computing (SocialCom)
Conference date
2013-09
Conference city
Washington, DC
Conference country
United States
Book title
2013 International Conference on Social Computing (SocialCom)
Book author
Chang, L.W.; Srivastava, Jaideep; Zhan, Justin
Publisher
IEEE
Published in
Piscataway, NJ
ISBN
978-0-7695-5137-1
Number of pages
1094
Pages
700-707
Publication identifier
10.1109/SocialCom.2013.105
Metadata
Show full item record
Author(s)
Jajodia, Sushil
Interdisciplinary Center for Economic Science, George Mason University
Litwin, Witold
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Schwarz, Thomas
Université d'Uruguay
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 / Keywords
Big data; Key recovery; Privacy; Noise; Complexity theory; Timing; Encryption; Information management; Data handling

Related items

Showing items related by title and author.

  • Thumbnail
    Recoverable Encryption through Noised Secret over a Large Cloud 
    Schwarz, Thomas; Litwin, Witold; Jajodia, Sushil (2012) Communication / Conférence
  • Thumbnail
    Numerical SQL Value Expressions Over Encrypted Cloud Databases 
    Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2015) Communication / Conférence
  • Thumbnail
    Privacy of data outsourced to a cloud for selected readers through client-side encryption 
    Schwarz, Thomas; Jajodia, Sushil; Litwin, Witold (2011) Communication / Conférence
  • Thumbnail
    Securing password recovery through dispersion 
    Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2012) Communication / Conférence
  • Thumbnail
    LH*RE: A Scalable Distributed Data Structure with Recoverable Encryption 
    Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas (2010) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo