Efficient public key encryption with smallest ciphertext expansion from factoring

DOI10.1007/S10623-008-9179-5zbMath1178.94200OpenAlexW2081859688WikidataQ122953254 ScholiaQ122953254MaRDI QIDQ1009067

Bing Zhang, Yuan Zhou, Zecheng Wang, Haifeng Qian, Zhi-Bin Li

Publication date: 31 March 2009

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-008-9179-5

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A simpler construction of CCA2-secure public-key encryption under general assumptions
• Probabilistic encryption
• Efficient Rabin-type digital signature scheme
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• A modification of the RSA public-key encryption procedure (Corresp.)
• Nonmalleable Cryptography
• Efficient Identity-Based Encryption Without Random Oracles
• Advances in Cryptology - CRYPTO 2003
• OAEP 3-Round:A Generic and Secure Asymmetric Encryption Padding
• Topics in Cryptology – CT-RSA 2005
• Theory of Cryptography
• Advances in Cryptology - ASIACRYPT 2003
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient public key encryption with smallest ciphertext expansion from factoring