Signcryption from randomness recoverable public key encryption
From MaRDI portal
Recommendations
- Signatures on randomizable ciphertexts
- Efficient Signcryption Key Encapsulation without Random Oracles
- Signcryption Schemes Based on the RSA Problem
- Signcryption schemes based on the Diffie-Hellman problem
- Efficient signatures on randomizable ciphertexts
- scientific article; zbMATH DE number 1186868
- Confidential Signatures and Deterministic Signcryption
- An efficient signcryption scheme with forward secrecy
- A constructive perspective on signcryption security
Cites work
- scientific article; zbMATH DE number 1583942 (Why is no real title available?)
- scientific article; zbMATH DE number 2085423 (Why is no real title available?)
- scientific article; zbMATH DE number 1186868 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1341867 (Why is no real title available?)
- scientific article; zbMATH DE number 1088233 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 1962152 (Why is no real title available?)
- scientific article; zbMATH DE number 2080187 (Why is no real title available?)
- scientific article; zbMATH DE number 1759661 (Why is no real title available?)
- scientific article; zbMATH DE number 2086700 (Why is no real title available?)
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- A new signature scheme without random oracles from bilinear pairings
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology - EUROCRYPT 2004
- Chosen-ciphertext security without redundancy
- Delegation with supervision
- Efficient Signcryption with Key Privacy from Gap Diffie-Hellman Groups
- Efficient generic on-line/off-line (threshold) signatures without key exposure
- Formal proofs for the security of signcryption
- Information Security and Cryptology - ICISC 2003
- Secure integration of asymmetric and symmetric encryption schemes
- The exact security of digital signatures -- how to sign with RSA and Rabin
- The ring authenticated encryption scheme-how to provide a clue wisely
Cited in
(12)- Signcryption with quantum random oracles
- Provably convertible multi-authenticated encryption scheme for generalized group communications
- Group-oriented setting's multisigncryption scheme with threshold designcryption
- Practical Signcryption
- scientific article; zbMATH DE number 6520960 (Why is no real title available?)
- Randomness recoverable secret sharing schemes
- Anamorphic encryption, revisited
- Incrementally Executable Signcryptions
- Signcryption Schemes Based on the RSA Problem
- Certificate-based signcryption with enhanced security features
- Sign-then-encrypt with security enhancement and compressed ciphertext
- Efficient Signcryption Key Encapsulation without Random Oracles
This page was built for publication: Signcryption from randomness recoverable public key encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2269814)