Recoverable Encryption through a Noised Secret over a Large Cloud

Jajodia, Sushil; Litwin, Witold; Schwarz, Thomas

doi:10.1007/978-3-642-40069-8_3

Cited by 2 publications

(23 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As in [2], we call below each x a noise and I is the 1b. The noise shares form the noise share space, say Q, with card |Q| = card |I| = M. Each s is an integer, as we just said and can be s 0 .…”

Section: Backup Creationmentioning

confidence: 99%

“…Notice that, while the backup creation is quite similar to that in [2], the definition of noise shares differs. The rationale (that we do not plan to address further here) is a programmatically simpler discount calculation.…”

Section: Backup Creationmentioning

confidence: 99%

“…Schemes for recoverable encryption through noised secret sharing, RE NS schemes in short, appeared as a new solution to the dilemma, [2] and [3]. The key owner escrows a specifically encrypted backup.…”

mentioning

confidence: 99%

“…Below, we first define and analyze the RE NS schemes with discounts using, so-called 2-share noised secret sharing. We generalize for this purpose the two related schemes defined in [2]. These are told respectively static and scalable and are analyzed further more in depth in [3].…”

mentioning

confidence: 99%

“…We generalize for this purpose the two related schemes defined in [2]. These are told respectively static and scalable and are analyzed further more in depth in [3]. We define the backup and the discount creation, then the discount-based recovery calculation.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Key Recovery Using Noised Secret Sharing with Discounts over Large Clouds

Jajodia

Litwin

Schwarz

2013

2013 International Conference on Social Computing

Self Cite

View full text Add to dashboard Cite

Encryption key loss problem is 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.

show abstract

Section: Backup Creationmentioning

confidence: 99%

Section: Backup Creationmentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations