Efficient Anonymous Authentication Protocol Research Articles

An efficient anonymous authentication protocol in multiple server communication networks (EAAM)

In a multi-server authentication environment, a user only needs to register once at a central registration place before accessing the different services on the different registered servers. Both, from a user point of view as for the management and maintenance of the infrastructure, these types of environments become more and more popular. Smartcard- or smartphone-based approaches lead to more secure systems because they offer two- or three-factor authentication, based on the strict combination of the user’s password, the user’s biometrics and the possession of the device. In this paper, we propose an efficient anonymous authentication protocol in multiple server communication networks, called the EAAM protocol, which is able to establish user anonymity, mutual authentication, and resistance against known security attacks. The novelty of the proposed scheme is that it does not require a secure channel during the registration between the user and the registration center and is resistant to a curious but honest registration system. These features are established in a highly efficient way with the minimum amount of communication flows between user and server during the establishment of the secret shared key and by using light-weight cryptographic techniques such as Chebyshev chaotic map techniques and symmetric key cryptography. The performance and security of the protocol are analyzed and compared with the latest new proposals in this field.

An efficient anonymous authentication protocol using batch operations for VANETs

Security and privacy are both fundamental requirements of vehicular networking applications. Existing anonymous authentication protocols entail serious performance issues due to serialized verification operations. This paper presents an efficient anonymous authentication protocol based on signature with message recovery. Different from existing solutions, our proposed protocol authenticates multiple signatures using batch operations. Therefore, our solution can remarkably reduce the total authentication time. Meanwhile the transmission overhead can also be considerably decreased due to the combination of signature and message. We also prove the unforgeability of our proposed protocol in the random oracle model. Through extensive analysis and simulations, we show that the proposed protocol outperforms existing ones in terms of communication and computation efficiency.

On the Security of Anonymous Authentication Protocol for Mobile Pay-TV

One of the promising multimedia services is the mobile pay-TV service. Due to its wireless nature, mobile pay-TV is vulnerable to attacks especially during hand-off. In 2011, an efficient anonymous authentication protocol for mobile pay-TV is proposed. The authors claim that their scheme provides an anonymous authentication to users by preventing intruders from obtaining users’ IDs during the mutual authentication between mobile subscribers and head end systems. However, after analysis, it was found that the scheme does not provide anonymous authentication and users can be easily tracked while using their anonymous identity. The scheme is also subject to denial of service attack. In this paper the deficiencies of the original scheme are demonstrated, and then a proposed improved scheme that eliminates these deficiencies is presented.

An efficient anonymous authentication protocol for mobile pay-TV

In terms of convenience requirements, mobility has been one of the most important services for pay-TV systems. In 2009, Yang and Chang proposed an authentication protocol for mobile devices using elliptic curves cryptography (ECC) and claimed that their mechanism is secure and efficient using in mobile pay-TV systems. In this paper, we demonstrate that their protocol still is insecure for authentication without password protection and performs inefficiently. Therefore, we offer an anonymous authentication protocol (AAP) to solve the performance issue and insecure risks. In addition, we present an analysis of our protocol to show that our protocol suits better for applications with higher security requirements and low power-consuming devices.

An Efficient Anonymous Authentication Protocol for Secure Vehicular Communications

As vehicular communications bring the promise of improved road safety and optimized road traffic through cooperative systems applications, it becomes a prerequisite to make vehicular communications secure for the successful deployment of vehicular ad hoc networks. In this paper, we propose an efficient authentication protocol with anonymous public key certificates for secure vehicular communications. The proposed protocol follows a system model to issue on-the-fly anonymous public key certificates to vehicles by road-side units. In order to design an efficient authentication protocol, we consider a key-insulated signature scheme for certifying anonymous public keys of vehicles to the system model. We demonstrate experimental results to confirm that the proposed protocol has better performance than other protocols based on group signature schemes.

A robust and efficient anonymous authentication protocol in VANETs

Recently, Lu et al. proposed an efficient conditional privacy preservation protocol, named ECPP, based on group signature scheme for generating anonymous certificates from roadside units (RSUs). However, ECPP does not provide unlinkability and traceability when multiple RSUs are compromised. In this paper, we make up for the limitations and propose a robust and efficient anonymous authentication protocol without loss of efficiency as compared with ECPP. Furthermore, in the proposed protocol, RSUs can issue multiple anonymous certificates to an OBU to alleviate system overheads for mutual authentication between OBUs and RSUs. In order to achieve these goals, we consider a universal re-encryption scheme and identity-based key establishment scheme as our building blocks. Several simulations are conducted to verify the efficiency and effectiveness of the proposed protocol by comparing with those of the existing ECPP.

VANET에서 다중 익명 인증서 기반 효율적인 익명 인증 프로토콜

최근까지 VANET 환경에서 차량의 익명성과 비연결성을 제공하기 위하여 제안된 익명 인증 프로토콜들은 신뢰기관이 차량에게 다수의 익명 인증서를 발급하거나, 차량과 RSU (Road-Side Unit)간의 상호인증 이후에 RSU가 차량에게 단기 (Short-time) 익명 인증서를 발급하였다. 하지만, 이러한 프로토콜들은 익명 인증서 생성 단계에서 신뢰기관을 비롯하여 차량 및 RSU의 높은 오버헤드를 발생시킨다. 따라서, 본 논문에서는 차량 및 RSU간의 한 번의 상호인증으로 RSU가 차량에게 다중 단기 익명 인증서를 발급하는 효율적인 익명 인증 프로토콜을 제안한다. 시뮬레이션을 통하여, RSU 서비스율 및 차량의 계산량 관점에서 기 제안되었던 가장 효율적인 익명 인증 프로토콜보다 효율적임을 보인다. 또한, 기 제안된 프로토콜들은 다수의 RSU들이 손상될 경우, 차량에 대한 비연결성과 추적성을 제공하지 못하는 반면 제안 프로토콜은 다수의 RSU가 손상되더라도 차량의 비연결성과 추적성을 제공한다. Until now, some protocols have been presented to provide vehicle's anonymity and unlinkability in VANET by means of issuing multiple anonymous certificates to each vehicle from the trust authority, or shot-time anonymous certificate to a vehicle after mutual authentication between a Roadside Unit (RSU) and the vehicle. However, these protocols have high overheads of the trust authority, RSUs and vehicles for generating anonymous certificate. In this paper, we propose an efficient anonymous authentication protocol, in which RSUs can issue multiple shot-time anonymous certificates to a vehicle to alleviate system overheads for mutual authentication between vehicles and RSUs. Several simulations are conducted to verify the efficiency of the proposed protocol in terms of RSU valid serve ratio and vehicle's computational costs. Moreover, the proposed protocol provides unlinkability and traceability when multiple RSUs are compromised, whereas previous protocols do not provide unlinkability and traceability.