scientific article; zbMATH DE number 1950617

MaRDI QIDQ4413329zbMATH OpenFDO

Authors Josef Pieprzyk, Xian-Mo Zhang

Publication date 17 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2587/25870253.htm

zbMATH Keywords

cheating detectionidentificationsecret sharingthreshold schemes

Mathematics Subject Classification ID

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

Recommendations

• Secret sharing using near-MDS codes
• MDS secret-sharing scheme secure against cheaters
• Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters
• Conjunctive hierarchical secret sharing scheme based on MDS codes
• scientific article; zbMATH DE number 1980983

Cited in

(14)

• Higher weights and near-MDR codes over chain rings
• A linear code based on resilient Boolean maps whose dual is a platform for a robust secret sharing scheme
• Secret sharing using near-MDS codes
• Conjunctive hierarchical secret sharing scheme based on MDS codes
• scientific article; zbMATH DE number 1980983 (Why is no real title available?)
• scientific article; zbMATH DE number 2159653 (Why is no real title available?)
• Relationship between MDS codes and threshold schemes
• Generalized Secret Sharing Schemes Using N$$^\mu $$MDS Codes
• On Hamming distance distributions of repeated-root constacyclic codes of length \(3p^s\) over \(\mathbb{F}_{p^m} + u \mathbb{F}_{p^m}\)
• On additive MDS codes with linear projections
• Some new classes of additive MDS and almost MDS codes over finite fields
• On constacyclic codes of length \(9 p^s\) over \(\mathbb{F}_{p^m}\) and their optimal codes
• Multi-recipient and threshold encryption based on hidden multipliers
• AMDS codes and quantum AMDS codes of length \(3p^s\) over \(\mathbb{F}_{p^m}\)

This page was built for publication:

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