Efficient robust secret sharing from expander graphs
From MaRDI portal
Publication:680925
DOI10.1007/s12095-017-0215-zzbMath1380.94098OpenAlexW2591883121MaRDI QIDQ680925
Rafail Ostrovsky, Brett Hemenway
Publication date: 29 January 2018
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-017-0215-z
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications of graph theory to circuits and networks (94C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Expansion of random graphs: new proofs, new results
- Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
- How to share a secret with cheaters
- Universal classes of hash functions
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- Secret sharing schemes with detection of cheaters for a general access structure
- Player simulation and general adversary structures in perfect multiparty computation
- Essentially Optimal Robust Secret Sharing with Maximal Corruptions
- Optimum Secret Sharing Scheme Secure against Cheating
- Identifying Cheaters without an Honest Majority
- Unconditionally-Secure Robust Secret Sharing with Compact Shares
- On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks
- Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
- Secure Message Transmission With Small Public Discussion
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Expander graphs and their applications
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- On Secret Sharing Schemes, Matroids and Polymatroids
- Towards Optimal and Efficient Perfectly Secure Message Transmission
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Scalable and Unconditionally Secure Multiparty Computation
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- An O (log n ) expected rounds randomized byzantine generals protocol
- Perfectly secure message transmission
- Codes Which Detect Deception
- General Error Decodable Secret Sharing Scheme and Its Application
- Almost-Everywhere Secure Computation
- Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
- Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
- Scalable Secure Multiparty Computation
This page was built for publication: Efficient robust secret sharing from expander graphs
