Efficient public key encryption with smallest ciphertext expansion from factoring
From MaRDI portal
(Redirected from Publication:1009067)
Recommendations
Cites work
- A modification of the RSA public-key encryption procedure (Corresp.)
- A simpler construction of CCA2-secure public-key encryption under general assumptions
- Advances in Cryptology - CRYPTO 2003
- Chosen-ciphertext security without redundancy
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Rabin-type digital signature scheme
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- scientific article; zbMATH DE number 176565 (Why is no real title available?)
- scientific article; zbMATH DE number 1302835 (Why is no real title available?)
- scientific article; zbMATH DE number 1302836 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- scientific article; zbMATH DE number 2079933 (Why is no real title available?)
- scientific article; zbMATH DE number 1775406 (Why is no real title available?)
- scientific article; zbMATH DE number 2086698 (Why is no real title available?)
- scientific article; zbMATH DE number 1842495 (Why is no real title available?)
- scientific article; zbMATH DE number 1842496 (Why is no real title available?)
- scientific article; zbMATH DE number 1842497 (Why is no real title available?)
- scientific article; zbMATH DE number 1440074 (Why is no real title available?)
- Nonmalleable Cryptography
- OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
- Probabilistic encryption
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- Theory of Cryptography
- Topics in Cryptology – CT-RSA 2005
This page was built for publication: Efficient public key encryption with smallest ciphertext expansion from factoring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009067)