A novel watermarking scheme for authenticating individual data integrity of WSNs

Guangyong Gao,Min Wang 한국인터넷정보학회 2023 KSII Transactions on Internet and Information Syst Vol.17 No.3

The limited computing power of sensor nodes in wireless sensor networks (WSNs) and data tampering during wireless transmission are two important issues. In this paper, we propose a scheme for independent individual authentication of WSNs data based on digital watermarking technology. Digital watermarking suits well for WSNs, owing to its lower computational cost. The proposed scheme uses independent individual to generate a digital watermark and embeds the watermark in current data item. Moreover, a sink node extracts the watermark in single data and compares it with the generated watermark, thereby achieving integrity verification of data. Inherently, individual validation differs from the grouping-level validation, and avoids the lack of grouping robustness. The improved performance of individual integrity verification based on proposed scheme is validated through experimental analysis. Lastly, compared to other state-of-the-art schemes, our proposed scheme significantly reduces the false negative rate by an average of 5%, the false positive rate by an average of 80% of data verification, and increases the correct verification rate by 50% on average.

Reversible Watermarking with Adaptive Embedding Threshold Matrix

( Guangyong Gao ),( Yun-qing Shi ),( Xingming Sun ),( Caixue Zhou ),( Zongmin Cui ),( Liya Xu ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.9

In this paper, a new reversible watermarking algorithm with adaptive embedding threshold matrix is proposed. Firstly, to avoid the overflow and underflow, two flexible thresholds, TL and TR, are applied to preprocess the image histogram with least histogram shift cost. Secondly, for achieving an optimal or near optimal tradeoff between the embedding capacity and imperceptibility, the embedding threshold matrix, composed of the embedding thresholds of all blocks, is determined adaptively by the combination between the composite chaos and the average energy of Integer Wavelet Transform (IWT) block. As a non-liner system with good randomness, the composite chaos is suitable to search the optimal embedding thresholds. Meanwhile, the average energy of IWT block is calculated to adjust the block embedding capacity, and more data are embedded into those IWT blocks with larger average energy. The experimental results demonstrate that compared with the state-of-the-art reversible watermarking schemes, the proposed scheme has better performance for the tradeoff between the embedding capacity and imperceptibility.

Efficient Identity-Based Generalized Ring Signcryption Scheme

Zhou, Caixue,Cui, Zongmin,Gao, Guangyong Korean Society for Internet Information 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12

In this paper, we introduce a new concept called generalized ring signcryption (GRSC), which can achieve ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system which has a large number of users, or has limited storage space, or whose function requirements may be changed later. We give a formal definition and a security model of GRSC and propose a concrete scheme based on bilinear pairings. In the random oracle model, the scheme's confidentiality can be proved under the GBDH assumption, and its unforgeability can be proved under GDH' assumption, and what is more, this scheme also allows unconditional anonymity. Compared with other identity-based ring signcryption schemes that use bilinear pairings as well, our scheme is a highly efficient one.

Optimal pre-conditioning and support designs of floor heave in deep roadways

Wang, Chunlai,Li, Guangyong,Gao, Ansen,Shi, Feng,Lu, Zhijiang,Lu, Hui Techno-Press 2018 Geomechanics & engineering Vol.14 No.5

In order to reduce deformation of roadway floor heave in deep underground soft rockmass, four support design patterns were analyzed using the Fast Lagrangian Analysis of Continua (FLAC)3D, including the traditional bolting (Design 1), the bolting with the backbreak in floor (Design 2), the full anchorage bolting with the backbreak in floor (Design 3) and the full anchorage bolting with the bolt-grouting backbreak in floor (Design 4). Results show that the design pattern 4, the full anchorage bolting with the bolt-grouting backbreak in floor, was the best one to reduce the deformation and failure of the roadway, the floor deformation was reduced at 88.38% than the design 1, and these parameters, maximum vertical stress, maximum horizontal displacement and maximum horizontal stress, were greater than 1.69%, 5.96% and 9.97%. However, it was perfectly acceptable with the floor heave results. The optimized design pattern 4 provided a meaningful and reliable support for the roadway in deep underground coal mine.

An Efficient Routing in Urban Vehicular Ad Hoc Networks

Xu Liya,Deng Anyuan,Gao Guangyong,Yang Wenzhong,Cheng Yong 보안공학연구지원센터 2016 International Journal of Smart Home Vol.10 No.8

VANET is a highly mobile wireless ad hoc network that is targeted to support road safety, traffic monitoring and other applications. The node communication is easy to break due to the high mobility of vehicles and the road layout. In this paper, we propose an efficient routing based on static node assistance. The static nodes are fixed in each intersection. Each static node stores information of other static nodes in path. The routing takes static nodes as backbone nodes and vehicles as relay nodes between static nodes. The static nodes are selected dynamically and sequentially, and they are chosen according to the delay that packets are forwarded from the current static node to the candidate one. The vehicular relay selection between two static nodes considers the link stability as the parameter. Simulation results show performance improvement comparing with performance of other existing routing approaches.

Efficient Identity-Based Generalized Ring Signcryption Scheme

( Caixue Zhou ),( Zongmin Cui ),( Guangyong Gao ) 한국인터넷정보학회 2016 KSII Transactions on Internet and Information Syst Vol.10 No.12

In this paper, we introduce a new concept called generalized ring signcryption (GRSC), which can achieve ring signature and ring signcryption functions with only one key pair and one algorithm. It is very useful for a system which has a large number of users, or has limited storage space, or whose function requirements may be changed later. We give a formal definition and a security model of GRSC and propose a concrete scheme based on bilinear pairings. In the random oracle model, the scheme`s confidentiality can be proved under the GBDH assumption, and its unforgeability can be proved under GDH` assumption, and what is more, this scheme also allows unconditional anonymity. Compared with other identity-based ring signcryption schemes that use bilinear pairings as well, our scheme is a highly efficient one.

Fatigue optimization with combined ensembles of surrogate modeling for a truck cab

Jianguang Fang,Yunkai Gao,Guangyong Sun,Chengmin Xu,Qing Li 대한기계학회 2014 JOURNAL OF MECHANICAL SCIENCE AND TECHNOLOGY Vol.28 No.11

In this study, we propose the ensembles of surrogates for an industrial application of fatigue optimization problem that aims to maximizea truck cab’s fatigue life. After validating the numerical model, different ensembles of surrogates comprised polynomial responsesurface (PRS), radial basis function (RBF) and Kriging (KRG) models are established to approximate the fatigue life function. A hybridPSO algorithm, which integrates the standard PSO with sequential quadratic programming (SQP), is implemented here to seek a quasiglobaloptimum. Compared with individual surrogates, the ensembles of surrogates can attain more competent optima and yield a smallersurrogate error at the optimal point. Moreover, the hybrid PSO technique proves to search the better optima than the standard PSO in thefatigue optimization problem considered. Finally, it is found that a more accurate surrogate model may not necessarily produce a betteroptimum for the ensembles of surrogates, thus multiple ensembles are recommended without increasing much extra computational cost.

Fingerprint Liveness Detection Using Difference Co-occurrence Matrix Based Texture Features

Zhihua Xia,Chengsheng Yuan,Xingming Sun,Rui Lv,Decai Sun,Guangyong Gao 보안공학연구지원센터 2016 International Journal of Multimedia and Ubiquitous Vol.11 No.11

Fingerprint authentication systems have been widely deployed in both civilian and government applications, however, whether fingerprint authentication systems is security or not has been an important issue under fraudulent attempts through artificial spoof fingerprints. In this paper, inspired by popular feature descriptors such as gray level co-occurrence matrix (GLCM) and Gradient (difference matrix (DM)), we propose a novel software-based fingerprint liveness detection algorithm called difference co-occurrence matrix (DCM). In doing so, quantization operation is firstly conducted on the images. DMs are constructed by calculating difference matrices of horizontal and vertical pixel values of images; difference co-occurrence arrays are constructed from the difference matrices between adjacent pixels. To reduce the influence of abnormal pixel values, truncation is used for DMs. Then, we compute four parameters (Angular Second Moment, Entropy, Inverse Differential Moment and Correlation) used as feature vectors of fingerprint images. For the first time in the fingerprint liveness detection, we construct eight difference co-occurrence matrices and extract texture features from processed DCMs. Finally, SVM classifier is used to predict classification accuracy. The experimental results reveal that our proposed method can achieve more accurate classification compared with the best algorithms of 2013 Fingerprint Liveness Detection Competition, while being able to recognize spoofed fingerprints with a better degree of accuracy.