Signcryption schemes based on the Diffie-Hellman problem
From MaRDI portal
Recommendations
Cites work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Formal proofs for the security of signcryption
- scientific article; zbMATH DE number 1617924 (Why is no real title available?)
- scientific article; zbMATH DE number 1618043 (Why is no real title available?)
- scientific article; zbMATH DE number 2085423 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 5009203 (Why is no real title available?)
- scientific article; zbMATH DE number 1186868 (Why is no real title available?)
- scientific article; zbMATH DE number 1341867 (Why is no real title available?)
- scientific article; zbMATH DE number 1088233 (Why is no real title available?)
- scientific article; zbMATH DE number 1950601 (Why is no real title available?)
- scientific article; zbMATH DE number 1950602 (Why is no real title available?)
- scientific article; zbMATH DE number 2080187 (Why is no real title available?)
- scientific article; zbMATH DE number 1759661 (Why is no real title available?)
- scientific article; zbMATH DE number 1440053 (Why is no real title available?)
- Information Security and Privacy
- On the fly authentication and signature schemes based on groups of unknown order
- Probabilistic encryption
- Public Key Cryptography - PKC 2006
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Signcryption with non-interactive non-repudiation
- Tag-KEM/DEM: A new framework for hybrid encryption
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
Cited in
(18)- A constructive perspective on signcryption security
- Signcryption from randomness recoverable public key encryption
- Hierarchical functional signcryption: notion and construction
- How to construct efficient signcryption schemes on elliptic curves
- Signcryption schemes based on bilinear maps
- Signcryption Schemes Based on the RSA Problem
- scientific article; zbMATH DE number 5856057 (Why is no real title available?)
- A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- scientific article; zbMATH DE number 6520960 (Why is no real title available?)
- Confidential Signatures and Deterministic Signcryption
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
- Practical Signcryption
- scientific article; zbMATH DE number 1759661 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Security in Communication Networks
- A code-based hybrid signcryption scheme
- Signed Diffie-Hellman key exchange with tight security
This page was built for publication: Signcryption schemes based on the Diffie-Hellman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000030)