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

Generic Construction of Adaptively Secure Anonymous Key-Policy attribute-based encryption from Public-Key Searchable encryption

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2020年第1期E103A卷 107-113页

作者： Hayata, Junichiro Ishizaka, Masahito Sakai, Yusuke Hanaoka, Goichiro Matsuura, Kanta Univ Tokyo Tokyo 1538505 Japan Natl Inst Adv Ind Sci & Technol Tokyo 1350064 Japan KDDI Res Inc Publ Key Cryptosyst Fujimino Japan

Public-key encryption with keyword search (PEKS) is a cryptographic primitive that allows us to search for particular keywords over ciphertexts without recovering plaintexts. By using PEKS in cloud services, users can outsource their data in encrypted form without sacrificing search functionality. Concerning PEKS that can specify logical disjunctions and logical conjunctions as a search condition, it is known that such PEKS can be (generically) constructed from anonymous attribute-based encryption (ABE). However, it is not clear whether it is possible to construct this types of PEKS without using ABE which may require large computational/communication costs and strong mathematical assumptions. In this paper, we show that ABE is crucial for constructing PEKS with the above functionality. More specifically, we give a generic construction of anonymous key-policy ABE from PEKS whose search condition is specified by logical disjunctions and logical conjunctions. Our result implies such PEKS always requires large computational/communication costs and strong mathematical assumptions corresponding to those of ABE.

关键词： public-key searchable encryption attribute-based encryption

来源：评论

学校读者我要写书评

暂无评论

Adaptively secure ciphertext-policy attribute-based encryption with dynamic policy updating

引用

Science China(Information Sciences) 2016年第4期59卷 187-202页

作者： Zuobin YING Hui LI Jianfeng MA Junwei ZHANG Jiangtao CUI School of Computer Science and Technology Xidian University

attribute-based encryption(ABE) is a promising new cryptographic technique which guarantees fine-grained access control of outsourced encrypted data in the cloud. With the help of ABE, the majority of security issues in accessing cloud data can be solved. However, a key limitation remains, namely policy *** the access policy is updated, a common approach is to have the data owner retrieve the data and reencrypt it with new policy, before sending the new ciphertext back to the cloud. This straight-forward approach will lead to heavy computation and communication overhead. Although a number of other approaches have been proposed in this regard, they suffer from two limitations; namely, supporting only limited update-policy types or having weak security models. In order to address these limitations, we propose a novel solution to the attribute-based encryption access control system by introducing a dynamic policy-updating technique which we call DPU-CP-ABE. The scheme is proved to be adaptively secure under the standard model and can support any type of policy updating. In addition, our scheme can significantly reduce the computation and communication costs of updating ciphertext.

关键词： attribute-based encryption ciphertext-policy dynamic policy updating adaptive secure standard model

来源：评论

学校读者我要写书评

暂无评论

Multiauthority attribute-based encryption With Dynamic Membership From Lattices

引用

IEEE ACCESS 2022年 10卷 58254-58267页

作者： Zhuang, Er-Shuo Fan, Chun-, I Kuo, I-Hua Natl Sun Yat Sen Univ Dept Comp Sci & Engn Kaohsiung 80424 Taiwan

attribute-based encryption is useful for one-to-many encrypted message sending. However, most attribute-based encryption schemes authorize and issue attributes to users by a single authority. Such a scenario conflicts with practical requirements and may cause the key-escrow problem. Hence, decentralization of authority is a critical issue in attribute-based encryption. Besides, dynamic membership management is another important issue in attribute-based encryption. With dynamic membership management, a system may update the user's attributes without affecting other users, making the system more flexible and practical. On the other hand, with the rapid development of quantum computers nowadays, encryption schemes based on traditional mathematical problems are at the risk of quantum attacks. Among the existing quantum-resistant mathematical architectures, lattice-based cryptography is the most widely studied. Thus, we propose a multi-authority attribute-based encryption scheme with dynamic membership from lattices to solve the above problems. Moreover, we also formally prove the security of the proposed scheme under the decisional learning with errors assumption.

关键词： encryption Lattices Public key Receivers Fans Resists Licenses attribute-based encryption decentralization of authority dynamic membership management lattice-based cryptography

来源：评论

学校读者我要写书评

暂无评论

A survey on multi-authority and decentralized attribute-based encryption

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2022年第1期13卷 515-533页

作者： Oberko, Prince Silas Kwesi Obeng, Victor-Hillary Kofi Setornyo Xiong, Hu Univ Elect Sci & Technol China Sch Informat & Software Engn Chengdu 610054 Peoples R China

The introduction of attribute-based encryption (ABE) targets to achieve the implementation of single-to-numerous encryption;however, the sole authority challenge and the issue of distributed management of attributes are bottlenecks to its realization. Multi-authority attribute-based encryption (MA-ABE) where various attribute authorities (which may be independent of each other) control different attribute universe and are involved in the administration of attribute keys for decryption provides the necessary platform to undertake the implementation of fine-grained access regulation over shared data while achieving single-to-numerous encryption. In recent years, research into MA-ABE has seen rapid advancement, and we believe that it is a suitable solution to thwarting the key escrow problem as well as the problem of distributed management of attributes. This paper offers a thorough survey and examines the state-of-the-art of some traditional ABE as well as multi-authority attribute-based encryption schemes over the past decade. Furthermore, the survey gives detailed insights on some essential techniques as well as some classic concretely constructed algorithms. Moreover, we discuss an extension (the different directions) of MA-ABE and its progress since its inception. We also provide design principles of MA-ABE and also show comparisons between existing works on areas as security, performance, and functionality. This paper also discusses several interesting open problems. As far as we can tell, no comparable survey on MA-ABE exists in literature so far.

关键词： attribute-based encryption Multi-authority attribute-based encryption Privacy preserving Survey Taxonomy

来源：评论

学校读者我要写书评

暂无评论

Efficient attribute-based encryption with attribute revocation for assured data deletion

引用

INFORMATION SCIENCES 2019年 479卷 640-650页

作者： Xue, Liang Yu, Yong Li, Yannan Au, Man Ho Du, Xiaojiang Yang, Bo Shaanxi Normal Univ Sch Comp Sci Xian 710062 Shaanxi Peoples R China Univ Wollongong Sch Comp & Informat Technol Inst Cybersecur & Cryptol Wollongong NSW 2522 Australia Hong Kong Polytech Univ Dept Comp Hong Kong Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

Cloud storage allows customers to store their data on remote cloud servers. With the advantage of reducing the burden of data management and storage, an increasing number of users prefer to store their data on the cloud. While secure data deletion is a crucial, it is a challenging issue in cloud storage. Logically deleted data may be easily exposed to unauthorized users in the cloud storage scenario thanks to its salient features such as multi tenancy, virtualization and elasticity. Moreover, cloud servers might not delete customers' data as instructed for hidden business interest. Hence, assured deletion is highly sought after. It helps preserve cloud users' data privacy and is a necessary component of data retention regulations in cloud storage. In this paper, we first investigate the goals of assured data deletion and formalize its security ***, we propose a key-policy attribute based encryption scheme for assured deletion (AD-KP-ABE) of cloud data. Our construction makes use of the attribute revocation cryptographic primitive and Merkle Hash Tree to achieve fine-grained access control and verifiable data deletion. The proposed AD-KP-ABE enjoys desirable properties such as no secret key update, partial ciphertext update and assured data deletion. The detailed security proof and implementation results demonstrate the security and practicality of our proposal. (C) 2018 Elsevier Inc. All rights reserved.

关键词： Cloud storage Assured data deletion attribute-based encryption

来源：评论

学校读者我要写书评

暂无评论

Improvement of an outsourced attribute-based encryption scheme

引用

SOFT COMPUTING 2019年第22期23卷 11409-11417页

作者： Chen, Hongjie Liao, Yongjian Univ Elect Sci & Technol China Chengdu Sichuan Peoples R China

attribute-based encryption (ABE) scheme has become an important technology in cryptography. However, the considerable overhead of encryption and decryption restricts its application on the devices with limited resource. Fortunately, as the development of cloud computing, someone presents that outsourcing decryption and encryption can be used to deal with the problem. This idea has drawn a lot of attention after being proposed. Recently, Li et al. put forward an efficient verifiable outsourced ABE scheme which outsources the encryption and decryption to the cloud server and enables its valid receivers to verify the correctness of the message after decrypting. However, in this paper, we prove that their scheme is not secure under chosen plaintext attack which is the basic security requirement of ABE scheme. Then, we improve their scheme and illustrate that the improved scheme is adaptive chosen ciphertext attack (CCA2) secure in the random oracle model. The final comparison shows that we do not add extra computational burden to improve the security.

关键词： attribute-based encryption Outsourced encryption Outsourced decryption Cloud computing CCA2

来源：评论

学校读者我要写书评

暂无评论

Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation

引用

INFORMATION SCIENCES 2015年 295卷 221-231页

作者： Shi, Yanfeng Zheng, Qingji Liu, Jigiang Han, Zhen Beijing Jiaotong Univ Sch Comp & Informat Technol Beijing 100044 Peoples R China Univ Texas San Antonio Dept Comp Sci San Antonio TX USA

attribute-based encryption (ABE) enables an access control mechanism by specifying access control policies among decryption keys and ciphertexts. In this paper, we propose a novel ABE variant, dubbed directly revocable key-policy ABE with verifiable ciphertext delegation (drvuKPABE), which supports direct revocation and verifiable ciphertext delegation. The drvuKPABE offers the following features which are promising in the data sharing applications: (1) it allows the trusted authority to revoke users by solely updating the revocation list while mitigating the interaction with non-revoked users, which is unlikely to indirectly revokable ABE;(2) it allows the third party to update ciphertexts with public information so that those non-revoked users cannot decrypt them;and (3) it enables any auditor (authorized by data owners) to verify whether the untrusted third party updated ciphertexts correctly or not. We formalize the syntax and security properties for drvuKPABE, and propose the construction based on the multilinear maps, Our solution attains the security properties under the (d + 3)-Multilinear Decisional Diffie-Hellman assumption in the random oracle model. (C) 2014 Elsevier Inc. All rights reserved.

关键词： attribute-based encryption Verifiable ciphertext delegation Direct revocation

来源：评论

学校读者我要写书评

暂无评论

A lightweight and scalable attribute-based encryption system for smart cities

引用

COMPUTER COMMUNICATIONS 2020年 149卷 78-89页

作者： Rasori, Marco Perazzo, Pericle Dini, Gianluca Univ Pisa Dept Informat Engn Pisa Italy

In the near future, a technological revolution will involve our cities, where a variety of smart services based on the Internet of Things will be developed to facilitate the needs of the citizens. Sensing devices are already being deployed in urban environments, and they will generate huge amounts of data. Such data is typically outsourced to some cloud service in order to lower capital and operating expenses and guarantee high availability. However, cloud services may suffer from data breaches due to software and hardware vulnerabilities, or they may have incentives to release stored data to unauthorized entities. In this work we present ABE-Cities, an encryption system for urban sensing which solves the above problems while ensuring fine-grained access control on data by means of attribute-based encryption (ABE). ABE-Cities senses data from the city and stores it on the cloud in an encrypted form. Then, it provides users with keys able to decrypt only data sensed from authorized paths or zones of the city. In ABE-Cities, sensors perform only lightweight symmetric-key encryption, thus we can employ constrained sensor devices such as battery powered motes. ABE-Cities allows us to plan an expiration date for each key, as well as to revoke a given key in an unplanned fashion. We prove that ABE-Cities scales well with the number of users and the number of streets by simulating it with 30 000 users on the Beijing street network, which consists of more than 30 000 streets. In addition to the "vanilla" ABE-Cities scheme, we propose an "advanced" one that leverages the presence of IoT gateways to reduce the computational load otherwise weighing on a single Trusted Third Party. We validate this by testing the advanced scheme on the simulated Houston and Beijing street networks.

关键词： Smart city Urban sensing attribute-based encryption Internet of things Data-centric security

来源：评论

学校读者我要写书评

暂无评论

A group key-policy attribute-based encryption with partial outsourcing decryption in wireless sensor networks

引用

SECURITY AND COMMUNICATION NETWORKS 2016年第17期9卷 4138-4150页

作者： Wang, Qihua Yu, Chang Wu Li, Fagen Wang, Huaqun Cao, Lijie Dalian Ocean Univ Dept Informat Engn Dalian 116023 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Peoples R China Chung Hua Univ Dept Comp Sci & Informat Engn Hsinchu 300 Taiwan Nanjing Univ Posts & Telecommun Coll Comp Nanjing 210003 Jiangsu Peoples R China

Outsourcing decryption that enables the authorized users to obtain the original data without decryption computation is crucially important for wireless sensor networks in public data center. The existing outsourcing decryption schemes have been designed based on key-policy attribute-based encryption. The security of outsourcing decryption cannot be guaranteed, because the data center is not loyal, and existing schemes have high computational complexity and energy consumption. In this work, a novel partially outsourcing decryption scheme is proposed to guarantee data security and computational efficiency for resource-constrained sensor nodes and terminal equipments. According to the attributes of cluster nodes in the proposed scheme, the encryption secret key is encrypted based on group key-policy attribute-based encryption and sent to data center, and authorized users who satisfy the attributes of the ciphertext can obtain the secret key to decrypt the ciphertext. Furthermore, in order to reduce the decryption overhead for users, the authorized users can simply decrypt the transformation ciphertext that is partially decrypted by the data center using token key. Compared with the previous decryption schemes, the proposed scheme efficiently decrypts ciphertext and enhances security of the data. The simulation results also indicate that the proposed scheme is efficient in terms of energy consumption and computation by comparing to previous work. Copyright (C) 2016 John Wiley & Sons, Ltd.

关键词： attribute-based encryption wireless sensor networks outsourcing decryption access control

来源：评论

学校读者我要写书评

暂无评论

Decentralized ciphertext-policy attribute-based encryption schemes for lightweight devices

引用

COMPUTER COMMUNICATIONS 2019年 145卷 113-125页

作者： Malluhi, Q. M. Shikfa, A. Tran, V. D. Trinh, V. C. Qatar Univ Coll Engn Doha Qatar Hanoi Univ Sci & Technol Hanoi Vietnam Hong Duc Univ Thanh Hoa Vietnam

In a traditional attribute-based encryption (ABE) system, there is only one central authority who generates and hence knows the secret keys of all users, this problem is known as the key escrow problem. An ABE scheme which can deal with the aforementioned problem is so-called a decentralized (or multi-authority) ABE scheme. There have been several efforts to propose decentralized ABE schemes in the literature, and these schemes can enjoy some interesting properties such as fine-grained access control and full security. However, all of them suffer from two main weaknesses that are large secret key size and slow decryption time. These weaknesses are obviously not desirable for lightweight device applications such as Internet of Things applications. In this paper, we propose two decentralized ciphertext-policy attribute-based encryption schemes. Our proposed schemes have some nice properties such as constant-size secret key, fast decryption, optimized ciphertext size and fine-grained access control. Our schemes, as a result, could be seen as a solution for lightweight device applications. For completeness, we implement our schemes and give some concrete benchmarks.

关键词： Ciphertext-policy attribute-based encryption Decentralized Multi-authority Fast decryption Lightweight devices

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：