New public key cryptosystems based on the dependent-RSA problems

DOI10.1007/3-540-48910-X_17MaRDI QIDQ4250765zbMATH OpenFDO

Authors David Pointcheval

Publication date 9 April 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48910-X_17

zbMATH Keywords

chosen-ciphertext attacksdependent-RSA problempublic-key encryptionsemantic security

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient CCA-Secure Public-Key Encryption Schemes from RSA-Related Assumptions
• Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
• A new public key encryption scheme based on two cryptographic assumptions
• A new public-key cryptosystem as secure as factoring

Cited in

(5)

• Threshold circuit lower bounds on cryptographic functions
• scientific article; zbMATH DE number 2085418 (Why is no real title available?)
• A new public key scheme based on DRSA and generalized GDLP
• A new public key encryption scheme based on two cryptographic assumptions
• New probabilistic public-key encryption based on the RSA cryptosystem

This page was built for publication: New public key cryptosystems based on the dependent-RSA problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250765)