Optimal chosen-ciphertext secure encryption of arbitrary-length messages

DOI10.1007/3-540-45664-3_2MaRDI QIDQ3043924zbMATH OpenFDO

Authors Jean-Sébastien Coron, Helena Handschuh, Marc Joye, Pascal Paillier, David Pointcheval, Christophe Tymen

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2274/22740017.htm

zbMATH Keywords

asymmetric encryptionpublic-key cryptographysecurity reductions

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60)

Recommendations

• GEM: a Generic chosen-ciphertext secure Ecryption Method
• A practical approach to attaining chosen ciphertext security
• Compact CCA-Secure Encryption for Messages of Arbitrary Length
• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Optimal asymmetric encryption

Cited in

(11)

• Efficient public key encryption with smallest ciphertext expansion from factoring
• Subtleties in the definition of IND-CCA: when and how should challenge decryption be disallowed?
• scientific article; zbMATH DE number 5901454 (Why is no real title available?)
• On Hiding a Plaintext Length by Preencryption
• A practical approach to attaining chosen ciphertext security
• How to Enrich the Message Space of a Cipher
• Chosen Ciphertext Security with Optimal Ciphertext Overhead
• Compact CCA-Secure Encryption for Messages of Arbitrary Length
• Optimal asymmetric encryption
• GEM: a Generic chosen-ciphertext secure Ecryption Method
• An efficient and secure cryptosystem for encrypting long messages

This page was built for publication: Optimal chosen-ciphertext secure encryption of arbitrary-length messages

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