Secret Sharing Made Short

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Key-Insulated Public Key Cryptosystems (2002, methodology): “For example, using either the computational secret sharing scheme of [ 27 ], or the AONT constructions of [9], we can achievejzj = L, while ‘ can be as small as the security parameter k (in particular, ‘? L). Thus, we get additive increase fln‘, which is essentially independent of L. Finally, in the”
Robust computational secret sharing and a unified account of classical secret-sharing goals (2007, methodology): “We give concrete-security, adversary-at-the-center definitions that encompass the perfect secret-sharing (PSS) goal of Shamir [43]; the less-than-perfect-privacy variant by Blakley [9]; the strengthening of PSS to robust schemes as envisioned by McEliece and Sarwate [35]; the alternative version of ”
Publius: a robust, tamper-evident, censorship-resistant web publishing system (2000, methodology): “Krawczyk in [14] describes how to use Rabin’s information dispersal algorithm to reduce the size of the encrypted file stored on the host server.”
DepSky: dependable and secure storage in a cloud-of-clouds (2011, methodology): “To cope with these limitations we employ an information-efﬁcient secret sharing scheme [Krawczyk 1993] that combines symmetric encryption with a classical secret sharing scheme and an optimal erasure code to partition the data in a set of blocks in such a way that (i.) f + 1 blocks are necessary to…”