Signcryption with non-interactive non-repudiation

DOI10.1007/s10623-004-3806-6zbMath1136.94321OpenAlexW2033032578MaRDI QIDQ2572979

John Malone-Lee

Publication date: 7 November 2005

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-004-3806-6

zbMATH Keywords

provable securitysigncryptionnon-repudiation

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

SETLA: Signature and Encryption from Lattices ⋮ Signcryption Schemes Based on the Diffie–Hellman Problem ⋮ Hybrid Signcryption

Cites Work

• Unnamed Item
• Probabilistic encryption
• Minimum disclosure proofs of knowledge
• Efficient signature generation by smart cards
• Public key signatures in the multi-user setting.
• Identity-based authenticated key agreement protocol based on Weil pairing
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Reducing elliptic curve logarithms to logarithms in a finite field
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack

This page was built for publication: Signcryption with non-interactive non-repudiation