A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation

DOI10.1007/978-981-19-9307-7_8MaRDI QIDQ6629098zbMATH OpenFDO

Authors Ngarenon Togde, Augustin P. Sarr

Publication date 29 October 2024

Full work available at URL https://doi.org/10.1007/978-981-19-9307-7_8

zbMATH Keywords

computational Diffie-Hellmaninsider securitynon-interactive non-repudiationrandom oracle modelsigncryption

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• A constructive perspective on signcryption security
• A practical and insider secure signcryption with non-interactive non-repudiation
• A signature scheme as secure as the Diffie-Hellman problem
• A signcryption scheme with signature directly verifiable by public key
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Digital signcryption or how to achieve cost(signature \& encryption) cost(signature) + cost(encryption).
• Efficient constructions of signcryption schemes and signcryption composability
• Formal proofs for the security of signcryption
• Guide to elliptic curve cryptography.
• Implicit zero-knowledge arguments and applications to the malicious setting
• Public Key Cryptography - PKC 2006
• Public Key Cryptography - PKC 2006
• Security proofs for signature schemes
• Short signatures from the Weil pairing
• Signcryption with non-interactive non-repudiation
• The oracle Diffie-Hellman assumptions and an analysis of DHIES
• The twin Diffie-Hellman problem and applications

This page was built for publication: A computational Diffie-Hellman-based insider secure signcryption with non-interactive non-repudiation

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