Search

Security and privacy are desired core issues to secure communication for the roaming service in global mobility network (GLOMONET). Authentication mechanism is an essential technology to establish a shared secret key between two or more participants who wish to encrypt sensitive data. How to design an ideal authenticated key agreement (AKA) that satisfies different security requirements is a very challenging task due to a handshake between participants is performed over an open channel. Multiple papers on AKA are currently available. We review a recently GLOMONET-oriented AKA released by Gope–Hwang. We point out that their scheme has various security problems. Specifically, their AKA is vulnerable to known session-specific temporary information attack. More seriously, the password renewal phase of their scheme is wrong, thus leading to the mobile user login failed and even the server rejects service. So the paper attempts to eliminate three security loopholes troubled in Gope–Hwang's scheme. Our objective is to propose an elliptic curve cryptography (ECC) based AKA to achieve secure implementation in GLOMONET. By performing informal and formal analyses, we demonstrate that our scheme overcomes some disadvantages in Gope–Hwang's scheme while possessing more excellent security attributes. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel general non-negative matrix factorization (general-NMF)-based digital watermarking scheme for copyright protection and integrity authentication of the image content. Specifically, the proposed general-NMF algorithm is able to factorize a matrix $C\in R_+^{s\times t}$ into a basis matrix $A\in R_+^{m\times n}$ and a coefficient matrix $B\in R_+^{p\times q}$ by removing the dimension-matching constraints required by the conventional NMF, where $s=m$ , $n = p$ , and $t= q$. In particular, $s= m\cdot l/n$ , $t=l/p\cdot q$ , and the variable $l$ is the least common multiple of $n$ and $p$. Furthermore, the generator factor of the random matrix and $n$ are used as the keys of the proposed digital watermarking scheme. Experimental results show that the proposed digital watermarking scheme can effectively resist various attacks and tampering. [ABSTRACT FROM AUTHOR]

With the greatest advancement of information technology, mobile communication has become more widespread and prevalent. When a mobile user intends to enjoy the services offered by a remote server, he needs to be authenticated before constructing a session key with the corresponding server. Numerous authentication schemes have been provided with the purpose of validating the legitimacy of a mobile user. Recently, Xie et al. presented a modified two-factor authenticated key exchange to eliminate the security flaws of Chen et al. Xie et al. claimed that the enhanced design was more secure than the design of Chen et al. Unfortunately, we identified that the proposed scheme by Xie et al. was insecure against user impersonation, insider and trace attacks and did fail to provide verification in login phase. To enhance the security and efficiency, we then proposed an anonymous authenticated key exchange scheme for mobile client-server environment. We demonstrated that the proposed scheme was immune to many attacks including attacks observed in the scheme of Xie et al. We also use a formal proof, namely Burrows-Abadi-Needham logic, to analyze the proposed scheme. In addition, the proposed scheme possesses a lower computation overheads than the other related schemes. Copyright © 2016 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

With the rapid development of computer networks, multi-server architecture has attracted much attention in many network environments. Moreover, in order to achieve non-repudiation which both passwords and cryptographic keys cannot provide, several password authentication schemes combining a user's biometrics for multi-server environments have been proposed in the past. In 2014, Chuang et al. presented a biometrics-based multi-server authenticated key agreement scheme and declared that their scheme was efficient and secure. Later, Mishra et al. commented that the scheme by Chuang et al. was susceptible to stolen smart card, impersonation and denial of service attacks. To conquer these weaknesses, Mishra et al. presented an efficient biometrics-based multi-server authenticated key agreement scheme using hash functions. However, we prove that the scheme by Mishra et al. is insecure against forgery, server masquerading and lacks perfect forward secrecy. The focus of this paper is to present a robust biometrics and public-key techniques-based authentication scheme, which is a significant enhancement to the scheme recently proposed by Mishra et al. The highlight of our scheme is that it not only conquers the flaws but also is efficient compared with other related authenticated key agreement schemes. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]