Paper 2001/071 Original: eprint.iacr.org/2001/071 ↗

Multi-Recipient Public-Key Encryption with Shortened Ciphertext

Kaoru Kurosawa
Abstract

In the trivial $n$-recipient public-key encryption scheme, a ciphertext is a concatenation of independently encrypted messages for $n$ recipients. In this paper, we say that an $n$-recipient scheme has a ``{\it shortened ciphertext}'' property if the length of the ciphertext is almost a half (or less) of the trivial scheme and the security is still almost the same as the underlying single-recipient scheme. We first present (multi-plaintext, multi-recipient) schemes with the ``{\it shortened ciphertext}'' property for ElGamal scheme and Cramer-Shoup scheme. We next show (single-plaintext, multi-recipient) hybrid encryption schemes with the ``{\it shortened ciphertext}'' property.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Preprint.
History
2002-01-15: last updated
2001-08-22: published
Short URL
https://ia.cr/2001/071
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2001/071,
      author = {Kaoru Kurosawa},
      title = {Multi-Recipient Public-Key Encryption with Shortened Ciphertext},
      howpublished = {Cryptology {ePrint} Archive, Paper 2001/071},
      year = {2001},
      url = {https://eprint.iacr.org/2001/071}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.