Compact CCA-Secure Encryption for Messages of Arbitrary Length

DOI10.1007/978-3-642-00468-1_21MaRDI QIDQ3615626zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Masayuki Abe, Eike Kiltz, Tatsuaki Okamoto

Publication date 24 March 2009

Published in Public Key Cryptography – PKC 2009 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00468-1_21

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1612500
• Miniature CCA2 PK Encryption: Tight Security Without Redundancy
• scientific article; zbMATH DE number 2085419
• Compact public key encryption with minimum ideal property of hash functions
• Chosen Ciphertext Security with Optimal Ciphertext Overhead

Cited in

(10)

• Efficient public key encryption with smallest ciphertext expansion from factoring
• A new authenticated encryption technique for handling long ciphertexts in memory constrained devices
• scientific article; zbMATH DE number 1612500 (Why is no real title available?)
• Compact public key encryption with minimum ideal property of hash functions
• scientific article; zbMATH DE number 2085419 (Why is no real title available?)
• scientific article; zbMATH DE number 2085421 (Why is no real title available?)
• On shortening ciphertexts: new constructions for compact public key and stateful encryption schemes
• Miniature CCA2 PK Encryption: Tight Security Without Redundancy
• Compress multiple ciphertexts using ElGamal encryption schemes
• A more efficient accountable authority IBE scheme under the DL assumption

Describes a project that uses

Uses Software

• KEM-DEM

This page was built for publication: Compact CCA-Secure Encryption for Messages of Arbitrary Length

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