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

identity-based encryption on RSA Without Pairings and Key Escrow

Chinese Journal of Electronics 2025年第4期23卷 842-850页

作者： Yan Zhu Shanbiao Wang Di Ma Rongquan Feng School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China School of Mathematical Sciences Peking University Beijing China Department of Computer and Information Science University of Michigan-Dearborn Michigan USA

We propose a new construction of identity-based encryption without key escrow over the tradition RSA cryptosystems. The security of our scheme follows from the decisional Diffie-Hellman assumption and the difficulty of Modular inversion hidden number problem with error (MIHNPwE), which can be seen as a generalization of the modular inversion hidden number problem. We give an analysis on the hardness of MIHNPwE by lattice techniques. In our construction, we generate each user's partial private key in the form of an MIHNPwE instance. The hardness of MIHNPwE provides our scheme with resistance against key-collusion attacks from any number of traitors. Our prototype implementation of the proposed scheme shows that it can be more computation efficient and easy-to-implementation than the influential pairing-friendly elliptic-curve based IBE scheme.

关键词： Resistance identity-based encryption Prototypes Lattices Computational efficiency Cryptography

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

identity-based matchmaking encryption with stronger security and instantiation on lattices

引用

THEORETICAL COMPUTER SCIENCE 2025年 1029卷

作者： Wang, Yuejun Wang, Baocang Lai, Qiqi Zhan, Yu Xidian Univ State Key Lab Integrated Serv Networks Xian Peoples R China Henan Key Lab Network Cryptog Technol Zhengzhou Henan Peoples R China Shaanxi Normal Univ Sch Comp Sci Xian Peoples R China

An identity-based matchmaking encryption (IB-ME) scheme proposed at JOC 2021 supports anonymous but authenticated communications in a way that communication parties can both specify the senders or receivers on the fly. IB-ME is easy to be used in several network applications requiring privacy-preserving for its efficient implementation and special syntax. Despite the rigorous security proofs in previous security models, the existing IB-ME schemes are still possibly vulnerable to some potential neglected attacks. Aiming at the above problems, we provide a stronger security definition of authenticity considering new attacks to fit real-world scenarios and then propose a generic construction of IB-ME satisfying the new model. Inspired by the prior IB-ME construction of Chen et al., the proposed scheme is constructed by combining 2-level anonymous hierarchical IBE (HIBE) and identity-based signature (IBS) schemes. In order to upgrade lattice- based IB-ME with better efficiency, we additionally improve a lattice IBS, as an independent technical contribution, to shorten its signature and thus reduce the final IB-ME ciphertext size. By combining the improved IBS and any 2-level adaptively-secure lattice-based HIBE with anonymity, we finally obtain the first lattice-based IB-ME construction achieving privacy and new-proposed stronger authenticity simultaneously.

关键词： Matchmaking encryption identity-based encryption Lattice identity-based signature Security model

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption with outsourced equality test in cloud computing

引用

INFORMATION SCIENCES 2016年 328卷 389-402页

作者： Ma, Sha S China Agr Univ Coll Math & Informat Guangzhou Guangdong Peoples R China

We firstly combine the concepts of public key encryption with equality test (PKEET) and identity-based encryption (IBE) to obtain identity-based encryption with equality test (IBEET). Inheriting the advantage of IBE, IBEET can simplify the certificate management of PKEET with all messages encrypted with the receiver's public identity. In the IBEET scheme, the receiver computes a trapdoor using the secret value for the identity and then sends it to a cloud server for equality test on its ciphertexts with others' ciphertexts. Using this primitive someone with the trapdoor for its identity can delegate out the capability of equality test on its ciphertexts without requiring a central authority to act as a delegator. So it is very suitable for the client with minimal computation resource, e.g, mobile phone. Furthermore, compared with PKEET, it has security improvement since not anyone can perform the test. Therefore, IBEET may have interesting applications in cloud computing, e.g., partition of encrypted emails. We define one-way chosen-ciphertext security against a chosen identity attack (OW-ID-CCA) and propose a construction in bilinear pairing. Finally, extensive security analysis and comparison with related works show that the proposed scheme is proven secure and useful. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Public key encryption Searchable encryption identity-based encryption Equality test

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption on RSA Without Pairings and Key Escrow

引用

Chinese Journal of Electronics 2014年第4期23卷 842-850页

作者： ZHU Yan WANG Shanbiao MA Di FENG Rongquan School of Computer and Communication Engineering University of Science and Technology Beijing School of Mathematical Sciences Peking University Department of Computer and Information Science University of Michigan-Dearborn

We propose a new construction of identitybased encryption without key escrow over the tradition RSA cryptosystems. The security of our scheme follows from the decisional Diffie-Hellman assumption and the difficulty of Modular inversion hidden number problem with error(MIHNPw E), which can be seen as a generalization of the modular inversion hidden number problem. We give an analysis on the hardness of MIHNPw E by lattice techniques. In our construction, we generate each user’s partial private key in the form of an MIHNPw E instance. The hardness of MIHNPw E provides our scheme with resistance against key-collusion attacks from any number of traitors. Our prototype implementation of the proposed scheme shows that it can be more computation efficient and easy-to-implementation than the influential pairingfriendly elliptic-curve based IBE scheme.

关键词： identity-based encryption Key escrow Hidden number problem with error

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption with leakage-amplified chosen-ciphertext attacks security

引用

THEORETICAL COMPUTER SCIENCE 2020年 809卷 277-295页

作者： Zhou, Yanwei Yang, Bo Xia, Zhe Zhang, Mingwu Mu, Yi Shaanxi Normal Univ Sch Comp Sci Xian Peoples R China State Key Lab Cryptol POB 5159 Beijing Peoples R China Wuhan Univ Technol Sch Comp Sci Wuhan Peoples R China Guilin Univ Elect Technol Sch Comp Sci & Informat Secur Guilin Peoples R China Fujian Normal Univ Fujian Prov Key Lab Network Secur & Cryptol Fujian Peoples R China

Alwen et al. (EUROCRYPT 2010) proposed the formal definition of identity-based hash proof system (IB-HPS). As an independent interest, they showed that a leakage-resilient identity-based encryption (LR-IBE) scheme can be created based on an IB-HPS. That is, a generic construction of LR-IBE scheme with the chosen-plaintext attacks (CPA) security be designed from the IB-HPS. However, in order to further improve the practicability of identity-based encryption (IBE) system, an IBE scheme must have the chosen-ciphertext attacks (CCA) security. Hence, in this paper, a generic construction of LR-IBE scheme with the CCA security is proposed from the IB-HPS. In additional, to design an LR-IBE schemes with an arbitrarily length leakage parameter, we design a novel generic construction of leakage amplified IBE scheme with CCA security, where we only increase the size of private key proportionally, while do not change all other parameters, and the upper bound of permitted leakage can be flexibly controlled by changing the leakage-size parameter. In other words, the length of allowed leakage of our generic construction is determined by the leakage requirements of actual applications. (C) 2019 Published by Elsevier B.V.

关键词： identity-based encryption Leakage resilience Generic construction identity-based hash proof system CCA security

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption With Disjunctive, Conjunctive and Range Keyword Search From Lattices

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2024年 19卷 8644-8657页

作者： Lin, Zesheng Li, Hongbo Chen, Xinjian Xiao, Meiyan Huang, Qiong South China Agr Univ Coll Math & Informat Guangzhou 510642 Peoples R China Guangzhou Key Lab Intelligent Agr Guangzhou 510642 Peoples R China

To reduce data storage costs, more individuals are using cloud servers for reliable, scalable, cost-effective, and globally accessible solutions. However, storing data in plaintext on cloud servers can lead to data leakage risks. Moreover, the advancement of quantum computing poses a threat to traditional encryption algorithms. To counter quantum computing attacks and enable searches over encrypted keywords, lattice-based searchable encryption with conjunctive keyword search has been implemented. Nonetheless, existing schemes expose keyword fields and leaks additional information. To mitigate this, we propose a privacy-preserving method based on lattice hardness assumptions. It enables testing the existence of an encrypted keyword in a set of encrypted keywords without requiring the keyword fields. Additionally, we propose two improved methods: one for inclusion-based searches between two keyword sets, and another for range-based keyword searches. These form the basis for three lattice-based identity-based searchable encryption schemes that support disjunctive, conjunctive, and range keyword searches, respectively. The storage overhead of ciphertexts and trapdoors is unaffected by the number of keywords, making our scheme suitable for multi-keyword search scenarios. Our formal security analysis uses the learning with errors (LWE) assumption and our theoretical analysis and experimental simulations show comparable efficiency and low storage overhead.

关键词： Disjunctive keyword search conjunctive keyword search range keyword search post-quantum security identity-based encryption learning with errors Disjunctive keyword search conjunctive keyword search range keyword search post-quantum security identity-based encryption learning with errors

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption from the Diffie-Hellman Assumption

引用

JOURNAL OF THE ACM 2021年第3期68卷 1–46页

作者： Doettling, Nico Garg, Sanjam Helmholtz Ctr Informat Secur CISPA Saarbrucken Germany Univ Calif Berkeley 685 Soda Hall Berkeley CA 94720 USA CISPA Campus Stuhlsatzenhaus 5 D-66123 Saarbrucken Germany

We provide the first constructions of identity-based encryption and hierarchical identity-based encryption based on the hardness of the (Computational) Diffie-Hellman Problem (without use of groups with pairings) or Factoring. Our construction achieves the standard notion of identity-based encryption as considered by Boneh and Franklin [CRYPTO 2001]. We bypass known impossibility results using garbled circuits that make a non-black-box use of the underlying cryptographic primitives.

关键词： identity-based encryption Garbled circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：