Essentially Optimal Robust Secret Sharing with Maximal Corruptions

DOI10.1007/978-3-662-49890-3_3zbMath1347.94068OpenAlexW2473929938MaRDI QIDQ2820478

Allison Bishop, Valerio Pastro, Daniel Wichs, Rajmohan Rajaraman

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-49890-3_3

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (10)

Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ On one-round reliable message transmission ⋮ Source-location privacy full protection in wireless sensor networks ⋮ Efficient robust secret sharing from expander graphs ⋮ Nearly optimal robust secret sharing ⋮ On fully-secure honest majority MPC without \(n^2\) round overhead ⋮ Constructing leakage-resilient Shamir's secret sharing: over composite order fields ⋮ Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing ⋮ Nearly optimal robust secret sharing against rushing adversaries

This page was built for publication: Essentially Optimal Robust Secret Sharing with Maximal Corruptions