Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures

DOI10.1007/s12095-010-0039-6zbMath1235.94056OpenAlexW2116360492MaRDI QIDQ662167

Keith M. Martin, Maura B. Paterson, Douglas R. Stinson

Publication date: 21 February 2012

Published in: Cryptography and Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12095-010-0039-6

zbMATH Keywords

error correctionsecret sharingperfectly secure message transmission

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Threshold Secret Sharing Requires a Linear Size Alphabet ⋮ A simple combinatorial treatment of constructions and threshold gaps of ramp schemes ⋮ Recursive hiding of biometrics-based secret sharing scheme using adversary structure ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Secure Outsourced Computation ⋮ Efficient robust secret sharing from expander graphs ⋮ Evolving ramp secret sharing with a small gap ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple assignment scheme for sharing secret
• Player simulation and general adversary structures in perfect multiparty computation
• Secure multi-party computation made simple
• How to share a secret
• Towards Optimal and Efficient Perfectly Secure Message Transmission
• Strongly Multiplicative and 3-Multiplicative Linear Secret Sharing Schemes
• Perfectly secure message transmission
• On the inherent intractability of certain coding problems (Corresp.)
• Fundamentals of Error-Correcting Codes
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes
• Almost Optimum Secret Sharing Schemes Secure Against Cheating for Arbitrary Secret Distribution
• Optimum Secret Sharing Scheme Secure against Cheating
• Information Security and Cryptology - ICISC 2003
• Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
• Algorithms and Computation

This page was built for publication: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures