Nearly optimal robust secret sharing against rushing adversaries

DOI10.1007/978-3-030-56877-1_6MaRDI QIDQ2102061zbMATH OpenOpenAlexFDO

Authors Pasin Manurangsi, Akshayaram Srinivasan, Prashant Nalini Vasudevan

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-56877-1_6

zbMATH Keywords

local authentication of sharesrobust secret sharing scheme

Mathematics Subject Classification ID

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

Recommendations

• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Towards optimal robust secret sharing with security against a rushing adversary
• Robust secret sharing schemes against local adversaries
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Nearly optimal robust secret sharing

Cites work

• A New Algorithm for the Robust Semi-random Independent Set Problem
• Crown structures for vertex cover kernelization
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Efficient robust secret sharing from expander graphs
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Finding and certifying a large hidden clique in a semirandom graph
• Graph-Theoretic Concepts in Computer Science
• Heuristics for semirandom graph problems
• How to share a function securely
• How to share a secret
• scientific article; zbMATH DE number 1842509 (Why is no real title available?)
• scientific article; zbMATH DE number 1394319 (Why is no real title available?)
• Iterative methods in combinatorial optimization.
• Learning from untrusted data
• Nearly optimal robust secret sharing
• Non-malleable secret sharing
• On the local leakage resilience of linear secret sharing schemes
• Properties of vertex packing and independence system polyhedra
• Reducibility among combinatorial problems
• Robust secret sharing schemes against local adversaries
• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Secret-Sharing Schemes: A Survey
• Towards optimal robust secret sharing with security against a rushing adversary
• Unconditionally-secure robust secret sharing with compact shares

Cited in

(13)

• Nearly optimal robust secret sharing
• Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
• Robust secret sharing with almost optimal share size and security against rushing adversaries
• Constructing locally leakage-resilient linear secret-sharing schemes
• Towards optimal robust secret sharing with security against a rushing adversary
• Robust secret sharing schemes against local adversaries
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Constructing leakage-resilient Shamir's secret sharing: over composite order fields
• Towards breaking the half-barrier of local leakage-resilient Shamir's secret sharing
• Efficient robust secret sharing from expander graphs
• Physical-bit leakage resilience of linear code-based secret sharing
• Statistical layered MPC
• Leakage-resilience of Shamir's secret sharing: identifying secure evaluation places

This page was built for publication: Nearly optimal robust secret sharing against rushing adversaries

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