Attribute-based Broadcast Encryption Research Articles

Anonymous attribute-based broadcast encryption with hidden multiple access structures

Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the correct participant but also respects the security of the identity user. In addition, when delivered, all the information must be protected for the party who employs the broadcasting service. Currently, Attribute-Based Broadcast Encryption (ABBE) is useful to apply for the broadcasting service. (ABBE) is a combination of Attribute-Based Encryption (ABE) and Broadcast Encryption (BE), which allows a broadcaster (or encrypter) to broadcast an encrypted message, including a predefined user set and specified access policy to install the authorization mechanism. It is desirable to hide all the information when producing in the ciphertext, which has not been considered in the previous works of ABBE. Motivated by the above issue, we devise a solution to achieve anonymity for the ABBE scheme, which not only hides the access structures but also anonymizes the user’s identity. In this work, we propose two schemes as Anonymous Key Policy (AKP)-ABBE and Anonymous Ciphertext Policy (ACP)-ABBE with supporting multiple access structures by using OR/AND\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {OR}/\ extsf {AND}$$\\end{document} gates. Specifically, we present the generic constructions of AKP/ACP-ABBE on the building block of the Inner Product Encryption (IPE\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {IPE}$$\\end{document}), which enables the hidden user’s identity and complex OR/AND\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ extsf {OR}/\ extsf {AND}$$\\end{document}-Gate access structure. We show that our proposed schemes are secured under the standard models.

Adaptively secure multi-authority attribute-based broadcast encryption in fog computing

Fog computing is considered an important development in cloud computing, with shorter response times, less data transfer load and a more secure distributed service architecture that can be accessed by a wide range of end devices. As with cloud computing, it also faces the challenge of how to securely distribute sensitive data. Ciphertext-Policy Attribute-based Broadcast Encryption (CP-ABBE) can protect sensitive data and provide fine-grained access control with user revocation. However, existing CP-ABBE schemes suffer many limitations when implemented in a fog computing environment: a single authority performs poorly in handling requests or data from many IoT devices, leading to system delays or limited functionality; expensive decryption costs make the computation and storage overheads unfriendly to devices with limited resources; these schemes are only proven selectively secure, meaning that security was proven in a weaker model. In this paper, using threshold secret sharing and decryption delegation, we propose an adaptively secure attribute-based multi-authority broadcast encryption (MA-ABBE) scheme that breaks through these limitations. The comparison and analysis results show that our scheme is practical and achieves adaptive security, enables user-side fast decryption and low storage overhead, and provides a secure and efficient option for protecting sensitive data in fog computing environments.

Privacy-preserving fully anonymous ciphertext policy attribute-based broadcast encryption with constant-size secret keys and fast decryption

Cloud computing is admired as a notable computing terminology in which facilities of the computing framework are rendered as aid over Internet services. In the era of cloud computing, lightweight devices can be used to afford remote e-healthcare, which facilitates the development of remote healthcare consultations, monitoring of patients’ health reports, and medical research. The downside of the cloud environment is that it does not support direct revocation with fine-grained access control over encrypted data by specifying access policies among ciphertexts and consumers’ secret-keys. Ciphertext Policy Attribute-Based Broadcast Encryption (CP-ABBE) can be deployed in a cloud computing environment to ensure fine-grained access control of outsourced data. In a CP-ABBE, consumers’ secret-keys are associated with attributes. Broadcaster encrypts the data concerning a subscriber set and an access policy. Legitimate consumers can recover the correct data if and only if the data file access policy satisfies the attributes associated with the consumers’ secret-keys. However, existing CP-ABBE schemes fail to withstand social engineering attacks, meaning that those are incapable of accomplishing consumers’ full anonymity as well as privacy of access policy, which are highly sensitive information in e-healthcare scenario. To mitigate these deficiencies, we introduce a new CP-ABBE, called privacy-preserving fully anonymous CP-ABBE, by tweaking an identity-based encryption framework over the most advanced and secure Type-3 bilinear pairings. In addition to being adaptively secure, our construction endures indistinguishable chosen-plaintext attack security under standard asymmetric decisional bilinear Diffie–Hellman assumption without using the random oracle model. In particular, the design is very efficient both in terms of parameter sizes and computation costs, as consumer secret-key and decryption time both are constant, and ciphertext-size is independent of access policy. The implementation and performance analysis of the protocol in opposition to existing works illustrate its effectiveness in providing healthcare services in the cloud environment.

Attribute-Based Privacy-Preserving Data Sharing for Dynamic Groups in Cloud Computing

The sharing of personal data with multiple users from different domains has been benefited considerably from the rapid advances of cloud computing, and it is highly desirable to ensure the sharing file should not be exposed to the unauthorized users or cloud providers. Unfortunately, issues such as achieving the flexible access control of the sharing file, preserving the privacy of the receivers, forming the receiver groups dynamically, and high efficiency in encryption/decryption still remain challenging. To deal with these challenges, we provide a novel anonymous attribute-based broadcast encryption (A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> E) which features the property of hidden access policy and enables the data owner to share his/her data with multiple participants who are inside a predefined receiver set and fulfill the access policy. We first suggest a concrete A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> E scheme together with the rigorous and formal security proof without the support of the random oracle model. Then, we design an efficient and secure data sharing system by incorporating the A <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> E scheme, verifiable outsourcing decryption technique for attribute-based encryption, and the idea of online/offline attribute-based encryption. Extensive security analysis and performance evaluation demonstrate that our data sharing system is secure and practical.

Partially policy-hidden attribute-based broadcast encryption with secure delegation in edge computing

The rapid growth of data has successfully promoted the development of edge computing, which is used for processing the data at the edge of network. The emergence of edge computing compensates for the network delay caused by massive data uploads to the cloud. However, the issues of data security and privacy protection still need to be resolved. In this paper, we propose an efficient ciphertext-policy attribute-based encryption (CP-ABE) scheme that for the first time simultaneously achieves partially hidden policy, direct revocation, and verifiable outsourced decryption. Specifically, in our scheme, the concept of partially hidden policy is introduced to protect private information in an access policy. In addition, after a revocation is successfully executed, the revoked users will not be able to access the message without affecting any other non-revoked users. Our new scheme leverages the outsourcing technique to minimize the overhead required of the user. We demonstrate that our scheme is secure under the Decisional (q−1) Diffie–Hellman assumption and the Decisional Bilinear Diffie–Hellman assumption, as well as evaluating its performance using simulations.

Multi-Authority with Access Policy Attribute-based Broadcast Encryption Algorithm

Multi-Authority with Access Policy Attribute-based Broadcast Encryption Algorithm

An Attribute-Based Broadcast Encryption Scheme Suitable for the Broadcasting Network

An Attribute-Based Broadcast Encryption Scheme Suitable for the Broadcasting Network

Attribute‐based broadcast encryption scheme for lightweight devices

Lightweight devices, such as a smartcard associated with a top-box decoder in pay-TV or a SIM card coupled with a powerful (but not totally trusted) smartphone, play an important role in modern applications. The essential requirements for a cryptographic scheme to be truly implemented in lightweight devices are that it should have compact secret key size and support fast decryption. Attribute-based broadcast encryption (ABBE) combines the functionalities of both broadcast encryption and attribute-based encryption in an efficient way, ABBE is therefore a promising cryptographic scheme to be used in practical applications such as mobile pay-TV, satellite transmission, or Internet of Things. Designing an ABBE scheme which can be truly implemented in lightweight devices is still an open question. In this study, the authors solve it by proposing an efficient constant-size private key ciphertext-policy ABBE scheme for disjunctive normal form supporting fast decryption and achieving standard security levels of an ABBE scheme. They concretely show that the authors’ scheme can be truly implemented in a prototype for a smartphone-based cloud storage use case. In particular, they show how to alleviate some parts of their scheme so as to obtain a very practical system, and they give some concrete benchmarks.

Computational friendly attribute-based encryptions with short ciphertext

We propose two Key-Policy Attribute-Based Encryption (KP-ABE) schemes for Linear Secret-Sharing Scheme (LSSS)-realizable Monotone Access Structure (MAS). We show that the first construction is secure against Chosen Plaintext Attacks (CPAs) while the second scheme is secure against Chosen Ciphertext Attacks (CCAs), without introducing any random oracle heuristic. Both the schemes enjoy constant-size ciphertext, constant number of pairing operations, and constant computation cost during encryption and decryption. We further propose two non-monotone access structure variants, one is CPA secure and another is CCA secure, preserving the same functionality as that of MAS primitives. We thereafter present a large attribute universe KP-ABE for MAS, still utilizing low computation cost together with constant number of pairing operations and public parameters. Unlike the existing approaches, this does not impose a bound on the size of attribute sets used in encryption, however, the security is in random oracle model. Our final result is a dual-policy ABE supporting LSSS-realizable MAS with significantly low communication and computation cost. Furthermore, we extend our KP-ABE to efficient key-policy attribute-based broadcast encryption. While the secret key in all our constructions has quadratic-size in the number of attributes, the number of pairing evaluations is constant. The CPA and CCA security against selective-adversary of proposed schemes are achieved under the decisional Bilinear Diffie–Hellman Exponent assumption over prime order groups.

Full Secure Attribute-Based Broadcast Encryption Achieved through Selective Techniques

According to the broadcast encryption scheme couldn’t consider its security and efficiency in one model simultaneously, a full secure attribute-based broadcast encryption achieved through selective techniques was proposed. The scheme can achieve constant-size ciphertext in the standard model. By utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security, it is proved by combining the dual system encryption argument and the static assumptions. The analysis results show that the scheme of this paper is full secure.

Efficient ABBE for Improving Cloud Security in a Dynamically Changing User Environment

The existing scenario to store a large amount of data in a centralized server is complex as the information stored is immense. To avert this organizations move to cloud this causes some security issues. The paper focuses on ABBE (Attribute Based Broadcast Encryption) which is an enhancement of ABE (Attribute Based Encryption) which uses ABE to encrypt the data (AES key) and then broadcasts the cipher in order to provide fine grained access. This also avoids collusion and excess key generation. In addition to this multiple data owner scenario scheme is part of our proposal wherein the whole system is divided into multiple domains. AES encryption is used to encrypt data and ABBE to encrypt the AES key to be broadcasted. ABBE has minimized implementation complexity and less effort with respect to computation when compared to that of ABE. This imposes no limit on the attribute’s size, when those attributes sets are used for encryption and has a huge attribute universe. Also the cost of cryptographic functions like encryption and decryption is minimum. It also enables modification of accessibility or modification of attributes dynamically and also it supports effective user or attribute revocation as per the demand. By having multiple domains the management complexity of keys is also minimum. This novel framework is developed for educational institutions to securely share the information through cloud.

Efficient Privacy-Preserving Ciphertext-Policy Attribute Based-Encryption and Broadcast Encryption

A new construction of CP-ABE, named Privacy Preserving Constant CP-ABE (PPC-CP-ABE) that significantly reduces the ciphertext to a constant size with any given number of attributes is disclosed. PPCCP-ABE leverages a hidden policy construction such that the recipients' privacy is preserved efficiently. A Privacy Preserving Attribute Based Broadcast Encryption (PP-AB-BE) scheme is disclosed. PP-AB-BE is flexible because a broadcasted message can be encrypted by an expressive hidden access policy, either with or without explicit specifying the receivers. PP-AB-BE significantly reduces the storage and communication overhead. Also, PP-AB-BE attains minimal bound on storage overhead for each user to cover all possible subgroups in the communication system.

Secure personal data sharing in cloud computing using attribute-based broadcast encryption

The ciphertext-policy (CP) attribute-based encryption (ABE) (CP-ABE) emergings as a promising technology for allowing users to conveniently access data in cloud computing. Unfortunately, it suffers from several drawbacks such as decryption overhead, user revocation and privacy preserving. The authors proposed a new efficient and privacy-preserving attribute-based broadcast encryption (BE) (ABBE) named EP-ABBE, that can reduce the decryption computation overhead by partial decryption, and protect user privacy by obfuscating access policy of ciphertext and user's attributes. Based on EP-ABBE, a secure and flexible personal data sharing scheme in cloud computing was presented, in which the data owner can enjoy the flexibly of encrypting personal data using a specified access policy together with an implicit user index set. With the proposed scheme, efficient user revocation is achieved by dropping revoked user's index from the user index set, which is with very low computation cost. Moreover, the privacy of user can well be protected in the scheme. The security and performance analysis show that the scheme is secure, efficient and privacy-preserving.

An Improved Attribute-based Broadcast Encryption Algorithm based on the Augmented Broadcast Encryption

An Improved Attribute-based Broadcast Encryption Algorithm based on the Augmented Broadcast Encryption

Secure Sharing of Personal Health Records in Cloud Computing using Attribute-based Broadcast Encryption

Personal Health Record (PHR) service is an emerging model for health information exchange. It allows patients to create, update and manage personal and medical information. Also they can control and share their medical information with other users as well as health care providers. PHR data is hosted to the third party cloud service providers in order to enhance its interoperability. However, there have been serious security and privacy issues in outsourcing these data to cloud server. For security, encrypt the PHRs before outsourcing. So many issues such as risks of privacy exposure, scalability in key management, flexible access and efficient user revocation, have remained the most important challenges toward achieving fine-grained, cryptographically enforced data access control. To achieve fine-grained and scalable data access control for client’s data, a novel patient-centric framework is used. This frame work is mainly focus on the multiple data owner scenario. A high degree of patient privacy is guaranteed simultaneously by exploiting multi authority ABE. This scheme also enables dynamic modification of access policies or file attributes, support efficient on demand user/attribute revocation. However some practical limitations are in building PHR system. If consider the workflow based access control scenarios, the data access right could be given based on users identities rather than their attributes, while ABE does not handle that efficiently. For solving these problem in this thesis proposed PHR system, based on Attribute Based Broadcast Encryption (ABBE).

이진트리 기반의 속성기반 암호전송 알고리즘

In this paper, we present two constructions of the attribute-based broadcast encryption(ABBE) algorithm. Attribute-based encryption(ABE) algorithm enables an access control mechanism over encrypted data by specifying access policies among private keys and ciphertexts. ABBE algorithm can be used to construct ABE algorithm with revocation mechanism. Revocation has a useful property that revocation can be done without affecting any non-revoked uers. The main difference between our algorithm and the classical ones derived from the complete subtree paradigm which is apt for military hierarchy. Our algorithm improve the efficiency from the previously best ABBE algorithm, in particular, our algorithm allows one to select or revoke users by sending ciphertext of constant size with respect to the number of attributes and by storing logarithm secret key size of the number of users. Therefore, our algorithm can be an option to applications where computation cost is a top priority and can be applied to military technologies in the near future.