Server-Aided Revocable Identity-Based Encryption

Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach,...

Full description

Saved in:
Bibliographic Details
Published inComputer Security -- ESORICS 2015 Vol. 9326; pp. 286 - 304
Main Authors Qin, Baodong, Deng, Robert H., Li, Yingjiu, Liu, Shengli
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2015
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Online AccessGet full text
ISBN9783319241739
3319241737
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-24174-6_15

Cover

Abstract Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size of key updates is only O(rlogNr) $$O(r\log \frac{N}{r})$$ , with N being the number of users and r the number of revoked users, respectively; however, every user needs to keep at least O(logN) $$O(\log N)$$ long-term secret keys and all non-revoked users are required to communicate with the KGC regularly. These two drawbacks pose challenges to users who have limited resources to store their secret keys or cannot receive key updates in real-time. To alleviate the above problems, we propose a novel system model called server-aided revocable IBE. In our model, almost all of the workloads on users are delegated to an untrusted server which manages users’ public keys and key updates sent by a KGC periodically. The server is untrusted in the sense that it does not possess any secret information. Our system model requires each user to keep just one short secret key and does not require users to communicate with either the KGC or the server during key updating. In addition, the system supports delegation of users’ decryption keys, namely it is secure against decryption key exposure attacks. We present a concrete construction of the system that is provably secure against adaptive-ID chosen plaintext attacks under the DBDH assumption in the standard model. One application of our server-aided revocable IBE is encrypted email supporting lightweight devices (e.g., mobile phones) in which an email server plays the role of the untrusted server so that only non-revoked users can read their email messages.
AbstractList Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size of key updates is only O(rlogNr) $$O(r\log \frac{N}{r})$$ , with N being the number of users and r the number of revoked users, respectively; however, every user needs to keep at least O(logN) $$O(\log N)$$ long-term secret keys and all non-revoked users are required to communicate with the KGC regularly. These two drawbacks pose challenges to users who have limited resources to store their secret keys or cannot receive key updates in real-time. To alleviate the above problems, we propose a novel system model called server-aided revocable IBE. In our model, almost all of the workloads on users are delegated to an untrusted server which manages users’ public keys and key updates sent by a KGC periodically. The server is untrusted in the sense that it does not possess any secret information. Our system model requires each user to keep just one short secret key and does not require users to communicate with either the KGC or the server during key updating. In addition, the system supports delegation of users’ decryption keys, namely it is secure against decryption key exposure attacks. We present a concrete construction of the system that is provably secure against adaptive-ID chosen plaintext attacks under the DBDH assumption in the standard model. One application of our server-aided revocable IBE is encrypted email supporting lightweight devices (e.g., mobile phones) in which an email server plays the role of the untrusted server so that only non-revoked users can read their email messages.
Author Liu, Shengli
Qin, Baodong
Deng, Robert H.
Li, Yingjiu
Author_xml – sequence: 1
  givenname: Baodong
  surname: Qin
  fullname: Qin, Baodong
– sequence: 2
  givenname: Robert H.
  surname: Deng
  fullname: Deng, Robert H.
  email: robertdeng@smu.edu.sg
– sequence: 3
  givenname: Yingjiu
  surname: Li
  fullname: Li, Yingjiu
– sequence: 4
  givenname: Shengli
  surname: Liu
  fullname: Liu, Shengli
BookMark eNpVkM1KAzEUhaNWcax9Axd9gWhufifLWqoWCoI_65BkMjpaZsZkLPTtm7ZuXF04h-_C-a7QqO3agNANkFsgRN1pVWKGGWhMOSiOpQFxgiY5Zjk8ZPIUFSABMGNcn_3rmB6hgjBCsVacXaBCMwpSU6CXaJLSFyEERMlzWSDyGuImRDxrqlBNX8Km89atw3RZhXZohi2-tykXi9bHbT80XXuNzmu7TmHyd8fo_WHxNn_Cq-fH5Xy2wj3lbMBSilo56VxNXG25s06BL4ErKMHryoMgyjHNAOqaqIpoba3LDPGV4yF4Nkb0-Df1sWk_QjSu676TAWL2ikzea5jJi81Bh9kryhA_Qn3sfn5DGkzYUz5viXbtP20_hJiMEGVJhTRUgKG6ZDtaDWX2
ContentType Book Chapter
Copyright Springer International Publishing Switzerland 2015
Copyright_xml – notice: Springer International Publishing Switzerland 2015
DBID FFUUA
DEWEY 005.8
DOI 10.1007/978-3-319-24174-6_15
DatabaseName ProQuest Ebook Central - Book Chapters - Demo use only
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9783319241746
3319241745
EISSN 1611-3349
Editor Weippl, Edgar
Pernul, Günther
Y A Ryan, Peter
Editor_xml – sequence: 1
  fullname: Weippl, Edgar
– sequence: 2
  fullname: Pernul, Günther
– sequence: 3
  fullname: Y A Ryan, Peter
EndPage 304
ExternalDocumentID EBC5588256_251_298
GroupedDBID 0D6
0DA
38.
AABBV
AAGZE
AAZAK
AAZUS
ABMNI
ACKNT
ACRRC
AEDXK
AEJLV
AEKFX
AETDV
AEZAY
ALMA_UNASSIGNED_HOLDINGS
APFYR
AZZ
BBABE
CZZ
FFUUA
I4C
IEZ
IY-
LDH
SBO
SFQCF
TMQGW
TPJZQ
TSXQS
TWXRB
Z7R
Z7S
Z7U
Z7X
Z7Y
Z7Z
Z81
Z83
Z84
Z85
Z88
-DT
-GH
-~X
1SB
29L
2HA
2HV
5QI
875
AASHB
ACGFS
ADCXD
AEFIE
EJD
F5P
FEDTE
HVGLF
LAS
P2P
RNI
RSU
SVGTG
VI1
~02
ID FETCH-LOGICAL-p243t-665f7b6bbf0bfa4bab71c8147181c9dc1507b39311ff07d099aab65f0cdb4eec3
ISBN 9783319241739
3319241737
ISSN 0302-9743
IngestDate Wed Sep 17 04:01:48 EDT 2025
Thu May 29 01:04:14 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
LCCallNum QA76.9.A25
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-p243t-665f7b6bbf0bfa4bab71c8147181c9dc1507b39311ff07d099aab65f0cdb4eec3
Notes Original Abstract: Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the literature. Among them, the tree-based revocation approach, due to Boldyreva, Goyal and Kumar, is probably the most efficient one. In this approach, a trusted Key Generation Center (KGC) periodically broadcasts a set of key updates to all (non-revoked) users through public channels, where the size of key updates is only O(rlogNr)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(r\log \frac{N}{r})$$\end{document}, with N being the number of users and r the number of revoked users, respectively; however, every user needs to keep at least O(logN)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log N)$$\end{document} long-term secret keys and all non-revoked users are required to communicate with the KGC regularly. These two drawbacks pose challenges to users who have limited resources to store their secret keys or cannot receive key updates in real-time. To alleviate the above problems, we propose a novel system model called server-aided revocable IBE. In our model, almost all of the workloads on users are delegated to an untrusted server which manages users’ public keys and key updates sent by a KGC periodically. The server is untrusted in the sense that it does not possess any secret information. Our system model requires each user to keep just one short secret key and does not require users to communicate with either the KGC or the server during key updating. In addition, the system supports delegation of users’ decryption keys, namely it is secure against decryption key exposure attacks. We present a concrete construction of the system that is provably secure against adaptive-ID chosen plaintext attacks under the DBDH assumption in the standard model. One application of our server-aided revocable IBE is encrypted email supporting lightweight devices (e.g., mobile phones) in which an email server plays the role of the untrusted server so that only non-revoked users can read their email messages.
OCLC 932169212
PQID EBC5588256_251_298
PageCount 19
ParticipantIDs springer_books_10_1007_978_3_319_24174_6_15
proquest_ebookcentralchapters_5588256_251_298
PublicationCentury 2000
PublicationDate 2015
PublicationDateYYYYMMDD 2015-01-01
PublicationDate_xml – year: 2015
  text: 2015
PublicationDecade 2010
PublicationPlace Switzerland
PublicationPlace_xml – name: Switzerland
– name: Cham
PublicationSeriesSubtitle Security and Cryptology
PublicationSeriesTitle Lecture Notes in Computer Science
PublicationSeriesTitleAlternate Lect.Notes Computer
PublicationSubtitle 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part I
PublicationTitle Computer Security -- ESORICS 2015
PublicationYear 2015
Publisher Springer International Publishing AG
Springer International Publishing
Publisher_xml – name: Springer International Publishing AG
– name: Springer International Publishing
RelatedPersons Kleinberg, Jon M.
Hartmanis, Juris
Mattern, Friedemann
Goos, Gerhard
Kittler, Josef
Weikum, Gerhard
Naor, Moni
Mitchell, John C.
Terzopoulos, Demetri
Pandu Rangan, C.
Kanade, Takeo
Hutchison, David
Tygar, Doug
RelatedPersons_xml – sequence: 1
  givenname: David
  surname: Hutchison
  fullname: Hutchison, David
– sequence: 2
  givenname: Takeo
  surname: Kanade
  fullname: Kanade, Takeo
– sequence: 3
  givenname: Josef
  surname: Kittler
  fullname: Kittler, Josef
– sequence: 4
  givenname: Jon M.
  surname: Kleinberg
  fullname: Kleinberg, Jon M.
– sequence: 5
  givenname: Friedemann
  surname: Mattern
  fullname: Mattern, Friedemann
– sequence: 6
  givenname: John C.
  surname: Mitchell
  fullname: Mitchell, John C.
– sequence: 7
  givenname: Moni
  surname: Naor
  fullname: Naor, Moni
– sequence: 8
  givenname: C.
  surname: Pandu Rangan
  fullname: Pandu Rangan, C.
– sequence: 9
  givenname: Demetri
  surname: Terzopoulos
  fullname: Terzopoulos, Demetri
– sequence: 10
  givenname: Doug
  surname: Tygar
  fullname: Tygar, Doug
– sequence: 11
  givenname: Gerhard
  surname: Weikum
  fullname: Weikum, Gerhard
– sequence: 12
  givenname: Gerhard
  surname: Goos
  fullname: Goos, Gerhard
– sequence: 13
  givenname: Juris
  surname: Hartmanis
  fullname: Hartmanis, Juris
SSID ssj0001584974
ssj0002792
Score 2.0235147
Snippet Efficient user revocation in Identity-Based Encryption (IBE) has been a challenging problem and has been the subject of several research efforts in the...
SourceID springer
proquest
SourceType Publisher
StartPage 286
SubjectTerms Computer security
Data encryption
Decryption key exposure
IBE
Information architecture
Revocation
Title Server-Aided Revocable Identity-Based Encryption
URI http://ebookcentral.proquest.com/lib/SITE_ID/reader.action?docID=5588256&ppg=298
http://link.springer.com/10.1007/978-3-319-24174-6_15
Volume 9326
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3NT9swFLdKuUwctsGmMbYpB26RUVInTnLgAKhThxhIfEzsZMUfEexQUJsOwV_Pe7GdpB0XdolaK03s99z38bN_z4TsgoHTuiglBV-JlBzNaMl0RssiM0xVDIIMhAZ-nvLJVXJ8nV4PBg99dkkt99TTi7yS_9EqtIFekSX7Cs22D4UG-Az6hStoGK4rwe8yzGrrCrjzGBxkDsE0peH44uz8x9FFCA43bTFNdyR7CRmo81MYuRr7L7dbq8PJXrs1p1nf_w0u7c_tomtcNDjpjUHab3-eobExM3pwqw0yHf-Cb0QyliMAP9JDcJM6HE_V7PG-nQQoHTPfP3ELGKd3dbMvLOzGZE1OH5OI0xVMwmOSK6hmB6wtJbGMYRIYZ7aokSdzgaGGVMfaPmNtM8eKi8xWOPX21tfRbr4xe5LxP16hvxEESVv4toRygcUJ1qADQ7J-MD4--dWBcxCWFRgXO5eOVRbtcpTtFZKEfK8zW8apG0WPoPnSK5dSmZXV9yaouXxHNpDoEiADBeT3ngzMdJO89SoInAq2SNRXcdCqOFhWcdCp-AO5-j6-PJpQd9AGvR8lrKacp1UmuZRVJKsykaXMYpXHGLfEqtAKkwbJChbHVRVlGpKKspTwm0hpmRij2EcynN5NzScSjJJcxTmvcg0PytMITIRUiDWbQnOdqW1C_ehFsx3A7UFWdqxzkaaQ86VcQNwtRkW-TUIvIoG3z4Wvsw2yFUyAbEUjW4Gy_fyqu3fIm27yfiHDerYwXyHErOU3NyGeAa1YcFg
linkProvider Library Specific Holdings
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=bookitem&rft.title=Computer+Security+--+ESORICS+2015&rft.au=Qin%2C+Baodong&rft.au=Deng%2C+Robert+H.&rft.au=Li%2C+Yingjiu&rft.au=Liu%2C+Shengli&rft.atitle=Server-Aided+Revocable+Identity-Based+Encryption&rft.series=Lecture+Notes+in+Computer+Science&rft.date=2015-01-01&rft.pub=Springer+International+Publishing&rft.isbn=9783319241739&rft.issn=0302-9743&rft.eissn=1611-3349&rft.spage=286&rft.epage=304&rft_id=info:doi/10.1007%2F978-3-319-24174-6_15
thumbnail_s http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Febookcentral.proquest.com%2Fcovers%2F5588256-l.jpg