Robust threshold DSS signatures

DOI10.1006/INCO.2000.2881MaRDI QIDQ1854399zbMATH OpenOpenAlexFDO

Authors Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, Tal Rabin

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

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

Recommendations

• Robust threshold DSS signatures
• scientific article; zbMATH DE number 2048539
• Robust and efficient sharing of RSA functions
• Practical threshold signatures
• scientific article; zbMATH DE number 1030972

Cites work

• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 176567 (Why is no real title available?)
• scientific article; zbMATH DE number 177618 (Why is no real title available?)
• scientific article; zbMATH DE number 1256769 (Why is no real title available?)
• scientific article; zbMATH DE number 1302840 (Why is no real title available?)
• scientific article; zbMATH DE number 1304079 (Why is no real title available?)
• scientific article; zbMATH DE number 1030972 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• scientific article; zbMATH DE number 1418290 (Why is no real title available?)
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Distributed Provers with Applications to Undeniable Signatures
• Efficient signature generation by smart cards
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• How to share a function securely
• How to share a secret
• Robust and efficient sharing of RSA functions
• Robust threshold DSS signatures
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(24)

• Secure threshold multi authority attribute based encryption without a central authority
• Fair Threshold Decryption with Semi-Trusted Third Parties
• Threshold RSA for Dynamic and Ad-Hoc Groups
• Sharing DSS by the Chinese remainder theorem
• Threshold signatures with private accountability
• Practical (fully) distributed signatures provably secure in the standard model
• A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
• Practical Threshold Signatures Without Random Oracles
• Optimal resilient threshold GQ signatures
• Certificateless threshold signature scheme from bilinear maps
• Fully adaptive Schnorr threshold signatures
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
• scientific article; zbMATH DE number 1808277 (Why is no real title available?)
• Efficient RSA key generation and threshold Paillier in the two-party setting
• Robust threshold DSS signatures
• Efficient certificateless threshold signatures without random oracles
• Practical distributed signatures in the standard model
• Non-interactive identity-based threshold signature scheme without random oracles
• Robust digital signature revisited
• Applied Cryptography and Network Security
• Matrix Signatures: From MACs to Digital Signatures in Distributed Systems

This page was built for publication: Robust threshold DSS signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854399)