A blind watermarking algorithm based on fractional Fourier transform and visual cryptography

This paper presents a robust copyright protection scheme based on fractional Fourier transform (FrFT) and visual cryptography (VC). Unlike the traditional schemes, in our scheme, the original image is not modified by embedding the watermark into the original image. We use the visual secret sharing scheme to construct two shares, namely, master share and ownership share. Features of the original image are extracted using SVD, and are used to generate the master share. Ownership share is generated with the help of secret image (watermark) and the master share, using VC technique. The two shares separately give no information about the secret image, but for ownership identification, the secret image can be revealed by stacking the master share and the ownership share. In order to achieve the robustness and security, the properties of VC, FrFT and SVD are used in our scheme. The experimental results show that the proposed scheme is strong enough to resist various signal processing operations.     

Power allocation-Assisted secrecy analysis for NOMA enabled cooperative network under multiple eavesdroppers

In this work, the secrecy of a typical wireless cooperative dual-hop non-orthogonal multiple access (NOMA)-enabled decode-and-forward (DF) relay network is investigated with the impact of collaborative and non-collaborative eavesdropping. The system model consists of a source that broadcasts the multiplexed signal to two NOMA users via a DF relay, and information security against the eavesdropper nodes is provided by a helpful jammer. The performance metric is secrecy rate and ergodic secrecy capacity is approximated analytically. In addition, a differential evolution algorithm-based power allocation scheme is proposed to find the optimal power allocation factors for relay, jammer, and NOMA users by employing different jamming schemes. Furthermore, the secrecy rate analysis is validated at the NOMA users by adopting different jamming schemes such as without jamming (WJ) or conventional relaying, jamming (J), and with control jamming (CJ). Simulation results demonstrate the superiority of CJ over the J and WJ schemes. Finally, the proposed power allocation outperforms the fixed power allocation under all conditions considered in this work.     

Secure Relay Selection of Cognitive Two-Way Denoise-and-Forward Relaying Networks

In this paper, secrecy performance of a cognitive two-way denoise-and-forward relaying network consisting of two primary user (PT and PD) nodes, two secondary source (SA and SB) nodes, multiple secondary relay (\({\textit{SR}}_i\)) nodes and an eavesdropper (E) node is considered, where SA and SB exchange their messages with the help of one of the relays using a two-way relaying scheme. The eavesdropper tries to wiretap the information transmitted between SA and SB. To improve secrecy performance of the network, two relay selection schemes called maximum sum rate and maximum secrecy capacity based relay selection (MSRRS and MSCRS) are proposed and analyzed in terms of intercept probability. It is proved that the MSRRS and MSCRS schemes have the same secrecy performance. Two parameters called average number gain and average cost gain are proposed to show the performance of the proposed relay selection schemes. Numerical results demonstrated that with 10 relay nodes, the proposed relay selection schemes can achieve, respectively, 3.7 dB and 1.9 dB’s improvements in terms of the reduced intercept probability and the enhanced secrecy capacity compared to the traditional round-robin scheme.     

基于随机数的图像信息秘密分享技术

提出一种不需将象素扩展的图像秘密分享技术,其方法是利用随机数的概念,使投影片上每个象素点的色彩利用随机数的编码技术来产生,当解密后仍可保持所解出的秘密图像的视觉效果,且能达到象素不需扩展的目的。通过制定每张投影片的随机数概率,来控制明暗的对比程度,也即对透光程度(透光率)加以控制,透光程度越高,则图像视觉上愈亮;反之则图像视觉上愈暗。实验结果显示,与其他类型的图像秘密分享机制相比,这个方法的有效性和可行性是值得肯定的。     

Relay selection schemes for secure transmission in cognitive radio networks

The security in cognitive radio networks (CRNs) has been attracting continuously growing attention due to the open and dynamic nature of cognitive radio architecture. In this paper, we propose new relay selection schemes to improve the physical layer security in CRNs. A trusted decode-and-forward relay is selected to help the secondary user (SU) transmission and improve the secrecy rate in the presence of multiple eavesdroppers and multiple primary users (PUs). The secrecy rate of the SU is characterized under both its own transmit power constraint as well as a set of interference power constraints imposed at each PU, in order to preserve its quality of service. The performance of the proposed schemes is analyzed in terms of the achievable secrecy rate and the intercept probability. Closed form expressions for the asymptotic intercept probability at high source-relays channel variances are also derived. Moreover, new derivations of some existing traditional schemes are presented and compared. The performance comparison of the proposed schemes with the schemes proposed in the literature reveals the superior of the proposed schemes.     

Sharing more information in gray visual cryptography scheme

Visual cryptography scheme (VCS) shares a binary secret image into several binary shadows, and the secret image can be visually revealed by stacking qualified shadows without computation. From the point of view of sharing secret information, VCS is not efficiency because of the large size expansion and low visual quality. In this paper, we introduce a general gray visual cryptography scheme, which can share more information, called Sharing More Information Gray Visual Cryptography Scheme (SMIGVCS). All the shadow pixels of VCS embed additional information to generate gray shadows of SMIGVCS, and the embedded information comes from the shadows of a polynomial-based secret sharing scheme (PSSS). In the revealing process, a vague secret image is visually decoded by stacking qualified shadows, and more information is revealed by computation. Compared with the two-in-one image secret sharing scheme (TiOISSS), our SMIGVCS can achieve smaller shadow size with acceptable visual quality.     

Secure AF relaying with efficient partial relay selection scheme

This paper evaluates the secrecy performance for the amplify‐and‐forward (AF) protocol with partial relay selection (PRS) schemes in the scenario of multiple independent but not necessarily identically distributed eavesdroppers. The secrecy performances of the first‐hop and second‐hop PRS schemes are revisited. Given the secrecy data rate, an efficient PRS scheme is presented, which selects the relay based on the instantaneous channel state information (CSI) of either the first or second hop according to the statistical CSI of two hops. The proposed PRS scheme provides the trade‐off between the two‐hop and one‐hop PRS criteria. Results show that the secrecy outage probability (SOP) performance of the proposed scheme is close to that of the conventional opportunistic relaying in the medium main‐to‐eavesdropper ratio (MER) regions. As for the intercept probability, the second‐hop scheme achieves the highest diversity order among PRS schemes and its performance depends on the overall eavesdroppers' behavior not on individual effects of the specific relay. The proposed criterion also outperforms the first‐hop PRS scheme. Simulation results finally substantiate the accuracy of the theoretical analysis.     

A New Relay and Jammer Selection Schemes for Secure One-Way Cooperative Networks

This paper presents different relay and jammer selection schemes for one-way cooperative networks to increase the security against malicious eavesdroppers. We consider a single source-destination cooperative network with multiple intermediate nodes and one or more eavesdroppers. The selection in the proposed schemes is made with the presence of direct links and the assumption that the broadcast phase is unsecured. The proposed schemes select three intermediate nodes. The first selected node operates in the conventional relay mode and assists the source to deliver its data to the corresponding destination via a Decode-and-Forward strategy. The second and third selected nodes are used in different communication phases as jammers to create intentional interference at the eavesdroppers’ nodes. Moreover, a hybrid scheme which switches between jamming and non-jamming modes is introduced in this paper. The proposed schemes are analyzed in terms of ergodic secrecy capacity and secrecy outage probability. Extensive analysis and a set of simulation results are presented to demonstrate the effectiveness of the different schemes presented in this work. The obtained results show that the proposed schemes with jamming outperform the conventional non-jamming schemes and the hybrid switching scheme further improves the secrecy capacity. The impact of changing both the eavesdroppers and the relays location on ergodic secrecy capacity and secrecy outage probability is also discussed. Finally, the impact of the presence of multiple eavesdroppers is studied in this paper.     

Performance study of hybrid decode–amplify–forward (HDAF) relaying scheme for physical layer security in wireless cooperative network

In this paper, the secrecy performance and power allocation of the signal‐to‐noise ratio‐based hybrid decode–amplify–forward (HDAF) relaying protocol in wireless cooperative network are investigated to get security at physical layer. The performance metrics considered are secrecy rate and intercept probability. The Ergodic secrecy rate is approximated theoretically. The effect of relay and eavesdropper locations on the secrecy performance of the system is analyzed. It is found that maximum secrecy rate is obtained for the relay close‐to‐destination case and minimum for the relay close‐to‐eavesdropper case. Jamming schemes are superior in secrecy rate performance than without jamming schemes. To enhance the secrecy rate further with the optimized relay and jammer powers, invasive weed optimization (IWO) algorithm‐based power allocation is proposed. Here, maximizing the secrecy rate is defined as the cost function for the proposed IWO algorithm‐based power allocation. Comparative study is done over the conventional equal and proposed power allocation schemes for validation. The proposed power allocation scheme proved to be superior. Copyright © 2016 John Wiley & Sons, Ltd.     

Improving the visual quality of size invariant visual cryptography scheme

In order to reduce the pixel expansion of visual cryptography scheme (VCS), many size invariant visual cryptography schemes (SIVCS’s) were proposed. However, most of the known SIVCS’s have bad visual quality and thin line problems, hence the known SIVCS’s are only suitable to encrypt coarse secret images. In this paper, we notice that the variance of the darkness levels of the pixels also reflects the visual quality of the recovered secret image, as well as the average contrast. We verify, analytically and experimentally, the effectiveness of the variance to be a criterion for evaluating the visual quality of the recovered secret image. Furthermore, we propose two multi-pixel encryption size invariant visual cryptography schemes (ME-SIVCS’s) which improve the visual quality of the recovered secret image by reducing the variance of the darkness levels. In addition, the proposed ME-SIVCS’s can be used to encrypt fine secret images since they avoid some known thin line problems. Experimental results and comparisons are also given to show the effectiveness of the proposed ME-SIVCS’s. Finally, we give suggestions on obtaining good visual quality for the recovered secret image.     

On the Contrast in Visual Cryptography Schemes

A visual cryptography scheme is a method to encode a secret image SI into shadow images called shares such that certain qualified subsets of shares enable the ``visual' recovery of the secret image. The ``visual' recovery consists of xeroxing the shares onto transparencies, and then stacking them. The shares of a qualified set will reveal the secret image without any cryptographic computation. In this paper we analyze the contrast of the reconstructed image in k out of n visual cryptography schemes. (In such a scheme any k shares will reveal the image, but no set of k-1 shares gives any information about the image.) In the case of 2 out of n threshold schemes we give a complete characterization of schemes having optimal contrast and minimum pixel expansion in terms of certain balanced incomplete block designs. In the case of k out of n threshold schemes with we obtain upper and lower bounds on the optimal contrast. Received 27 September 1996 and revised 13 February 1998     

Cryptanalysis and security enhancement of a remote user authentication scheme using smart cards

With the broad implementations of the electronic business and government applications,robust system security and strong privacy protection have become essential requirements for remote user authentication schemes.Recently,Chen et al.pointed out that Wang et al.’s scheme is vulnerable to the user impersonation attack and parallel session attack,and proposed an enhanced version to overcome the identified security flaws.In this paper,however,we show that Chen et al.’s scheme still cannot achieve the claimed security goals and report its following problems:(1) It suffers from the offline password guessing attack,key compromise impersonation attack and known key attack;(2) It fails to provide forward secrecy;(3) It is not easily repairable.As our main contribution,a robust dynamic ID-based scheme based on non-tamper resistance assumption of the smart cards is presented to cope with the aforementioned defects,while preserving the merits of different related schemes.The analysis demonstrates that our scheme meets all the proposed criteria and eliminates several grave security threats that are difficult to be tackled at the same time in previous scholarship.     

Enhanced Physical Layer Security for Cooperative NOMA Network with Hybrid-Decode-Amplify-Forward Relaying via Power Allocation Assisted Control Jamming

This paper introduces the hybrid-decode-amplify-forward (HDAF) cooperative relaying into a control jamming aided NOMA network under Rayleigh-flat-fading channel conditions. In HDAF, the relay switches between AF and DF modes based on SNR threshold to forward the information signal to the corresponding NOMA users in the existence of an eavesdropper. We first characterize the secrecy performance of the considered network in terms of secrecy rate at both NOMA users analytically under different jamming scenarios. Further, to improve the secrecy rate, Differential Evolution (DE) algorithm-based power allocation is adopted to optimize the powers of jammer, relay, and NOMA users for which maximization of secrecy rate is chosen as the cost function. Moreover, the impact of different numerical parameters such as signal-to-noise ratio (SNR), jammer-to-eavesdropper distance, and relay-to-eavesdropper distance on the secrecy rate is investigated at both NOMA users by employing different jamming schemes. The MATLAB based simulation results validate the efficacy of proposed power allocation over fixed power allocation, CJ over other jamming schemes, and application of HDAF relaying for physical layer security enhancement of NOMA enabled cooperative network.

     

A multicast key management scheme based on characteristic values of members

A new collusion attack on Pour-like schemes is proposed in this paper. Then, we present a collusion-free centralized multicast key management scheme based on characteristic values of members. The re-keying method that other group members calculate new keys when a member is joining or leaving is also designed. It achieves forward secrecy and backward secrecy. Compared with typical existing centralized schemes, the storage of Group Key Controller (GKC) in our scheme halves the storage overhead of others, and communication overhead of GKC is 2 in case of joining re-keying. Especially, the leaving re-keying overhead is log₂ n, and the overall performance is excellent.     

联合发端天线选择和收端人工噪声的物理层安全传输方法

该文在同频全双工技术快速发展的背景下,针对物理层安全研究中波束成形技术的高复杂度和发端天线选择(TAS)技术的低性能,提出一种联合发端天线选择和收端人工噪声(AN)的物理层安全传输方法TAS-rAN。首先,有多根天线的发端,利用天线选择技术,选取能使合法接收方接收信噪比最大的天线发送保密消息;其次,有同频全双工能力的收端,在接收到消息的同时,发送人工噪声来扰乱窃听方对保密消息的窃听。在Nakagami-m信道下,推导了安全中断概率的闭合表达式,并基于此,得到非零安全容量的概率表达式;通过渐进安全中断概率的推导,得到TAS-rAN方法的安全分集度。仿真结果表明,与已有的TAS-single和TAS-Alamouti方法相比,TAS-rAN安全方法具有较强的稳定性,且能提供更优的安全性能。     

A novel relay selection algorithm using ant colony optimization with artificial noise for secrecy enhancement in cooperative networks

Cooperative communication is one of the fastest growing research areas of today. It can efficiently mitigate the effect of shadowing and fading with the help of relays and proper relay selection technique. In this paper, a novel relay selection scheme combined with artificial noise (AN) is devised to enhance the secrecy of cooperative networks with amplify‐and‐forward scheme, over Rayleigh fading channels in the presence of a passive eavesdropper. The probability of path selection of ant colony optimization algorithm is used for selecting the best relay with high end‐to‐end signal‐to‐noise ratio. The probability of choosing a path depends on the significance of channel gain (G) and fading coefficients (h). The proposed algorithm finds the best relay in the following wireless scenarios: when (i) both channel gain and fading coefficients are significant; (ii) only fading coefficients are significant; and (iii) only channel gain is significant. Because the direct links between source and destination and source and eavesdropper are considered, AN along with the information is sent by both the source and the selected relay. The performance is evaluated based on secrecy rate (R_s); for the relays randomly placed between the source and destination and for different eavesdropper's location. The results show that the proposed relay selection scheme achieves better secrecy for different wireless scenarios compared with traditional schemes. With the help of AN, the secrecy rate can be made positive even when the eavesdropper lies near to source.     

Improving the visual quality of random grid-based visual secret sharing via error diffusion

Random grid (RG) is an approach to implement visual secret sharing (VSS) without pixel expansion. However, visual quality of the recovered secret image in RG-based VSS is not satisfactory. In this paper, two methodologies are introduced for improving image quality. Firstly, a random noise balanced error diffusion (RNBED) algorithm is proposed for generating RGs whose black pixels are distributed homogeneously. By combining the proposed RNBED algorithm and existing RG-based VSS schemes, two approaches for enhancing the recovered image quality are presented. Experimental results are provided, illustrating that competitive visual quality is achieved.     

Discrete Memoryless Interference and Broadcast Channels With Confidential Messages: Secrecy Rate Regions

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers while ensuring mutual information-theoretic secrecy. That is, each receiver is kept in total ignorance with respect to the message intended for the other receiver. The secrecy level is measured by the equivocation rate at the eavesdropping receiver. In this paper, we present inner and outer bounds on secrecy capacity regions for these two communication systems. The derived outer bounds have an identical mutual information expression that applies to both channel models. The difference is in the input distributions over which the expression is optimized. The inner bound rate regions are achieved by random binning techniques. For the broadcast channel, a double-binning coding scheme allows for both joint encoding and preserving of confidentiality. Furthermore, we show that, for a special case of the interference channel, referred to as the switch channel, derived bounds meet. Finally, we describe several transmission schemes for Gaussian interference channels and derive their achievable rate regions while ensuring mutual information-theoretic secrecy. An encoding scheme in which transmitters dedicate some of their power to create artificial noise is proposed and shown to outperform both time-sharing and simple multiplexed transmission of the confidential messages.     

Massive-scale image retrieval based on deep visual feature representation

This paper proposes an image retrieval algorithm towards massive-scale multimedia data. In order to be consistent with human visual system, we first design a color attention function to describe the important of different image patches. Subsequently, we combine color and texture to construct candidate regions, which will be fed into a deep neural network (DNN) for deep representation extraction. Then, we design a similarity function to calculate the distance among different images, where top-ranking images are considered as the required images. Experimental results show the effectiveness and robustness of our proposed method.