Threshold RSA for Dynamic and Ad-Hoc Groups

DOI10.1007/978-3-540-78967-3_6zbMath1149.94316OpenAlexW1534607189MaRDI QIDQ5458587

Shai Halevi, Hugo Krawczyk, Rosario Gennaro, Tal Rabin

Publication date: 15 April 2008

Published in: Advances in Cryptology – EUROCRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78967-3_6

Mathematics Subject Classification ID

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

Related Items (6)

Adaptively secure threshold symmetric-key encryption ⋮ Threshold and multi-signature schemes from linear hash functions ⋮ Threshold RSA for Dynamic and Ad-Hoc Groups ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer ⋮ Practical (fully) distributed signatures provably secure in the standard model

Cites Work

• RSA-based undeniable signatures
• Robust threshold DSS signatures
• Robust and efficient sharing of RSA functions.
• How to share a function securely
• How to share a secret
• Robust and Efficient Sharing of RSA Functions
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• Threshold RSA for Dynamic and Ad-Hoc Groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Threshold RSA for Dynamic and Ad-Hoc Groups