On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme

DOI10.1016/J.INS.2018.06.046zbMath1440.94092OpenAlexW2399180445WikidataQ129635173 ScholiaQ129635173MaRDI QIDQ2198255

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

Publication date: 9 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2018.06.046

zbMATH Keywords

entropyChinese remainder theoremsecret sharing schemeasymptotic idealnessasymptotic perfectness

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

A collaborative secret sharing scheme based on the Chinese remainder theorem ⋮ Multi-secret sharing model based on Hermite interpolation polynomial and quantum graph state ⋮ Homomorphic extensions of CRT-based secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes
• Distributive weighted threshold secret sharing schemes
• Threshold cryptography based on Asmuth-Bloom secret sharing
• A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme
• Chinese remaindering with errors
• How to Share a Secret
• A modular approach to key safeguarding
• Elements of Information Theory

This page was built for publication: On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme