Volume 16, Issue 1 (2-2024)                   itrc 2024, 16(1): 20-27 | Back to browse issues page

XML Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Khajouei-Nejad S, Haj Seyyed Javadi H, Jabbehdari S, Moattar S M H. Reducing The Computational Complexity of Fuzzy Identity-Based Encryption from Lattice. itrc 2024; 16 (1) :20-27
URL: http://ijict.itrc.ac.ir/article-1-574-en.html
1- North Tehran Branch, Islamic Azad University Tehran, Iran
2- Shahed University Tehran, Iran
3- North Tehran Branch, Islamic Azad University Tehran, Iran , S_jabbehdari@iau-tnb.ac.ir
4- Mashhad Branch, Islamic Azad University Mashhad, Iran
Abstract:   (972 Views)
—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. 
Full-Text [PDF 708 kb]   (369 Downloads)    
Type of Study: Research | Subject: Network

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.