检索结果-内蒙古大学图书馆

hierarchical identity-based encryption without key delegation in decryption

INTERNATIONAL JOURNAL OF GRID AND UTILITY COMPUTING 2014年第2期5卷 71-79页

作者： Luo, Song Chen, Zhong Chongqing Univ Technol Coll Comp Sci & Engn Chongqing 400054 Peoples R China Peking Univ Sch Elect Engn & Comp Sci Inst Software Beijing 100871 Peoples R China Peking Univ Minist Educ Key Lab High Confidence Software Technol Beijing 100871 Peoples R China

hierarchical identity-based encryption (HIBE) is a generalisation of identity- based encryption (IBE) which mirrors an organisational hierarchy. However, when the user decrypts a ciphertext encrypted to a hierarchical identity, he/she should know the exact hierarchical identity in order to run the delegate algorithm to get the secret key corresponding to the target hierarchical identity if the hierarchical identity linked with his/her key is a prefix of the target hierarchical identity. In this paper, we consider a new concept called HIBE without key delegation in decryption. In such HIBE systems, the user can decrypt the ciphertext directly without running the delegate algorithm even if his hierarchical identity is only a prefix of the target hierarchical identity. We present two HIBE systems, which are proven secure in the standard model under the decision BDH and l-BDHE assumptions, respectively. Both systems have the same decryption efficiency in pairing, compared with BB1-HIBE system and BBG-HIBE system, respectively.

关键词： hierarchical identity-based encryption key delegation decryption standard model

来源：评论

学校读者我要写书评

暂无评论

hierarchical identity-based encryption with Tight Multi-challenge Security 23rd

Hierarchical Identity-Based Encryption with Tight Multi-chal...

引用

23rd International Conference on the Practice and Theory of Public-Key Cryptography (PKC)

作者： Langrehr, Roman Pan, Jiaxin Swiss Fed Inst Technol Zurich Switzerland NTNU Norwegian Univ Sci & Technol Dept Math Sci Trondheim Norway

ISBN: (纸本)9783030453732;9783030453749

We construct the first hierarchical identity-based encryption (HIBE) scheme with tight adaptive security in the multi-challenge setting, where adversaries are allowed to ask for ciphertexts for multiple adaptively chosen identities. Technically, we develop a novel technique that can tightly introduce randomness into user secret keys for hierarchical identities in the multi-challenge setting, which cannot be easily achieved by the existing techniques for tightly multi-challenge secure IBE. In contrast to the previous constructions, the security of our scheme is independent of the number of user secret key queries and that of challenge ciphertext queries. We prove the tight security of our scheme based on the Matrix Decisional Diffie-Hellman Assumption, which is an abstraction of standard and simple decisional Diffie-Hellman assumptions, such as the k-Linear and SXDH assumptions. Finally, we also extend our ideas to achieve tight chosen-ciphertext security and anonymity, respectively. These security notions for HIBE have not been tightly achieved in the multi-challenge setting before.

关键词： hierarchical identity-based encryption Tight security Multi-challenge security Chosen-ciphertext security Anonymity

来源：评论

学校读者我要写书评

暂无评论

Compact Anonymous hierarchical identity-based encryption with Constant Size Private Keys

引用

COMPUTER JOURNAL 2016年第4期59卷 452-461页

作者： Zhang, Leyou Mu, Yi Wu, Qing Xidian Univ Sch Math & Stat Xian 710071 Shaanxi Peoples R China Univ Wollongong Sch Comp Sci & Software Engn Wollongong NSW 2522 Australia Xian Univ Posts & Telecommun Sch Automat Xian 710121 Shaanxi Peoples R China

We present a new construction of anonymous hierarchical identity-based encryption (HIBE) over prime order groups. The distinct feature of our proposed scheme is that both private key and ciphertext have a constant size, which has never been achieved in all other existing anonymous HIBE schemes. Moreover, we utilized a double exponent technique to generate the ciphertext in order to provide anonymity. This simple and efficient method allows us to construct a more compact anonymous HIBE in prime order groups. Under the decisional bilinear n + 1-Diffie-Hellman exponent assumption and linear assumption, we show that the proposed scheme is secure and anonymous against chosen plaintext attacks in the standard model.

关键词： anonymity hierarchical identity-based encryption prime order groups constant size private keys

来源：评论

学校读者我要写书评

暂无评论

Tightly Secure hierarchical identity-based encryption

引用

JOURNAL OF CRYPTOLOGY 2020年第4期33卷 1787-1821页

作者： Langrehr, Roman Pan, Jiaxin Swiss Fed Inst Technol Zurich Switzerland NTNU Norwegian Univ Sci & Technol Dept Math Sci Trondheim Norway Karlsruhe Inst Technol KIT Karlsruhe Germany

We construct the first tightly secure hierarchical identity-based encryption (HIBE) scheme based on standard assumptions, which solves an open problem from Blazy, Kiltz, and Pan (CRYPTO 2014). At the core of our constructions is a novel randomization technique that enables us to randomize user secret keys for identities with flexible length. The security reductions of previous HIBEs lose at least a factor of Q, which is the number of user secret key queries. Different to that, the security loss of our schemes is only dependent on the security parameter. Our schemes are adaptively secure based on the Matrix Diffie-Hellman assumption, which is a generalization of standard Diffie-Hellman assumptions such as k-Linear. We have two tightly secure constructions, one with constant ciphertext size, and the other with tighter security at the cost of linear ciphertext size. Among other things, our schemes imply the first tightly secure identity-based signature scheme by a variant of the Naor transformation.

关键词： hierarchical identity-based encryption tight security affine message authentication codes

来源：评论

学校读者我要写书评

暂无评论

Efficient and Fully CCA Secure Conditional Proxy Re-encryption from hierarchical identity-based encryption

引用

COMPUTER JOURNAL 2015年第10期58卷 2778-2792页

作者： Liang, Kaitai Susilo, Willy Liu, Joseph K. Wong, Duncan S. Aalto Univ Dept Comp Sci Espoo Finland Univ Wollongong Sch Comp & Informat Technol Ctr Comp & Informat Secur Res Wollongong NSW 2522 Australia Monash Univ Fac Informat Technol Melbourne Vic 3004 Australia ASTRI Secur & Data Sci Hong Kong Hong Kong Peoples R China

A proxy re-encryption (PRE) allows a data owner to delegate the decryption rights of some encrypted data stored on the cloud without revealing the data to an honest-but-curious cloud service provider (i.e. the PRE proxy). Furthermore, the data owner can offload most of the computational operations to the cloud service provider and hence, using PRE for encrypted cloud data sharing can be very effective even for data owners using limited resource devices (e.g. mobile devices). However, PRE schemes only enables data owners to delegate the decryption rights of all their encrypted data. A more practical notion is a conditional PRE (CPRE) that allows us to specify under what condition the decryption of an encrypted data can be delegated, for example, only sharing all the encrypted files under a directory called 'public'. In this paper, we provide an affirmative result on the long-standing question of building a full chosen-ciphertext attacks (CCA)-secure CPRE system in the standard model and for the first time, we show that a class of hierarchical identity-based encryption (HIBE) schemes can be transferred to building a CCA-secure CPRE in the standard model. We also list out some concrete HIBE schemes which fall into this class, e.g., Lewko-Waters HIBE. All existing CCA-secure PRE schemes in the standard model are not conditional while all existing CPRE schemes are either not CCA secure or not in the standard model. By instantiating our generic HIBE-based transformation, we show that an efficient and concrete CPRE scheme which is both CCA secure in the standard model and conditional can be built.

关键词： conditional proxy re-encryption hierarchical identity-based encryption chosen-ciphertext security

来源：评论

学校读者我要写书评

暂无评论

Revocable hierarchical identity-based encryption with adaptive security

引用

THEORETICAL COMPUTER SCIENCE 2021年 880卷 37-68页

作者： Lee, Kwangsu Sejong Univ Seoul South Korea

hierarchical identity-based encryption (HIBE) can be extended to revocable HIBE (RHIBE) if a private key of a user can be revoked when the private key is revealed or expired. Previously, many selectively secure RHIBE schemes were proposed, but it is still unsolved problem to construct an adaptively secure RHIBE scheme. In this work, we propose two RHIBE schemes in composite-order bilinear groups and prove their adaptive security under simple static assumptions. To prove the adaptive security, we use the dual system encryption framework, but it is not simple to use the dual system encryption framework in RHIBE since the security model of RHIBE is quite different with that of HIBE. We show that it is possible to solve the problem of the RHIBE security proof by carefully designing hybrid games. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://***/licenses/by-nc-nd/4.0/).

关键词： hierarchical identity-based encryption Key revocation Adaptive security Dual system encryption Bilinear maps

来源：评论

学校读者我要写书评

暂无评论

Analysis of Hu-Huang-Fan Practical hierarchical identity-based encryption Scheme

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2010年第6期E93A卷 1269-1273页

作者： Park, Jong Hwan Lee, Dong Hoon Kyung Hee Univ Dept Appl Math Seoul South Korea Korea Univ Grad Sch Informat Management & Secur Seoul South Korea

Recently, Hu et al. have suggested a fully secure hierarchical identity-based encryption (HIBE) scheme that achieves constant size ciphertext and tight security reduction. Their construction was based on Gentry's IBE scheme that supports their security proof. In this paper, we show that their security proof is incorrect. We point out the difference between Gentry's proof and that of Hu et al., and we show that the security of Hu et al.'s HIBE scheme cannot be reduced to their claimed complexity assumption.

关键词： hierarchical identity-based encryption full security bilinear maps

来源：评论

学校读者我要写书评

暂无评论

Efficient hierarchical identity-based encryption for Mobile Ad hoc Networks

引用

MOBILE INFORMATION SYSTEMS 2014年第4期10卷 407-425页

作者： He, Kai Chen, Min-Rong Mao, Yijun Zhang, Xi Zhang, Yiju Jinan Univ Dept Comp Sci Guangzhou 510632 Guangdong Peoples R China Shenzhen Univ Coll Informat Engn Shenzhen Guangdong Peoples R China S China Normal Univ Sch Comp Guangzhou Guangdong Peoples R China Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China South China Agr Univ Coll Informat Guangzhou Guangdong Peoples R China Shenzhen Univ Coll Comp Sci & Software Engn Shenzhen Guangdong Peoples R China Sun Yat Sen Univ Sch Engn Guangzhou 510275 Guangdong Peoples R China

A Mobile Ad-hoc Network (MANET) is a collection of wireless nodes that can dynamically form a network to exchange information without using any pre-existing fixed network infrastructure. Such networks are more vulnerable to security attacks than conventional wired networks, and hence cryptographic schemes are usually used to ensure security for them. It is worth noting that the nodes in MANETs are with low computational power and communicate over relatively bandwidth constrained wireless links, and thus the deployed cryptographic schemes should usually be highly efficient in term of both computational cost and communication overhead. To ensure the data confidentiality for MANETs, in this paper, we present a new hierarchical identity-based encryption (HIBE) scheme, which enjoys the advantages of low computational cost and light communication overhead. We further propose a new hierarchical identity-based key encapsulation mechanism (HIBKEM) based on our HIBE scheme. The proposed HIBKEM scheme is fully secure against adaptive chosen-ciphertext attack, and has a tight security reduction in the standard model.

关键词： hierarchical identity-based encryption key encapsulation mechanism tight reduction standard model

来源：评论

学校读者我要写书评

暂无评论

Compact hierarchical identity-based encryption based on a harder decisional problem

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 2015年第3期92卷 463-472页

作者： Galindo, David Loria UMR 7503 CNRS F-54506 Vandoeuvre Les Nancy France

We generalize the decisional problem that was used to prove the security of a well-known hierarchical identity-based encryption scheme by Boneh, Boyen and Goh. We argue that our new problem is strictly harder than the original problem, and thus the security of the aforementioned cryptographic primitive is laid on even stronger foundations.

关键词： F.2.2 E.3 decisional assumptions hard problems hierarchical identity-based encryption standard model generic model 68P25 68Q17 94A60

来源：评论

学校读者我要写书评

暂无评论

A Generic Approach to Build Revocable hierarchical identity-based encryption

引用

IEEE ACCESS 2022年 10卷 44178-44199页

作者： Lee, Kwangsu Kim, Joon Sik Sejong Univ Dept Comp & Informat Secur Seoul South Korea Korea Univ Grad Sch Informat Secur Seoul 02841 South Korea

Revocable hierarchical identity-based encryption (RHIBE) is an extension of HIBE that provides the efficient key revocation function by broadcasting an update key per each time period. Many RHIBE schemes have been proposed by combining an HIBE scheme and a tree-based revocation method, but a generic method for constructing an RHIBE scheme has not been proposed. In this paper, we show for the first time that it is possible to construct RHIBE schemes by generically combining underlying cryptographic primitives and tree-based revocation methods. We first generically construct an RHIBE-CS scheme by combining HIBE schemes and the complete subtree (CS) method, and prove the adaptive security by using the adaptive security of the HIBE schemes. Thus, we obtain RHIBE schemes under the quadratic residuosity assumption, CDH assumption, and factoring assumption. Next, we generically construct an RHIBE-SD scheme with shorter update keys by combining HIBE and hierarchical single revocation encryption (HSRE) schemes, and the subset difference (SD) method to reduce the size of update keys. Finally, we generically construct an RHIBE-CS scheme with shorter ciphertexts by combining HIBE schemes with constant-size ciphertext and the CS method. Through different kind of generic combinations, we obtain various RHIBE schemes that provide a trade-off between shorter ciphertexts and shorter update keys.

关键词： Binary trees Security encryption Cryptography identity-based encryption Servers Licenses hierarchical identity-based encryption key revocation subset cover generic construction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：