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

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

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

• Short signatures from the Weil pairing
• Security proofs for signature schemes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient constructions of signcryption schemes and signcryption composability
• An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
• A constructive perspective on signcryption security
• Title not available (Why is that?)
• Public Key Cryptography - PKC 2006
• Title not available (Why is that?)
• The twin Diffie-Hellman problem and applications
• Title not available (Why is that?)
• Formal proofs for the security of signcryption
• Public Key Cryptography - PKC 2006
• Implicit zero-knowledge arguments and applications to the malicious setting
• A practical and insider secure signcryption with non-interactive non-repudiation
• Signcryption with non-interactive non-repudiation

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)