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

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 With Continuous Leakage-Resilient CCA Security From Static Complexity Assumption

引用

COMPUTER JOURNAL 2023年第4期66卷 924-940页

作者： Zhou, Yanwei Wang, Zhaolong Qiao, Zirui Wang, Ying Yang, Bo Mu, Yi Zhang, Mingwu Shaanxi Normal Univ Sch Comp Sci Xian 710062 Peoples R China Henan Key Lab Network Cryptog Technol Zhengzhou 450040 Peoples R China Guilin Univ Elect Technol Guangxi Key Lab Cryptog & Informat Secur Guilin 541004 Peoples R China Aviat Ind Corp China Xian Aeronaut Comp Tech Res Inst Xian 710068 Peoples R China City Univ Macau Inst Data Sci Macau 999078 Peoples R China

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 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. In this paper, an IBE scheme with adaptive leakage-resilient CCA security is proposed, and its security is rigorously proved in the random oracle model under a classic static complexity assumption, e.g. decisional bilinear Diffie-Hellman assumption. In our construction, all elements of ciphertext are randomly distributed in the adversary's view. Hence, the adversary cannot obtain any useful information of the user's private key from the given ciphertexts. Moreover, a unique property of our construction is that the leakage parameter is independent of the plaintext space, which contributes a better leakage rate.

关键词： Leakage resilience identity-based encryption CCA security random oracle model

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption with security against the KGC: A formal model and its instantiations

引用

THEORETICAL COMPUTER SCIENCE 2022年 900卷 97-119页

作者： Emura, Keita Katsumata, Shuichi Watanabe, Yohei Natl Inst Informat & Commun Technol NICT Koganei Tokyo Japan Natl Inst Adv Ind Sci & Technol Tokyo Japan Univ Electrocommun Chofu Tokyo Japan

The key escrow problem is one of the main barriers to the widespread real-world use of identity-based encryption (IBE). Specifically, a key generation center (KGC), which generates secret keys for a given identity, has the power to decrypt all ciphertexts. At PKC 2009, Chow defined a notion of security against the KGC, that relies on assuming that it cannot discover the underlying identities behind ciphertexts. However, this is not a realistic assumption since, in practice, the KGC manages an identity list, and hence it can easily guess the identities corresponding to given ciphertexts. Chow later amended this issue by introducing a new entity called an identity-certifying authority (ICA) and proposed an anonymous keyissuing protocol. Essentially, this allows the users, KGC, and ICA to interactively generate secret keys without users ever having to reveal their identities to the KGC. Unfortunately, since Chow separately defined the security of IBE and that of the anonymous key-issuing protocol, his IBE definition did not provide any formal treatment when the ICA is used to authenticate the users. Effectively, all of the subsequent works following Chow lack the formal proofs needed to determine whether or not it delivers a secure solution to the key escrow problem. In this paper, based on Chow's work, we formally define an IBE scheme that resolves the key escrow problem and provide formal definitions of security against corrupted users, KGC, and ICA. Along the way, we observe that if we are allowed to assume a fully trusted ICA, as in Chow's work, then we can construct a trivial (and meaningless) IBE scheme that is secure against the KGC. Finally, we present two instantiations in our new security model: a lattice-based construction based on the Gentry-Peikert-Vaikuntanathan IBE scheme (STOC 2008) and Ruckert's lattice-based blind signature scheme (ASIACRYPT 2010), and a pairing-based construction based on the Boneh-Franklin IBE scheme (CRYPTO 2001) and Boldyreva's bl

关键词： identity-based encryption Key escrow problem Lattices Pairings

来源：评论

学校读者我要写书评

暂无评论

LMIBE: Lattice-based Matchmaking identity-based encryption for Internet of Things

引用

IEEE ACCESS 2023年 11卷 9851-9858页

作者： Tao, Xufeng Qiang, Yan Wang, Peng Wang, Yingsen Taiyuan Univ Technol Coll Informat & Comp Taiyuan 030600 Peoples R China Chongqing Univ Sci & Technol Sch Intelligent Technol & Engn Chongqing 401331 Peoples R China

Under the usage of new technologies, Internet of Things (IoT) develops rapidly and provides a great convenience for our lives. It is critical for ensuring security to IoT systems as the tremendous growth of IoT applications. Although many cryptography tools (such as identity-based encryption) have been given to provide appropriate security in IoT covering various application fields such as smart home, how to guarantee data confidentiality, provide reasonable data source identification, and resist quantum attacks simultaneously has been a challenging problem. To address this problem, we propose a matchmaking encryption scheme named lattice-based matchmaking identity-based encryption (LMIBE) which can provide bilateral access control for both sender and receiver in IoT systems, and resist quantum attacks. Moreover, we give a formal definition and a security definition for our scheme. Security proof shows that our scheme is secure under the proposed security definition. Finally, by comparing the performance of our scheme with existing works, our proposed scheme has a broad application prospect in IoT environment.

关键词： Internet of Things Receivers Security Cryptography encryption Access control identity-based encryption matchmaking encryption post-quantum security

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting

引用

JOURNAL OF CRYPTOLOGY 2024年第2期37卷 12-12页

作者： Hofheinz, Dennis Koch, Jessica Striecks, Christoph Swiss Fed Inst Technol Zurich Switzerland AIT Austrian Inst Technol Vienna Austria

We construct an identity-based encryption (IBE) scheme that is tightly secure in a very strong sense. Specifically, we consider a setting with many instances of the scheme and many encryptions per instance. In this setting, we reduce the security of our scheme to a variant of a simple assumption used for a similar purpose by Chen and Wee (CRYPTO 2013, Springer, 2013). The security loss of our reduction is O(k)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\textbf{O} (k)$$\end{document} (where k\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k $$\end{document} is the security parameter). Our scheme is the first IBE scheme to achieve this strong flavor of tightness under a simple assumption. Technically, our scheme is a variation of the IBE scheme by Chen and Wee. However, in order to "lift" their results to the multi-instance, multi-ciphertext case, we need to develop new ideas. In particular, while we build on (and extend) their high-level proof strategy, we deviate significantly in the low-level proof steps.

关键词： Public-key cryptography identity-based encryption Dual-system groups Multi-challenge security Tightness

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

identity-based encryption in DDH Hard Groups 13th

Identity-Based Encryption in DDH Hard Groups

引用

13th International Conference on the Theory and Application of Cryptographic Techniques in Africa (AFRICACRYPT)

作者： Blazy, Olivier Kakvi, Saqib A. Ecole Polytech Inst Polytech Paris INRIA LIXCNRS F-91120 Palaiseau France Univ London Royal Holloway London England

ISBN: (纸本)9783031174322;9783031174339

The concept of identity-based encryption was first introduced by Shamir (CRYPTO 1984) but were not realised until much later by Sakai, Ohgishi and Kasahara (SCIS 2000), Boneh and Franklin (CRYPTO 2001) and Cocks (IMACC 2001). Since then, identity-based encryption has been a highly active area of research. While there have been several instantiations of identity-based encryption and its variants, there is one glaring omission: there have been no instantiations in plain Decisional Diffie-Hellman groups. This seemed at odds with the fact that we can instantiate almost every single cryptographic primitive in plain Decisional Diffie-Hellman groups. An answer to this question came in a result by Papakonstantinou, Rackoff and Vahlis (EPRINT 2012), who showed that it is impossible to instantiate an identity-based encryption in plain DDH groups. The impossibility result was questioned when Dottling and Garg (CRYPTO 2017) presented an identity-based encryption based on the Decisional Diffie-Hellman problem. However, this result did not disprove the impossibility result, as it requires the use of garbled circuits, which are inherently interactive. This type of scheme is not covered by the impossibility result, but it does raise some questions. In this paper, we answer some of those questions by constructing an identity-based encryption scheme based on the Decisional Diffie-Hellman problem. We achieve this by instantiating the generic construction based on Witness encryption by Garg, Gentry, Sahai and Waters (STOC 2013), with some minor changes. To this end, we construct the first unique signature scheme in Decisional Diffie-Hellman groups, to the best of our knowledge. The unique signature scheme, and as a result, our identity-based encryption scheme, is inefficient, but this is unavoidable. Our construction does not completely contradict the impossibility result but instead shows that the statement was too strong, and the result only rules out efficient con

关键词： identity-based encryption Unique signatures Generic constructions DDH Impossibility results

来源：评论

学校读者我要写书评

暂无评论

An Efficient identity-based encryption With Equality Test in Cloud Computing

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2023年第3期11卷 2983-2992页

作者： Yang, Zhichao He, Debiao Qu, Longjiang Ye, Qing Naval Univ Engn Dept Informat Secur Wuhan 430000 Peoples R China Qilu Univ Technol Shandong Acad Sci Shandong Prov Key Lab Comp Networks Jinan 250014 Peoples R China Wuhan Univ Sch Cyber Sci & Engn Wuhan 430000 Peoples R China Natl Univ Def Technol Coll Liberal Arts & Sci Changsha 410000 Peoples R China

identity-based encryption with equality test (IBEET) provides a feasible way for cloud server partitioning or searching on ciphertexts in the cloud. In that case, the server can judge if two different ciphertexts encrypt the same plaintexts or not. In response to threats posed by quantum computers, lattice-based IBEET schemes have been proposed to make cloud service post-quantum secure. However, those schemes are inefficient and can hardly meet the needs of resource-constrained devices. In this article, an efficient post-quantum IBEET scheme is introduced, which achieves testability by embedding the hash value of plaintext into testing trapdoor instead of encrypting it directly and doubling the size of ciphertext. We also prove that, with the Learning With Errors (LWE) problem assumption, the new scheme is one-way secure against selective identity and chosen ciphertext attacks (OW-sID-CCA) in quantum secure model. Furthermore, we evaluate the performance of the new construction and demonstrate its efficiency by showing that it only costs about half storage comparing with other lattice-based IBEET schemes. The execution time of encryption and decryption phrases in the new scheme reduce by 50%, while the computational cost in test algorithm keeps the same. Therefore, the new proposed IBEET is much more practical for working in post-quantum cloud computing scenarios.

关键词： Cloud computing Cryptography Servers encryption Testing Computational modeling Public key equality test identity-based encryption learning with errors problem quantum secure model

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Delegate and Verify the Update Keys of Revocable identity-based encryption

引用

IEEE ACCESS 2023年 11卷 52636-52652页

作者： Lee, Kwangsu Yonsei Univ Comp Sci Seoul South Korea Korea Adv Inst Sci & Technol Comp Sci Daejeon South Korea Korea Univ Informat Secur Seoul South Korea Sejong Univ Dept Comp & Informat Secur Seoul South Korea

Revocable identity-based encryption (RIBE) is an extension of identity-based encryption (IBE) and it supports efficient revocation of private keys. In the past, many efficient RIBE schemes have been proposed, but research on efficiently delegating the generation of update keys to a cloud server is somewhat insufficient. In this paper, we newly introduce the concept of delegated RIBE (DRIBE) that can delegate the generation of update keys to the semi-trusted cloud server and define the security models of DRIBE. Next, we propose a DRIBE scheme by generically combining a hierarchical IBE (HIBE) scheme, an identity-based broadcast encryption (IBBE) scheme, and a collision-resistant hash function. In addition, we propose a DRIBE-INC scheme that generates an occasional base update key and a periodic incremental update key to reduce the size of update keys in our DRIBE scheme.

关键词： Binary trees Servers Security Public key identity-based encryption encryption Hash functions key revocation subset cover update key delegation public verifiability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：