Signcryption Schemes Based on the RSA Problem
From MaRDI portal
Recommendations
- Signcryption schemes based on the Diffie-Hellman problem
- A scheme of hybrid signcryption using RSA
- Signatures on randomizable ciphertexts
- A signcryption scheme based on integer factorization
- A signature scheme based strong RSA assumption
- Signcryption from randomness recoverable public key encryption
- A new RSA-based signature scheme
- On the security of some variants of the RSA signature scheme
- RSA-based undeniable signatures
Cites work
- A method for obtaining digital signatures and public-key cryptosystems
- A signcryption scheme based on integer factorization
- Computing the RSA secret key is deterministic polynomial time equivalent to factoring
- Identification, signature and signcryption using high order residues modulo an RSA composite
- Optimal asymmetric encryption
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Two birds one stone: Signcryption using RSA
- Universal padding schemes for RSA
Cited in
(8)- Signcryption from randomness recoverable public key encryption
- scientific article; zbMATH DE number 6520960 (Why is no real title available?)
- How (not) to design RSA signature schemes
- Transitive signatures based on factoring and RSA
- New signcryption schemes based on KCDSA
- On the security of RSA textbook signature scheme on Paillier ciphertext
- A scheme of hybrid signcryption using RSA
- A code-based hybrid signcryption scheme
This page was built for publication: Signcryption Schemes Based on the RSA Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000032)