Public key broadcast encryption with low number of keys and constant decryption time

Yi Ru Liu*, Wen-Guey Tzeng

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

In this paper we propose three public key BE schemes that have efficient complexity measures. The first scheme, called the BE-PI scheme, has O(r) header size, O(1) public keys and O(logN) private keys per user, where r is the number of revoked users. This is the first public key BE scheme that has both public and private keys under O(logN) while the header size is O(r). These complexity measures match those of efficient secret key BE schemes. Our second scheme, called the PK-SD-PI scheme, has O(r) header size, O(1) public key and O(log 2 N) private keys per user. They are the same as those of the SD scheme. Nevertheless, the decryption time is remarkably O(1). This is the first public key BE scheme that has O(1) decryption time while other complexity measures are kept low. The third scheme, called, the PK-LSD-PI scheme, is constructed in the same way, but based on the LSD method. It has O(r/ε) ciphertext size and O(log1∈+∈ε N) private keys per user, where 0∈<∈ε<∈1. The decryption time is also O(1). Our basic schemes are one-way secure against full collusion of revoked users in the random oracle model under the BDH assumption. We can modify our schemes to have indistinguishably security against adaptive chosen ciphertext attacks.

Original languageEnglish
Title of host publicationPublic Key Cryptography - PKC 2008 - 11th International Workshop on Practice and Theory in Public Key Cryptography, Proceedings
Pages380-396
Number of pages17
DOIs
StatePublished - 10 Mar 2008
Event11th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2008 - Barcelona, Spain
Duration: 9 Mar 200812 Mar 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4939 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference11th International Workshop on Practice and Theory in Public Key Cryptography, PKC 2008
CountrySpain
CityBarcelona
Period9/03/0812/03/08

Keywords

  • Broadcast encryption
  • Collusion
  • Polynomial interpolation

Fingerprint Dive into the research topics of 'Public key broadcast encryption with low number of keys and constant decryption time'. Together they form a unique fingerprint.

  • Cite this

    Liu, Y. R., & Tzeng, W-G. (2008). Public key broadcast encryption with low number of keys and constant decryption time. In Public Key Cryptography - PKC 2008 - 11th International Workshop on Practice and Theory in Public Key Cryptography, Proceedings (pp. 380-396). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4939 LNCS). https://doi.org/10.1007/978-3-540-78440-1_22