Pseudo Identity Research Articles

A new privacy‐preserving authentication protocol for anonymous web browsing

SummaryAnonymous authentication technique receives wide attention in recent years since it can protect users' privacy. Anonymous web browsing refers to utilization of the World Wide Web that hides a user's personally identifiable information from the websites visited. Even if a user can hide the IP address and other physical information with anonymity programs such as Tor, the web server can always monitor the user on the basis of the identity. In this paper, we firstly give an overview and cryptanalysis on the protocol of Yang et al and point out the security weaknesses of their protocol. Then, we propose a new authentication protocol for anonymous web browsing. In the proposed protocol, we take the advantages of a pseudo identity mechanism and an identity‐based elliptic curve cryptography algorithm to achieve user anonymity, robust security, and high efficiency. The result of security analysis and performance evaluation indicate the feasibility and practicality of our proposed anonymous authentication protocol.

Pseudo Laguerre Matrix Polynomials, Operational Identities and Quasi-Monomiality

The main purpose of this paper is to introduce the matrix extension of the pseudo Laguerre matrix polynomials and to explore the formal properties of the operational rules and the principle of quasi-monomiality to derive a number of properties for pseudo Laguerre matrix polynomials.

A Novel Friends Matching Privacy Preserving Strategy in Mobile Social Networks

③ (School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China) Abstract: In mobile social networks, people can quickly find potential friends with the same attributes by sharing personal attribute profile. These attribute profiles, however, usually contain sensitive information, if this information gets intercepted by malicious attackers it may result in unpredictable consequences. In this paper, a dual handshake privacy-preserving scheme is proposed based on user pseudo identity anonymous and hash value authentication, which is combined with identity authentication, one-way hash function and key agreement to ensure that malicious attackers can not get the real content of personal profile by identity fraud, attribute forgery, hacking security attributes and eavesdrop secure channel, thus the personal privacy can be protected. At the same time, the scheme relies on the powerful computing and anti-attack ability to trusted third party to reduce the computation cost of the intelligent terminal and security risks. Security and performance analysis demonstrates that this scheme is of high privacy, non-repudiation and verifiability and is more effective than existing solutions.

New Authentication Scheme for Wireless Body Area Networks Using the Bilinear Pairing

Due to the development of information technologies and network technologies, healthcare systems have been employed in many countries. As an important part of healthcare systems, the wireless body area network (WBAN) could bring convenience to both patients and physicians because it could help physicians to monitor patients' physiological values remotely. It is essential to ensure secure communication in WBANs because patients' physiological values are very sensitive. Recently, Liu et al. proposed an efficient authentication scheme for WBANs. Unfortunately, Zhao pointed out that their schemesuffered from the stolen verifier-table attack. To improve security and efficiency, Zhao proposed an anonymous authentication scheme for WBANs. However, Zhao's scheme cannot provide real anonymity because the users' pseudo identities are constant value and the attack could tract the users. In this paper, we propose a new anonymous authentication scheme for WBANs. Security analysis shows that the proposed scheme could overcome weaknesses in previous scheme. We also use the BAN logic to demonstrate the security of the proposed scheme.

Solving Scalability Problems on Secure RFID Grouping-Proof Protocol

Scalable grouping-proof protocol has broad and various RFID applications. It generates a proof to confirm scalable multiple co-existing tags within timeout period. The scalability problems focus on performance of generating the scalable grouping-proof, such as messages relay, collision, exhaustive search and computation load of lightweight tag. No integrated solution is presented to scalability problems on RFID grouping-proof. In this paper, a novel protocol is proposed to solve scalability problems and offer secure properties including the mutual authentication, replay attack prevention, forward security, anonymity, and forge proof resistance. In addition, the pseudo identity with direct search is used to provide the privacy and unlinkability. The proposed mechanism adopts broadcast and pre-ordering responses scheme to improve system performance. The achievement is based on reducing the number of message relay, avoiding collision of responses and computing simultaneously of multiple lightweight tags. The experimental results of simulation show that the scalability requirements on grouping-proof protocol are satisfied with our protocol. Within timeout period of 400 ms, the proposed protocol could provide a proof with a scale up to about 130 and 600 tags under data rate of 105 and 640 kbps. The scalability performance of the proposed protocol is more than 3 times better than the other grouping-proof protocols.

An efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks

Certificateless public key cryptography was introduced to solve the complicated certificate management problem in traditional public key cryptography and the key escrow problem in identity-based cryptography. The aggregate signature concept is useful in special areas where the signatures on many different messages generated by many different users need to be compressed. This feature is very attractive for authentication in a resource constrained environment because it allows large bandwidth and computation time savings. This paper proposes a new certificateless signature scheme. A new certificateless aggregate signature scheme for vehicle-to-infrastructure communication in vehicular ad hoc networks based on the new certificateless signature scheme is presented. We demonstrate that the proposed certificateless aggregate signature scheme can also achieve conditional privacy preservation, in which each traffic message launched by a vehicle is mapped to a distinct pseudo identity. A legal authority can retrieve the real identity from any pseudo identity for any dispute event. In addition, the proposed scheme is provably secure against existential forgery on adaptively chosen message attack in the random oracle model assuming the computational Diffie–Hellman problem is hard. Furthermore, the proposed scheme presents efficient computational overhead with the existing well-known schemes and is suitable for practical use.

A secure temporal-credential-based mutual authentication and key agreement scheme with pseudo identity for wireless sensor networks

With an advancement of wireless communication technology, wireless sensor network (WSN) has emerged as one of the most powerful technologies which can be used in various applications, such as military surveillance, environment monitoring, industrial control, and medical monitoring. WSNs are vulnerable to large collection of attacks than traditional networks because they transmit data using a wireless channel and are deployed in unattended environments. So, in this environment, how to ensure secure communications between different communication parties becomes a challenging issue with respect to the constraints of energy consumption, and large overhead generated during various operations performed. In this direction, the mutual authentication and key agreement (MAAKA) scheme attracts much attention in recent years. In literature, MAAKA schemes were presented in last several years. However, most of these schemes cannot satisfy security requirements in WSNs. Recently, Xue et al. proposed a temporal-credential-based MAAKA scheme for WSNs and proved that it could withstand various types of attacks. However, this paper points out that Xue et al.’s MAAKA scheme is vulnerable to the off-line password guessing attack, the user impersonation attack, the sensor node impersonation attack and the modification attack. Moreover, this paper also points out that Xue et al.’s MAAKA scheme cannot provide user anonymity. To overcome weaknesses in Xue et al.’s MAAKA scheme, this paper proposes a new temporal-credential-based MAAKA scheme for WSNs. Security analysis shows the proposed MAAKA scheme could overcome the weaknesses in Xue et al.’s MAAKA scheme. Performance analysis shows the proposed MAAKA scheme has better performance than the existing benchmarked schemes in literature. Therefore, the proposed MAAKA scheme is more suitable for providing security for various applications in WSNs.

LESPP: lightweight and efficient strong privacy preserving authentication scheme for secure VANET communication

Authentication in vehicular ad-hoc network (VANET) is still a research challenge, as it requires not only secure and efficient authentication, but also privacy preservation. In this paper, we proposed a lightweight and efficient authentication scheme (LESPP) with strong privacy preservation for secure VANET communication. The proposed scheme utilizes self-generated pseudo identity to guarantee both privacy preservation and conditional traceability, and it only requires a lightweight symmetric encryption and message authentication code (MAC) generation for message signing and a fast MAC re-generation for verification. Compared with currently existing public key based schemes, the proposed scheme significantly reduces computation cost by $$10^2$$102---$$10^3$$103 times and decreases communication overhead by 41.33---77.60 %, thus achieving resilience to denial of service (DoS) attack. In LESPP, only key management center can expose a vehicle's real identity from its pseudo identity, therefore, LESPP provides strong privacy preservation so that the adversaries cannot trace any vehicles, even if all roadside units are compromised. Furthermore, vehicles in LESPP need not maintain certificate revocation list (CRL), so any CRL related overhead is avoided. Extensive simulations reveal that the novel scheme is feasible and has an outstanding performance of nearly 0 ms network delay and 0 % packet loss ratio, which are especially appropriate for realtime emergency event reporting applications.

VANET-based secure taxi service

Taxi service is an important type of point-to-point transportation in many cities. One of the major concerns is the safety of both passengers and taxi drivers. In this paper, based on the framework of VANET (Vehicular Ad-hoc NETwork), we propose a novel secure taxi service scheme to tackle the problem. First, a driver needs to authenticate himself using a password before he can provide any service. Second, after picking up a passenger, the taxi’s OBU (on-board unit) needs to continuously send its current location to the trusted server. This location is then double-verified with RSU (road-side unit) signatures. We also design a cooperative tracking mechanism to locate a taxi in case of emergency. In some occasions, taxi passengers as well as taxi drivers are concerned with their privacy (such as travelling route). We incorporate privacy-preserving measures into our scheme. The taxi’s OBU uses pseudo identities instead of real identity for all ongoing transmissions so that a passenger’s travelling route (or the driver’s travelling route when he/she is not carrying any passengers) cannot be traced by a third party easily. We show by simulation that the total delay (from 1 to 9s) introduced by all security measures is small while the total number of messages required to be transmitted in the network is reasonable.

On batch verification with group testing for vehicular communications

In this paper, an efficient identity-based batch signature verification scheme is proposed for vehicular communications. With the proposed scheme, vehicles can verify a batch of signatures once instead of in a one-by-one manner. Hence the message verification speed can be tremendously increased. To identify invalid signatures in a batch of signatures, this paper adopts group testing technique, which can find the invalid signatures with few number of batch verifications. In addition, a trust authority in our scheme is capable of tracing a vehicle's real identity from its pseudo identity, and therefore conditional privacy preserving can also be achieved. Moreover, since identity-based cryptography is employed in the scheme to generate private keys for pseudo identities, certificates are not required and thus transmission overhead can be significantly reduced.

An Improved Dynavote E-Voting Protocol Implementation

Electronic voting—the use of computers or computerized voting equipment to cast and tabulate and tally ballots in an election in a trustable manner—is a pillar of e-Government. The DynaVote voting protocol system proposed by Cetinkaya and Koc (2007) is assumed secure and practicable on a network. However, the DynaVote e-Voting protocol does not completely protect the voting counter against impersonated votes, especially when the pseudo-Vote identities are known by the wrong voter or compromised by authorities. To address this problem, a prototype called improved DynaVote e-Vote protocol was designed to protect the counter from anomalies associated with counting impersonated votes (multiple votes) in the same election. This was achieved by introducing biometric fingerprint and pseudo voter identities (PVID) encryption for each voter during voter registration via online or data mining of population data containing fingerprint biometrics. Furthermore, fingerprint reader and RSA public key cryptography is used in PVID to eliminate counting impersonated votes. The performance results showed that improved DynaVote e-Vote protocol is more reliable, eligible, and accurate, and protects voter privacy against other e-Vote protocols.

Discourse of identity in the world waiting to be made

This paper addresses the nature of Australian and Asian identity through an examination of the novel, The World Waiting to be Made, by Simone Lazaroo, the story of a young woman born in Singapore of Malaccan heritage but growing up in Perth, Western Australia. Acutely aware of the Asianness which sets her apart from mainstream Australians, the unnamed narrator in this first person novel struggles to establish a sense of herself at different periods of time, demarcated in this paper as her childhood, her adolescence and her adulthood. The story in Lazaroo’s first novel is of an outsider—a Eurasian young woman from a mixed Portuguese and Chinese background, born in Singapore but with ancestors in Malaysia, fighting to find a place where she can belong, with the narrator trying to change her appearance and behaviour at various stages of her life to conform to what she perceives as genuinely Australian. Having failed to establish her own identity in Australia, the narrator travels back to her father’s family in Singapore and Malacca, where acceptance is no easier than in Australia, although for different reasons, until she meets her Uncle Linus in Malacca, highly respected in the family as a bomoh, or wise man with special powers. Erik H. Erikson’s psychological definition of “identity”, together with traditional critical analysis of literary meaning, provides a theoretical framework to approach the issue of individual identity in relation to national culture in The World Waiting to Be Made. The analysis highlights the narrator’s frustration and struggle against ethnic displacement and marginalization, which she chooses to fight against with different pseudo identities—an Australian self, and mysterious Asianness. Finally these false identities lead to the total loss of herself—until she meets her Malaccan Uncle and claims a new identity. The World Waiting to Be Made, as Kate Temby states, “provides a sensitive searching of questions of nationality, ethnicity and identity as it charts the multiple journeys of its nameless Eurasian narrator.” (Westerly No.4, Summer, 1994, p.148.)

USE OF NILPOTENT WEIGHTS IN LOGARITHMIC CONFORMAL FIELD THEORIES

We show that logarithmic conformal field theories may be derived using nilpotent scale transformation. Using such nilpotent weights we derive properties of LCFT's, such as two and three point correlation functions solely from symmetry arguments. Singular vectors and the Kac determinant may also be obtained using these nilpotent variables, hence the structure of the four point functions can also be derived. This leads to non homogeneous hypergeometric functions. Also we consider LCFT's near a boundary. Constructing "superfields" using a nilpotent variable, we show that the superfield of conformal weight zero, composed of the identity and the pseudo identity is related to a superfield of conformal dimension two, which comprises of energy momentum tensor and its logarithmic partner. This device also allows us to derive the operator product expansion for logarithmic operators. Finally we discuss the AdS/LCFT correspondence and derive some correlation functions and a BRST symmetry.

Biorthogonal Wavelet Space: Parametrization and Factorization

In this paper we study the algebraic and geometric structure of the space of compactly supported biorthogonal wavelets. We prove that any biorthogonal wavelet matrix pair (which consists of the scaling filters and wavelet filters) can be factored as the product of primitive para-unitary matrices, a pseudo identity matrix pair, an invertible matrix, and the canonical Haar matrix. Compared with the factorization results of orthogonal wavelets, it now becomes apparent that the difference between orthogonal and biorthogonal wavelets lies in the pseudo identity matrix pair and the invertible matrix, which in the orthogonal setting will be the identity matrix and a unitary matrix. Thus by setting the pseudo identity matrix pair to be the identity matrix and using the Schmidt orthogonalization method on the invertible matrix, it is very straightforward to convert a biorthogonal wavelet pair into an orthogonal wavelet.