A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme

DOI10.1016/J.IPL.2014.01.008zbMATH Open1285.94114OpenAlexW2002847594MaRDI QIDQ2446574FDOQ2446574

Authors: Constantin Cătălin Drăgan, Ferucio Laurenţiu Ţiplea 

Publication date: 17 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.01.008

Recommendations

• On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
• Bounds on the Threshold Gap in Secret Sharing and its Applications
• Remarks on the classical threshold secret sharing schemes
• Optimum general threshold secret sharing
• A scheme for threshold multi-secret sharing
• An efficient \((t,n)\) threshold multi-secret sharing scheme
• Theory of Cryptography
• Characterizing Ideal Weighted Threshold Secret Sharing
• A remark on hierarchical threshold secret sharing

zbMATH Keywords

entropycryptographyChinese remainder theoremsecret sharing scheme(asymptotic) idealness(asymptotic) perfectness

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Title not available (Why is that?)
• Chinese remaindering with errors
• Title not available (Why is that?)
• Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
• A modular approach to key safeguarding
• How to share a secret

Cited In (3)

• Ideal access structures based on a class of minimal linear codes
• On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
• Distributive weighted threshold secret sharing schemes

This page was built for publication: A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme

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