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

key-policy attribute-based encryption based on SM9

JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 2025年第1期40卷 267-282页

作者： Liu, Xiao-Hong Huang, Xin-Yi Wu, Wei Ning, Jian-Ting Fujian Normal Univ Coll Comp & Cyber Secur Fuzhou 350117 Peoples R China Yuncheng Univ Maths & Informat Technol Sch Yuncheng 04400 Peoples R China Hong Kong Univ Sci & Technol Guangzhou Artificial Intelligence Thrust Informat Hub Guangzhou 511455 Peoples R China Fujian Normal Univ Sch Math & Stat Fuzhou 350117 Peoples R China

attribute-based encryption (ABE) is a type of encryption derived from identity-based encryption, implementing access control over encrypted data based on attributes rather than on specific identities. SM9 is the Chinese national standard for identity-based cryptography. This paper presents two novel key-policy attribute-based encryption (KP-ABE) designs based on SM9. The first scheme operates in a small attribute universe, while the second scheme caters to a large universe where the size of public parameters is only proportional to the maximum number of attributes used for encryption. Both schemes have a similar private-key/ciphertext structure to the original SM9 identity-based encryption algorithm, enabling effective integration into information systems built on SM9. Further, both schemes are selectively secure under the (f, g)-GDDHE assumption. Extensive experiments show that both schemes are comparable to other classical KP-ABE schemes, in terms of the communication and computational costs. We believe the proposed schemes will expedite the implementation of SM9 in distributed computing systems such as cloud computing and blockchain.

关键词： key-policy attribute-based encryption large universe SM9 selective-set model

来源：评论

学校读者我要写书评

暂无评论

key-policy attribute-based encryption against continual auxiliary input leakage

引用

INFORMATION SCIENCES 2019年 470卷 175-188页

作者： Li, Jiguo Yu, Qihong Zhang, Yichen Shen, Jian Fujian Normal Univ Coll Math & Informat Fuzhou 350117 Fujian Peoples R China State Key Lab Cryptol POB 5159 Beijing 100878 Peoples R China Suqian Coll Sch Comp Sci Suqian 223800 Peoples R China Nanjing Univ Posts & Telecommun Jiangsu Key Lab Big Data Secur & Intelligent Proc Nanjing 210023 Jiangsu Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software 219 Ningliu Rd Nanjing 210044 Jiangsu Peoples R China

attribute-based encryption mechanism can achieve very flexible access control, so it has a wide range of applications in the distributed environment, such as fine-grained access control, audit log applications, cloud storage systems. key-policy attribute-based encryption (KP-ABE) scheme is especially suitable for video on demand, pay TV, etc. Most of the existing KP-ABE schemes do not consider the side channel attacks which probably leak some secret information about the cryptosystems. In the paper, we present the formal definition and security model of key-policy attribute-based encryption scheme which is resilient to continual auxiliary input (CAI) leakage. What is more, we present a concrete KP-ABE scheme. The proposed scheme is proved secure under the static assumptions. (C) 2018 Elsevier Inc. All rights reserved.

关键词： key-policy attribute-based encryption Continual auxiliary input leakage Dual system encryption Static assumptions

来源：评论

学校读者我要写书评

暂无评论

Hierarchical and non-monotonic key-policy attribute-based encryption and its application

引用

INFORMATION SCIENCES 2022年 611卷 591-627页

作者： Li, Cong Shen, Qingni Xie, Zhikang Dong, Jisheng Feng, Xinyu Fang, Yuejian Wu, Zhonghai Peking Univ Sch Comp Sci Beijing 100871 Peoples R China Peking Univ Sch Software & Microelect Beijing 102600 Peoples R China Peking Univ Natl Engn Res Ctr Software Engn Beijing 100871 Peoples R China

Hierarchical-authority attribute-based encryption (HABE) can resolve the performance bottleneck of the key generation center in the traditional attribute-based encryption (ABE) system. HABE has numerous applications, such as cloud computing and smart grid systems. Nevertheless, almost all of the existing HABE schemes are in the ciphertext-policy setting and do not support non-monotonic access structures. In this work, we propose the first key-policy hierarchical-authority ABE with non-monotonic access structures, dubbed KP-HABE-NMaCS, which supports the authority key delegation, constant size ciphertexts and the large universe simultaneously. We further define the security model of KP-HABE-NMaCS and prove the selective security of it in the standard model. Then we optimize our scheme to realize the outsourced decryption. Subsequently, we present the detailed theoretical analysis of our constructions and the existing HABE constructions in computation and storage costs, and meanwhile implement ours and conduct a series of experiments. Both results indicate that our KP-HABE-NMaCS construction makes improvements in expressiveness and features, and achieves efficiency comparable to the previous HABE constructions. Furthermore, they also show that our extension construction is suitable for resource-limited applications. Eventually, we explore how to apply our KP-HABE-NMaCS to build an ABE with equality test and time-based authorization. (C) 2022 Elsevier Inc. All rights reserved.

关键词： key-policy attribute-based encryption Hierarchy of authorities Non-monotonic access structure Standard model attribute-based encryption with equality test and time-based authorization

来源：评论

学校读者我要写书评

暂无评论

Puncturable key-policy attribute-based encryption Scheme for Efficient User Revocation

引用

IEEE TRANSACTIONS ON SERVICES COMPUTING 2023年第6期16卷 3999-4011页

作者： Ghopur, Dilxat Ma, Jianfeng Ma, Xindi Hao, Jialu Jiang, Tao Wang, Xiangyu Xidian Univ Sch Cyber Engn Xian 710071 Peoples R China Xian Satellite Control Ctr Xian 710043 Peoples R China

Cloud computing, which provides a brand-new service model, has become an important infrastructure in the information age, and has been widely used in numerous fields. The key-policy attribute-based encryption (KP-ABE) scheme allows the encrypted data with fine-grained access control in the cloud environment. However, achieving large-scale user revocation in the application scenario of KP-ABE becomes one of the thorny problems. Furthermore, the computation and communication costs of the previous user revocation schemes were generally high, especially when a large number of users were revoked. To address these problems, an enhanced high-performance user-revocable KP-ABE scheme combined with the puncture method was proposed. In this article, the user could be revoked by the fine-grained restriction policy. When revoking the user, the cloud would run the puncture algorithm to embed the restriction policy defined by the data owner into the ciphertext. This method could effectively omit the reencryption and key updating processes, by which the computation and communication overhead of the user revocation are efficiently reduced, and the user revocation becomes more flexible and efficient. Moreover, the Chosen-Plaintext Attack (CPA) security proof and extensive simulation results demonstrate the reliability and efficiency of the proposed scheme for user revocation in a cloud environment.

关键词： Access control key-policy attribute-based encryption puncturable encryption user revocation

来源：评论

学校读者我要写书评

暂无评论

A key-policy attribute-based encryption Scheme with Constant Size Ciphertext

A Key-policy Attribute-based Encryption Scheme with Constant...

引用

8th International Conference on Computational Intelligence and Security (CIS)

作者： Wang, Chang-Ji Luo, Jian-Fa Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China

ISBN: (纸本)9780769548968;9781467347259

attribute-based encryption (ABE) is a new cryptographic primitive which provides a promising tool for addressing the problem of secure and fine-grained data sharing and decentralized access control. key-policy attribute-based encryption (KP-ABE) is an important class of ABE, where ciphertexts are labeled with sets of attributes and private keys are associated with access structures that control which ciphertexts a user is able to decrypt. KP-ABE has important applications in data sharing on untrusted cloud storage. However, the ciphertext size grows linearly with the number of attributes embedded in ciphertext in most existing KP-ABE schemes. In this paper, we describe our work on designing a KP-ABE scheme with constant size ciphertext for monotonic access structures. The downside of the proposed KP-ABE scheme is that private keys have multiple size growth in the number of attributes in the access structure. The proposed KP-ABE scheme is proved to be secure under the general Diffie-Hellman exponent assumption.

关键词： identity-based broadcast encryption key-policy attribute-based encryption cloud computing constant size ciphertexts general Diffie-Hellman exponent assumption

来源：评论

学校读者我要写书评

暂无评论

Fully Secure Unbounded Revocable key-policy attribute-based encryption Scheme 9th

Fully Secure Unbounded Revocable Key-Policy Attribute-Based ...

引用

9th International Conference on Security, Privacy, and Anonymity in Computation, Communication and Storage (SpaCCS)

作者： Wang, Changji Fang, Jian Xie, Jianguo Guangdong Univ Foreign Studies Collaborat Innovat Ctr 21st Century Maritime Silk Cisco Sch Informat Guangzhou 510006 Guangdong Peoples R China Sun Yat Sen Univ Sch Data & Comp Sci Guangzhou 510006 Guangdong Peoples R China

ISBN: (纸本)9783319491486;9783319491479

attribute-based encryption (ABE) is a promising cryptographic primitive which can provide fine-grained access control over encrypted data. Providing an efficient revocation mechanism for ABE scheme is crucial since users' credentials may be compromised or expired over time. Existing revocable ABE schemes in the literature are not satisfactory: (1) they are bounded in the sense that the size of the public parameters depends linearly on the size of the attribute universe;(2) they are only proved to be selectively secure in a prime order bilinear group setting or to be fully secure in a composite order bilinear group setting. In this paper, we present a unbounded revocable key-policy ABE scheme from prime order bilinear groups based on dual pairing vector space technique. The proposed scheme is proved to be fully secure under the DLIN and CDH assumptions in the standard model by adopting the dual system encryption methodology over dual pairing vector space. Compared with previous revocable key-policy ABE schemes, our proposed scheme is more efficient in terms of the size of ciphertext and private key, and the cost of encryption and decryption.

关键词： key-policy attribute-based encryption key revocation Dual system encryption Dual pairing vector space Bilinear pairing Full security

来源：评论

学校读者我要写书评

暂无评论

An Efficient key-policy attribute-based Searchable encryption in Prime-Order Groups 11th

An Efficient Key-Policy Attribute-Based Searchable Encryptio...

引用

11th International Conference on Provable Security (ProvSec)

作者： Meng, Ru Zhou, Yanwei Ning, Jianting Liang, Kaitai Han, Jinguang Susilo, Willy Shaanxi Normal Univ Sch Comp Sci Xian Peoples R China Natl Univ Singapore Dept Comp Sci Singapore Singapore Univ Surrey Dept Comp Sci Guildford Surrey England Univ Wollongong Inst Cybersecur & Cryptol Sch Comp & Informat Technol Wollongong NSW Australia

ISBN: (纸本)9783319686370;9783319686363

Public key encryption with keyword search (PEKS) is a promising cryptographic mechanism to enable secure search over encrypted data in cloud. The mechanism allows a semi-trusted cloud server to return related encrypted contents without knowing what the query is and what the corresponding contents are. It has been combined with attribute based encryption (ABE) to support more expressiveness in search. Most of the existing searchable ABE schemes, however, are restricted to heavy complexity. In particular, the size of ciphertext and pairing cost in the test phase are both linear in the size of the keyword set, say O(n), where n is the number of keyword. This limitation hinders the scalability of searchable ABE in practice. To address this long-lasting open problem, this paper proposes a new key-policy attribute-based search encryption (KP-ABSE) scheme. Our construction can be regarded as a novel combination of fast decryption, anonymous-like encryption, and KP-ABE technologies. As of independent interest, the scheme is built in asymmetric bilinear groups. The scheme is further proved secure under the asymmetric decisional DBDH, decisional q-BDHE and decisional linear assumptions in the standard model. Compared with existing KP-ABSE schemes, our new scheme achieves the following properties: (1) flexible access structure for search - any monotonic access structure, (2) constant ciphertext size, (3) constant pairing operations in the test phase.

关键词： key-policy attribute-based encryption Searchable encryption Prime-order groups Efficiency

来源：评论

学校读者我要写书评

暂无评论

A scalable encryption scheme for multi-privileged group communications

引用

JOURNAL OF SUPERCOMPUTING 2013年第3期64卷 1075-1091页

作者： Wang, Guojun Du, Qiushuang Zhou, Wei Liu, Qin Cent South Univ Sch Informat Sci & Engn Changsha 410083 Hunan Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

In multi-privileged group communications, since users, who can subscribe to different data streams according to their interests, have multiple access privileges, security issues are more difficult to be solved than those in traditional group communications. The common drawback of traditional key management schemes is that they will result in the "one-affect-many" problem, because they use a key graph to manage all the keys in a group, which makes one key being shared by many users. Recently, a key-policy attribute-based encryption (KP-ABE) scheme is proposed to encrypt messages to multiple users efficiently, which has been applied in secure multi-privileged group communications. However, user revocation in KP-ABE is still not resolved when applied to multi-privileged group communications. So, in this paper, by uniquely combining a collusion-resistant broadcast encryption system and a KP-ABE system with a non-monotone access structure, we propose a scalable encryption scheme for multi-privileged group communications (EMGC). based on the features of different multi-privileged group communication systems, we also propose two constructions for our EMGC scheme. With the two constructions, a system can support a user not only to join/leave a group at will, but also to change his access privilege on demand, and the expenses during rekeying operations are small. Therefore, our scheme, which can accommodate a dynamic group of users, is more applicable to multi-privileged group communications.

关键词： attribute-based broadcast encryption Multi-privileged group communications Revocation key-policy attribute-based encryption

来源：评论

学校读者我要写书评

暂无评论

Expressive Public-key encryption With keyword Search: Generic Construction From KP-ABE and an Efficient Scheme Over Prime-Order Groups

引用

IEEE ACCESS 2020年 8卷 93-103页

作者： Shen, Chen Lu, Yang Li, Jiguo Hohai Univ Coll Comp & Informat Nanjing 211100 Peoples R China Nanjing Normal Univ Sch Comp Sci & Technol Nanjing 210097 Peoples R China Fujian Normal Univ Coll Math & Informat Fuzhou 350007 Peoples R China State Key Lab Cryptol Beijing 100878 Peoples R China

Public key encryption with keyword search (PEKS) allows a cloud server to retrieve particular ciphertexts without leaking the contents of the searched ciphertexts. This kind of cryptographic primitive gives users a special way to retrieve the encrypted documents they need while preserving privacy. Nevertheless, most existing PEKS schemes only offer single-keyword search or conjunctive-keyword search. The poorly expressive ability and constantly inaccurate search results make them hard to meet users' requirements. Although several expressive PEKS (EPEKS) schemes were proposed, they entail high computation and communication costs. An ideal EPEKS scheme should enable fast and accurate ciphertext retrieval, while lowering the storage server's load and reducing the amount of communication data. Drawing on the strongly expressive ability of key-policy attribute-based encryption (KP-ABE), we propose a generic construction of EPEKS from KP-ABE. We demonstrate that the derived EPEKS scheme is secure under the chosen keyword attack if the implicit KP-ABE scheme fulfills the anonymity under the chosen plaintext attack. Furthermore, we present a concrete EPEKS scheme over the prime-order groups. The comparison and experimental results indicate that our scheme is more efficient than the existing EPEKS schemes.

关键词： Searchable encryption expressive keyword search key-policy attribute-based encryption prime-order group

来源：评论

学校读者我要写书评

暂无评论

SCMP-V: A secure multiple relays cooperative downloading scheme with privacy preservation in VANETs

引用

PEER-TO-PEER NETWORKING AND APPLICATIONS 2022年第1期15卷 340-354页

作者： Liu, Xuejiao Wang, Chuanhua Chen, Wei Xia, Yingjie Zhu, Gaoxiang Hangzhou Normal Univ Sch Informat Sci & Technol Hangzhou Peoples R China Zhejiang Univ Coll Comp Sci & Technol Hangzhou Peoples R China Hangzhou Yuantiao Technol Co Hangzhou Peoples R China

In vehicular ad hoc networks (VANETs), vehicle-to-vehicle cooperative downloading schemes have been provided to solve the problem of data download in the communication blind zone. However, how to realize the secure and reliable download of data by vehicles in the blind zone while preserving user privacy is still a problem to be solved in cooperative downloading. In this paper, we propose a secure multiple relays cooperative downloading scheme with privacy preservation in VANETs (SCMP-V), which mainly composes a secure relay selection algorithm, an adaptive data allocation mechanism, and an encrypted cooperative downloading method with privacy-preserving. Specially, we propose a secure relay selection method, which allows roadside units to select multiple relay vehicles while considering the most relevant criteria. Also, we propose an adaptive data allocation mechanism that can dynamically allocate the different sizes of data to the multiple relays by estimating the dynamic communication environment. Finally, we propose an encrypted cooperative downloading method based on key-policy attribute-based encryption, which can ensure target vehicles downloading the data with privacy-preserving. Simulation results show that SCMP-V can maintain a high transmission success rate and low packet loss rate for downloading data in different environments Compared with existing schemes, SCMP-V can improve the overall efficiency of relays selection and cooperative downloading by 13% and 27%, respectively while ensuring the privacy of vehicles.

关键词： VANETs key-policy attribute-based encryption Cooperative Downloading Adaptive Data Allocation Privacy Preservation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：