Robust threshold DSS signatures

DOI10.1006/inco.2000.2881zbMath1021.94527OpenAlexW2019616576MaRDI QIDQ1854399

Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin, Rosario Gennaro

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2000.2881

zbMATH Keywords

signaturesdigital signature standard

Mathematics Subject Classification ID

Cooperative games (91A12) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items

Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting ⋮ Threshold cryptography based on Asmuth-Bloom secret sharing ⋮ Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party ⋮ Certificateless threshold signature scheme from bilinear maps ⋮ Practical Threshold Signatures Without Random Oracles ⋮ Efficient RSA key generation and threshold Paillier in the two-party setting ⋮ Threshold signatures with private accountability ⋮ Fully adaptive Schnorr threshold signatures ⋮ Non-interactive identity-based threshold signature scheme without random oracles ⋮ Efficient certificateless threshold signatures without random oracles ⋮ Secure threshold multi authority attribute based encryption without a central authority ⋮ Threshold RSA for Dynamic and Ad-Hoc Groups ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem ⋮ Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority ⋮ Sharing DSS by the Chinese remainder theorem ⋮ Practical (fully) distributed signatures provably secure in the standard model

Cites Work

• Efficient signature generation by smart cards
• How to share a function securely
• Robust Threshold DSS Signatures
• How to share a secret
• Robust and Efficient Sharing of RSA Functions
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• The Knowledge Complexity of Interactive Proof Systems
• Distributed Provers with Applications to Undeniable Signatures
• A method for obtaining digital signatures and public-key cryptosystems
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item