Secret sharing schemes for infinite sets of participants: a new design technique

DOI10.1016/j.tcs.2021.01.019zbMath1506.94078OpenAlexW3121126693MaRDI QIDQ2227498

Paolo D'Arco, Alfredo De Santis, Roberto De Prisco

Publication date: 15 February 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.01.019

zbMATH Keywords

secret sharingChinese remainder theoremthreshold access structureevolving secret sharing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On-line secret sharing
• Evolving secret sharing: dynamic thresholds and robustness
• Constructing ideal secret sharing schemes based on Chinese remainder theorem
• Approximate formulas for some functions of prime numbers
• Secret-Sharing Schemes: A Survey
• How to share a secret
• How to Share a Secret, Infinitely
• Chinese remaindering with errors
• Probabilistic secret sharing
• How to Share a Secret
• How to Share a Secret, Infinitely