Anonymous user authentication is an essential security mechanism for roaming services in global mobility networks (GLOMONET). Recently, Zhao et al. propose a two-factor anonymous authentication scheme to achieve mutual authentication and session key establishment between the mobile user (MU) and a foreign agent (FA). This paper shows that their scheme has some security vulnerabilities and opera...

certificateless public key cryptography (cl-pkc) is a useful method in order to solve the problems of traditional public key infrastructure (i. e. large amount of computation, storage and communication cost for managing certificates) and id-based public key cryptography (i. e. key escrow problem), simultaneously. a signcryption scheme is an important primitive in cryptographic protocols which p...

Due to its efficiency, symmetric key cryptography is very attractive in sensor networks. A number of key predistribution schemes have been proposed, but the scalability is often constrained by the unavailability of topology information before deployment and the limited storage budget within sensors. Recently, three in-situ key establishment schemes, SBK [13], LKE [14] and iPAK [15], have been p...

In 1993, Beimel and Chor presented an unconditionally secure interactive protocol which allows a subset of users in a network to establish a common key. This scheme made use of a key predistribution scheme due to Blom. In this paper, we describe some variations and generalizations of the Beimel-Chor scheme, including broadcast encryption schemes as well as interactive key distribution schemes. ...

To establish pairwise keys for each pair of neighboring sensor nodes is a basic service, forming the basis other security services, such as authentication and encrypted in wireless sensor networks (WSNs). However, due to constrained energy, memory, and computational capabilities of sensor nodes to establish the pairwise key is challenging task. Here, a combination of polynomial pool-based and t...

One-dimensional wireless sensor networks are important for such security-critical applications as pipeline monitoring and perimeter surveillance. When considering the distribution of symmetric keys to secure the communication in such networks, the specific topology leads to security and performance requirements that are markedly distinct from those of the more widely-studied case of a planar ne...

We rst present two tight lower bounds on the size of the secret keys of each user in an unconditionally secure one-time use broadcast encryption scheme (OTBES). Then we show how to construct a computa-tionally secure multiple-use broadcast encryption scheme (MBES) from a key predistribution scheme (KPS) by using the ElGamal cryptosystem. We prove that our MBES is secure against chosen (message,...