Anonymous HIBE with short ciphertexts: full security in prime order groups

Lee, Kwangsu; Park, Jong Hwan; Lee, Dong Hoon

doi:10.1007/s10623-013-9868-6

Cited by 20 publications

(13 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Angelo, Vincenzo, and Giuseppe [20] modified the HIBE construction of [7] to achieve anonymity. Some other recent fully-secure HIBE systems, which were proven using the dual-system encryption technique, include [21,22]. Chen and Wee [21] proposed a compact HIBE scheme in prime-order groups, but the scheme had a linear-sized private key and ciphertext.…”

Section: Related Workmentioning

confidence: 99%

“…Chen and Wee [21] proposed a compact HIBE scheme in prime-order groups, but the scheme had a linear-sized private key and ciphertext. In [22], a fully-secure and anonymous HIBE scheme with short ciphertexts in prime order (asymmetric) bilinear groups was proposed. However, the size of public parameters and the private key of their HIBE scheme grew linearly with the hierarchy depth.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient Hierarchical Identity-Based Encryption System for Internet of Things Infrastructure

2019

View full text Add to dashboard Cite

Security is a main concern for the Internet of Things (IoT) infrastructure as large volumes of data are collected and processed in the systems. Due to the limited resources of interconnected sensors and devices in the IoT systems, efficiency is one of the key considerations when deploying security solutions (e.g., symmetric/asymmetric encryption, authentication, etc.) in IoT. In this paper, we present an efficient Hierarchical Identity-Based Encryption (HIBE) system with short parameters for protecting data confidentiality in distributed IoT infrastructure. Our proposed HIBE system has the public parameters, private key, and ciphertext, each consisting of a constant number of group elements. We prove the full security of the HIBE system in the standard model using the dual system encryption technique. We also implement the proposed scheme and compare the performance with the original Lewko-Waters HIBE. To the best of our knowledge, our construction is the first HIBE system that achieves both full security in the standard model and short parameters in terms of the public parameters, private key, and ciphertext.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Efficient Hierarchical Identity-Based Encryption System for Internet of Things Infrastructure

2019

View full text Add to dashboard Cite

show abstract

“…This work introduced a way to hash identity vectors into the pairing groups. Almost all known CC-HIBE schemes that appeared later have either used this technique or a variant [11,12,31,40,20,36,29,39,14]. Since we are interested in CC-HIBE, we do not consider the line of work [25,3,44,10,45,38] where the length of the ciphertext depends on the length of the identity tuple.…”

Section: Type-3 Pairingsmentioning

confidence: 99%

“…Security of both their IBE schemes (for composite-order pairings as well as for Type-3 pairings) are based on static but non-standard assumptions. Two works [29,39] independently obtained a CC-HIBE scheme from Lewko-Waters' IBE in prime-order groups. Both the schemes are anonymous and achieve security under static assumptions.…”

Section: Possible Approaches To the Construction Of Hibe Schemesmentioning

confidence: 99%

See 1 more Smart Citation

Efficient (Anonymous) Compact HIBE from Standard Assumptions

Ramanna

Sarkar

2014

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present two hierarchical identity-based encryption (HIBE) schemes, denoted as H1 and H2, from Type-3 pairings with constant sized ciphertexts. Scheme H1 achieves anonymity while H2 is non-anonymous. The constructions are obtained by extending the IBE scheme recently proposed by Jutla and Roy (Asiacrypt 2013). Security is based on the standard decisional Symmetric eXternal Diffie-Hellman (SXDH) assumption. In terms of provable security properties, previous direct constructions of constant-size ciphertext HIBE had one or more of the following drawbacks: security in the weaker model of selective-identity attacks; exponential security degradation in the depth of the HIBE; and use of non-standard assumptions. The security arguments for H1 and H2 avoid all of these drawbacks. These drawbacks can also be avoided by obtaining HIBE schemes by specialising schemes for hierarchical inner product encryption; the downside is that the resulting efficiencies are inferior to those of the schemes reported here. Currently, there is no known anonymous HIBE scheme having the security properties of H1 and comparable efficiency. An independent work by Chen and Wee describes a non-anonymous HIBE scheme with security claims and efficiency similar to that of H2; we note though that in comparison to H2, the Chen-Wee HIBE scheme has larger ciphertexts and less efficient encryption and decryption algorithms. Based on the current state-of-the-art, H1 and H2 are the schemes of choice for efficient implementation of (anonymous) HIBE constructions.

show abstract

Generic Construction of Forward Secure Public Key Authenticated Encryption with Keyword Search

Emura

2024

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Anonymous HIBE with short ciphertexts: full security in prime order groups

Cited by 20 publications

References 41 publications

Efficient Hierarchical Identity-Based Encryption System for Internet of Things Infrastructure

Efficient Hierarchical Identity-Based Encryption System for Internet of Things Infrastructure

Efficient (Anonymous) Compact HIBE from Standard Assumptions

Generic Construction of Forward Secure Public Key Authenticated Encryption with Keyword Search

Contact Info

Product

Resources

About