Signcryption Schemes Based on the Diffie–Hellman Problem
From MaRDI portal
Publication:3000030
DOI10.1007/978-3-540-89411-7_4zbMath1217.68079MaRDI QIDQ3000030
Jean-Jacques Quisquater, Benoît Libert, Paulo S. L. M. Barreto, Noel McCullagh
Publication date: 18 May 2011
Published in: Practical Signcryption (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89411-7_4
94A60: Cryptography
68P25: Data encryption (aspects in computer science)
94A62: Authentication, digital signatures and secret sharing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the fly authentication and signature schemes based on groups of unknown order
- Formal proofs for the security of signcryption
- Probabilistic encryption
- Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
- Tag-KEM/DEM: A new framework for hybrid encryption
- Signcryption with non-interactive non-repudiation
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
- An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
- Information Security and Privacy
- Public Key Cryptography - PKC 2006
