A short ID‐based proxy signature scheme

The notion of identity‐based proxy signature with message recovery feature has been proposed to shorten identity‐based proxy signatures and improve their communication overhead because signed messages are not transmitted with these kinds of signatures. There are a few schemes for this notion: the schemes of Singh and Verma and Yoon et al. Unfortunately, Tian et al., by presenting two forgery attacks, show that Singh and Verma scheme is not secure, and also, the scheme of Yoon et al. does not support provable security. The contributions of this paper are twofold. First, we review the scheme by Yoon et al. and discuss why it does not have message recovery property, and consequently, it is not short. Second, we propose a short identity‐based proxy signature scheme with the help of message recovery property and show that it is secure under computational Diffie–Hellman assumption in the random oracle model. Furthermore, our scheme is more efficient than (as efficient as) previous identity‐based proxy signatures. Copyright © 2014 John Wiley & Sons, Ltd.     

Provable secure identity‐based multi‐proxy signature scheme

Multi‐proxy signature is one of the useful primitives of the proxy signature. Till now, only a few schemes of identity‐based multi‐proxy signature (IBMPS) have been proposed using bilinear pairings, but most of the schemes are insecure or lack a formal security proof. Because of the important application of IBMPS scheme in distributed systems, grid computing, and so on, construction of an efficient and provable‐secure IBMPS scheme is desired. In 2005, Li & Chen proposed an IBMPS scheme from bilinear pairings, but their paper lacks a formal model and proof of the security. Further, in 2009, Cao & Cao presented an IBMPS scheme with the first formal security model for it. Unfortunately, their scheme is not secure against the Xiong et al's attack. In this paper, first, we present an IBMPS scheme, then we formalize a security model for the IBMPS schemes and prove that the presented scheme is existential unforgeable against adaptive chosen message and identity attack in the random oracle model under the computational Diffie–Hellman assumption. Also, our scheme is not vulnerable for the Xiong et al's attack. The presented scheme is more efficient in the sense of computation and operation time than the existing IBMPS schemes. Copyright © 2013 John Wiley & Sons, Ltd.     

Provably secure RSA‐type signature based on conic curve

In electronic communication and wireless communication, message authentication should be necessary. However, traditional method message authentication code (MAC) employs a symmetric cryptographical technique and it needs to keep a shared private key between two parties. For convenience, people now begins to use public key techniques to provide message authentication. In wireless communication, we shall save more space for message itself because of the limited resources. Therefore, we believe that our proposed digital signature scheme will be more fitful for this kind of communication due to the following merits: (1) in addition to inheriting the merits of RSA signature such as high verification efficiency, the proposed scheme also shows its advantage over RSA by resisting low public key exponent attack; (2) comparing with 1024 bits RSA, our digital signature scheme can sign 2048‐bit long message once, and generate a signature with 1025 bits length which doubles the capacity of the 1024‐bit RSA signature; (3) the scheme is provably secure and its security is tightly related to the hardness of conic‐based (CB)‐RSA assumption. Copyright © 2008 John Wiley & Sons, Ltd.     

An improved and provable self‐certified digital signature scheme with message recovery

This paper presents a self‐certified digital signature scheme with message recovery that is proven to be secure. So far, many schemes of this kind have been proposed to keep message secret in the transmission. But Zhang et al. has proposed the man‐in‐middle attack to Shao's self‐certified signature scheme, which is based on discrete logarithm. The attacker can make a new signature by using an old one, but the reason of such man‐in‐middle attack was not referred. We present the scheme of Yoon et al., which is also based on discrete logarithm, that cannot resist man‐in‐middle attack either, give the analysis of the attack, and propose a new scheme. The proposed scheme can resist forgery attack in the random oracle model and avoid message leakage, the man‐in‐middle attack, and meanwhile has several security characters. Compared with some self‐certified schemes, our scheme is the best because of the time cost. Copyright © 2013 John Wiley & Sons, Ltd.     

SRGH: A secure and robust group‐based handover AKA protocol for MTC in LTE‐A networks

Machine‐type communication (MTC) is defined as an automatic aggregation, processing, and exchange of information among intelligent devices without humans intervention. With the development of immense embedded devices, MTC is emerging as the leading communication technology for a wide range of applications and services in the Internet of Things (IoT). For achieving the reliability and to fulfill the security requirements of IoT‐based applications, researchers have proposed some group‐based handover authentication and key agreement (AKA) protocols for mass MTCDs in LTE‐A networks. However, the realization of secure handover authentication for the group of MTCDs in IoT enabled LTE‐A network is an imminent issue. Whenever mass MTCDs enter into the coverage area of target base‐station simultaneously, the protocols incur high signaling congestion. In addition, the existing group‐based handover protocols suffer from the huge network overhead and numerous identified problems such as lack of key forward/backward secrecy, privacy‐preservation. Moreover, the protocols fail to avoid the key escrow problem and vulnerable to malicious attacks. To overcome these issues, we propose a secure and robust group‐based handover (SRGH) AKA protocol for mass MTCDs in LTE‐A network. The protocol establishes the group key update mechanism with forward/backward secrecy. The formal security proof demonstrates that the protocol achieves all the security properties including session key secrecy and data integrity. Furthermore, the formal verification using the AVISPA tool shows the correctness and informal analysis discusses the resistance from various security problems. The performance evaluation illustrates that the proposed protocol obtains substantial efficiency compared with the existing group‐based handover AKA protocols.     

A provably secure biometrics and ECC‐based authentication and key agreement scheme for WSNs

Wireless sensor networks (WSNs) underpin many applications of the Internet of Things (IoT), ranging from smart cities to unmanned surveillance and others. Efficient user authentication in WSNs, particularly in settings with diverse IoT device configurations and specifications (eg, resource‐constrained IoT devices) and difficult physical conditions (eg, physical disaster area and adversarial environment such as battlefields), remains challenging, both in research and in practice. Here, we put forth a user anonymous authentication scheme, relying on both biometrics and elliptic curve cryptography, to establish desired security features like forward and backward secrecy. We then make use of the Random‐or‐Real (RoR) model to prove the security of our scheme. We have implemented the proposed scheme in an environment compatible with WSNs. We show after conducting the comparison of the proposed scheme with some recent and related existent schemes that it satisfies various essential and desirable security attributes of a WSN environment. We conclude that the proposed scheme is suitable for the WSN scenario demanding high security.     

Forgery attacks of an identity‐based multi‐proxy signature scheme

Multi‐proxy signature is used to delegate a permission of an owner to at least two proxies in the digital world. Recently, Sahu and Padhye gave a new construction of identity‐based multi‐proxy signature. Their scheme's security was supported by a reduction proof against a hard mathematical problem. Even supported by such security proofs, we present some forgery attacks against Sahu and Padhye's scheme. We demonstrate that any dishonest insider or any malicious outsider can break the security of Sahu and Padhye's scheme by forging either a permission or a multi‐proxy signature. In fact, our forgery attacks exploit the security weakness in their underlying identity‐based signature scheme, which is the fundamental constructing component of their proposed scheme. Copyright © 2014 John Wiley & Sons, Ltd.     

A secure and efficient identity‐based mutual authentication scheme with smart card using elliptic curve cryptography

The e‐commerce has got great development in the past decades and brings great convenience to people. Users can obtain all kinds of services through e‐commerce platform with mobile device from anywhere and at anytime. To make it work well, e‐commerce platform must be secure and provide privacy preserving. To achieve this goal, Islam et al. proposed a dynamic identity‐based remote user mutual authentication scheme with smart card using Elliptic Curve Cryptography(ECC). Islam et al claimed that the security of their scheme was good enough to resist various attacks. However, we demonstrate that their scheme is vulnerable to insider attack and suffers from off‐line password guessing attack if smart card is compromised. To overcome the deficiencies, we present an improved scheme over Islam's scheme. The security proof and analysis shows that our scheme can also provide user anonymity and mutual authentication, and the security is enough to against relay attack, impersonation attack, and other common secure attackers. The performance analysis shows that the proposed scheme is more efficient than Islam et al's scheme.     

A secure channel code‐based scheme for privacy preserving data aggregation in wireless sensor networks

Data aggregation is an efficient method to reduce the energy consumption in wireless sensor networks (WSNs). However, data aggregation schemes pose challenges in ensuring data privacy in WSN because traditional encryption schemes cannot support data aggregation. Homomorphic encryption schemes are promising techniques to provide end to end data privacy in WSN. Data reliability is another main issue in WSN due to the errors introduced by communication channels. In this paper, a symmetric additive homomorphic encryption scheme based on Rao‐Nam scheme is proposed to provide data confidentiality during aggregation in WSN. This scheme also possess the capability to correct errors present in the aggregated data. The required security levels can be achieved in the proposed scheme through channel decoding problem by embedding security in encoding matrix and error vector. The error vectors are carefully designed so that the randomness properties are preserved while homomorphically combining the data from different sensor nodes. Extensive cryptanalysis shows that the proposed scheme is secure against all attacks reported against private‐key encryption schemes based on error correcting codes. The performance of the encryption scheme is compared with the related schemes, and the results show that the proposed encryption scheme outperforms the existing schemes.     

Short computational Diffie–Hellman‐based proxy signature scheme in the standard model

Proxy signature is an important delegation technique. It allows that the original signer delegates his or her signing capability to a proxy signer that can generate valid signatures on behalf of the original signer. Until now, most of proxy signature schemes only were proven secure in the random oracle model. And the length of a proxy signature is usually a sum of the lengths of two signatures in most of the proxy signature schemes. Therefore, the factors make the proxy signature unsuitable for many applications with the constrained space or bandwidth. In this paper, we propose a novel short proxy signature scheme in the standard model. And the scheme is probably secure in the standard model. Compared with all existing proxy signature schemes without random oracles, the scheme achieves the following advantages: stronger security, shorter system parameters, shorter signature length and higher efficiency. To the best of our knowledge, this is the first shortest proxy signature scheme in the standard model, whose length is only 320 b for practical 80‐bit security level and the same as that of Digital Signature Algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

基于随机网络编码的无线广播重传方案及性能分析

针对自动重复重传(ARQ)机制在无线广播系统中吞吐量性能不佳的缺陷,提出一种基于随机网络编码的广播重传方案RNC-ARQ.对于广播节点,采用随机线性码对所有丢失包进行编码组合重传.对于接收节点,当接收的编码包累积到一定数量后可通过解码操作恢复出原始数据.该方案可有效减少重传次数,改善无线广播的吞吐量性能.基于Gilbert-Elliott模型描述的突发错误信道,建立了信道状态和节点接收处理流程合并的多状态马尔可夫模型,并以此为基础推导了RNC-ARQ方案的吞吐量闭合解.最后,使用NS-2模拟器评估RNC-ARQ方案的性能,结果表明在突发差错信道下,基于随机网络编码重传方案的吞吐量优于传统的选择承传ARQ方案和基于异或编码的重传方案.     

A secure and enhanced elliptic curve cryptography‐based dynamic authentication scheme using smart card

In remote system security, 2‐factor authentication is one of the security approaches and provides fundamental protection to the system. Recently, numerous 2‐factor authentication schemes are proposed. In 2014, Troung et al proposed an enhanced dynamic authentication scheme using smart card mainly to provide anonymity, secure mutual authentication, and session key security. By the analysis of Troung et al's scheme, we observed that Troung et al' s scheme does not provide user anonymity, perfect forward secrecy, server's secret key security and does not allow the user to choose his/her password. We also identified that Troung et al's scheme is vulnerable to replay attack. To fix these security weaknesses, a robust authentication scheme is proposed and analyzed using the formal verification tool for measuring the robustness. From the observation of computational efficiency of the proposed scheme, we conclude that the scheme is more secure and easy to implement practically.     

A dynamic CSFICA and feature‐based collision detection method in multichannel space‐based AIS

To detect message collisions in multichannel spaced‐based automatic identification system (AIS), a dynamic complex symmetric fast independent component analysis (CSFICA) and feature‐based collision detection method is proposed in this paper. A fast and stable blind source separation algorithm, dynamic CSFICA, is utilized to separate signals dynamically and improve the signal‐to‐interference ratio (SIR) in each channel. A frequency and phase offset insensitive feature detection algorithm is used to calculate the test statistics in each channel. The false alarm is suppressed by applying the arithmetic to geometric mean (AGM) method, and test statistics of channels with sufficient signal quality are extracted to detect the preamble. Simulation results show that the proposed algorithm outperforms the reference feature detection algorithm under collision conditions and is insensitive to the SIR. The proposed algorithm is more resistant to false alarm caused by signal (FAS) than the differential correlation (DC) algorithm.     

A scalable and efficient key escrow model for lawful interception of IDBC‐based secure communication

Key escrowing is one of the core technologies for the lawful interception (LI) of secure communications in the wired and wireless networks. Although many previous studies on the key escrowing have been done before, they are insufficient to be deployed in practical networks due to conflicts with the LI requirements. Moreover, there is lack of consideration on the LI of ID‐based cryptosystem (IDBC)‐based secure communication because the interest of the LI was moved to the industries and IDBC has the inherent key escrowing property. However, the inherent property of IDBC cannot prevent ‘illegal’ eavesdropping of all the communications in the networks from the law enforcement agency with the ‘legally’ obtained key. Thus, we propose a new key escrow model that satisfies the requirements of LI and overcomes the potential threats of IDBC. Our contributions enable the scalable and efficient key escrowing for the LI of secure one‐way and two‐pass communication in the mobile networks. Copyright © 2010 John Wiley & Sons, Ltd.     

A secure and effective biometric‐based user authentication scheme for wireless sensor networks using smart card and fuzzy extractor

User authentication is a prominent security requirement in wireless sensor networks (WSNs) for accessing the real‐time data from the sensors directly by a legitimate user (external party). Several user authentication schemes are proposed in the literature. However, most of them are either vulnerable to different known attacks or they are inefficient. Recently, Althobaiti et al. presented a biometric‐based user authentication scheme for WSNs. Although their scheme is efficient in computation, in this paper, we first show that their scheme has several security pitfalls such as (i) it is not resilient against node capture attack; (ii) it is insecure against impersonation attack; and (iii) it is insecure against man‐in‐the‐middle attack. We then aim to propose a novel biometric‐based user authentication scheme suitable for WSNs in order to withstand the security pitfalls found in Althobaiti et al. scheme. We show through the rigorous security analysis that our scheme is secure and satisfies the desirable security requirements. Furthermore, the simulation results for the formal security verification using the most widely used and accepted Automated Validation of Internet Security Protocols and Applications tool indicate that our scheme is secure. Our scheme is also efficient compared with existing related schemes. Copyright © 2015 John Wiley & Sons, Ltd.     

Study of trust‐based mechanism and its component model in MANET: Current research state,issues, and future recommendation

Security against routing attacks in MANET is most critical issue and traditional concepts of cryptography, authentication, or Watchdog are not that significant in mitigation of these attacks. In recent years, trust‐based approach provides a reputation system that compose of different components to provide security against routing attacks. In this paper, we provide an in‐depth analysis of various components that are used in trust‐based mechanism and techniques deployed in effective and efficient execution of task by the components. Trust‐based mechanisms generally have five components: monitoring and information gathering, trust calculation and evaluation unit, trust recommendation unit, decision‐making and dissemination of detection unit. All or some of these units cooperate together to provide a reliable communication environment with the aim to prevent routing attacks from participating in route formation process and detect attacking nodes simultaneously. Different routing attacks and measures in trust‐based mechanism along with some published work are discussed to understand the implementation of this type of mechanism. Various related issues are explored, discussed, and recommendations are pointed out for future research work in this field.     

A novel rateless codes design scheme based on two‐stage encoding and forward equal probability

This paper proposes an ideal rateless codes model to comprehensively describe rateless codes and extends the definition of systematic linear block code to generalized systematic code. Under the proposed model, average delay, maximum disorder, and uniformity recovery entropy are introduced as performance indices to design efficient rateless codes. A novel coding scheme based on two‐stage encoding and forward equal probability is proposed to optimize the proposed indices. In the first stage, the first k symbols are encoded, aiming to improve the performance of order recovery, uniformity recovery, and transmission efficiency as much as possible. In the second stage, the remaining infinite symbols are encoded, where the symbols with high degree are used to compensate the symbols loss in the first stage. Simulation results show that the proposed scheme can achieve generalized systematic rateless codes with high probability and also has less average delay and maximum disorder, better capacity achievability, and uniformity recovery performance than Luby trasform (LT) codes and rateless coded symbol sorting algorithm. Besides, the proposed scheme has the aforementioned advantages compared with expending window fountain codes except for uniformity recovery and maximum disorder performance when the erasure rate is higher than about 0.25. Copyright © 2013 John Wiley & Sons, Ltd.     

Geometry‐based statistical channel model and performance for MIMO antennas

To test an adaptive array algorithm in cellular communications, we developed a geometry‐based statistical channel model for radio propagation environments, which provides the statistics of the angle of arrival and time of arrival of the multipath components. This channel model assumes that each multipath component of the propagating signal undergoes only one bounce traveling from the transmitter to the receiver and that scattering objects are located according to Gaussian and exponential spatial distributions, and a new scatterer distribution is proposed as a trade‐off between the outdoor and the indoor propagation environments. Using the channel model, we analyze the effects of directional antennas at the base station on the Doppler spectrum of a mobile station due to its motion and the performance of its MIMO systems. Copyright © 2014 John Wiley & Sons, Ltd.