CryptoDB
Multi-Recipient Public-Key Encryption with Shortened Ciphertext
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2001-11483, title={Multi-Recipient Public-Key Encryption with Shortened Ciphertext}, booktitle={IACR Eprint archive}, keywords={public-key cryptography / public-key cryptography, multi-user setting}, url={http://eprint.iacr.org/2001/071}, note={ kurosawa@cis.ibaraki.ac.jp 11702 received 21 Aug 2001, last revised 15 Jan 2002}, author={Kaoru Kurosawa}, year=2001 }