Generalized Secret Sharing Schemes Using N^\mu MDS Codes

DOI10.1007/978-3-030-43120-4_18MaRDI QIDQ5014680zbMATH OpenOpenAlexFDO

Authors Sanyam Mehta, Vishal Saraswat

Publication date 8 December 2021

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-43120-4_18

zbMATH Keywords

almost MDS codesgeneralized access structurenear MDS codessecret sharing schemes

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Recommendations

• Secret sharing using near-MDS codes
• scientific article; zbMATH DE number 1950617
• Conjunctive hierarchical secret sharing scheme based on MDS codes
• MDS secret-sharing scheme secure against cheaters
• Secret sharing schemes with general access structures

Cites work

• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• Fundamentals of Error-Correcting Codes
• Generalized ideal secret-sharing schemes and matroids
• How to share a secret
• scientific article; zbMATH DE number 4179276 (Why is no real title available?)
• scientific article; zbMATH DE number 1088900 (Why is no real title available?)
• scientific article; zbMATH DE number 1950617 (Why is no real title available?)
• Matrix characterization of linear codes with arbitrary Hamming weight hierarchy
• Secret sharing using near-MDS codes

Cited in

(1)

• Classification of a class of A^3MDS code and applications in secret-sharing schemes

This page was built for publication: Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes

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