Signcryption schemes based on the Diffie-Hellman problem

DOI10.1007/978-3-540-89411-7_4MaRDI QIDQ3000030zbMATH OpenOpenAlexFDO

Authors Paulo S. L. M. Barreto, Benoît Libert, Noel McCullagh, Jean-Jacques Quisquater

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

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

Recommendations

• Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
• Security in Communication Networks
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems
• A signature scheme as secure as the Diffie-Hellman problem
• Signcryption schemes based on bilinear maps

Cites work

• A public key cryptosystem and a signature scheme based on discrete logarithms
• A signcryption scheme based on integer factorization
• A signcryption scheme with signature directly verifiable by public key
• Advances in Cryptology - EUROCRYPT 2004
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Digital signcryption or how to achieve cost(signature \& encryption) cost(signature) + cost(encryption).
• Encrypted message authentication by firewalls
• Formal proofs for the security of signcryption
• Formal proofs for the security of signcryption
• scientific article; zbMATH DE number 4191111 (Why is no real title available?)
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• Information Security and Privacy
• New DSA-verifiable signcryption schemes
• New signcryption schemes based on KCDSA
• On the fly authentication and signature schemes based on groups of unknown order
• Probabilistic encryption
• Provably secure encrypt-then-sign composition in hybrid signcryption
• 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
• The composite discrete logarithm and secure authentication
• The gap-problems: A new class of problems for the security of cryptographic schemes
• The oracle Diffie-Hellman assumptions and an analysis of DHIES

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
• New signcryption schemes based on KCDSA
• 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)