Fully secure threshold unsigncryption
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Efficient signature generation by smart cards
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
- Formal proofs for the security of signcryption
- How to share a secret
- scientific article; zbMATH DE number 1186868 (Why is no real title available?)
- scientific article; zbMATH DE number 1088233 (Why is no real title available?)
- scientific article; zbMATH DE number 1107669 (Why is no real title available?)
- scientific article; zbMATH DE number 2086700 (Why is no real title available?)
- Information Security
- Information Security
- Information Security and Cryptology
- Information Security and Cryptology - ICISC 2003
- Public Key Cryptography - PKC 2006
- Secure distributed key generation for discrete-log based cryptosystems
- Securing threshold cryptosystems against chosen ciphertext attack
- Security arguments for digital signatures and blind signatures
- Topics in Cryptology – CT-RSA 2006
Cited in
(5)- Signcryption schemes with threshold unsigncryption, and applications
- Breaking and building of threshold signcryption schemes
- An ID-based (u,m) threshold signcryption scheme with (t,n) shared unsigncryption
- scientific article; zbMATH DE number 2202077 (Why is no real title available?)
- Information Security
This page was built for publication: Fully secure threshold unsigncryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4933226)