Towards optimal robust secret sharing with security against a rushing adversary

DOI10.1007/978-3-030-17659-4_16OpenAlexW2931027073MaRDI QIDQ2292703FDOQ2292703

Authors: Serge Fehr, Chen Yuan 

Publication date: 4 February 2020

Full work available at URL: https://ir.cwi.nl/pub/28685

Recommendations

• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Nearly optimal robust secret sharing against rushing adversaries
• Unconditionally-secure robust secret sharing with compact shares
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Nearly optimal robust secret sharing

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (9)

• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Constructing locally leakage-resilient linear secret-sharing schemes
• On fully-secure honest majority MPC without \(n^2\) round overhead
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters
• Constructing leakage-resilient Shamir's secret sharing: over composite order fields
• Nearly optimal robust secret sharing against rushing adversaries
• Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
• Efficient fully secure computation via distributed zero-knowledge proofs

This page was built for publication: Towards optimal robust secret sharing with security against a rushing adversary

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2292703)