Nearly optimal robust secret sharing against rushing adversaries
From MaRDI portal
Publication:2102061
DOI10.1007/978-3-030-56877-1_6zbMath1504.94219OpenAlexW2982521367MaRDI QIDQ2102061
Akshayaram Srinivasan, Pasin Manurangsi, Prashant Nalini Vasudevan
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_6
Related Items (2)
Constructing locally leakage-resilient linear secret-sharing schemes ⋮ Leakage-resilience of the Shamir secret-sharing scheme against physical-bit leakages
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient robust secret sharing from expander graphs
- Heuristics for semirandom graph problems
- Nearly optimal robust secret sharing
- Robust secret sharing with almost optimal share size and security against rushing adversaries
- Towards optimal robust secret sharing with security against a rushing adversary
- Crown structures for vertex cover kernelization
- Robust Secret Sharing Schemes Against Local Adversaries
- How to share a function securely
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Unconditionally-Secure Robust Secret Sharing with Compact Shares
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Iterative Methods in Combinatorial Optimization
- Properties of vertex packing and independence system polyhedra
- Finding and certifying a large hidden clique in a semirandom graph
- Learning from untrusted data
- Reducibility among Combinatorial Problems
- A New Algorithm for the Robust Semi-random Independent Set Problem
- Non-malleable secret sharing
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Graph-Theoretic Concepts in Computer Science
- On the local leakage resilience of linear secret sharing schemes
This page was built for publication: Nearly optimal robust secret sharing against rushing adversaries
