Anonymous Authentication Scheme Research Articles

An efficient anonymous authentication scheme for blockchain assisted and fog-enabled smart grid

The growing integration of blockchain and fog computing with Smart Grid (SG) technologies highlights the need for strong security protocols, dependable communication channels, and sensitive user data protection. In order to meet the unique needs of SG, this research paper presents a novel and effective anonymous authentication scheme enhanced by fog computing and blockchain. The suggested scheme makes use of blockchain's decentralized structure to strengthen security protocols and ensure user privacy and anonymity within the SG ecosystem. Through the combination of fog computing's low latency benefits and blockchain's immutability, the suggested scheme creates a robust framework for secure authentication. The suggested approach gives considerable weight to reducing computational overhead and optimizing user identity privacy. Through comprehensive analysis, the study highlights the scheme's efficiency concerning authentication speed, resource utilization, and resilience against potential attacks. These results offer an important remedy for the ever-changing landscape of energy management systems and substantially advance the development of safe and privacy-preserving SG architectures.

BIAS: A novel secure and efficient biometric-based anonymous authentication scheme

Currently, biometric-based authentication schemes are widely adopted in the field of online payments. Consequently, this has led to an increasing number of people becoming concerned about the privacy-preservation of their biometric data. Gunasinghe et al. presented PrivBioMTAuth, a solution for mobile phone biometric-based authentication designed to protect users’ privacy. However, the solution has drawbacks, such as its impact on the execution efficiency of the authentication protocol or its vulnerability to man-in-the-middle attacks during the authentication phase. Moreover, the user’s biometric image and the password must be revealed to the identity provider, which may raise security concerns. In this work, we present a novel secure and efficient biometric-based anonymous authentication solution with fully succinct verification and significantly lower storage and communication overhead. Different from PrivBioMTAuth, we rely on the NIZK argument given in Groth’s work to reduce the size of the anonymous identity and simplify the verification complexity. In addition, we design a high-performance protocol for conducting large-scale verification of the user’s anonymous identities. We propose an optimized multi-exponentiation argument based on Bayer et al.’s work and utilize it to ensure that a semi-trusted identity provider who seeks to access the users’ sensitive biometric information can faithfully execute the users’ identity registration protocol. The experiment results show that our proposed scheme is efficient and has privacy-preserving capabilities, and it can be applied in the resource-constrained devices.

Scalable Anonymous Authentication Scheme Based on Zero-Knowledge Set-Membership Proof

In this paper, we propose zero-knowledge named proof, a stateless replay attack prevention strategy that ensures the user’s anonymity against malicious administrators. We begin with adopting the zero-knowledge set-membership proof into an authentication setting in which users would delegate their requests to an agent that obstructs the user’s identity from the administrator. This anonymous agent carries the guarantee of authenticity, which the administrator through the set-membership proof can confirm. Next, we prevent replay attacks from other parties by binding the agent’s identity to the authentication proof verifiable by the administrators. By leveraging these properties, a scalable blockchain-based authentication scheme is then built. We quantitatively evaluate the security and measure the time and monetary cost of our scheme under both ideal and realistic environments. On top of it, we provide a third-party authorization scheme derived from our authentication framework to demonstrate its real-world applicability.

Efficient Anonymous Authentication and Group Key Distribution Scheme Based on Quantum Random Numbers for VANETs

Efficient Anonymous Authentication and Group Key Distribution Scheme Based on Quantum Random Numbers for VANETs

DCPFS: A Conditional Privacy-Preserving Authentication Scheme with Dual Cuckoo Pseudonym Filters for Vanets

With the increasing frequency of information dissemination and exchange, the attention paid to security and privacy in the Internet of Vehicles (IoV) is also on the rise. To protect user privacy, many anonymous authentication scheme have been proposed. These schemes assign pseudonyms to vehicles to hide their true identities when communicating with other vehicles or Roadside Units (RSUs). However, existing schemes also face pseudonym issues such as pseudonym abuse, high storage overhead, and low query efficiency. Motivated by this, we propose an RSU-based pseudonym assistance management scheme. In this scheme, RSUs employ dual cuckoo pseudonym filters to manage pseudonyms, effectively improving pseudonym query efficiency, preventing pseudonym abuse, and reducing storage overhead. Additionally, security and performance analyses demonstrate that the proposed protocol offers stronger security features and lower overhead. Besides, our scheme has reduced the generation time of pseudonym to only 0.0039 ms.

PUF-Based Robust and Anonymous Authentication and Key Establishment Scheme for V2G Networks

PUF-Based Robust and Anonymous Authentication and Key Establishment Scheme for V2G Networks

An Anonymous Authenticated Group Key Agreement Scheme for Transfer Learning Edge Services Systems

The visual information processing technology based on deep learning (DL) can play many important yet assistant roles for unmanned aerial vehicles (UAV) navigation in complex environments. Traditional centralized architectures usually rely on a cloud server to perform model inference tasks, which can lead to long communication latency. Using transfer learning (TL) to unload deep neural networks (DNN) to the edge-fog collaborative networks has become a new paradigm for dealing with the conflicts between computing resources and communication latency. However, ensuring the security of edge-fog collaborative networks entity is still challenging. For such, we propose an anonymous authentication and group key agreement scheme for the UAV-enabled edge-fog collaborative networks, consisting of UAV authentication protocol and collaborative networks authentication protocol. Utilizing the AVISPA assessment tool and security analysis, the security requirements and functional features of the proposed scheme are demonstrated. From the performance results of the proposed scheme, we show that it is superior to existing authentication schemes and promising.

Dynamic Privacy-Preserving Anonymous Authentication Scheme for Condition-Matching in Fog-Cloud-Based VANETs.

Secure group communication in Vehicle Ad hoc Networks (VANETs) over open channels remains a challenging task. To enable secure group communications with conditional privacy, it is necessary to establish a secure session using Authenticated Key Agreement (AKA). However, existing AKAs suffer from problems such as cross-domain dynamic group session key negotiation and heavy computational burdens on the Trusted Authority (TA) and vehicles. To address these challenges, we propose a dynamic privacy-preserving anonymous authentication scheme for condition matching in fog-cloud-based VANETs. The scheme employs general Elliptic Curve Cryptosystem (ECC) technology and fog-cloud computing methods to decrease computational overhead for On-Board Units (OBUs) and supports multiple TAs for improved service quality and robustness. Furthermore, certificateless technology alleviates TAs of key management burdens. The security analysis indicates that our solution satisfies the communication security and privacy requirements. Experimental simulations verify that our method achieves optimal overall performance with lower computational costs and smaller communication overhead compared to state-of-the-art solutions.

Blacklisting Based Anonymous Authentication Scheme for Sharing Economy

Authentication and blacklisting mechanisms have a key role for service providers to deliver the service to correct users through digital channels. Nevertheless, there always have been concerns about privacy of the users against such mechanisms. The conditional anonymity concept is proposed as a remedy to these concerns. A recent approach in the literature for conditional anonymity is blacklistable anonymous credentials, which allows service providers to blacklist users for an authentication session without identifying the user. In this paper, we improve user anonymity in conditionally anonymous schemes using two complementary mechanisms. First, we define whitelisting property for blacklistable anonymous credentials and give a construction of this scheme. The whitelisting property can be used to unlink an honestly behaved authentication session from the user. Second, we propose an extension of this scheme for a particular use case, sharing economy services. This scheme allows a service provider to blacklist a user only if the user have not returned the shared asset in due time. We benchmark the performance of our schemes by comparing them with the rival schemes. Our experiments show that both of our scheme have comparable performance to previous works.

LAAKA: Lightweight Anonymous Authentication and Key Agreement Scheme for Secure Fog-Driven IoT Systems

Fog computing is a new computing model with limited resources located near the Internet of Things (IoT) devices to provide low transmission delay, mobility, and location awareness services. However, fog technology not only extends the cloud resources but also inherits its properties and security problems, such as device capture, man-in-the-middle, secret key compromise, identity impersonation, and message replay attacks. These vulnerabilities pose significant risks to the integrity of IoT-fog communications. Nevertheless, the existing mutual authentication approaches either suffer from high computational overheads or fail to provide secure mutual authentication. To address this gap, this paper introduces LAAKA, a Lightweight Anonymous Authentication and Key Agreement scheme. Considering the constrained resources of IoT and fog devices, LAAKA utilizes lightweight operations such as hash function and bitwise XOR. Its main objective is to facilitate mutual authentication and establish secure session keys between IoT devices and fog servers, making it useful for various IoT applications. We validate the robustness of LAAKA against various security threats by conducting comprehensive formal security analysis, including Burrows-Abadi-Needham (BAN) logic and Random Oracle Model (ROM), as well as informal analysis. The efficacy of our scheme is further demonstrated through evaluation with the Scyther tool. Compared to other proposed authentication approaches, the results illustrate the superior performance and efficiency of our approach in enhancing the security features, minimizing the computational cost, and optimizing storage utilization.

Secure and Anonymous Authentication Scheme for Mobile Edge Computing Environments

Secure and Anonymous Authentication Scheme for Mobile Edge Computing Environments

Retracted: An Anonymous Authentication Scheme in VANETs of Smart City Based on Certificateless Group Signature

Retracted: An Anonymous Authentication Scheme in VANETs of Smart City Based on Certificateless Group Signature

An anonymous authentication and secure data transmission scheme for the Internet of Things based on blockchain

An anonymous authentication and secure data transmission scheme for the Internet of Things based on blockchain

Lattice-Based Cryptography and Fog Computing Based Efficient Anonymous Authentication Scheme for 5G-Assisted Vehicular Communications

Lattice-Based Cryptography and Fog Computing Based Efficient Anonymous Authentication Scheme for 5G-Assisted Vehicular Communications

LCAA: Lightweight Conditional Anonymous Authentication Scheme for Vehicular Carbon Emissions Environment

LCAA: Lightweight Conditional Anonymous Authentication Scheme for Vehicular Carbon Emissions Environment

Anonymous Authentication Scheme for Fog-Assisted V2G Networks

Anonymous Authentication Scheme for Fog-Assisted V2G Networks

An Anonymous Authentication Scheme for Internet of Vehicles Based on TRUG-PBFT Master-Slave Chains and Zero-Knowledge Proof

An Anonymous Authentication Scheme for Internet of Vehicles Based on TRUG-PBFT Master-Slave Chains and Zero-Knowledge Proof

An efficient key agreement and anonymous privacy preserving scheme for vehicular ad‐hoc networks with handover authentication

SummaryVehicular ad‐hoc networks (VANETs) have gained significant attention in recent years due to their potential to improve the safety and efficiency of transportation systems. VANETs are a type of wireless ad‐hoc network that enables communication between vehicles and between vehicles and roadside infrastructure. VANETs can also improve the efficiency of transportation systems by reducing traffic congestion and improving traffic flow. In addition to improving safety and efficiency, VANETs also face several challenges. One of the biggest challenges is ensuring the security and privacy of the data transmitted over the network. In this manuscript, an anonymous authentication scheme for VANET users is proposed along with privacy preservation and confidentiality. An efficient session key agreement protocol is designed for transferring location‐based information between the vehicle user and the roadside unit (RSU). Further, updated session keys are transferred to the subsequent RSU, when the vehicle user moves to another location. Moreover, re‐authentication of VANET users is completely evaded during to handover authentication, thus reducing the computational overhead. In addition, Resistance to different security assaults is discussed in this work through informal analysis. Finally, performance is compared with different relevant schemes and validated through Cygwin software.

A Lightweight Anonymous Authentication and Key Negotiation Scheme in Smart Home Environments

With the rapid development of Internet of Things (IoT) technology, smart home users can access and control smart devices remotely to enjoy convenient and efficient services. However, sensitive data collected by smart devices is vulnerable to attacks such as eavesdropping and simulation when transmitted through public channels. At the same time, the security of resource-constrained smart devices is low, and attackers may use the controlled devices to carry out malicious operations further. To address the aforementioned existing security issues, this paper proposes a lightweight user anonymous authentication scheme for resource-constrained smart home environments. At the same time, the security analysis is carried out to further prove the proposed scheme's security. Finally, the performance analysis between the proposed scheme and the existing similar schemes proves that the proposed scheme has advantages in calculation cost and safety characteristics.

A dynamic anonymous authentication scheme with trusted fog computing in V2G networks

As an important component of smart grid, vehicle-to-grid (V2G) is helpful to improve grid stability, save on generation costs, and reduce energy consumption. However, the existing V2G authentication schemes focus on the trustworthiness of electric vehicles (EVs), instead of the trustworthiness of fog servers (FSs). For unsuspecting EVs, malicious FSs may steal their sensitive data and compromise privacy. We propose a dynamic anonymous authentication scheme with trusted fog computing in V2G networks. In our scheme, to ensure the trustworthiness of the FSs in V2G networks, a collaborative trust evaluation model among FSs is designed. The trust value of FSs can be calculated by comprehensively analyzing the timeliness, authenticity, and execution of FSs' behavior in the collaboration process. Meanwhile, trust evaluation is incorporated into the dynamic anonymous authentication scheme against malicious FSs and ensure a trusted environment of EVs in the authentication process. During the authentication process, to avoid the key escrow and computational overhead of FSs, the certificateless mechanism and aggregated signatures of non-linear pairs are used. We use a combination of long-term anonymity (LID) and temporary anonymity (TID) to ensure the anonymity and the signatures freshness of EVs. Finally, security proofs based on random oracle models and non-formal security analysis show that our scheme satisfies seven security requirements and resists five common attacks. The simulation results show that, in comparison with the five reference schemes, our scheme reduces average computational and communication overheads by 80.05% and 47.68%, respectively.