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

identity-based broadcast encryption with continuous leakage resilience

INFORMATION SCIENCES 2018年 429卷 177-193页

作者： Li, Jiguo Yu, Qihong Zhang, Yichen Hohai Univ Coll Comp & Informat Nanjing 211100 Jiangsu Peoples R China Suqian Coll Sch Comp Sci Suqian 223800 Peoples R China

identity-based broadcast encryption (IBBE) is an important type of broadcast encryption. In the paper, we put forward the formal definition and security model of IBBE with leakage resilience. Furthermore, we propose an IBBE scheme with continuous leakage-resilience. The presented scheme is resilient to private key leakage. By refreshing the private key, our scheme can resist continuous private key leakage. based on dual system encryption technique, we prove the security of the proposed scheme under subgroup decisional assumptions. We give the specific performance analysis of leakage-resilience. The relative leakage ratio can amount to 1/3. (C) 2017 Elsevier Inc. All rights reserved.

关键词： identity-based broadcast encryption Private key leakage Dual system encryption

来源：评论

学校读者我要写书评

暂无评论

identity-based broadcast encryption with Outsourced Partial Decryption for Hybrid Security Models in Edge Computing 19

Identity-Based Broadcast Encryption with Outsourced Partial ...

引用

ACM Asia Conference on Computer and Communications Security (Asia CCS)

作者： Kim, Jongkil Camtepe, Seyit Susilo, Willy Nepal, Surya Baek, Joonsang Univ Wollongong Wollongong NSW Australia CSIRO Data61 Marsfield Australia

ISBN: (纸本)9781450367523

Each layer of nodes and communication networks in edge computing, from cloud to the end device (i.e, often considered as resource-constrained IoT devices), exhibits a different level of trust for each stakeholder - e.g., edge nodes may not be fully trusted by IoT devices and the cloud. Moreover, asymmetric nature of resources between layers makes it hard to establish a balance between security and performance - e.g., lightweight cryptography may degrade security level against untrusted nodes while heavyweight ones may not be feasible for the light-weight end devices. An advanced encryption scheme such as the identity-based broadcast encryption (IBBE) is a popular technique to reduce storage and communication overhead. However, IBBE requires heavy computation to the end devices and still does not fully satisfy the security requirements that exist in the layers of edge computing. This paper presents a new IBBE with outsourced partial decryption for hybrid security models that each layer in edge computing requires. It balances the computational overhead based on asymmetric nature that nodes in each layer have. Particularly, with new schemes, the ciphertext can be transformed from its initial format. The cloud encrypts their data for multiple end devices and store them in the edge nodes, but those interim nodes can blindly transform the ciphertext from the cloud into a form which (i) is decryptable by only an authorized end device, and (ii) imposes smaller decryption and data transmission burden to end devices, regardless of the number of recipients. Our security analysis shows that new schemes are selectively and adaptively secure. We implement our solution and show that new schemes reduce the communication overhead from an edge node to end devices and the computation overhead on the end devices, compared to the original IBBE schemes.

关键词： identity-based encryption identity-based broadcast encryption Outsourced decryption Edge computing

来源：评论

学校读者我要写书评

暂无评论

Adaptively Secure identity-based broadcast encryption With a Constant-Sized Ciphertext

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2015年第3期10卷 679-693页

作者： Kim, Jongkil Susilo, Willy Au, Man Ho Seberry, Jennifer Univ Wollongong Sch Comp Sci & Software Engn Ctr Comp & Informat Secur Res Wollongong NSW 2522 Australia Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China

In this paper, we present an adaptively secure identity-based broadcast encryption system featuring constant sized ciphertext in the standard model. The size of the public key and the private keys of our system are both linear in the maximum number of receivers. In addition, our system is fully collusion-resistant and has stateless receivers. Compared with the state-of-the-art, our scheme is well optimized for the broadcast encryption. The computational complexity of decryption of our scheme depends only on the number of receivers, not the maximum number of receivers of the system. Technically, we employ dual system encryption technique and our proposal offers adaptive security under the general subgroup decisional assumption. Our scheme demonstrates that the adaptive security of the schemes utilizing a composite order group can be proven under the general subgroup decisional assumption, while many existing systems working in a composite order group are secure under multiple subgroup decision assumptions. We note that this finding is of an independent interest, which may be useful in other scenarios.

关键词： Cryptography public key broadcast encryption identity-based broadcast encryption

来源：评论

学校读者我要写书评

暂无评论

Fully CCA2 secure identity-based broadcast encryption with black-box accountable authority

引用

JOURNAL OF SYSTEMS AND SOFTWARE 2012年第3期85卷 708-716页

作者： Zhao, Xingwen Zhang, Fangguo Sun Yat Sen Univ Sch Informat Sci & Technol Guangzhou 510275 Guangdong Peoples R China Guangdong Key Lab Informat Secur Technol Guangzhou 510275 Guangdong Peoples R China

The concept of accountable authority identity-based encryption was introduced as a convenient tool to reduce the amount of trust in authorities in identity-based encryption. In this model, if the Private Key Generator (PKG) maliciously re-distributes users' decryption keys, it runs the risk of being caught and prosecuted. Libert and Vergnaud proposed an accountable authority identity-based broadcast encryption, which allows white-box tracing or weak black-box tracing. Their scheme was proved only secure in selective-ID model. We present a weak black-box accountable authority identity-based broadcast encryption scheme, which is proven as fully CCA2 secure against adaptive adversary with tight reduction. Our scheme achieves O(m) public keys size, O(m) private keys size, and O(1) ciphertext length, where m is the maximum number of receivers allowed in each broadcast. (C) 2011 Elsevier Inc. All rights reserved.

关键词： identity-based broadcast encryption Black-box traceability Accountability

来源：评论

学校读者我要写书评

暂无评论

Cloud assisted semi-static secure accountable authority identity-based broadcast encryption featuring public traceability without random oracles

引用

ANNALS OF TELECOMMUNICATIONS 2023年第1-2期78卷 79-90页

作者： Singh, Amit Kumar Acharya, Kamalesh Dutta, Ratna IIT Kharagpur Dept Math Kharagpur 721302 W Bengal India Vellore Inst Technol Sch Adv Sci Div Math Chennai 600127 Tamil Nadu India

Cloud computing has gained widespread popularity in the industry and academia and rapidly becomes an integral part of our everyday life. It offers several benefits including reduced cost on technical support for data backups, saving electric power and maintenance cost. These encourage the major industry players like Google, IBM, Microsoft to invest into cloud storage with the goal to extend the spectrum of cloud-based services from open public to closed private. One of the crucial challenges in cloud computing is the security of outsourced data. Sharing sensitive data among multiple users under the same domain in a secure and efficient way requires technical solutions. identity-based broadcast encryption (IBBE) is an important building block in cryptography. This is a one to many encryption that broadcasts a message to many identities. In this paper, we address the key escrow problem of IBBE. As private key generator (PKG) generates secret keys for users, it has the capability to decrypt the ciphertext and recover the message. The accountable authority IBBE was introduced to give accountability in IBBE, where white-box A-IBBE can differentiate the creator of a given pirated private key between the PKG and suspected user and black-box A-IBBE can further trace the creator of a decoder box. In our construction, we have established the secret key by using zero-knowledge proof between the user and PKG. The decryption key is held by the user only. This restricts PKG to re-distribute keys maliciously and solves the key escrow problem. Inspired by the work of Zhao et al., we develop an accountable authority identity-based broadcast encryption scheme (A-IBBE). Our construction is the first publicly traceable weak black-box A-IBBE scheme secure against the indistinguishability under chosen-identity and chosen-plaintext attack in the standard model. We support the conjectured security of our candidate by analysis and prove its security without using any random oracle under the

关键词： Bilinear paring identity-based broadcast encryption Semi-static Weak black-box accountability

来源：评论

学校读者我要写书评

暂无评论

KeyD: Secure Key-Deduplication with identity-based broadcast encryption

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2021年第2期9卷 670-681页

作者： Liu, Ling Zhang, Yuqing Li, Xuejun Xidian Univ Sch Cyber Engn Xian 710071 Peoples R China Grad Univ Chinese Acad Sci Natl Comp Network Intrus Protect Ctr Beijing 100049 Peoples R China

Deduplication, which can save storage cost by enabling us to store only one copy of identical data, becomes unprecedentedly significant with the dramatic increase in data stored in the cloud. For the purpose of ensuring data confidentiality, they are usually encrypted before outsourced. Traditional encryption will inevitably result in multiple different ciphertexts produced from the same plaintext by different users' secret keys, which hinders data deduplication. Convergent encryption makes deduplication possible since it naturally encrypts the same plaintexts into the same ciphertexts. One attendant problem is how to reliably and effectively manage a huge number of convergent keys. Several deduplication schemes have been proposed to deal with the convergent key management problem. However, they either need to introduce key management servers or require interaction between data owners. In this paper, we design a novel client-side deduplication protocol named KeyD without such an independent key management server by utilizing the identity-based broadcast encryption (IBBE) technique. Users only interact with the cloud service provider (CSP) during the process of data upload and download. Security analysis demonstrates that KeyD ensures data confidentiality and convergent key security, and well protects the ownership privacy simultaneously. A thorough and detailed performance comparison shows that our scheme makes a better tradeoff among the storage cost, communication and computation overhead.

关键词： Data deduplication convergent encryption convergent key management identity-based broadcast encryption

来源：评论

学校读者我要写书评

暂无评论

Anonymous identity-based broadcast encryption technology for smart city information system

引用

PERSONAL AND UBIQUITOUS COMPUTING 2017年第5期21卷 841-853页

作者： He, Kai Weng, Jian Mao, Yijun Yuan, Huaqiang DongGuan Univ Technol Sch Comp & Network Secur Dongguan Guangdong Peoples R China Jinan Univ Dept Comp Sci Guangzhou Guangdong Peoples R China Shenzhen Univ Guangdong Prov Big Data Collaborat Innovat Ctr Shenzhen Peoples R China South China Univ Agr Sch Math & Informat Guangzhou Guangdong Peoples R China

A smart city can utilize information and communication technologies to minimize energy, waste, and resource consumption and attain high-efficiency services, so it directly improves the life quality of all residents. However, it also brings about some security and privacy challenges. For instance, once the ubiquitous network in the smart city is attacked, all of the sensitive information and residents' identities will be revealed. In many application scenarios, the anonymity of residents is a desirable security property. After all, nobody wants to be traced for his daily activity or personal habits. In this paper, we propose a generic identity-based broadcast encryption scheme which can satisfy information's confidentiality and users' anonymity simultaneously under chosen-ciphertext attacks. What is different from our previous work which was published in ACISP 2016 is that we present the proof of confidentiality and focus on the application environment. The generic IBBE construction has a desirable property that its public parameter size and private key size are constant as well as its decryption cost is independent of the number of receivers. Thus, no matter from which point of views, the construction is very appropriate for smart city information system.

关键词： Smart city identity-based broadcast encryption Anonymity Chosen-ciphertext security

来源：评论

学校读者我要写书评

暂无评论

Adaptively secure identity-based broadcast encryption with constant size private keys and ciphertexts from the subgroups

引用

MATHEMATICAL AND COMPUTER MODELLING 2012年第1-2期55卷 12-18页

作者： Zhang, Leyou Hu, Yupu Wu, Qing Xidian Univ Dept Math Sci Xian 710071 Shaanxi Provinc Peoples R China Xidian Univ Minist Educ Key Lab Comp Networks & Informat Secur Xian 710071 Shaanxi Provinc Peoples R China Xian Inst Posts & Telecommun Sch Automat Xian 710121 Shaanxi Provinc Peoples R China

The main challenge in building efficient broadcast systems is to encrypt messages with short ciphertexts. The well-known constructions of identity-based broadcast encryption (IBBE) with constant size ciphertexts in the standard model are based on the non-standard cryptography assumption. In addition, these constructions cannot solve the trade-off between the private keys and ciphertexts. These folklore construction methods lead to schemes that are somewhat inefficient and leave open the problem of finding more efficient direct constructions. In this paper, we give a secure identity-based broadcast encryption scheme with a constant-size ciphertext and private keys. It is constructed by using dual techniques in the subgroups. The proposed scheme achieves the full security (adaptive security) under three static (i.e. non q-based) assumptions. It is worth noting that only recently Waters's scheme achieves adaptive security under simple assumptions. One feature of our scheme is that it is relatively simple to get adaptive security. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： identity-based broadcast encryption Dual system encryption Full security Static assumption Subgroup

来源：评论

学校读者我要写书评

暂无评论

Efficient identity-based broadcast encryption without Random Oracles

引用

JOURNAL OF COMPUTERS 2010年第3期5卷 331-336页

作者： Hu, Liang Liu, Zheli Cheng, Xiaochun Jilin Univ Dept Comp Sci & Technol Changchun Jilin Peoples R China Middlesex Univ Dept Comp Commun London England

We propose a new efficient identity-based broadcast encryption scheme without random oracles and prove that it achieves selective identity, chosen plaintext security. Our scheme is constructed based on bilinear Diffie-Hellman inversion assumption and it is a good efficient hybrid encryption scheme, which achieves O (1) - size ciphertexts, public parameters and constant size private keys. In our scheme, either ciphertexts or public parameters has no relation with the number of receivers, moreover, both the encryption and decryption only require one pairing computation. Compared with other identity-based broadcast encryption schemes, our scheme has comparable properties, but with a better efficiency.

关键词： identity-based broadcast encryption Random oracles Bilinear Groups Bilinear Diffie-Hellman Assumption

来源：评论

学校读者我要写书评

暂无评论

Recipient Revocable identity-based broadcast encryption How to Revoke Some Recipients in IBBE without Knowledge of the Plaintext 16

Recipient Revocable Identity-Based Broadcast Encryption How ...

引用

11th ACM Asia Conference on Computer and Communications Security (ASIA CCS)

作者： Susilo, Willy Chen, Rongmao Guo, Fuchun Yang, Guomin Mu, Yi Chow, Yang-Wai Univ Wollongong Wollongong NSW 2522 Australia

ISBN: (纸本)9781450342339

In this paper, we present the notion of recipient-revocable identity-based broadcast encryption scheme. In this notion, a content provider will produce encrypted content and send them to a third party (which is a broadcaster). This third party will be able to revoke some identities from the cipher-text. We present a security model to capture these requirements, as well as a concrete construction. The ciphertext consists of k + 3 group elements, assuming that the maximum number of revocation identities is k. That is, the ciphertext size is linear in the maximal size of R, where R is the revocation identity set. However, we say that the additional elements compared to that from an IBBE scheme are only for the revocation but not for decryption. Therefore, the ciphertext sent to the users for decryption will be of constant size (i.e.,3 group elements). Finally, we present the proof of security of our construction.

关键词： identity-based broadcast encryption Recipients Revocation Constant Size

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：