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

identity-based encryption with equality test and datestamp-based authorization mechanism

THEORETICAL COMPUTER SCIENCE 2021年 861卷 117-132页

作者： Lin, Xi-Jun Wang, Qihui Sun, Lin Qu, Haipeng Ocean Univ China Dept Comp Sci & Technol Qingdao Peoples R China Qingdao Univ Coll Liberal Arts Qingdao Peoples R China

Due to the advancement of cloud computing, public key encryption with equality test has become a hot topic in the cryptography community. The notion was extended to the identity-based setting to obtain a new primitive, called identity-based encryption with equality test (IBEET). To the best of our knowledge, there are two categories of authorization mechanisms for IBEET: ciphertext-specified authorization and user-specified authorization. However, these authorizations are not applicable for some scenarios. Motivated by this, we propose in this paper a new primitive, called identity-based encryption with equality test and datestamp-based authorization mechanism (IBEET-DBA). In the primitive, the data owner can control the validity of trapdoor by embedding datestamp into it. The cloud server can only obtain the correct equivalence results on the ciphertexts which are generated within the valid period of trapdoor. In this paper, we formally define this primitive and its security notion. Moreover, we propose the first IBEET-DBA scheme and prove its security. (C) 2021 Elsevier B.V. All rights reserved.

关键词： IBEET Datestamp identity-based encryption Equality test Authorization

来源：评论

学校读者我要写书评

暂无评论

A New Construction of Leakage-Resilient identity-based encryption Scheme 19th

A New Construction of Leakage-Resilient Identity-Based Encry...

引用

19th International Conference on Information Security Practice and Experience

作者： Qiao, Zirui Xu, Ran Lu, Yonghui Zhou, Yanwei Yang, Bo Shaanxi Normal Univ Sch Comp Sci Xian 710119 Peoples R China Xian Univ Posts & Telecommun Sch Cyberspace Secur Xian 710121 Peoples R China Shaanxi Normal Univ Sch Int Studies Xian 710119 Peoples R China

ISBN: (纸本)9789819790524;9789819790531

Although a large number of provably secure cryptographic primitives have been proposed in the literature, many of these schemes might be broken in practice because of various leakage attacks. Therefore, the leakage resilience property should be considered in designing these primitives. However, in identity-based cryptography, most of the existing leakage-resilient identity-based encryption (IBE) schemes suffer some limitations: they either resist the leakage attacks in the selective identity security model or achieve the chosen-ciphertext attack (CCA) security based on a non-static assumption. To further solve the above problems, in this paper, an IBE scheme with adaptive leakage-resilient chosen-plaintext attacks (CPA) security is proposed, and its security is rigorously proved in the random oracle model under a classic static assumption, e.g., decisional bilinear Diffie-Hellman (DBDH) assumption. In addition, the leakage-resilient CCA security can be obtained from the above CPA secure IBE scheme. That is, a generic method created leakage-resilient CCA secure public-key encryption is proposed, and the leakage-resilient CCA secure IBE scheme can also be created. Therefore, we propose a noval method to create leakage-resilient IBE scheme with CCA security from static complexity assumption.

关键词： identity-based encryption Leakage resilience Chosen-plaintext attacks Chosen-ciphertext attacks

来源：评论

学校读者我要写书评

暂无评论

Two-Level identity-based encryption Scheme for Internet of Things 36

Two-Level Identity-Based Encryption Scheme for Internet of T...

引用

36th Chinese Control and Decision Conference (CCDC)

作者： Han, Yiliang Li, Yu Wang, Chao Wu, Xuguang Cryptog Engn Univ PAP Engn Coll Xian Peoples R China

ISBN: (纸本)9798350387780;9798350387797

In the application layer of the Internet of Things, there are multiple levels of user identities in the user management system. When the cloud and intelligent connected devices exchange big data among users, the sensitive data transmitted in the IoT are vulnerable to attackers. Therefore, how to build a secure Internet of Things data encryption scheme based on the identity level of the user is a critical issue. In this paper, we present a two-level identity-based encryption scheme for the hierarchical management system of the Internet of Things. The correctness and security of the scheme are analyzed. Compared with the lattice-based encryption scheme, our scheme has smaller keys and ciphertexts. To avoid the high computational complexity caused by the trapdoor delegation algorithm, our scheme is an efficient and practical two-level identity-based encryption scheme for the Internet of Things.

关键词： Internet of Things identity-based encryption RLWE

来源：评论

学校读者我要写书评

暂无评论

Anonymous Key Issuing Protocol with Certified Identities in identity-based encryption 19th

Anonymous Key Issuing Protocol with Certified Identities in ...

引用

19th International Conference on Security and Privacy in Communication Networks

作者： Yang, Yanqing Wang, Jian Nanjing Univ Aeronaut & Astronaut Nanjing 210016 Peoples R China

ISBN: (纸本)9783031649479;9783031649486

identity-based encryption can simplify the certificate management problem of traditional public key cryptosystem. But it also has an inherent drawback, called the key escrow problem. A malicious key generation center (KGC) can easily generate the user's private key to decrypt ciphertexts or perform illegal activities. In this paper, we propose an anonymous key issuing-based IBE protocol to solve the key escrow problem. The protocol separates the tasks of authentication and key generation, which are respectively implemented by two authorities. identity-certifying authority (ICA) authenticates the user and collaborates with him to generate a pseudo-identity to hide the real one, and issues an evidence to prove its validity. KGC generates private keys for users based on their pseudo-identities. We prove the security based on recipient anonymity and ciphertext indistinguishability, with the assumption that KGC does not collude with ICA. Compared with Emura's work, we weaken the communication restriction between KGC and ICA by allowing KGC to access the identity list stored by ICA arbitrarily, and only restrict its query method during the key generation phase, making it accessible through the index. This lowers the security assumption and makes it more realistic. Meanwhile, we eliminate the need for secure channels using blinding technique, and only require authentication channels to ensure that messages are not being tampered with. Our protocol has higher security and utility.

关键词： identity-based encryption Key escrow Anonymous key issuing

来源：评论

学校读者我要写书评

暂无评论

Wildcarded identity-based encryption from lattices

引用

THEORETICAL COMPUTER SCIENCE 2022年 902卷 41-53页

作者： Minh Thuy Truc Pham Ngoc Ai Van Nguyen Jiang, Mei Dung Hoang Duong Susilo, Willy Univ Wollongong Sch Comp & Informat Technol Inst Cybersecur & Cryptol Northfields Ave Wollongong NSW 2522 Australia Vietnam Natl Univ Univ Informat Technol Dept Math & Phys Ho Chi Minh City Vietnam

Wildcard identity-based encryption (WIRE) is a generalization of hierarchical identity-based encryption (HIRE) where a sender can simultaneously encrypt messages to a group of users matching a certain pattern, defined as a sequence of identities and wildcards. This special feature makes WIRE a promising solution to distributed IoT data security. In this paper, we propose the first construction of a post-quantum WIRE scheme. Our scheme is proven secure in the standard model, and it enjoys the security in the future quantum computer era. (C) 2021 Elsevier B.V. All rights reserved.

关键词： identity-based encryption Wildcard Standard model Lattices Learning with errors

来源：评论

学校读者我要写书评

暂无评论

Hierarchical identity-based encryption based on SM9 2nd

Hierarchical Identity-Based Encryption Based on SM9

引用

2nd International Conference on Data Security and Privacy Protection, DSPP 2024

作者： Chuai, Yi Zhang, Leyou Xie, Shuwei Tian, Runze Shan, Zhuang School of Mathematics and Statistics Xidian University Xi’an China

ISBN: (纸本)9789819785391

SM9 is an identification cryptography standard based on bilinear pairs adopted in China in 2016, and becomes an international cryptographic standard by ISO in 2021. But the initial SM9 identification cryptographic algorithm has only a single private key generator (PKG), and the user private key generation and transportation are completed by the PKG. It is not suitable for large-scale networks because the overburdened PKG can affect system security and efficiency. An effective solution is hierarchical identity-based encryption (HIBE), but there is no efficient HIBE based on SM9 at present. Motivated by this, a HIBE based on SM9 is proposed, which completes the generation and transmission of private keys in levels to solve the performance bottleneck of SM9 in large-scale networks. The private keys of the proposed HIBE decrease with the hierarchical level increasing, which improves the efficiency in large-scale networks. The decapsulation also achieves high efficiency where it only requires two bilinear mapping operations. The performance results showed that the proposed scheme is of high efficiency. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Hierachical identity-based encryption identity-based encryption Key encapsulation SM9

来源：评论

学校读者我要写书评

暂无评论

Receiver Selective Opening Chosen Ciphertext Secure identity-based encryption

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2022年第3期E105A卷 160-172页

作者： Hara, Keisuke Matsuda, Takahiro Tanaka, Keisuke Tokyo Inst Technol Dept Informat Sci Tokyo 1528550 Japan Tokyo Inst Technol Tokyo 1528550 Japan Natl Inst Adv Ind Sci & Technol Tokyo 1350064 Japan

In the situation where there are one sender and multiple receivers, a receiver selective opening (RSO) attack for an identity-based encryption (IBE) scheme considers adversaries that can corrupt some of the receivers and get their user secret keys and plaintexts. Security against RSO attacks for an IBE scheme ensures confidentiality of ciphertexts of uncorrupted receivers. In this paper, we formalize a definition of RSO security against chosen ciphertext attacks (RSO-CCA security) for IBE and propose the first RSO-CCA secure IBE schemes. More specifically, we construct an RSO-CCA secure IBE scheme based on an IND-ID-CPA secure IBE scheme and a non-interactive zero-knowledge proof system with unbounded simulation soundness and multi-theorem zero-knowledge. Through our generic construction, we obtain the first pairing-based and lattice-based RSO-CCA secure IBE schemes.

关键词： identity-based encryption receiver selective opening security chosen ciphertext attack

来源：评论

学校读者我要写书评

暂无评论

Receiver selective opening security for identity-based encryption in the multi-challenge setting

引用

DESIGNS CODES AND CRYPTOGRAPHY 2022年第4期91卷 1233-1259页

作者： Huang, Zhengan Lai, Junzuo Zeng, Gongxian Mu, Xin Peng Cheng Lab Shenzhen Peoples R China Jinan Univ Coll Informat Sci & Technol Guangzhou Peoples R China

Receiver selective opening (RSO) security requires that in a situation where there are one sender and multiple receivers, even if an adversary has access to all ciphertexts and adaptively corrupts some fraction of the receivers to obtain their secret keys, the (potentially related) ciphertexts of the uncorrupted receivers remain secure. All of the existing works construct RSO secure identity-based encryption (IBE) in the single-challenge setting, where each identity is used only once for encryption. This restriction makes RSO security for IBE unrealistic in practice. It is preferable to have IBE schemes with RSO security in the multi-challenge setting in practice, where each identity can be used to encrypt multiple messages. In this paper, we initiate the study of RSO security in the multi-challenge setting (which we call RSOk security) for IBE. Concretely, we show that the conclusion of lower bound, proposed by Yang et al. (in: ASIACRYPT 2020, Springer, 2020), on the secret key size of RSO secure public-key encryption also holds in the IBE setting (i.e., an IBE scheme cannot be RSOk secure if the length of its secret key is not k times larger than the length of message). For construction, we propose a generic construction of IBE achieving RSOk security. Through our generic construction, we can obtain RSOk secure IBE schemes based on decisional linear (DLIN) assumption and learning with error (LWE) assumption. Furthermore, we show that the well-known Fujisaki-Okamoto transformation can be applied to construct a practical IBE scheme achieving RSOk security.

关键词： identity-based encryption Selective opening security Multi-challenge setting Chosen-ciphertext attack

来源：评论

学校读者我要写书评

暂无评论

Attack and improvement of the recent identity-based encryption with authorized equivalence test in cluster computing

引用

CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS 2022年第1期25卷 633-646页

作者： Choi, Seongbong Lee, Hyung Tae Chung Ang Univ Sch Comp Sci & Engn Seoul South Korea

Recently, Elhabob et al. proposed an identity-based encryption with authorized equivalence test (IBE-AET), which allows authorized testers to check whether messages in two ciphertexts are the same or not under the identity-based setting (Cluster Computing, 2020). This paper looks into the security and correctness of their IBE-AET construction. More specifically, contrary to the security claim in the original paper, we point out that their proposed scheme cannot achieve the indistinguishability under adaptively chosen identity and ciphertext attacks (IND-ID-CCA2) for adversaries who do not have authorization. In terms of the correctness of the scheme, we also identify that their type-4 authorization does not work correctly. Finally, we remedy their construction in order that it satisfies the IND-ID-CCA2 security with the rigorous security proof as well as the type-4 authorization works correctly.

关键词： identity-based encryption Equivalence test Adaptive chosen ciphertext attacks Modification

来源：评论

学校读者我要写书评

暂无评论

Anonymous (Hierarchical) identity-based encryption from Broader Assumptions 21st

Anonymous (Hierarchical) Identity-Based Encryption from Broa...

引用

21st International Conference on Applied Cryptography and Network Security (ACNS)

作者： Wu, Huangting Chow, Sherman S. M. Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)9783031334900;9783031334917

Dottling and Garg (CRYPTO 2017) introduced a non-black-box approach to identity-based encryption (IBE). This paves the way for the first and still the only anonymous IBE (AIBE) scheme from the computational Diffie-Hellman (CDH) assumption of Brakerski et al. (EUROCRYPT 2018). This paper revisits the blinding technique of Brakerski et al. and introduces a suite of blind primitives, extending chameleon encryption, hash encryption, and one-time signature with encryption. Using them, we propose an AIBE scheme from CDH with improved efficiency compared to Brakerski et al., especially in the decryption time. We also propose the first anonymous hierarchical IBE (AHIBE) scheme from CDH and the first AIBE and AHIBE schemes from the phi-hiding assumption, with similar efficiency as their non-anonymous counterparts.

关键词： identity-based encryption hierarchical IBE anonymity computational Diffie-Hellman phi-hiding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：