Signcryption Schemes Based on the Diffie–Hellman Problem

DOI10.1007/978-3-540-89411-7_4zbMath1217.68079OpenAlexW130784259MaRDI QIDQ3000030

Paulo S. L. M. Barreto, Jean-Jacques Quisquater, Benoît Libert, 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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A code-based hybrid signcryption scheme

Cites Work

• 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
• 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

This page was built for publication: Signcryption Schemes Based on the Diffie–Hellman Problem