Key Recovery Using Noised Secret Sharing with Discounts over Large Clouds

Conference object English OPEN
JAJODIA , Sushil ; Litwin , Witold ; Schwarz , Thomas (2013)
  • Publisher: HAL CCSD
  • Related identifiers: doi: 10.1109/SocialCom.2013.105
  • Subject: Complexity theory | Encryption | Information management | [ INFO ] Computer Science [cs] | Timing | Noise | Privacy | Key recovery | Data handling | Big data

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.
  • References (6)

    [1] ARO Meeting on Cloud Security. GMU March 11- 12,2013. http://csis.gmu.edu/albanese/events/march-2013-cloudsecurity-meeting/ .

    [2] Jajodia, S., Litwin, W., Schwarz, Th., S.J. Recoverable Encryption through a Noised Secret over a Large Cloud. 5th Inl. Conf. on Data Management in Cloud, Grid and P2P Systems (Globe 2012 ). Springer Verlag, Lecture Notes in Comp. Sc.

    [3] Jajodia, S., Litwin, W., Schwarz, Th., S.J. Recoverable Encryption through a Noised Secret over a Large Cloud. Intl. Journal on Large-Scale Data and Knowledge-Centered Systems, TLDKS IX, LNCS 7980, 2013.

    [4] Jajodia, S., Litwin, W., Schwarz, Th., S.J. Key Recovery Using Noised Secret Sharing with Discounts and Large Clouds. Lamsade Research Report. July 2013 http://www.lamsade.dauphine.fr/~litwin/cours98/CoursBD/Key%2 0Recovery%20with%20Discounts%20Res%20Rep.pdf

    [5] Raluca Ada Popa, Redfield, C., Zeldovich, N. & Balakrishnan, H. CryptDB: Protecting Confidentiality with Encrypted Query Processing. SOSP '11, October 23-26, 2011, Cascais, Portugal.

    [6] Smith, K. How Practical Is Computable Encryption? In[1].

  • Metrics
    No metrics available
Share - Bookmark