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

DOI10.1016/J.IPL.2014.01.008zbMath1285.94114OpenAlexW2002847594MaRDI QIDQ2446574

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (3)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
• Chinese remaindering with errors
• How to Share a Secret
• A modular approach to key safeguarding

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