Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 3,683 papers for “attribute-based encryption”

Attribute‐Based Encryption

Qi Xia, Jianbin Gao, Daniel Adu Worae et al. · 2023

This chapter describes attribute-based encryption (ABE) and its advantages over the current cryptographic scheme. ABE provides less key overhead than other public key encryption algorithms, such as RSA, ElGamal, and identity-based encryption, when multiple users with varying access privileges exchange encrypted data. As ABE employs an access structure based on attributes in either the ciphertext or the secret key, it is able to provide fine-grained access control with the guarantee that a user can only decrypt a message if they satisfy the constraints imposed by the access structure. Important aspects of ABE are reviewed in this chapter, including the secret-sharing scheme, access structure constructions, properties, bilinear pairing, cryptographic assumptions, and security notions.

Cited by 1

Attribute-Based Encryption

Ankita Karale, Vladimir Poulkov, Milena Lazarova · EAI/Springer Innovations in Communication and Computing · 2021

Cited by 0

Attribute-based encryption

Ignatenko, T Tanya, Asim, M Muhammad · TU/e Research Portal (Eindhoven University of Technology) · 2014

A system for attribute-based encryption comprises a first encrypter (11) and a second encrypter (12). The first encrypter (11) comprises an input unit (1) for determining a message and a policy over a set of attributes, wherein the policy comprises a plurality of components, and a first cryptographic unit (2) for generating an encrypted representation of the message and an encrypted representation of the plurality of components. The second encrypter (12) comprises a receiving unit (3) for receiving the encrypted representation of the message and the encrypted representation of the plurality of components, and a second cryptographic unit (4) for transforming the encrypted representation of the message and the encrypted representation of the plurality of components into an attribute-based encrypted message associated with the policy.

Cited by 1

Attribute-based encryption implies identity-based encryption

Herranz Sotoca, Javier · LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) · 2017

In this study, the author formally proves that designing attribute-based encryption schemes cannot be easier than designing identity-based encryption schemes. In more detail, they show how an attribute-based encryption scheme which admits, at least, and policies can be combined with a collision-resistant hash function to obtain an identity-based encryption scheme. Even if this result may seem natural, not surprising at all, it has not been explicitly written anywhere, as far as they know. Furthermore, it may be an unknown result for some people: Odelu et al. in 2016 and 2017 have proposed both an attribute-based encryption scheme in the discrete logarithm setting, without bilinear pairings, and an attribute-based encryption scheme in the RSA setting, both admitting and policies. If these schemes were secure, then by using the implication proved in this study, one would obtain secure identity-based encryption schemes in both the RSA and the discrete logarithm settings, without bilinear pairings, which would be a breakthrough in the area. Unfortunately, the author presents here complete attacks of the two schemes proposed by Odelu et al.

Cited by 0Open access

Attribute‐based encryption implies identity‐based encryption

Javier Herranz · IET Information Security · 2017

In this study, the author formally proves that designing attribute‐based encryption schemes cannot be easier than designing identity‐based encryption schemes. In more detail, they show how an attribute‐based encryption scheme which admits, at least, and policies can be combined with a collision‐resistant hash function to obtain an identity‐based encryption scheme. Even if this result may seem natural, not surprising at all, it has not been explicitly written anywhere, as far as they know. Furthermore, it may be an unknown result for some people: Odelu et al . in 2016 and 2017 have proposed both an attribute‐based encryption scheme in the discrete logarithm setting, without bilinear pairings, and an attribute‐based encryption scheme in the RSA setting, both admitting and policies. If these schemes were secure, then by using the implication proved in this study, one would obtain secure identity‐based encryption schemes in both the RSA and the discrete logarithm settings, without bilinear pairings, which would be a breakthrough in the area. Unfortunately, the author presents here complete attacks of the two schemes proposed by Odelu et al .

Cited by 30Open access

Attribute‐based Encryption (ABE)

Qi Xia, Jianbin Gao, Daniel Adu Worae et al. · 2023

Attribute-based Encryption (ABE) Enables readers to understand applications of attribute-based encryption schemes in cloud computing with the support of blockchain technology With a focus on blockchain technology, Attribute-based Encryption (ABE) provides insight into the application of attribute-based encryption (ABE) schemes, discussing types of blockchains, fundamentals of blockchain, and how blockchains are constructed. Comprised of 16 chapters, the text provides an overview of the components that go into creating a dual ABE system of encryption proofs within the following: composite bilinear groups, dual pairing vector space framework, matrix pairing framework, framework for matrix pairing, and the application of cryptographic scheme on blockchain. The team of authors discuss the basic construction components of ABE and share the security models, including the selective and semi- adaptive security models, applying these to either prime order or composite order groups. The book also discusses the tools used for converting a composite order ABE scheme to prime order and an adaptive secure ABE scheme based on prime order. In Attribute-based Encryption (ABE), readers can expect to find information on: Mathematical background of ABE, covering group and cyclic group, elliptic curves, curve selection, supersingular curves, ordinary curves, and weil and tate pairing Basic construction components of ABE, covering access structure, monotone Boolean formula, linear secret-sharing scheme, and ordered binary decision diagram Tools for converting composite order ABE schemes to prime order, covering security assumptions and conversion based on vectors for preliminaries, scheme construction, and security proof technique Foundations of blockchain technology, covering blocks, miners, hash functions, and public key cryptography Attribute-based Encryption (ABE) is an essential resource for professionals working in the field of design and cybersecurity who wish to understand how to use blockchain and the ABE scheme to provide fine-grained access control in outsourced data on third-party cloud servers.

Cited by 2

Implementing Hierarchical Attribute Set Based Encryption Over Key-Policy Attribute Based Encryption

Densy John, Priyanka Surendran, Bindhya Thomas · 2023

The use of Internet and cloud storage is increasing daily and hence issues related to cloud security are also increasing day-by-day. In this research, we are trying to find a solution that will protect the data integrity and security of cloud data transfers and storage. Here we analyze the Key Policy-Attribute Based Encryption (KP-ABE) and Hierarchical Set Based Attribute based Encryption (HASBE) to find the speed of Execution Time, Data Security Rate, Data Integrity Rate and Space complexity. From the study we concluded that HASBE has a more powerful algorithm with less execution time, more secure and more integrated with less space complexity. HASBE has an ordered hierarchical structure of aligning cloud data. Both KP-ABE and HASBE are based on Attribute encryption where unique attributes like telephone number, email-id, personal id number which can identify a person uniquely will be used. Among the two algorithms it is found that HASBE is more efficient.

Cited by 0

Attribute-based encryption scheme with attribute revocation

Yijie He, Lin You, Ke Lian · WIT transactions on engineering sciences · 2015

Welcome to the WIT Press eLibrary - the home of the Transactions of the Wessex Institute collection, providing on-line access to papers presented at the Institute's prestigious international conferences and from its State-of-the-Art in Science & Engineering publications.

Cited by 0

A File Encryption System Based on Attribute Based Encryption

Jie Tong, Yihong Long, Quan Liu · 2021 17th International Conference on Computational Intelligence and Security (CIS) · 2021

Attribute Based Encryption (ABE) is a kind of public-key cryptosystem that is commonly used to protect file data security and achieve the fine-grained sharing of files. However, the existing attribute-based encryption algorithms are very complex and involve a large amount of additional cryptographic data, which is not convenient to implement. To solve this problem, an attribute-based data encryption scheme is proposed in this paper to achieve secure storage and access control of files. This system is convenient to implement and reliable in operation. In this file encryption system, the attribute private key is divided into a server-side secret share and a user-side secret share. When a user is authorized to access a file, the client and the server decrypt the encrypted file by collaborative computation using the user-side secret shares and server-side secret shares of the user's attribute private keys.

Cited by 6