Reducing The Computational Complexity of Fuzzy Identity-Based Encryption from Lattice

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Khajouei Nejad Sedigheh; Haj Seyyed Javadi Hamid; Jabbehdari Sam; Moattar Seyed Mohammad Hossein

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: International Journal of Information and Communication Technology Research Year:2024 | Volume:16 | Issue:1 Page(s): 20-27

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Reducing The Computational Complexity of Fuzzy Identity-Based Encryption from Lattice

Author(s)

Khajouei Nejad Sedigheh | Haj Seyyed Javadi Hamid | Jabbehdari Sam | Moattar Seyed Mohammad Hossein | Issue Writer Certificate

Keywords

Attribute-Based Encryption (ABE)

Fuzzy Identity-Based Encryption (FIBE)

policy

access structure

lattice

Learning with Errors (LWE)

Abstract

—In order to provide access control on encrypted data, Attribute-based encryption (ABE) defines each user using a set of attributes. Fuzzy identity-based encryption (FIBE) is a variant of ABE that allows for a threshold access structure for users. To address the potential threat posed by future quantum computers, this paper presents a postquantum fuzzy IBE scheme based on lattices. However, current lattice-based ABE schemes face challenges related to computational complexity and the length of ciphertext and keys. This paper aims to improve the performance of an existing fuzzy IBE scheme by reducing key length and computational complexity during the encryption phase. While negative attributes are not utilized in our scheme, we prove its security under the learning with error (LWE) hard problem assumption in the selective security model. These improvements have significant implications for the field of ABE.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans