Efficient robust secret sharing from expander graphs
From MaRDI portal
Recommendations
- On the Share Efficiency of Robust Secret Sharing and Secret Sharing with Cheating Detection
- Nearly optimal robust secret sharing against rushing adversaries
- Nearly optimal robust secret sharing
- Unconditionally-secure robust secret sharing with compact shares
- Robust secret sharing schemes against local adversaries
Cites work
- scientific article; zbMATH DE number 4179276 (Why is no real title available?)
- scientific article; zbMATH DE number 1024000 (Why is no real title available?)
- scientific article; zbMATH DE number 1024043 (Why is no real title available?)
- scientific article; zbMATH DE number 1095500 (Why is no real title available?)
- scientific article; zbMATH DE number 1942426 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- scientific article; zbMATH DE number 1842509 (Why is no real title available?)
- scientific article; zbMATH DE number 1390062 (Why is no real title available?)
- scientific article; zbMATH DE number 1394290 (Why is no real title available?)
- scientific article; zbMATH DE number 1394319 (Why is no real title available?)
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- Almost-Everywhere Secure Computation
- An O (log n ) expected rounds randomized byzantine generals protocol
- Codes Which Detect Deception
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Expander graphs and their applications
- Expansion of random graphs: new proofs, new results
- General Error Decodable Secret Sharing Scheme and Its Application
- How to share a secret
- How to share a secret with cheaters
- Identifying cheaters without an honest majority
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- On Secret Sharing Schemes, Matroids and Polymatroids
- On the role of expander graphs in key predistribution schemes for wireless sensor networks
- Optimum Secret Sharing Scheme Secure against Cheating
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Perfectly secure message transmission
- Player simulation and general adversary structures in perfect multiparty computation
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable Secure Multiparty Computation
- Scalable and Unconditionally Secure Multiparty Computation
- Secret sharing schemes with detection of cheaters for a general access structure
- Secret-Sharing Schemes: A Survey
- Secure Message Transmission With Small Public Discussion
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Unconditionally-secure robust secret sharing with compact shares
- Universal classes of hash functions
Cited in
(3)
This page was built for publication: Efficient robust secret sharing from expander graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680925)
