journal article·2023Open access

Attribute-Based Authentication Scheme from Partial Encryption for Lattice with Short Key

Wangke Yu, Shuhua Wang

Computers, Materials & Continua· Volume 75· Issue 1

Abstract

Wireless network is the basis of the Internet of things and the intelligent vehicle Internet. Due to the complexity of the Internet of things and intelligent vehicle Internet environment, the nodes of the Internet of things and the intelligent vehicle Internet are more vulnerable to malicious destruction and attacks. Most of the proposed authentication and key agreement protocols for wireless networks are based on traditional cryptosystems such as large integer decomposition and elliptic curves. With the rapid development of quantum computing, these authentication protocols based on traditional cryptography will be more and more threatened, so it is necessary to design some authentication and key agreement protocols that can resist quantum attacks. In this paper, an anti-quantum authentication scheme for wireless networks based on lattice cryptosystem is constructed. In the attribute-based authentication scheme, the length of the authenticated public-private key pair depends on the maximum order and complexity of the formula in the algorithm. In the attribute-based authentication scheme, there is a certain correlation between the authenticated data and the attribute value of the user in the scheme. We show that the attribute-based authentication scheme gives an attribute-based with smaller public-private key pairs. The security of the attribute-based authentication scheme is based on the sub-exponential hard problem of the LWE (Learning With Errors). The Q-poly made by the adversary in the scheme, and our attribute-based authentication scheme guarantees that private data about user attributes and ciphertext cannot be obtained by malicious attackers.
Source: openalex_inverted_index · Quality: baseline

Research context

OpenAlex topics: Cryptography and Data Security · Security in Wireless Sensor Networks · Advanced Authentication Protocols Security

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

References (40)

Show source-provided references
1. EAAP: Efficient anonymous authentication with conditional privacy-preserving scheme for vehicular ad hoc networks10.1109/TITS.2016.2634623 ↗
2. PA-CRT: Chinese remainder theorem based conditional privacy-preserving authentication scheme in vehicular ad-hoc networks10.1109/TDSC.2019.2904274 ↗
3. A blockchain-based public auditing protocol with self-certified public keys for cloud data
4. A new ADS-B authentication framework based on efficient hierarchical identity-based signature with batch verification10.1109/TSC.2015.2459709 ↗
5. An efficient lattice-based multi signature scheme with applications to bitcoins
6. Targeted homomorphic attribute-based encryption
7. A lattice-based provably secure multi signature scheme in quantum random oracle model
8. An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice10.1007/s00607-018-0689-3 ↗
9. Round optimal secure multi signature schemes from lattice with public key aggregation and signature compression
10. Practical lattice-based multi signature schemes for blockchains10.1109/ACCESS.2019.2958816 ↗
11. Fuzzy password-authenticated key exchange
12. Identity-based blind multi signature from lattices10.1109/ACCESS.2019.2959943 ↗
13. A new self-certified signature scheme based on ntrusing for smart mobile communications10.1007/s11277-017-4385-y ↗
14. Ciphertext policy attribute-based encryption for circuits from LWE assumption
15. An efficient self-certified multi-proxy signature scheme based on elliptic curve discrete logarithm problem10.1080/09720529.2020.1734293 ↗
16. On lattices, learning with errors, random linear codes, and cryptography
17. On lattices, learning with errors, random linear codes, and cryptography10.1145/1568318.1568324 ↗
18. Public-key cryptosystems from the worst-case shortest vector problem
19. Classical hardness of learning with errors
20. (Leveled) fully homomorphic encryption without bootstrapping
21. Bootstrapping homomorphic encryption in less than a second
22. Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
23. Stronger security for reusable garbled circuits, general definitions and attacks
24. Practical MP-LWE-based encryption balancing security-risk versus efficiency10.1007/s10623-019-00654-5 ↗
25. Lattice trapdoors and IBE from middle-product LWE
26. Approx-SVP in ideal lattices with pre-processing
27. Functional encryption with bounded collusions via multi-party computation
28. Partial garbling schemes and their applications
29. Predicate encryption for circuits from lwe
30. Trapdoors for hard lattices and new cryptographic constructions
31. Efficient lattice (H)IBE in the standard model
32. Bonsai trees, or how to delegate a lattice basis10.1007/s00145-011-9105-2 ↗
33. More efficient commitments from structured lattice assumptions
34. One-shot verifiable encryption from lattices
35. Lattice-based public key searchable encryption from experimental perspectives10.1109/TDSC.2018.2867462 ↗
36. Group signatures without NIZK: From lattices
37. A lattice-based fully dynamic group signature scheme without NIZK
38. Constant-size lattice-based group signature with forward security in the standard model
39. Memetic optimization with cryptographic encryption for secure medical data transmission in IoT-based distributed systems10.32604/cmc.2020.012379 ↗
40. Robust reversible audio watermarking scheme for telemedicine and privacy protection10.32604/cmc.2022.022304 ↗