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 “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 “shortened ciphertext” property for ElGamal scheme and Cramer-Shoup scheme. We next show (single-plaintext, multi-recipient) hybrid encryption schemes with the “shortened ciphertext” property.
CITATION STYLE
Kurosawa, K. (2002). Multi-recipient public-key encryption with shortened ciphertext. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2274, pp. 48–63). Springer Verlag. https://doi.org/10.1007/3-540-45664-3_4
Mendeley helps you to discover research relevant for your work.