New techniques for anonymous HIBE with short ciphertexts in prime order groups

Kwangsu Lee, Dong Hoon Lee

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

Original languageEnglish
Pages (from-to)968-988
Number of pages21
JournalKSII Transactions on Internet and Information Systems
Volume4
Issue number5
DOIs
Publication statusPublished - 2010 Oct 1

Fingerprint

Cryptography
Composite materials
Communication systems

Keywords

  • Anonymity
  • Bilinear pairing
  • Cryptography
  • Hierarchical identity based encryption
  • Identity based encryption
  • Provable security

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

New techniques for anonymous HIBE with short ciphertexts in prime order groups. / Lee, Kwangsu; Lee, Dong Hoon.

In: KSII Transactions on Internet and Information Systems, Vol. 4, No. 5, 01.10.2010, p. 968-988.

Research output: Contribution to journalArticle

@article{86bf719e7ef8447dbfac0241cd890ca4,
title = "New techniques for anonymous HIBE with short ciphertexts in prime order groups",
abstract = "Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.",
keywords = "Anonymity, Bilinear pairing, Cryptography, Hierarchical identity based encryption, Identity based encryption, Provable security",
author = "Kwangsu Lee and Lee, {Dong Hoon}",
year = "2010",
month = "10",
day = "1",
doi = "10.3837/tiis.2010.10.016",
language = "English",
volume = "4",
pages = "968--988",
journal = "KSII Transactions on Internet and Information Systems",
issn = "1976-7277",
publisher = "Korea Society of Internet Information",
number = "5",

}

TY - JOUR

T1 - New techniques for anonymous HIBE with short ciphertexts in prime order groups

AU - Lee, Kwangsu

AU - Lee, Dong Hoon

PY - 2010/10/1

Y1 - 2010/10/1

N2 - Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

AB - Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key, and it additionally provide the anonymity of identity in ciphertexts. Using the anonymous HIBE schemes, it is possible to construct anonymous communication systems and public key encryption with keyword search. This paper presents an anonymous HIBE scheme with constant size ciphertexts under prime order symmetric bilinear groups, and shows that it is secure under the selective security model. Previous anonymous HIBE schemes were constructed to have linear size ciphertexts, to use composite order bilinear groups, or to use asymmetric bilinear groups that is a special type of bilinear groups. Our construction is the first efficient anonymous HIBE scheme that has constant size ciphertexts and that uses prime order symmetric bilinear groups. Compared to the previous scheme of composite order bilinear groups, ours is ten times faster. To achieve our construction, we first devise a novel cancelable random blinding technique. The random blinding property of our technique provides the anonymity of our construction, and the cancellation property of our technique enables decryption.

KW - Anonymity

KW - Bilinear pairing

KW - Cryptography

KW - Hierarchical identity based encryption

KW - Identity based encryption

KW - Provable security

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

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

U2 - 10.3837/tiis.2010.10.016

DO - 10.3837/tiis.2010.10.016

M3 - Article

AN - SCOPUS:78449250327

VL - 4

SP - 968

EP - 988

JO - KSII Transactions on Internet and Information Systems

JF - KSII Transactions on Internet and Information Systems

SN - 1976-7277

IS - 5

ER -