How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes

Masashi Mitomo; Kaoru Kurosawa

Paper 2000/065

How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes

Masashi Mitomo and Kaoru Kurosawa

Abstract

Suppose that we wish to encrypt long messages with small overhead by a public key encryption scheme which is secure against adaptive chosen ciphertext attack (IND-CCA2). Then the previous schemes require either a large size one-way trapdoor permutation (OAEP) or both a large size symmetric encryption scheme and a small size asymmetric encryption scheme (hybrid encryption). In this paper, we show a scheme which requires only a small size asymmetric encryption scheme satisfying IND-CCA2 for our purpose. Therefore, the proposed scheme is very efficient. A hash function and a psuedorandom bit generator are used as random oracles.

Metadata

Available format(s): PS
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: public-key cryptography chosen ciphertext attack provable security long message efficient encryption decryption
Contact author(s): kurosawa @ ss titech ac jp
History: 2000-12-22: revised; 2000-12-19: received; See all versions
Short URL: https://ia.cr/2000/065
License: CC BY

BibTeX

@misc{cryptoeprint:2000/065,
      author = {Masashi Mitomo and Kaoru Kurosawa},
      title = {How to Encrypt Long Messages without Large Size Symmetric/Asymmetric Encryption Schemes},
      howpublished = {Cryptology {ePrint} Archive, Paper 2000/065},
      year = {2000},
      url = {https://eprint.iacr.org/2000/065}
}