Formal proofs for the security of signcryption
From MaRDI portal
Recommendations
Cited in
(25)- On CCA-Secure Somewhat Homomorphic Encryption
- A constructive perspective on signcryption security
- Applications of signcryption
- Certificateless identity-concealed authenticated encryption under multi-KGC
- Information Security
- On the Connection Between Signcryption and One-Pass Key Establishment
- Signcryption from randomness recoverable public key encryption
- One-Round Attribute-Based Key Exchange in the Multi-Party Setting
- SETLA: Signature and Encryption from Lattices
- Hybrid signcryption
- Efficient identity-based signcryption in the standard model
- Proving Tight Security for Rabin-Williams Signatures
- Practical Signcryption
- Security for signcryption: the two-user model
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Identity-based combined public key schemes for signature, encryption, and signcryption
- A single key pair is adequate for the Zheng signcryption
- A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation
- A secure anonymous proxy signcryption scheme
- Signcryption schemes based on the Diffie-Hellman problem
- scientific article; zbMATH DE number 2085423 (Why is no real title available?)
- One-round attribute-based key exchange in the multi-party setting
- Sign-then-encrypt with security enhancement and compressed ciphertext
- scientific article; zbMATH DE number 2080187 (Why is no real title available?)
- Fully secure threshold unsigncryption
This page was built for publication: Formal proofs for the security of signcryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877813)
