Public-key revocation and tracing schemes with subset difference methods revisited

Kwangsu Lee, Woo Kwon Koo, Dong Hoon Lee, Jong Hwan Park

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

7 Citations (Scopus)

Abstract

Broadcast encryption is a very powerful primitive since it can send an encrypted message to a set of users excluding a set of revoked users. Public-key broadcast encryption (PKBE) is a special type of broadcast encryption such that anyone can run the encryption algorithm to create an encrypted message by using a public key. In this paper, we propose a new technique to construct an efficient PKBE scheme by using the subset cover framework. First, we introduce a new concept of public-key encryption named single revocation encryption (SRE) and propose an efficient SRE scheme in the random oracle model. A user in SRE is represented as a group that he belongs and a member in the group. In SRE, a sender can create a ciphertext for a specified group where one member in the group is revoked, and a receiver can decrypt the ciphertext if he belongs to the group in the ciphertext and he is not revoked in the group. Second, we show that the subset difference (SD) scheme (or the layered subset difference (LSD) scheme) and an SRE scheme can be combined to construct a public-key revocation encryption (PKRE) scheme such that a set of revoked users is specified in a ciphertext. Our PKRE scheme using the LSD scheme and our SRE scheme can reduce the size of private keys and public keys by logN factor compared with the previous scheme of Dodis and Fazio.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
PublisherSpringer Verlag
Pages1-18
Number of pages18
Volume8713 LNCS
EditionPART 2
ISBN (Print)9783319112114
DOIs
Publication statusPublished - 2014 Jan 1
Event19th European Symposium on Research in Computer Security, ESORICS 2014 - Wroclaw, Poland
Duration: 2014 Sep 72014 Sep 11

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
NumberPART 2
Volume8713 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other19th European Symposium on Research in Computer Security, ESORICS 2014
CountryPoland
CityWroclaw
Period14/9/714/9/11

Fingerprint

Revocation
Public key
Tracing
Encryption
Difference Method
Cryptography
Broadcast Encryption
Subset
Public Key Encryption
Difference Scheme
Random Oracle Model
Receiver
Cover

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Lee, K., Koo, W. K., Lee, D. H., & Park, J. H. (2014). Public-key revocation and tracing schemes with subset difference methods revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 8713 LNCS, pp. 1-18). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8713 LNCS, No. PART 2). Springer Verlag. https://doi.org/10.1007/978-3-319-11212-1_1

Public-key revocation and tracing schemes with subset difference methods revisited. / Lee, Kwangsu; Koo, Woo Kwon; Lee, Dong Hoon; Park, Jong Hwan.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8713 LNCS PART 2. ed. Springer Verlag, 2014. p. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8713 LNCS, No. PART 2).

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

Lee, K, Koo, WK, Lee, DH & Park, JH 2014, Public-key revocation and tracing schemes with subset difference methods revisited. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 8713 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8713 LNCS, Springer Verlag, pp. 1-18, 19th European Symposium on Research in Computer Security, ESORICS 2014, Wroclaw, Poland, 14/9/7. https://doi.org/10.1007/978-3-319-11212-1_1
Lee K, Koo WK, Lee DH, Park JH. Public-key revocation and tracing schemes with subset difference methods revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 8713 LNCS. Springer Verlag. 2014. p. 1-18. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). https://doi.org/10.1007/978-3-319-11212-1_1
Lee, Kwangsu ; Koo, Woo Kwon ; Lee, Dong Hoon ; Park, Jong Hwan. / Public-key revocation and tracing schemes with subset difference methods revisited. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8713 LNCS PART 2. ed. Springer Verlag, 2014. pp. 1-18 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).
@inproceedings{70f71018d1954e99a82b8d598a7fcd56,
title = "Public-key revocation and tracing schemes with subset difference methods revisited",
abstract = "Broadcast encryption is a very powerful primitive since it can send an encrypted message to a set of users excluding a set of revoked users. Public-key broadcast encryption (PKBE) is a special type of broadcast encryption such that anyone can run the encryption algorithm to create an encrypted message by using a public key. In this paper, we propose a new technique to construct an efficient PKBE scheme by using the subset cover framework. First, we introduce a new concept of public-key encryption named single revocation encryption (SRE) and propose an efficient SRE scheme in the random oracle model. A user in SRE is represented as a group that he belongs and a member in the group. In SRE, a sender can create a ciphertext for a specified group where one member in the group is revoked, and a receiver can decrypt the ciphertext if he belongs to the group in the ciphertext and he is not revoked in the group. Second, we show that the subset difference (SD) scheme (or the layered subset difference (LSD) scheme) and an SRE scheme can be combined to construct a public-key revocation encryption (PKRE) scheme such that a set of revoked users is specified in a ciphertext. Our PKRE scheme using the LSD scheme and our SRE scheme can reduce the size of private keys and public keys by logN factor compared with the previous scheme of Dodis and Fazio.",
keywords = "bilinear maps, broadcast encryption, public-key encryption, trace and revoke, traitor tracing",
author = "Kwangsu Lee and Koo, {Woo Kwon} and Lee, {Dong Hoon} and Park, {Jong Hwan}",
year = "2014",
month = "1",
day = "1",
doi = "10.1007/978-3-319-11212-1_1",
language = "English",
isbn = "9783319112114",
volume = "8713 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
number = "PART 2",
pages = "1--18",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
edition = "PART 2",

}

TY - GEN

T1 - Public-key revocation and tracing schemes with subset difference methods revisited

AU - Lee, Kwangsu

AU - Koo, Woo Kwon

AU - Lee, Dong Hoon

AU - Park, Jong Hwan

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Broadcast encryption is a very powerful primitive since it can send an encrypted message to a set of users excluding a set of revoked users. Public-key broadcast encryption (PKBE) is a special type of broadcast encryption such that anyone can run the encryption algorithm to create an encrypted message by using a public key. In this paper, we propose a new technique to construct an efficient PKBE scheme by using the subset cover framework. First, we introduce a new concept of public-key encryption named single revocation encryption (SRE) and propose an efficient SRE scheme in the random oracle model. A user in SRE is represented as a group that he belongs and a member in the group. In SRE, a sender can create a ciphertext for a specified group where one member in the group is revoked, and a receiver can decrypt the ciphertext if he belongs to the group in the ciphertext and he is not revoked in the group. Second, we show that the subset difference (SD) scheme (or the layered subset difference (LSD) scheme) and an SRE scheme can be combined to construct a public-key revocation encryption (PKRE) scheme such that a set of revoked users is specified in a ciphertext. Our PKRE scheme using the LSD scheme and our SRE scheme can reduce the size of private keys and public keys by logN factor compared with the previous scheme of Dodis and Fazio.

AB - Broadcast encryption is a very powerful primitive since it can send an encrypted message to a set of users excluding a set of revoked users. Public-key broadcast encryption (PKBE) is a special type of broadcast encryption such that anyone can run the encryption algorithm to create an encrypted message by using a public key. In this paper, we propose a new technique to construct an efficient PKBE scheme by using the subset cover framework. First, we introduce a new concept of public-key encryption named single revocation encryption (SRE) and propose an efficient SRE scheme in the random oracle model. A user in SRE is represented as a group that he belongs and a member in the group. In SRE, a sender can create a ciphertext for a specified group where one member in the group is revoked, and a receiver can decrypt the ciphertext if he belongs to the group in the ciphertext and he is not revoked in the group. Second, we show that the subset difference (SD) scheme (or the layered subset difference (LSD) scheme) and an SRE scheme can be combined to construct a public-key revocation encryption (PKRE) scheme such that a set of revoked users is specified in a ciphertext. Our PKRE scheme using the LSD scheme and our SRE scheme can reduce the size of private keys and public keys by logN factor compared with the previous scheme of Dodis and Fazio.

KW - bilinear maps

KW - broadcast encryption

KW - public-key encryption

KW - trace and revoke

KW - traitor tracing

UR - http://www.scopus.com/inward/record.url?scp=84906500937&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84906500937&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-11212-1_1

DO - 10.1007/978-3-319-11212-1_1

M3 - Conference contribution

AN - SCOPUS:84906500937

SN - 9783319112114

VL - 8713 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 1

EP - 18

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer Verlag

ER -