Distributed Identity Authentication with Lenstra-Lenstra-Lovász Algorithm-Ciphertext Policy Attribute-Based Encryption from Lattices: An Efficient Approach Based on Ring Learning with Errors Problem.
Gespeichert in:
| Titel: | Distributed Identity Authentication with Lenstra-Lenstra-Lovász Algorithm-Ciphertext Policy Attribute-Based Encryption from Lattices: An Efficient Approach Based on Ring Learning with Errors Problem. |
|---|---|
| Autoren: | Yuan Q; Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China., Yuan H; Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China., Zhao J; Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China., Zhou M; Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China., Shao Y; State Grid Information Communication Branch, Beijing 100032, China., Wang Y; Faculty of Communication and Electronic Engineering, Qiqihar University, Qiqihar 161000, China., Zhao S; Network Information Center, Qiqihar University, Qiqihar 161006, China. |
| Quelle: | Entropy (Basel, Switzerland) [Entropy (Basel)] 2024 Aug 27; Vol. 26 (9). Date of Electronic Publication: 2024 Aug 27. |
| Publikationsart: | Journal Article |
| Sprache: | English |
| Info zur Zeitschrift: | Publisher: MDPI Country of Publication: Switzerland NLM ID: 101243874 Publication Model: Electronic Cited Medium: Internet ISSN: 1099-4300 (Electronic) Linking ISSN: 10994300 NLM ISO Abbreviation: Entropy (Basel) Subsets: PubMed not MEDLINE |
| Imprint Name(s): | Original Publication: Basel, Switzerland : MDPI, 1999- |
| Abstract: | In recent years, research on attribute-based encryption (ABE) has expanded into the quantum domain. Because a traditional single authority can cause the potential single point of failure, an improved lattice-based quantum-resistant identity authentication and policy attribute encryption scheme is proposed, in which the generation of random values is optimized by adjusting parameters in the Gaussian sampling algorithm to improve overall performance. Additionally, in the key generation phase, attributes are processed according to their shared nature, which reduces the computational overhead of the authorization authority. In the decryption phase, the basis transformation of the Lenstra-Lenstra-Lovász (LLL) lattice reduction algorithm is utilized to rapidly convert shared matrices into the shortest vector form, which can reduce the computational cost of linear space checks. The experimental results demonstrate that the proposed method not only improves efficiency but also enhances security compared with related schemes. |
| Competing Interests: | The authors declare no conflicts of interest. |
| Grant Information: | SJGY20220395 Project Name: Exploration and Practice of Building First Class Courses in Electronic Information Majors under the Background of New Engineering; 145309213 Fundamental Research Funds Heilongjiang Provincial Universities; LH2020F050 Heilongjiang Provincial Natural Science Foundation of China |
| Contributed Indexing: | Keywords: Lenstra–Lenstra–Lovász lattice reduction algorithm; encryption of policy attributes; identity authentication; lattice cryptography |
| Entry Date(s): | Date Created: 20240927 Latest Revision: 20240929 |
| Update Code: | 20250114 |
| PubMed Central ID: | PMC11431376 |
| DOI: | 10.3390/e26090729 |
| PMID: | 39330064 |
| Datenbank: | MEDLINE |
Full Text 
Full Text Finder 
Nájsť tento článok vo Web of Science Schreiben Sie den ersten Kommentar!