scholarly journals Efficient identity-based encryption with Hierarchical key-insulation from HIBE

2021 ◽  
Author(s):  
Keita Emura ◽  
Atsushi Takayasu ◽  
Yohei Watanabe
Keyword(s):  
Standard Model ◽  
Special Requirement ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Secret Keys ◽  
Generic Construction ◽  
Identity Based ◽  
Important Notion ◽  
Effective Design ◽  
Key Exposure

AbstractHierarchical key-insulated identity-based encryption (HKIBE) is identity-based encryption (IBE) that allows users to update their secret keys to achieve (hierarchical) key-exposure resilience, which is an important notion in practice. However, existing HKIBE constructions have limitations in efficiency: sizes of ciphertexts and secret keys depend on the hierarchical depth. In this paper, we first triumph over the barrier by proposing simple but effective design methodologies to construct efficient HKIBE schemes. First, we show a generic construction from any hierarchical IBE (HIBE) scheme that satisfies a special requirement, called MSK evaluatability introduced by Emura et al. (Des. Codes Cryptography 89(7):1535–1574, 2021). It provides several new and efficient instantiations since most pairing-based HIBE schemes satisfy the requirement. It is worth noting that it preserves all parameters’ sizes of the underlying HIBE scheme, and hence we obtain several efficient HKIBE schemes under the k-linear assumption in the standard model. Since MSK evaluatability is dedicated to pairing-based HIBE schemes, the first construction restricts pairing-based instantiations. To realize efficient instantiation from various assumptions, we next propose a generic construction of an HKIBE scheme from any plain HIBE scheme. It is based on Hanaoka et al.’s HKIBE scheme (Asiacrypt 2005), and does not need any special properties. Therefore, we obtain new efficient instantiations from various assumptions other than pairing-oriented ones. Though the sizes of secret keys and ciphertexts are larger than those of the first construction, it is more efficient than Hanaoka et al.’s scheme in the sense of the sizes of master public/secret keys.

Server-aided Revocable IBE with Identity Reuse

2019 ◽  
Vol 63 (4) ◽  
pp. 620-632
Author(s):  
Xuecheng Ma ◽  
Dongdai Lin
Keyword(s):  
System Model ◽  
Secret Key ◽  
Critical Problem ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Secret Keys ◽  
Identity Based ◽  
Key Revocation ◽  
Key Exposure

Abstract Efficient key revocation in Identity-based Encryption (IBE) has been a both fundamental and critical problem when deploying an IBE system in practice. Boneh and Franklin proposed the first revocable IBE (RIBE) scheme where the size of key updates is linear in the number of users. Then, Boldyreva, Goyal and Kumar proposed the first scalable RIBE by using the tree-based approach where the size of key updates is $O(r\log (N/r))$ and the size of every user’s long-term secret key is $O(\log N)$ with $N$ being the number of users and $r$ the number of revoked users. Recently, Qin et al. presented the notion of server-aided RIBE where the size of every user’s long-term secret key is $O(1),$ and users do not need to communicate with Key Generator Center (KGC) during every key updates. However, users must change their identities once their secret keys are revoked as they cannot decrypt ciphertexts by using their revoked secret keys. To address the above problem, we formalize the notion of RIBE with identity reuse. In our system model, users can obtain a new secret key called the reuse secret key from KGC when their secret keys are revoked. The decryption key can be derived from the reuse secret key and new key updates while it cannot be derived from the revoked secret key and the new key updates. We present a concrete construction that is secure against adaptive-ID chosen plaintext attacks and decryption key exposure attacks under the $\mathsf{ADDH}1$ and $\mathsf{DDH}2$ assumptions in the standard model. Furthermore, we extend it to server-aided RIBE scheme with identity reuse property that is more suitable for lightweight devices.

Intrusion-resilient identity-based signatures: Concrete scheme in the standard model and generic construction

2018 ◽  
Vol 442-443 ◽  
pp. 158-172 ◽  
Author(s):  
Jia Yu ◽  
Rong Hao ◽  
Hui Xia ◽  
Hanlin Zhang ◽  
Xiangguo Cheng ◽  
...  
Keyword(s):  
Standard Model ◽  
The Standard Model ◽  
Generic Construction ◽  
Identity Based

scholarly journals New Fuzzy Identity-Based Encryption in the Standard Model

Informatica ◽  
2010 ◽  
Vol 21 (3) ◽  
pp. 393-407 ◽  
Author(s):  
Yanli Ren ◽  
Dawu Gu ◽  
Shuozhong Wang ◽  
Xinpeng Zhang
Keyword(s):  
Standard Model ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Identity Based ◽  
Fuzzy Identity

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

Symmetry ◽  
2019 ◽  
Vol 11 (7) ◽  
pp. 913
Author(s):  
Lifeng Guo ◽  
Jing Wang ◽  
Wei-Chuen Yau
Keyword(s):  
Internet Of Things ◽  
Standard Model ◽  
Main Concern ◽  
The Public ◽  
Private Key ◽  
Identity Based Encryption ◽  
Dual System Encryption ◽  
The Standard Model ◽  
Identity Based ◽  
The Internet Of Things

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.

scholarly journals Time-and-ID-Based Proxy Reencryption Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Kambombo Mtonga ◽  
Anand Paul ◽  
Seungmin Rho
Keyword(s):  
Standard Model ◽  
Criminal Investigations ◽  
Fine Grained ◽  
Identity Based Encryption ◽  
The Standard Model ◽  
Identity Based

Time- and ID-based proxy reencryption scheme is proposed in this paper in which a type-based proxy reencryption enables the delegator to implement fine-grained policies with one key pair without any additional trust on the proxy. However, in some applications, the time within which the data was sampled or collected is very critical. In such applications, for example, healthcare and criminal investigations, the delegatee may be interested in only some of the messages with some types sampled within some time bound instead of the entire subset. Hence, in order to carter for such situations, in this paper, we propose a time-and-identity-based proxy reencryption scheme that takes into account the time within which the data was collected as a factor to consider when categorizing data in addition to its type. Our scheme is based on Boneh and Boyen identity-based scheme (BB-IBE) and Matsuo’s proxy reencryption scheme for identity-based encryption (IBE to IBE). We prove that our scheme is semantically secure in the standard model.

Cryptanalysis of a Compact Anonymous HIBE with Constant Size Private Keys

2018 ◽  
Vol 62 (8) ◽  
pp. 1087-1091
Author(s):  
Xi-Jun Lin ◽  
Lin Sun ◽  
Haipeng Qu ◽  
He-Qun Xian
Keyword(s):  
Standard Model ◽  
Prime Order ◽  
Private Key ◽  
Identity Based Encryption ◽  
Constant Size ◽  
The Standard Model ◽  
Identity Based

AbstractRecently, Zhang et al. proposed a new anonymous hierarchical identity-based encryption (anonymous HIBE) over prime order groups to achieve both constant size private key and constant size ciphertext. Moreover, a double exponent technique was used to provide anonymity. They proved that their scheme is secure and anonymous against chosen plaintext attacks in the standard model. In this paper, we point out that their scheme is insecure.

Sign in / Sign up

Export Citation Format

Share Document