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

41st Annual International Cryptology Conference (CRYPTO)

作者： Wang, Yuyu Pan, Jiaxin Chen, Yu Univ Elect Sci & Technol China Chengdu Peoples R China NTNU Norwegian Univ Sci & Technol Dept Math Sci Trondheim Norway Shandong Univ Sch Cyber Sci & Technol Qingdao 266237 Peoples R China State Key Lab Cryptol POB 5159 Beijing 100878 Peoples R China Shandong Univ Key Lab Cryptol Technol & Informat Secur Minist Educ Qingdao 266237 Peoples R China

ISBN: (纸本)9783030842598;9783030842581

Fine-grained cryptography is constructing cryptosystems in a setting where an adversary's resource is a-prior bounded and an honest party has less resource than an adversary. Currently, only simple form of encryption schemes, such as secret-key and public-key encryption, are constructed in this setting. In this paper, we enrich the available tools in fine-grained cryptography by proposing the first fine-grained secure attribute-based encryption (ABE) scheme. Our construction is adaptively secure under the widely accepted worst-case assumption, NC1 not subset of circle plus L/poly, and it is presented in a generic manner using the notion of predicate encodings (Wee, TCC'14). By properly instantiating the underlying encoding, we can obtain different types of ABE schemes, including identity-based encryption. Previously, all of these schemes were unknown in fine-grained cryptography. Our main technical contribution is constructing ABE schemes without using pairing or the Diffie-Hellman assumption. Hence, our results show that, even if one-way functions do not exist, we still have ABE schemes with meaningful security. For more application of our techniques, we construct an efficient (quasi-adaptive) non-interactive zero-knowledge (QANIZK) proof system.

关键词： Fine-grained cryptography Identity-based encryption attribute-based encryption Quasi-adaptive non-interactive zero-knowledge proof

来源：评论

学校读者我要写书评

暂无评论

An attribute-based encryption scheme with multiple authorities on hierarchical personal health record in cloud

引用

JOURNAL OF SUPERCOMPUTING 2020年第7期76卷 4884-4903页

作者： Guo, Rui Li, Xiong Zheng, Dong Zhang, Yinghui Xian Univ Posts & Telecommun Natl Engn Lab Wireless Secur Xian 710121 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China Hunan Univ Sci & Technol Sch Comp Sci & Engn Xiangtan 411201 Peoples R China Westone Cryptol Res Ctr Beijing 100070 Peoples R China

In the personal health record (PHR) system, the patient's health records are usually outsourced to a large database, such as the cloud service provider. In order to guarantee the confidentiality of this data , achieve access control with flexibility and fine-grained property, it usually employs ciphertext-policy attribute-based encryption (CP-ABE) scheme in cloud computing. However, the outsourced data have the characteristic of multi-level hierarchy, and the general CP-ABE is inappropriate for being applied in distributed cloud service systems directly to provide the security of hierarchy structure of outsourced data. In this paper, to overcome this challenge, a PHR hierarch CP-ABE scheme with multiple authorities is presented. This protocol integrated some different access structures into a single one, which the hierarchical PHR is encrypted based on. There are multiple authorities to generate and distribute user's private key all together. According to this mode, it enables to avoid the problem of key escrow and conform to the distributed characteristic of cloud service systems. However, it has no trusted single or central one in these authorities. Moreover, this proposed scheme resists (N-1) corrupted authorities out of N authorities in the collusion attack. based on the intractability of the standard decisional bilinear Diffie-Hellman problem, the security of this protocol is proven to be semantic secure. Finally, by comparison analysis, this protocol exhibits a better performance.

关键词： attribute-based encryption Multi-authority Hierarchical PHR Cloud computing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cost-Efficient Outsourced Decryption of attribute-based encryption Schemes for Both Users and Cloud Server in Green Cloud Computing

引用

IEEE ACCESS 2020年 8卷 20862-20869页

作者： Liao, Yongjian Zhang, Ganglin Chen, Hongjie Univ Elect Sci & Technol China Sch Informat & Software Engn Chengdu 610054 Peoples R China

To reduce a user's decryption cost and protect the private information from being leaked, Green et al. proposed an approach oursourcing the decryption of the attribute based encryption (ABE) scheme to the cloud server. Later, almost all ABE schemes with outsourced decryption (ABE-OD) used their model or approach. However, the cloud server needs to repeat the outsourced decryption service of the same ciphertext for distinct users satisfying the same access policy in these schemes. Green computing is the atmosphere conscientious and recyclable utilization of resources. The green cloud networks can reduce their cost or energy requirements by adapting its performance, optimizing resources management and services. The method is not efficient for the cloud server in the green cloud networks. In this article, to take into account recyclable utilization of resources for the cloud server, we put forward a new and secure approach to reduce total overhead of the cloud server when many users satisfying an access policy require the outsourced decryptions for the same ciphertext besides decreasing the decryption computation cost for users. Compared with the existing ABE-OD schemes, our total overhead of the cloud server is independent of the number of the users who satisfy an access policy and request the outsourcing decryption service. Finally, we extend our approach to a RCCA-secure ABE-OD scheme.

关键词： Green cloud computing attribute-based encryption outsourced decryption cloud server recyclable utilization bilinear maps

来源：评论

学校读者我要写书评

暂无评论

Server-aided revocable attribute-based encryption for cloud computing services

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2020年第14期32卷 e5680-e5680页

作者： Cui, Hui Yuen, Tsz Hon Deng, Robert H. Wang, Guilin Murdoch Univ Discipline Informat Technol Math & Stat Perth WA Australia Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Singapore Management Univ Singapore Singapore Huawei Int Pte Ltd Singapore Singapore

attribute-based encryption (ABE) has been regarded as a promising solution in cloud computing services to enable scalable access control without compromising the security. Despite of the advantages, efficient user revocation has been a challenge in ABE. One suggestion for user revocation is using the binary tree in the key generation phase of an ABE scheme, which enables a trusted key generation center to periodically distribute the key update information to all nonrevoked users over a public channel. This revocation approach reduces the size of key updates from linear to logarithmic in the number of users. But it requires each user to keep a private key of the logarithmic size, and asks each nonrevoked user to periodically update his/her decryption key for each new time period. To further optimize user revocation in ABE, a server-aided revocable ABE (SR-ABE) scheme has been proposed, in which almost all workloads of users incurred by the user revocation are outsourced to an untrusted server, and each user only needs to store a private key of the constant size. In addition, SR-ABE does not require any secure channel for the key transmission, and a user only needs to perform a small amount of calculations to decrypt a ciphertext. In this paper, we revisit the notion of SR-ABE, and present a generic construction of SR-ABE, which can transform a revocable ABE (RABE) scheme to an SR-ABE scheme. In addition, we give an instantiation of SR-ABE by applying the generic construction on a concrete RABE scheme, and implement an instantiation of SR-ABE and an RABE scheme to evaluate the performance of SR-ABE.

关键词： access control attribute-based encryption cloud computing outsourced computation revocation

来源：评论

学校读者我要写书评

暂无评论

MedSBA: a novel and secure scheme to share medical data based on blockchain technology and attribute-based encryption

引用

JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING 2020年第11期11卷 4613-4641页

作者： Pournaghi, Seyed Morteza Bayat, Majid Farjami, Yaghoub Univ Qom Dept Comp Engn Qom Iran Shahed Univ Dept Comp Engn Tehran Iran

The development of Electronic Information Technology has made the Electronic Medical Record a commonly used approach to recording and categorizing medical patient data in databases of different hospitals and medical entities so that controlling the shared data is not possible for patients at all. The importance of medical data as possessions of people and the system leads us to be concerned about its security, privacy, and accessibility. How to store and controlling access to medical information is of the most important challenges in the electronic health area. The present paper provides a new, secure, and efficient scheme based on blockchain technology and attribute-based encryption entitled "MedSBA" to record and store medical data, indicating that our proposed scheme protects user privacy and allows fine-grain access control of medical patient data based on General Data Protection Regulation (GDPR). Private blockchains are used in MedSBA to improve the right to revoke instant access which is of the attribute-based encryption challenges. The security and functionality of our proposed scheme are proved within a formal model and based on BAN logic, respectively;simulating the MedSBA scheme in the OPNET software as well as examining its computational complexity and storage indicates the efficiency of the present scheme.

关键词： e-Health Blockchain technology attribute-based encryption Security BAN logic OPNET

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Decentralized attribute-based encryption and Signatures

引用

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

作者： Okamoto, Tatsuaki Takashima, Katsuyuki NTT Res Inc East Palo Alto CA USA Mitsubishi Electr Corp Informat Technol R&D Ctr Kamakura Kanagawa 2478501 Japan

This paper presents decentralized multi-authority attribute-based encryption and signature (DMA-ABE and DMA-ABS) schemes, in which no central authority exists and no global coordination is required except for the setting of a parameter for a prime order bilinear group and a hash function, which can be available from public documents, e.g., ISO and FIPS official documents. In the proposed DMA-ABE and DMA-ABS schemes, every process can be executed in a fully decentralized manner;any party can become an authority and issue a piece for a secret key to a user without interacting with any other party, and each user obtains a piece of his/her secret key from the associated authority without interacting with any other party. While enjoying such fully decentralized processes, the proposed schemes are still secure against collusion attacks, i.e., multiple pieces issued to a user by different authorities can form a collusion resistant secret key, composed of these pieces, of the user. The proposed ABE scheme is the first DMA-ABE for non-monotone relations (and more general relations), which is adaptively secure under the decisional linear (DLIN) assumption in the random oracle model. This paper also proposes the first DMA-ABS scheme for non-monotone relations (and more general relations), which is fully secure, adaptive-predicate unforgeable and perfect private, under the DLIN assumption in the random oracle model. DMA-ABS is a generalized notion of ring signatures. The efficiency of the proposed DMA-ABE and DMA-ABS schemes is comparable to those of the existing practical ABE and ABS schemes with comparable relations and security.

关键词： attribute-based encryption attribute-based signatures decentralized multi-authority system non-monotone predicates

来源：评论

学校读者我要写书评

暂无评论

CCA-Secure attribute-based encryption Supporting Dynamic Membership in the Standard Model

CCA-Secure Attribute-Based Encryption Supporting Dynamic Mem...

引用

IEEE Conference on Dependable and Secure Computing (DSC)

作者： Fan, Chun-, I Tseng, Yi-Fan Feng, Cheng-Chun Natl Sun Yat Sen Univ Informat Secur Res Ctr Intelligent Elect Commerce Res Ctr Dept Comp Sci & Engn Kaohsiung Taiwan Natl Chengchi Univ Dept Comp Sci Taipei Taiwan Natl Sun Yat Sen Univ Dept Comp Sci & Engn Kaohsiung Taiwan

ISBN: (纸本)9781728175348

attribute-based encryption (ABE) is an access control mechanism where a sender encrypts messages according to an attribute set for multiple receivers. With fine-grained access control, it has been widely applied to cloud storage and file sharing systems. In such a mechanism, it is a challenge to achieve the revocation efficiently on a specific user since different users may share common attributes. Thus, dynamic membership is a critical issue to discuss. On the other hand, most works on LSSS-based ABE do not address the situation about threshold on the access structure, and it lowers the diversity of access policies. This manuscript presents an efficient attribute-based encryption scheme with dynamic membership by using LSSS. The proposed scheme can implement threshold gates in the access structure. Furthermore, it is the first ABE supporting complete dynamic membership that achieves the CCA security in the standard model, i.e. without the assumption of random oracles.

关键词： attribute-based encryption Linear secret sharing Chosen-ciphertext attacks Access Control

来源：评论

学校读者我要写书评

暂无评论

Efficient ciphertext-policy attribute-based encryption with blackbox traceability

引用

INFORMATION SCIENCES 2020年 538卷 19-38页

作者： Xu, Shengmin Yuan, Jiaming Xu, Guowen Li, Yingjiu Liu, Ximeng Zhang, Yinghui Ying, Zuobin Fujian Normal Univ Coll Math & Informat Fujian Prov Key Lab Network Secur & Cryptol Fuzhou 350007 Peoples R China Singapore Management Univ Secure Mobile Ctr Sch Informat Syst Singapore 178902 Singapore Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 611731 Sichuan Peoples R China Fuzhou Univ Coll Math & Comp Sci Fuzhou 350108 Peoples R China Xian Univ Posts & Telecommun Natl Engn Lab Wireless Secur Xian 710121 Peoples R China Anhui Univ Sch Comp Sci & Technol Hefei 230601 Anhui Peoples R China

Traitor tracing scheme is a paradigm to classify the users who illegal use of their decryption keys in cryptosystems. In the ciphertext-policy attribute-based cryptosystem, the decryption key usually contains the users' attributes, while the real identities are hidden. The decryption key with hidden identities enables malicious users to intentionally leak decryption keys or embed the decryption keys in the decryption device to gain illegal profits with a little risk of being discovered. To mitigate this problem, the concept of blackbox traceability in the ciphertext-policy attribute-based scheme was proposed to identify the malicious user via observing the I/O streams of the decryption device. However, current solutions with blackbox traceability are impractical since either the composite-order group or the linear complexity of system users is required. In this article, we proposed a secure ciphertext-policy attribute-based set encryption scheme with the short decryption key. The proposed scheme bases on the prime-order group to improve computational performances and aggregates multiple attributes into a constant-size attribute set to reduce the costs of communication overheads. By applying our proposed scheme with fingerprint codes, we then give an instantiation of the ciphertext-policy attribute-based scheme with blackbox traceability. Our scheme is provably secure under various q-type assumptions. (C) 2020 Elsevier Inc. All rights reserved.

关键词： Blackbox traceability attribute-based encryption Short decryption key

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：