Efficient robust secret sharing from expander graphs

DOI10.1007/S12095-017-0215-ZzbMATH Open1380.94098OpenAlexW2591883121MaRDI QIDQ680925FDOQ680925

Authors: Brett Hemenway, Rafail Ostrovsky 

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

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

zbMATH Keywords

expander graphsrobust secret sharingsecure message transmission

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Universal classes of hash functions
• How to share a secret
• Expander graphs and their applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes Which Detect Deception
• How to share a secret with cheaters
• Optimum Secret Sharing Scheme Secure against Cheating
• Title not available (Why is that?)
• Secret-Sharing Schemes: A Survey
• Title not available (Why is that?)
• Player simulation and general adversary structures in perfect multiparty computation
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• On Secret Sharing Schemes, Matroids and Polymatroids
• Expansion of random graphs: new proofs, new results
• On the role of expander graphs in key predistribution schemes for wireless sensor networks
• Perfectly secure message transmission
• Title not available (Why is that?)
• Scalable and Unconditionally Secure Multiparty Computation
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures
• Identifying cheaters without an honest majority
• Almost-Everywhere Secure Computation
• Title not available (Why is that?)
• Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Almost Secure (1-Round, n-Channel) Message Transmission Scheme
• Scalable Multiparty Computation with Nearly Optimal Work and Resilience
• Scalable Secure Multiparty Computation
• Secret sharing schemes with detection of cheaters for a general access structure
• Essentially Optimal Robust Secret Sharing with Maximal Corruptions
• Unconditionally-secure robust secret sharing with compact shares
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Secure Message Transmission With Small Public Discussion
• Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
• An O (log n ) expected rounds randomized byzantine generals protocol
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• General Error Decodable Secret Sharing Scheme and Its Application

Cited In (3)

• Proactive secret sharing with constant communication
• Secret key amplification from uniformly leaked key exchange complete graph
• Nearly optimal robust secret sharing against rushing adversaries

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)