Efficient robust secret sharing from expander graphs
type: Item
instance of: scholarly article
title: Efficient robust secret sharing from expander graphs
zbMATH Open document ID: 1380.94098
author: Brett Hemenway
author: Rafail Ostrovsky
published in: Cryptography and Communications
publication date: 2018-01-29T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 11T71
Mathematics Subject Classification ID: 94C15
zbMATH DE Number: 6830410
zbMATH Keywords: robust secret sharing
zbMATH Keywords: expander graphs
zbMATH Keywords: secure message transmission
MaRDI profile type: Publication
full work available at URL: s12095-017-0215-z
OpenAlex ID: W2591883121
cites work: Expander graphs and their applications
cites work: Secret-Sharing Schemes: A Survey
cites work: Q3202940
cites work: Q4341674
cites work: Essentially Optimal Robust Secret Sharing with Maximal Corruptions
cites work: Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
cites work: An O (log n ) expected rounds randomized byzantine generals protocol
cites work: Q4934327
cites work: Secret sharing schemes with detection of cheaters for a general access structure
cites work: Q4934735
cites work: Universal classes of hash functions
cites work: Unconditionally-Secure Robust Secret Sharing with Compact Shares
cites work: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
cites work: Identifying Cheaters without an Honest Majority
cites work: Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
cites work: Q4783743
cites work: Q4409124
cites work: Scalable Secure Multiparty Computation
cites work: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
cites work: Scalable Multiparty Computation with Nearly Optimal Work and Resilience
cites work: Scalable and Unconditionally Secure Multiparty Computation
cites work: Perfectly secure message transmission
cites work: Towards Optimal and Efficient Perfectly Secure Message Transmission
cites work: General Error Decodable Secret Sharing Scheme and Its Application
cites work: Secure Message Transmission With Small Public Discussion
cites work: Almost-Everywhere Secure Computation
cites work: How to share a secret
cites work: Codes Which Detect Deception
cites work: Player simulation and general adversary structures in perfect multiparty computation
cites work: Q4934703
cites work: On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks
cites work: Almost Secure (1-Round, n-Channel) Message Transmission Scheme
cites work: On Secret Sharing Schemes, Matroids and Polymatroids
cites work: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
cites work: Q4450526
cites work: Optimum Secret Sharing Scheme Secure against Cheating
cites work: New combinatorial designs and their applications to authentication codes and secret sharing schemes.
cites work: Expansion of random graphs: new proofs, new results
cites work: Q4341731
cites work: How to share a secret with cheaters
cites work: Q4368762
DOI: 10.1007/S12095-017-0215-Z
description: scientific article; zbMATH DE number 6830410