A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem

DOI10.1007/978-3-540-89754-5_32zbMath1203.94132OpenAlexW206566878MaRDI QIDQ5504640

Kamer Kaya, Ali Aydın Selçuk

Publication date: 22 January 2009

Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11693/26802

zbMATH Keywords

verifiabilityChinese Remainder TheoremAsmuth-Bloom secret sharing schemejoint random secret sharing

Mathematics Subject Classification ID

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

Related Items (3)

Homomorphic extensions of CRT-based secret sharing ⋮ Multilevel threshold secret sharing based on the Chinese remainder theorem ⋮ Sharing DSS by the Chinese remainder theorem

Cites Work

• Robust threshold DSS signatures
• Threshold cryptography based on Asmuth-Bloom secret sharing
• How to share a secret
• Distributed Provers with Applications to Undeniable Signatures
• Efficient generation of shared RSA keys
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem