Error correcting and complexity aspects of linear secret sharing schemes

DOI10.1007/10958513_30zbMATH Open1255.94074OpenAlexW1492546183MaRDI QIDQ3404418FDOQ3404418

Authors: Kaoru Kurosawa, Tri van le, Yvo Desmedt 

Publication date: 9 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/10958513_30

Recommendations

• New secret sharing scheme based on linear code
• scientific article; zbMATH DE number 1543059
• Coding and Cryptography
• scientific article; zbMATH DE number 1390062
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions

Mathematics Subject Classification ID

Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Authentication, digital signatures and secret sharing (94A62)

Cited In (6)

• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• New secret sharing scheme based on linear code
• Improving the linear programming technique in the search for lower bounds in secret sharing
• Linear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
• Finding lower bounds on the complexity of secret sharing schemes by linear programming
• Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming

This page was built for publication: Error correcting and complexity aspects of linear secret sharing schemes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404418)