Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
From MaRDI portal
Publication:3626853
DOI10.1007/978-3-540-24632-9_14zbMATH Open1198.94106OpenAlexW1760090598MaRDI QIDQ3626853FDOQ3626853
Authors: Benoît Libert, Jean-Jacques Quisquater
Publication date: 14 May 2009
Published in: Public Key Cryptography – PKC 2004 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-24632-9_14
Recommendations
Cited In (22)
- Signcryption schemes with insider security in an ideal permutation model
- A generic solution to realize public verifiability of signcryption
- Information Security
- Signcryption from randomness recoverable public key encryption
- Analysis of improved signcryption scheme with key privacy
- CASE: a new frontier in public-key authenticated encryption
- How to construct efficient signcryption schemes on elliptic curves
- The Group of Signed Quadratic Residues and Applications
- Provably secure non-interactive key distribution based on pairings
- KCI-resilient anonymous wireless link-layer authentication protocols
- A secure anonymous proxy signcryption scheme
- Signcryption schemes based on the Diffie-Hellman problem
- On the security of joint signature and encryption revisited
- COMPASS: Authenticated Group Key Agreement from Signcryption
- Security in Communication Networks
- Sign-then-encrypt with security enhancement and compressed ciphertext
- A new encryption and signing algorithm
- Certificate-based signcryption with enhanced security features
- Cryptanalysis of a signcryption scheme with fast online signing and short signcryptext
- Identity based public verifiable signcryption scheme
- Fully secure threshold unsigncryption
- Indifferentiable deterministic hashing to elliptic and hyperelliptic curves
This page was built for publication: Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626853)