Robust threshold DSS signatures
From MaRDI portal
Recommendations
Cites work
- 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
- 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?)
- Robust and efficient sharing of RSA functions
- Robust threshold DSS signatures
- The Knowledge Complexity of Interactive Proof Systems
Cited in
(29)- Robust digital signature revisited
- Sharing DSS by the Chinese remainder theorem
- Practical (fully) distributed signatures provably secure in the standard model
- Threshold cryptography based on Asmuth-Bloom secret sharing
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Robust threshold DSS signatures
- Efficient RSA key generation and threshold Paillier in the two-party setting
- scientific article; zbMATH DE number 1808277 (Why is no real title available?)
- Practical Threshold Signatures Without Random Oracles
- Matrix Signatures: From MACs to Digital Signatures in Distributed Systems
- Fair Threshold Decryption with Semi-Trusted Third Parties
- scientific article; zbMATH DE number 1030972 (Why is no real title available?)
- Practical distributed signatures in the standard model
- Efficient certificateless threshold signatures without random oracles
- Threshold RSA for Dynamic and Ad-Hoc Groups
- A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
- Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority
- Applied Cryptography and Network Security
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party
- Threshold signatures with private accountability
- Fully adaptive Schnorr threshold signatures
- Certificateless threshold signature scheme from bilinear maps
- Arctic: lightweight and stateless threshold Schnorr signatures
- Dynamic-FROST: Schnorr threshold signatures with a flexible committee
- Improved universal thresholdizer from iterative Shamir secret sharing
- Honest-majority threshold ECDSA with batch generation of key-independent presignatures
- Optimal resilient threshold GQ signatures
- Non-interactive identity-based threshold signature scheme without random oracles
- Secure threshold multi authority attribute based encryption without a central authority
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)
