<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.0 20120330//EN" "JATS-journalpublishing1.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
	<front>
		<journal-meta>
			<journal-id journal-id-type="publisher-id">INFORMATICA</journal-id>
			<journal-title-group>
				<journal-title>Informatica</journal-title>
			</journal-title-group>
			<issn pub-type="epub">0868-4952</issn>
			<issn pub-type="ppub">0868-4952</issn>
			<publisher>
				<publisher-name>VU</publisher-name>
			</publisher>
		</journal-meta>
		<article-meta>
			<article-id pub-id-type="publisher-id">INF25207</article-id>
			<article-id pub-id-type="doi">10.15388/Informatica.2014.16</article-id>
			<article-categories>
				<subj-group subj-group-type="heading">
					<subject>Research article</subject>
				</subj-group>
			</article-categories>
			<title-group>
				<article-title>RHIBE: Constructing Revocable Hierarchical ID-Based Encryption from HIBE</article-title>
			</title-group>
			<contrib-group>
				<contrib contrib-type="Author">
					<name>
						<surname>Tsai</surname>
						<given-names>Tung-Tso</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_000"/>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Tseng</surname>
						<given-names>Yuh-Min</given-names>
					</name>
					<email xlink:href="mailto:ymtseng@cc.ncue.edu.tw">ymtseng@cc.ncue.edu.tw</email>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_001"/>
					<xref ref-type="corresp" rid="fn1">∗</xref>
				</contrib>
				<contrib contrib-type="Author">
					<name>
						<surname>Wu</surname>
						<given-names>Tsu-Yang</given-names>
					</name>
					<xref ref-type="aff" rid="j_INFORMATICA_aff_001"/>
				</contrib>
				<aff id="j_INFORMATICA_aff_000">Department of Mathematics, National Changhua University of Education, ,Jin-De Campus, Chang-Hua City 500, Taiwan, R.O.C.</aff>
				<aff id="j_INFORMATICA_aff_001">School of Computer Science and Technology, Shenzhen Graduate School, Harbin Institute of Technology, Shenzhen 518055, P.R. China</aff>
			</contrib-group>
			<author-notes>
				<corresp id="fn1">
					<label>∗</label>Corresponding author.</corresp>
			</author-notes>
			<pub-date pub-type="epub">
				<day>01</day>
				<month>01</month>
				<year>2014</year>
			</pub-date>
			<volume>25</volume>
			<issue>2</issue>
			<fpage>299</fpage>
			<lpage>326</lpage>
			<history>
				<date date-type="received">
					<day>01</day>
					<month>08</month>
					<year>2012</year>
				</date>
				<date date-type="accepted">
					<day>01</day>
					<month>12</month>
					<year>2012</year>
				</date>
			</history>
			<abstract>
				<p>Up to now, there was very little work on studying the revocation problem in existing hierarchical ID-based encryption (HIBE) systems. Certainly, all existing HIBE systems may inherit the revocation method suggested by Boneh and Franklin to revoke illegal or expired users, in which non-revoked users must periodically update their private keys using secure channels by contacting their ancestors in hierarchical structures. In this paper, we propose the first HIBE scheme with public revocation mechanism, called revocable HIBE (RHIBE), which is extended from Lewko and Waters's unbounded HIBE scheme presented in Eurocrypt 2011. We demonstrate that the proposed RHIBE scheme is fully secure while removing the requirement of secure channels for private key updating in Boneh and Franklin's revocation method. The public revocation mechanism is an exciting alternative to the existing revocation methods. Finally, we discuss the transformation technique from a HIBE scheme to a RHIBE scheme and employ it to another well-known HIBE scheme.</p>
			</abstract>
			<kwd-group>
				<label>Keywords</label>
				<kwd>revocation</kwd>
				<kwd>hierarchical identity-based encryption</kwd>
				<kwd>full security</kwd>
				<kwd>bilinear pairing</kwd>
				<kwd>public channel</kwd>
			</kwd-group>
		</article-meta>
	</front>
</article>