A signcryption scheme based on integer factorization
From MaRDI portal
Recommendations
- Two birds one stone: Signcryption using RSA
- Formal proofs for the security of signcryption
- A signcryption scheme with signature directly verifiable by public key
- Formal proofs for the security of signcryption
- Digital signcryption or how to achieve cost(signature \& encryption) cost(signature) + cost(encryption).
Cited in
(16)- Signcryption schemes with insider security in an ideal permutation model
- Signcryption from randomness recoverable public key encryption
- Conjugacy systems based on nonabelian factorization problems and their applications in cryptography
- Identification, signature and signcryption using high order residues modulo an RSA composite
- Signcryption schemes based on the Diffie-Hellman problem
- Signcryption Schemes Based on the RSA Problem
- Efficient identity-based signcryption in the standard model
- A signcryption scheme based learning with errors over rings without trapdoor
- A generic solution to realize public verifiability of signcryption
- scientific article; zbMATH DE number 6520960 (Why is no real title available?)
- Efficient ``on the fly signature schemes based on integer factoring
- Identity based public verifiable signcryption scheme
- A code-based hybrid signcryption scheme
- CASE: a new frontier in public-key authenticated encryption
- Sign-then-encrypt with security enhancement and compressed ciphertext
- Formal proofs for the security of signcryption
This page was built for publication: A signcryption scheme based on integer factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472429)
