Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes

DOI10.1016/j.ins.2013.03.062zbMath1321.94100OpenAlexW2060876648MaRDI QIDQ497226

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

Publication date: 23 September 2015

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

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

zbMATH Keywords

entropyChinese remainder theoremsecret-sharing scheme(asymptotic) idealness(asymptotic) perfectnessperfect zero-knowledge

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Distributive weighted threshold secret sharing schemes ⋮ On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ A necessary and sufficient condition for the asymptotic idealness of the GRS threshold secret sharing scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some of the properties of the sequence of powers of prime numbers.
• How to share a secret
• Chinese remaindering with errors
• The Difference Between Consecutive Primes
• A modular approach to key safeguarding

This page was built for publication: Compact sequences of co-primes and their applications to the security of CRT-based threshold schemes