Signcryption from randomness recoverable public key encryption

DOI10.1016/J.INS.2009.10.015zbMath1191.94093OpenAlexW2042908314WikidataQ123198399 ScholiaQ123198399MaRDI QIDQ2269814

Duncan S. Wong, Chung Ki Li

Publication date: 11 March 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.10.015

zbMATH Keywords

provable securitypublic key cryptographysigncryptionpublic key encryption with randomness recovery

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (3)

Certificate-based signcryption with enhanced security features ⋮ Group-oriented setting's multisigncryption scheme with threshold designcryption ⋮ Provably convertible multi-authenticated encryption scheme for generalized group communications

Cites Work

• Formal proofs for the security of signcryption
• Efficient generic on-line/off-line (threshold) signatures without key exposure
• The ring authenticated encryption scheme-how to provide a clue wisely
• Delegation with supervision
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• A New Signature Scheme Without Random Oracles from Bilinear Pairings
• Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
• A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
• Secure integration of asymmetric and symmetric encryption schemes
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - CRYPTO 2003
• Information Security and Cryptology - ICISC 2003
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Signcryption from randomness recoverable public key encryption