Cryptographers’ Track at the RSA Conference

CT-RSA 2006: Topics in Cryptology – CT-RSA 2006 pp 244-261

How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack

  • Yitao Duan
  • John Canny
Conference paper

DOI: 10.1007/11605805_16

Volume 3860 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Duan Y., Canny J. (2006) How to Construct Multicast Cryptosystems Provably Secure Against Adaptive Chosen Ciphertext Attack. In: Pointcheval D. (eds) Topics in Cryptology – CT-RSA 2006. CT-RSA 2006. Lecture Notes in Computer Science, vol 3860. Springer, Berlin, Heidelberg

Abstract

In this paper we present a general framework for constructing efficient multicast cryptosystems with provable security and show that a line of previous work on multicast encryption are all special cases of this general approach. We provide new methods for building such cryptosystems with various levels of security (e.g., IND-CPA, IND-CCA2). The results we obtained enable the construction of a whole class of new multicast schemes with guaranteed security using a broader range of common primitives such as OAEP. Moreover, we show that multicast cryptosystems with high level of security (e.g. IND-CCA2) can be based upon public key cryptosystems with weaker (e.g. CPA) security as long as the decryption can be securely and efficiently “shared”. Our constructions feature truly constant-size decryption keys whereas the lengths of both the encryption key and ciphertext are independent of group size.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yitao Duan
    • 1
  • John Canny
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeleyUSA