Paper 2024/016
Reducing the computational complexity of fuzzy identity-based encryption from lattice
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 post-quantum 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.
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint.
- Keywords
- Attribute-Based Encryption (ABE)Fuzzy Identity-Based Encryptionaccess structurelatticeLearning with Errors (LWE)
- Contact author(s)
- se_khajouei_nejad @ yahoo com
- History
- 2024-01-05: approved
- 2024-01-04: received
- See all versions
- Short URL
- https://ia.cr/2024/016
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2024/016,
author = {Sedigheh Khajouei-Nejad and Hamid Haj Seyyed Javadi and Sam Jabbehdari and Seyed Mohammad Hossein Moattar},
title = {Reducing the computational complexity of fuzzy identity-based encryption from lattice},
howpublished = {Cryptology ePrint Archive, Paper 2024/016},
year = {2024},
note = {\url{https://eprint.iacr.org/2024/016}},
url = {https://eprint.iacr.org/2024/016}
}
