Threshold RSA for Dynamic and Ad-Hoc Groups
From MaRDI portal
Publication:5458587
Recommendations
Cites work
- scientific article; zbMATH DE number 176567 (Why is no real title available?)
- scientific article; zbMATH DE number 1256769 (Why is no real title available?)
- scientific article; zbMATH DE number 1088252 (Why is no real title available?)
- scientific article; zbMATH DE number 1759781 (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
- How to share a function securely
- How to share a secret
- Practical threshold signatures
- RSA-based undeniable signatures
- Robust and efficient sharing of RSA functions
- Robust and efficient sharing of RSA functions.
- Robust threshold DSS signatures
- Threshold RSA for Dynamic and Ad-Hoc Groups
Cited in
(10)- Practical (fully) distributed signatures provably secure in the standard model
- Efficient and adaptive threshold signatures for ad hoc networks
- Security in Communication Networks
- Adaptively secure threshold symmetric-key encryption
- Threshold and multi-signature schemes from linear hash functions
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer
- Twinkle: threshold signatures from DDH with full adaptive security
- Enhance confidentiality of threshold signature for MANET
- Threshold RSA for Dynamic and Ad-Hoc Groups
- Fair Threshold Decryption with Semi-Trusted Third Parties
This page was built for publication: Threshold RSA for Dynamic and Ad-Hoc Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458587)