Efficient KEMs with Partial Message Recovery
From MaRDI portal
Recommendations
- Constructing Better KEMs with Partial Message Recovery
- Tag-KEM from Set Partial Domain One-Way Permutations
- Constructing Strong KEM from Weak KEM (or How to Revive the KEM/DEM Framework)
- Advances in Cryptology – CRYPTO 2004
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
Cites work
- Cryptography and Coding
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- scientific article; zbMATH DE number 1583804 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2081084 (Why is no real title available?)
- scientific article; zbMATH DE number 1759350 (Why is no real title available?)
- On IND-CCA security modeling in cryptographic protocols
- Secure integration of asymmetric and symmetric encryption schemes
- Tag-KEM/DEM: A New Framework for Hybrid Encryption and A New Analysis of Kurosawa-Desmedt KEM
- The exact security of digital signatures -- how to sign with RSA and Rabin
Cited in
(5)- Signcryption schemes with insider security in an ideal permutation model
- Constructing Better KEMs with Partial Message Recovery
- Sponge based CCA2 secure asymmetric encryption for arbitrary length message
- Chosen Ciphertext Security with Optimal Ciphertext Overhead
- On the construction of public key encryption with sender recovery
This page was built for publication: Efficient KEMs with Partial Message Recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447520)