Security in Communication Networks

DOI10.1007/B105083MaRDI QIDQ5491701zbMATH OpenOpenAlexFDO

Authors Benoît Libert, Jean-Jacques Quisquater

Publication date 10 October 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b105083

zbMATH Keywords

bilinear mapsprovable securitysigncryption

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
• Signcryption schemes based on the Diffie-Hellman problem
• Efficient Short Signcryption Scheme with Public Verifiability
• scientific article; zbMATH DE number 1088233
• Efficient signature schemes with tight reductions to the Diffie-Hellman problems

Cited in

(8)

• Signcryption schemes based on the Diffie-Hellman problem
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• On the security of joint signature and encryption revisited
• Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
• Related-key differential cryptanalysis of GMiMC used in post-quantum signatures
• Sign-then-encrypt with security enhancement and compressed ciphertext
• Analysis of improved signcryption scheme with key privacy
• Cryptanalysis of a signcryption scheme with fast online signing and short signcryptext

This page was built for publication: Security in Communication Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5491701)