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

DOI10.1007/978-981-19-9307-7_8MaRDI QIDQ6629098FDO

Authors Ngarenon Togde, Augustin P. Sarr

Publication date 29 October 2024

zbMATH Keywords

computational Diffie-Hellmanrandom oracle modelsigncryptioninsider securitynon-interactive non-repudiation

Mathematics Subject Classification ID

Numerical analysis (65-XX)

Cites work

• scientific article; zbMATH DE number 1617924 (Why is no real title available?)
• scientific article; zbMATH DE number 1186868 (Why is no real title available?)
• scientific article; zbMATH DE number 1088233 (Why is no real title available?)
• scientific article; zbMATH DE number 2009970 (Why is no real title available?)
• scientific article; zbMATH DE number 2114384 (Why is no real title available?)
• A constructive perspective on signcryption security
• A practical and insider secure signcryption with non-interactive non-repudiation
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• Efficient constructions of signcryption schemes and signcryption composability
• Formal proofs for the security of signcryption
• 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 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)