On Secret Reconstruction in Secret Sharing Schemes

57 citations recorded by the source corpus.

How researchers see this paper

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

Staircase-PIR: Universally Robust Private Information Retrieval (2018, background): “In this section, we explore more this connection between communication efficient secret sharing [32]– [34] and capacity achieving robust PIR schemes.”
Communication Efficient Secret Sharing (2015, methodology): “A secret sharing scheme is perfect if a subset of parties is either authorized or blocked, i.e., A∪B = 2{1,...,n}.”
Threshold changeable secret sharing schemes revisited (2012, background): “Now it is a fundamental building block inmany cryptographic protocols such as threshold signature schemes, threshold encryption schemes, and secure multiparty computation.”
Centralized Repair of Multiple Node Failures With Applications to Communication Efficient Secret Sharing (2016, background): “have revisited the model for communication efficient secret sharing which was first proposed by Wang and Wong in [15].”
Staircase codes for secret sharing with optimal communication and read overheads (2015, methodology): “Related work: Wang and Wong derived in [11] a lower bound on CO for perfect CESS, where z = t− 1.”