Robust Threshold Schemes Based on the Chinese Remainder Theorem

DOI10.1007/978-3-540-68164-9_7zbMath1142.94348OpenAlexW1569983209MaRDI QIDQ3506373

Kamer Kaya, Ali Aydın Selçuk

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

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

zbMATH Keywords

RSArobustnessElGamalChinese Remainder TheoremPaillierThreshold cryptography

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Threshold cryptography based on Asmuth-Bloom secret sharing
• How to share a function securely
• How to share a secret
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Homomorphic Zero-Knowledge Threshold Schemes over any Finite Abelian Group
• A modular approach to key safeguarding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Robust Threshold Schemes Based on the Chinese Remainder Theorem