A secure biometric-based remote user authentication with key agreement scheme using extended chaotic maps

Recently, biometric-based remote user authentication schemes along with passwords have drawn considerable attention in research. In 2011, Das proposed an improvement on an efficient biometric-based remote user authentication scheme using smart cards and claimed his scheme could resist various attacks. However, there are some weaknesses in Das’s scheme such as the privileged insider attack and the off-line password guessing attack. Besides, Das’s scheme also cannot provide user anonymity. To overcome these weaknesses, we shall propose a secure biometric-based remote user authentication with key agreement scheme using extended chaotic maps. The proposed scheme not only can resist the above-mentioned attacks, but also provide user anonymity.     

A three-party password-based authenticated key exchange protocol with user anonymity using extended chaotic maps

In this paper, we propose a scheme utilizing three-party password-based authenticated key exchange protocol with user anonymity using extended chaotic maps, which is more efficient and secure than previously proposed schemes. In order to enhance the efficiency and security, we use the extended chaotic maps to encrypt and decrypt the information transmitted by the user or the server. In addition, the proposed protocol provides user anonymity to guarantee the identity of users, which is transmitted in the insecure public network.     

Event-based secure consensus of multiple AUVs under DoS attacks

In this paper, the event-based triggering method is adopted to investigate the secure consensus issue of multiple autonomous underwater vehicles (AUVs) under denial-of-service (DoS) attacks. DoS attack is a form of time-sequence-based cyber attack, which can destroy the normal service of the control target or network. First, based on an event-triggered mechanism, a novel secure control protocol is proposed. Second, the upper bounds of attack duration and attack frequency are given to ensure that multiple AUVs under DoS attacks can reach consensus. Third, an event-triggered mechanism with exponential variables is developed to avoid the continuous update of the controller, thereby reducing the burdens of communication and calculation. Zeno behavior can be strictly ruled out for each AUV under this triggering mechanism. Finally, the simulation results illustrate the feasibility of the proposed scheme.

     

A revised key agreement protocol based on chaotic maps

Very recently, Chen et al. proposed a security-enhanced key agreement protocol based on Chebyshev chaotic map. They claimed that the proposed protocol can achieve session key agreement shared among the server and user with security and users anonymity. Although, in this paper, we will prove that Chen et al.’s protocol cannot guarantee security and user anonymity against internal adversary who is a legal user. Furthermore, we give some improvements to dominate the mentioned shortcomings. The analysis shows that our proposed improvements are secure and efficient.     

A chaotic maps-based authenticated key agreement protocol with strong anonymity

In wireless communication environments, the authenticated key agreement with user anonymity is important. Recently, many chaotic maps-based anonymous authenticated key agreement protocols have been proposed. Tseng et al. applied Chebyshev chaotic maps to propose an anonymous key agreement protocol. Unfortunately, Niu et al. demonstrated that Tseng et al.’s protocol cannot protect the user anonymity and it suffers from insider attacks. Xue et al. improved Tseng et al.’s protocol. However, we have found that their improved protocol still cannot provide strong anonymity and it is vulnerable to the man-in-the-middle attack. To remove these weaknesses, we have proposed a novel chaotic maps-based authenticated key agreement protocol. The proposed protocol cannot only resist these attacks, but also provide strong anonymity.     

Provably secure dynamic identity-based three-factor password authentication scheme using extended chaotic maps

With the aim of guaranteeing secure communication through public networks, three-factor password authentication (TF-PWA) scheme plays a key role in many internet applications. Since in TF-PWA scheme, the communicating entities can mutually authenticate each other and generate a shared session key, which will be used for secure exchange of messages in succeeding communication among them. As a result, the TF-PWA schemes gain enormous consideration in recent years. More recently, due to light-weight features of the extended chaotic map, it is also extensively applied in designing of public key encryption, key agreement, image encryption, S-box, hash function, digital signature, password authentication, etc. The aim of this paper was to design a dynamic identity-based three-factor password authentication scheme using extended chaotic map (ECM-TF-PWA) in the random oracle model. The proposed scheme is provably secure based on the intractability assumption of chaotic map-based Diffie–Hellman problem. The informal security analysis gives the evidence that our scheme protects all attacks and provides functionality attributes that are needed in a three-factor authentication system. Besides, the performance discussion shows that our scheme performs better than others in respect of computation and communication cost.     

An extended chaotic-maps-based protocol with key agreement for multiserver environments

Due to the rapid development and growth of computer networks, there have been greater and greater demands for remote password authentication protocols. Recently, the focus has been on protocols for multiserver environments that run on smart cards. These protocols typically count on the nonce or timestamp to provide protection against the replay attack. However, as Tsaur et al. pointed out, these protocols have some security issues such as disturbance in clock synchronization and vulnerability to the man-in-the-middle attack. In order to solve the above problems, Tsaur et al. proposed a multiserver authentication scheme with key agreement in 2012, and they claimed that their scheme could effectively achieve password-authenticated key agreement while getting around the technical difficulty of implementing clock synchronization in multiserver environments. Unfortunately, we found out that Tsaur et al.’s protocol still has the following weaknesses: (1) inability to resist privileged insider attack, (2) inability to resist known-plaintext attack, (3) inability to provide user anonymity, and (4) lack of perfect forward secrecy. To fix these secure flaws of Tsaur et al.’s protocol, in this paper, we shall propose an improved multiserver authentication protocol with key agreement based on extended chaotic maps. We shall also offer formal proof of smooth execution of the improved authenticated key agreement protocol.     

An extended chaotic maps-based key agreement protocol with user anonymity

A key agreement protocol is used to derive a shared secure session key by two or more parties, but no party can predetermine the resulting value. Users can securely exchange information over an open network by using the shared session key to encrypt/decrypt secure information. Recently, several key agreement protocols based on chaotic maps are proposed. Xiao et al. proposed a novel key agreement protocol based on chaotic maps and claimed their protocol can resist the known attack which is proposed by Bergamo et al. However, Han et al. and Xiang et al. pointed out that the Xiao et al. protocol is still insecure. To overcome these attacks, we shall propose an extended chaotic maps-based key agreement protocol. The proposed protocol not only can resist these attacks, but also provide mutual authentication and user anonymity.     

Cryptanalysis and enhancement of a chaotic maps-based three-party password authenticated key exchange protocol

Recently, Lee et al. (Nonlinear Dyn, 73(1–2):125–132, 2013) proposed a three party password authenticated key exchange with user anonymity by utilizing extended chaotic maps. They claimed that their protocol is more secure than previously proposed schemes. In this paper, our analysis shows that Lee et al.’s protocol suffers from two kinds of attacks: (1) man-in-the-middle attack, and (2) user anonymity attack. To overcome these weakness, we propose an enhanced protocol that can resist the attacks described and yet with comparable efficiency.     

A secure chaotic maps-based key agreement protocol without using smart cards

To guarantee secure communication, many maps-based key agreement protocols have been proposed. Due to inherent tamper-resistance, most of them are based on smart cards. Unfortunately, the cost of cards and readers makes these protocols costly. In the real world, common storage devices, such as universal serial bus (USB) thumb drives, portable HDDs, mobile phones, and laptop or desktop PCs, are widely used, and they are much cheaper or more convenient for storing user authentication information. These devices do not provide tamper-resistance; it is a challenge to design a secure authentication protocol using these kinds of memory devices. In this paper, we will propose a maps-based key agreement protocol without using smart cards. According to our analysis, the proposed protocol guarantees mutual authentication, and also resists different attacks. Therefore, our protocol is suitable even for practical applications.     

An efficient and provably secure three-party password-based authenticated key exchange protocol based on Chebyshev chaotic maps

Three-party password-based authenticated key exchange (3PAKE) protocols allow two clients to establish a secure session key through a server over an insecure channel. Recently, the 3PAKE protocols have been developed based on Chebyshev chaotic maps, in which the clients utilize smart cards to login into the server and employ server’s public key to ensure the identity of the server or symmetric cryptosystems to encrypt the messages. However, this paper describes an efficient chaos-based 3PAKE protocol without smart cards, which requires neither server’s public key nor symmetric cryptosystems. The security of the proposed 3PAKE protocol is proved in the random oracle model using the chaos-based decisional Diffie–Hellman assumption. In comparison with the existing chaos-based 3PAKE protocols, our protocol individually provides better performance in terms of communication, computation, and security aspects, and is supported by the formal proof in the random oracle model.     

Cryptanalysis and improvement of an extended chaotic maps-based key agreement protocol

Very recently, Lee et?al. (C.?Lee, C.?Chen, C.?Wu, S.?Huang, An extended chaotic maps-based key agreement protocol with user anonymity, Nonlinear Dynamics, doi:10.1007/s11071-011-0247-4) proposed a chaotic maps-based key agreement protocol with user anonymity and claimed their protocol could resist various attacks. In this paper, we will point out that Lee et?al.??s protocol suffers from three weaknesses: (1)?inability of resisting the privileged insider attack; (2)?inability of resisting the denial-of-service attack; and (3)?inability of providing anonymity. To overcome the weaknesses, we also proposed an improved protocol. The analysis shows our protocol is more suitable for practical applications.     

Cryptanalysis and improvement of a three-party key agreement protocol using enhanced Chebyshev polynomials

Three-party key agreement protocol is an important cryptographic mechanism for secure communication, which allows two parties authenticate each other with the help of a trusted server. Very recently, Lai et al.’s proposed a novel three-party key agreement protocol using the enhanced Chebyshev chaotic map and claimed their protocol could withstand various attacks. Unfortunately, in this paper, we will show their protocol is vulnerable to the privileged insider attack and the off-line password guessing attack. To solve the problems, we propose an improved three-party key agreement protocol using the enhanced Chebyshev chaotic map. Security analysis and performance analysis show our protocol not only could withstand various attacks, but also has similar performance. Therefore, it is very suitable for practical applications.     

复杂用户网络在移动通信方面的应用研究

在传统的移动蜂窝系统研究中,所有用户都假设具有相同的行为,即他们以相等的概率打出/接听电话,以及他们以相同的移动性在网络内移动. 还有,基础用户网络假设为一个全互联的网络, 这暗示着所有的用户都互相认识,且以同一概率进行相互通讯. 但在现实的环境中,每个用户有各自的熟人(包括家人、亲戚、朋友和同事)通讯录,其通讯录的大小也视乎个别用户而有所不同. 此外,由于用户的移动性取决于各种各样的因素(如工作性质等),不同用户的移动程度也不尽相同. 为了估计移动系统更接近实际的性能,我们使用无尺度网络作为潜在的用户网络模型,即一个用户的熟人数目服从幂律分布,并且研究在3种移动性(即零移动性、相同移动性和幂律移动性)下的移动系统.最后, 通过计算机仿真来估计系统的性能指标(如承载话务量和阻塞率等).结果表明, 用户网络结构以及用户移动性都会对移动系统的性能产生影响.      

Parallel CFD fire modelling on office PCs with dynamic load balancing

Parallel processing techniques have been used in the past to provide high performance computing resources for activities such as Computational Fluid Dynamics. This is normally achieved using specialized hardware and software, the expense of which would be difficult to justify for many fire engineering practices. In this paper, we demonstrate how typical office‐based PCs attached to a local area network have the potential to offer the benefits of parallel processing with minimal costs associated with the purchase of additional hardware or software. A dynamic load balancing scheme was devised to allow the effective use of the software on heterogeneous PC networks. This scheme ensured that the impact between the parallel processing task and other computer users on the network was minimized thus allowing practical parallel processing within a conventional office environment. Copyright © 2006 John Wiley & Sons, Ltd.     

大规模并行结构动力分析分层计算方法

多核分布式存储超级计算机的兴起为大规模并行结构动力分析提供了强有力的计算工具。根据多核分布式计算环境的特点,提出了一种大规模并行结构动力分析分层计算方法。该方法在传统隐式动力分析的区域分解法的基础上,利用两级分区和两次缩聚策略进行求解。不但通过进一步缩减求解问题规模有效提高了界面方程的收敛速度,而且通过三层并行计算有效提高了通信效率。该方法并不对有限元模型引入近似,属于精确的动力子区域分层计算方法。典型数值算例表明,该方法计算精度与商业软件ANSYS完全法求解精度相当;同传统区域分解法相比,该方法能够获得较高的并行计算性能。     

Designing a multi-scroll chaotic system by operating Logistic map with fractal process

Recently, chaotic systems have been widely investigated in several engineering applications. This paper presents a new chaotic system based on Julia’s fractal process, chaotic attractors and Logistic map in a complex set. Complex dynamic characteristics were analyzed, such as equilibrium points, bifurcation, Lyapunov exponents and chaotic behavior of the proposed chaotic system. As we know, one positive Lyapunov exponent proved the chaotic state. Numerical simulation shows a plethora of complex dynamic behaviors, which coexist with an antagonist form mixed of bifurcation and attractor. Then, we introduce an algorithm for image encryption based on chaotic system. The algorithm consists of two main stages: confusion and diffusion. Experimental results have proved that the proposed maps used are more complicated and they have a key space sufficiently large. The proposed image encryption algorithm is compared to other recent image encryption schemes by using different security analysis factors including differential attacks analysis, statistical tests, key space analysis, information entropy test and running time. The results demonstrated that the proposed image encryption scheme has better results in the level of security and speed.     

A new secure and robust watermarking technique based on logistic map and modification of DC coefficient

The proliferation of information and communication technology has made exchange of information easier than ever. Security and copyright protection of multimedia contents in such a scenario has become a major challenge for the research community round the globe. Digital watermarking has been found as an effective tool for protection and security of multimedia content. A secure and robust watermarking scheme based on DC coefficient modification in pixel domain and a modified logistic map is presented in this paper. The cover image is divided into \(8 \times 8\) sub-blocks and instead of computing DC coefficient using discrete cosine transform (DCT), we compute DC coefficient of each block in spatial domain. Watermark bits are embedded by modifying DC coefficients of various blocks in spatial domain. The quantum of change to be brought in various pixels of a block for embedding watermark bit depends upon DC coefficient of respective blocks, nature of watermark bit (0 or 1) to be embedded and the adjustment factor. The security of embedded watermark has been taken care of by using chaotic encryption based on a generalized logistic map (GLM). We show that GLM has better properties like ergodicity, larger lyapunov exponent, uniform invariant density, mixing, higher range of bifurcation parameter etc., compared to basic logistic map. We exploit these properties of GLM for designing a secure robust, strong efficient cryptosystem to encrypt the watermark information before embedding it. Experimental investigations show that besides being highly secure the proposed technique is robust to both signal processing and geometric attacks. Further, the proposed scheme is computationally efficient as DC coefficient which holds the information is computed in pixel domain instead of using DCT on an image block.     

三维气相爆轰动态并行计算程序设计与开发

在三维气相爆轰数值研究中,网格精度和计算域的规模导致网格数占有非常庞大的计算资源,进而给数值模拟带来了极大的挑战。本文针对这一难题,采用5阶WENO格式对带化学反应Euler方程组进行空间离散,基于MPI（MessagePassingInterface）并行模式开发了高精度动态并行代码,并对爆轰波在带有障碍物的三维方形管道中的传播过程进行计算。计算结果表明,高精度动态并行计算能够很好的模拟三维气相爆轰波在大尺寸管道中的传播,不仅提高了计算效率,而且提高了爆轰波阵面的分辨率。与高精度静态并行相比,高精度动态并行计算减少了界面数据通信时间,从而进一步提高了计算效率。因此,高精度动态并行程序为探究三维气相爆轰新的物理机制提供有效的手段。     

MULTIBLOCK EULER COMPUTATION OF TRANSONIC FLOW ABOUT A GENERIC AIRCRAFT CONFIGURATION

SUMMARY

An implicit, upwind numerical scheme is presented for computing the unsteady transonic flowfield around complex aircraft configurations. This scheme solves the time-dependent Euler equations with a finite volume method that incorporates a high resolution Riemann solver to define the interface fluxes. A multiblock domain decomposition appproach is used to partition the computational domain into a completely arbitrary arrangement of blocks. However, this work is restricted to C¹-continuous grid lines across block boundaries. Consequently, block-block interfaces are treated such as to mimic interior block communication, thus introducing no additional spatial differencing error. Computational results have been obtained for a complete wing-pylon-store configuration with the store in the captive and vertical launch positions. The numerical results for both stationary and dynamic grids have shown favorable agreement with experimental data.