Search

Source location privacy (SLP) protection is an emerging research topic in wireless sensor networks (WSNs). Because the source location represents the valuable information of the target being monitored and tracked, it is of great practical significance to achieve a high degree of privacy of the source location. Although many studies based on phantom nodes have alleviates the protection of source location privacy to some extent. It is urgent to solve the problems such as complicate the ac path between nodes, improve the centralized distribution of Phantom nodes near the source nodes and reduce the network communication overhead. In this paper, PSSPR routing is proposed as a visable approach to address SLP issues. We use the coordinates of the center node V to divide sector-domain, which act as important role in generating a new phantom nodes. The phantom nodes perform specified routing policies to ensure that they can choose various locations. In addition, the directed random route can ensure that data packets avoid the visible range when they move to the sink node hop by hop. Thus, the source location is protected. Theoretical analysis and simulation experiments show that this protocol achieves higher security of source node location with less communication overhead.

The (k, n)-threshold quantum secret sharing scheme is an important and difficult field in quantum information processing and quantum cryptography. In this paper, the (k, n)-threshold quantum secret sharing scheme based on local operations and classical communication (LOCC-QSS) is investigated. Firstly, in order to effectively study the LOCC-QSS scheme, digital and graphical representations of judgement space are introduced creatively. These representations are simple and convenient. Secondly, an algorithm is designed to search optional states for any given k and n. For optional states, the unambiguous probability equals 0 when x participants cooperate (x

The main challenge of user personality recognition is low accuracy resulting from small sample size and severe sample distribution imbalance. This paper analyzes the impact of imbalanced data distribution and positive and negative sample overlap on the machine learning classification model. The classification model is based on the data resampling technique, which can improve the classification accuracy. These problems can be solved once the data are effectively resampled. We present a personality prediction method based on particle swarm optimization (PSO) and synthetic minority oversampling technique+Tomek Link (SMOTETomek)resampling (PSO-SMOTETomek), which, apart from effective SMOTETomek resampling of data samples, is able to execute PSO feature optimization for each set of feature combinations. Validated by simulation, our analysis reveals that the PSO-SMOTETomek method is efficient under a small dataset, and the accuracy of personality recognition is improved by up to around 10%. The results are better than those of previous similar studies. The average accuracies of the plain text dataset and the non-plain text dataset are 75.34% and 78.78%, respectively. The average accuracies of the short text dataset and the long text dataset are 75.34% and 64.25%, respectively. From the experimental results, we found that short text has a better classification effect than long text. Plain text data can still have high personality discrimination accuracy, but there is no relevant external information. The proposed model is able to facilitate the design and implementation of a personality recognition system, and the model significantly outperforms existing state-of-the-art models.

The security demands in humanization should be considered as important, because artificial intelligence is developing rapidly in this area. Recent studies have shown the vulnerability of many deep learning models to adversarial examples; however, only a few studies on facial expression adversarial examples have been conducted. Thus, in this paper, we propose a novel method for generating facial expression adversarial examples using facial saliency maps and facial masking maps. Extensive numerical experiments demonstrate the outstanding performance of our method in terms of attack accuracy, structural similarity index measure score, and computational time, compared with other leading methods, such as the fast gradient sign method, projected gradient descent method, and Carlini–Wagner attacks.

Nowadays, blockchain has become one of the most cutting-edge technologies, which has been widely concerned and researched. However, the quantum computing attack seriously threatens the security of blockchain, and related research is still less. Targeting at this issue, in this paper, we present the definition of post-quantum blockchain (PQB) and propose a secure cryptocurrency scheme based on PQB, which can resist quantum computing attacks. First, we propose a signature scheme based on lattice problem. We use lattice basis delegation algorithm to generate secret keys with selecting a random value, and sign message by preimage sampling algorithm. In addition, we design the first-signature and last-signature in our scheme, which are defined as double-signature. It is used to reduce the correlation between the message and the signature. Second, by combining the proposed signature scheme with blockchain, we construct the PQB and propose this cryptocurrency scheme. Its security can be reduced to the lattice short integer solution (SIS) problem. At last, through our analysis, the proposed cryptocurrency scheme is able to resist the quantum computing attack and its signature satisfies correctness and one-more unforgeability under the lattice SIS assumption. Furthermore, compared with previous signature schemes, the sizes of signature and secret keys are relatively shorter than that of others, which can decrease the computational complexity. These make our cryptocurrency scheme more secure and efficient.

Artificial intelligence is developing rapidly in the direction of intellectualization and humanization. Recent studies have shown the vulnerability of many deep learning models to adversarial examples, but there are fewer studies on adversarial examples attacking facial expression recognition systems. Human–computer interaction requires facial expression recognition, so the security demands of artificial intelligence humanization should be considered. Inspired by facial expression recognition, we want to explore the characteristics of facial expression recognition adversarial examples. In this paper, we are the first to study facial expression adversarial examples (FEAEs) and propose an adversarial attack method on facial expression recognition systems, a novel measurement method on the adversarial hardness of FEAEs, and two evaluation metrics on FEAE transferability. The experimental results illustrate that our approach is superior to other gradient-based attack methods. Finding FEAEs can attack not only facial expression recognition systems but also face recognition systems. The transferability and adversarial hardness of FEAEs can be measured effectively and accurately.

In order to estimate maximum steganographic capacity of discrete cosine transform (DCT) domain in JPEG image, this paper presents a method based on the maximize capacity under undetectable model (MCUU). We analyze the relation between steganographic capacity and affecting factors (image size, steganography operator, loading band, embedding intensity and image complexity). Then we design a steganography analyzer architecture and a steganographic algorithm which can dynamically increase the steganographic capacity. Compared with other methods of embedding capacity estimation in DCT domain, the proposed methods utilizes general steganalysis methods rather than one specific steganalysis technique and takes five essential factors into account, which improves the commonality and comprehensiveness of capacity estimation, respectively. The experimental results show that steganographic capacity for quantization index modulation (QIM) is almost twice that of spread spectrum (SS) based on MCUU model.

This paper presents a spatial domain quantum watermarking scheme. For a quantum watermarking scheme, a feasible quantum circuit is a key to achieve it. This paper gives a feasible quantum circuit for the presented scheme. In order to give the quantum circuit, a new quantum multi-control rotation gate, which can be achieved with quantum basic gates, is designed. With this quantum circuit, our scheme can arbitrarily control the embedding position of watermark images on carrier images with the aid of auxiliary qubits. Besides reversely acting the given quantum circuit, the paper gives another watermark extracting algorithm based on quantum measurements. Moreover, this paper also gives a new quantum image scrambling method and its quantum circuit. Differ from other quantum watermarking schemes, all given quantum circuits can be implemented with basic quantum gates. Moreover, the scheme is a spatial domain watermarking scheme, and is not based on any transform algorithm on quantum images. Meanwhile, it can make sure the watermark be secure even though the watermark has been found. With the given quantum circuit, this paper implements simulation experiments for the presented scheme. The experimental result shows that the scheme does well in the visual quality and the embedding capacity.

This work focuses on the problem of maximum watermarking payload under the condition of keeping image transparency. The maximum watermarking payload of JPEG images is influenced by internal factors such as the size, complexity and visual sensitivity of images, as well as external factors including embedding operators, carrier frequency bands and embedding intensity, etc. Through the construction of payload mathematical model, theoretic analysis and experimental derivation we propose an estimation method of maximum watermarking payload based on the DCT coefficients. The feasibility and efficiency of the proposed method has been demonstrated in our experiments by adopting two embedding operators and three carrier frequency bands. Our results show, in comparison with previously related work, the proposed method can be more practical.

Network viruses pose a great threat to cyberspace, which makes people study many different models of network virus propagation based on dynamic system theory. However, many models of network virus have not been carried out in-depth analysis on the security situation of network virus system, especially the research on the security of network virus propagation model using safety entropy is still in the early stage. In this paper, we propose a new type of SLBRS (Susceptible–Latent–Breaking-out–Recovered–Susceptible) network virus propagation model. Firstly, we analyze the dynamic characteristics of the SLBRS model such as stability, periodic orbit and basic reproduction number. Secondly, we analyzed the security of SLBRS model, and studied the security trend of the virus system on the basis of safety entropy and its derivative. Finally, numerical simulation experiments were carried out on SLBRS model and the trend of safety entropy, the simulation results verify the correctness of the model. Numerical simulation shows that SLBRS model avoids the shortcomings of state and parameter processing in previous studies, and the SLBRS model can describe the security trend of the system intuitively and effectively by using the method of safety entropy.

Quantum network coding with the assistance of auxiliary resources can achieve perfect transmission of the quantum state. This paper suggests a novel perfect network coding scheme to efficiently solve the quantum $k$-pair problem, in which only a few assisting resources are introduced. Specifically, only one pair of maximally entangled state needs to be pre-shared between two intermediate nodes, and only $O(k)$ of classical information is transmitted though the network. Moreover, the classical communication used in our protocol does not cause transmission congestion, providing better adaptability to large-scale quantum $k$-pair networks.Through relevant analyses and comparisons, we demonstrate that our proposed scheme saves resources and has good application value, thereby showing its high efficiency. Furthermore, the proposed scheme achieves 1-max flow quantum communication, and the achievable rate region result is extended from its counterpart over the butterfly network.

Recently, the number of people who are members of multiple online social networks simultaneously has increased. However, if these people share everything with others, they risk their privacy. Users may be unaware of the privacy risks involved with sharing their sensitive information on a network. Currently, there are many research efforts focused on social identity linkage (SIL) on multiple online social networks for commercial services, which exacerbates privacy issues. Many existing studies consider methods of encrypting or deleting sensitive information without considering if this is unreasonable for social networks. Meanwhile, these studies ignore privacy awareness, which is rudimentary and critical. To enhance privacy awareness, we discuss a user privacy exposure measure for users who are members of multiple online social networks. With this measure, users can be aware of the state of their privacy and their position on a privacy measurement scale. Additionally, we propose a straightforward method through our framework to reduce information loss and foster user privacy awareness by using spurious content for required fields.

In a rational protocol, players are supposed to be rational, rather than honest, semi-honest or dishonest. This kind of protocols is practical and important, but seldom researched in quantum computation field. In this paper, a multifunctional rational quantum secure multi-party computation protocol is investigated. Firstly, a rational quantum summation protocol is proposed. Secondly, the protocol is generalized to a rational quantum multi-party computation protocol. The computation which is homomorphic can be resolved by our protocol. Thirdly, from the view of utilities, correctness, Nash equilibrium and fairness, analyses show that our protocol is rational. Besides, our protocol is also proved to be secure, efficient and practical. Our research will promote the development of rational quantum multi-party protocol.

Ciphertext-policy attribute-based encryption (CP-ABE) is becoming a promising solution to guarantee data security in cloud computing. In this paper, we present an attribute-based secure data sharing scheme with Efficient revocation (EABDS) in cloud computing. Our scheme first encrypts data with Data encryption key (DEK) using symmetric encryption and then encrypts DEK based on CP-ABE, which guarantees the data confidentiality and achieves fine-grained access control. In order to solve the key escrow problem in current attribute based data sharing schemes, our scheme adopts additively homomorphic encryption to generate attribute secret keys of users by attribute authority in cooperation with key server, which prevents attribute authority from accessing the data by generating attribute secret keys alone. Our scheme presents an immediate attribute revocation method that achieves both forward and backward security. The computation overhead of user is also reduced by delegating most of the decryption operations to the key server. The security and performance analysis results show that our scheme is more secure and efficient.

As a promising branch of quantum information hiding, Quantum steganography aims to transmit secret messages covertly in public quantum channels. But due to environment noise and decoherence, quantum states easily decay and change. Therefore, it is very meaningful to make a quantum information hiding protocol apply to quantum noisy channels. In this paper, we make the further research on a quantum steganography protocol for quantum noisy channels. The paper proved that the protocol can apply to transmit secret message covertly in quantum noisy channels, and explicity showed quantum steganography protocol. In the protocol, without publishing the cover data, legal receivers can extract the secret message with a certain probability, which make the protocol have a good secrecy. Moreover, our protocol owns the independent security, and can be used in general quantum communications. The communication, which happen in our protocol, do not need entangled states, so our protocol can be used without the limitation of entanglement resource. More importantly, the protocol apply to quantum noisy channels, and can be used widely in the future quantum communication.

Network coding is an effective means to enhance the communication efficiency. The characterization of network solvability is one of the most important topic in this field. However, for general network, the solvability conditions are still a challenge. In this paper, we consider the solvability of general quantum k-pair network in measurement-based framework. For the first time, a detailed account of measurement-based quantum network coding(MB-QNC) is specified systematically. Differing from existing coding schemes, single qubit measurements on a pre-shared graph state are the only allowed coding operations. Since no control operations are concluded, it makes MB-QNC schemes more feasible. Further, the sufficient conditions formulating by eigenvalue equations and stabilizer matrix are presented, which build an unambiguous relation among the solvability and the general network. And this result can also analyze the feasibility of sharing k EPR pairs task in large-scale networks. Finally, in the presence of noise, we analyze the advantage of MB-QNC in contrast to gate-based way. By an instance network $${G}_{k}$$ G k , we show that MB-QNC allows higher error thresholds. Specially, for X error, the error threshold is about 30% higher than 10% in gate-based way. In addition, the specific expressions of fidelity subject to some constraint conditions are given.

Based on the properties of two-qubit Grover’s quantum search algorithm, we propose two quantum direct communication protocols, including a deterministic secure quantum communication and a quantum secure direct communication protocol. Secret messages can be directly sent from the sender to the receiver by using two-qubit unitary operations and the single photon measurement with one of the proposed protocols. Theoretical analysis shows that the security of the proposed protocols can be highly ensured.

In order to achieve fine-grained access control in cloud computing, existing digital rights management (DRM) schemes adopt attribute-based encryption as the main encryption primitive. However, these schemes suffer from inefficiency and cannot support dynamic updating of usage rights stored in the cloud. In this paper, we propose a novel DRM scheme with secure key management and dynamic usage control in cloud computing. We present a secure key management mechanism based on attribute-based encryption and proxy re-encryption. Only the users whose attributes satisfy the access policy of the encrypted content and who have effective usage rights can be able to recover the content encryption key and further decrypt the content. The attribute based mechanism allows the content provider to selectively provide fine-grained access control of contents among a set of users, and also enables the license server to implement immediate attribute and user revocation. Moreover, our scheme supports privacy-preserving dynamic usage control based on additive homomorphic encryption, which allows the license server in the cloud to update the users' usage rights dynamically without disclosing the plaintext. Extensive analytical results indicate that our proposed scheme is secure and efficient.

The online social networks (OSNs) offer attractive means for social interactions and data sharing, as well as raise a number of security and privacy issues. Although current solutions propose to encrypt data before sharing, the access control of encrypted data has become a challenging task. Moreover, multiple owners may enforce different access policy to the same data because of their different privacy concerns. A digital rights management (DRM) scheme is proposed for encrypted data in OSNs. In order to protect users' sensitive data, the scheme allows users outsource encrypted data to the OSNs service provider for sharing and customize the access policy of their data based on ciphertext-policy attribute-based encryption. Furthermore, the scheme presents a multiparty access control model based on identity-based broadcast encryption and ciphertext-policy attribute-based proxy re-encryption, which enables multiple owners, such as tagged users who appear in a single data, customize the access policy collaboratively, and also allows the disseminators update the access policy if their attributes satisfy the existing access policy. Security analysis and comparison indicate that the proposed scheme is secure and efficient.

Cloud computing provides a convenient way of content trading and sharing. In this paper, we propose a secure and privacy-preserving digital rights management (DRM) scheme using homomorphic encryption in cloud computing. We present an efficient digital rights management framework in cloud computing, which allows content provider to outsource encrypted contents to centralized content server and allows user to consume contents with the license issued by license server. Further, we provide a secure content key distribution scheme based on additive homomorphic probabilistic public key encryption and proxy re-encryption. The provided scheme prevents malicious employees of license server from issuing the license to unauthorized user. In addition, we achieve privacy preserving by allowing users to stay anonymous towards the key server and service provider. The analysis and comparison results indicate that the proposed scheme has high efficiency and security.

In this paper, we first propose a hidden rule among the secure message, the initial tensor product of two Bell states and the final tensor product when respectively applying local unitary transformations to the first particle of the two initial Bell states, and then present a high-efficiency quantum steganography protocol under the control of the hidden rule. In the proposed quantum steganography scheme, a hidden channel is established to transfer a secret message within any quantum secure direct communication (QSDC) scheme that is based on 2-level quantum states and unitary transformations. The secret message hiding/unhiding process is linked with the QSDC process only by unitary transformations. To accurately describe the capacity of a steganography scheme, a quantitative measure, named embedding efficiency, is introduced in this paper. The performance analysis shows that the proposed steganography scheme achieves a high efficiency as well as a good imperceptibility. Moreover, it is shown that this scheme can resist all serious attacks including the intercept-resend attack, measurement-resend attack, auxiliary particle attack and even the Denial of Service attack. To improve the efficiency of the proposed scheme, the hidden rule is extended based on the tensor product of multiple Bell states.

By analyzing the basic properties of unitary transformations used in a quantum secure direct communication (QSDC) protocol, we show the main idea why a covert channel can be established within any QSDC channel which employs unitary transformations to encode information. On the basis of the fact that the unitary transformations used in a QSDC protocol are secret and independent, a novel quantum covert channel protocol is proposed to transfer secret messages with unconditional security. The performance, including the imperceptibility, capacity and security of the proposed protocol are analyzed in detail.

Motivated by some previous joint remote preparation schemes, we first propose some quantum circuits and photon circuits that two senders jointly prepare an arbitrary one-qubit state to a remote receiver via GHZ state. Then, by constructing KAK decomposition of some transformation in SO(4), one quantum circuit is constructed for jointly preparing an arbitrary two-qubit state to the remote receiver. Furthermore, some deterministic schemes of jointly preparing one-qubit and two-qubit states are presented. Besides, the proposed schemes are extended to multi-sender and the partially entangled quantum resources.

Classical communication plays an important role in quantum information processing such as remote state preparation and quantum teleportation. First, in this paper, we present some simple faithful remote state preparation of an arbitrary n-qubit state by constructing entanglement resources and special measurement basis for the sender. Then to weigh the classical resource required, we present an information-theoretical model to evaluate the classical communication cost. By optimizing the classical communication in quantum protocols, we obtain the optimal classical communication cost. This model can also be applied to the quantum teleportation. Moreover, based on the present computation model, we reinvestigate some remote state preparation and teleportation protocols in which the classical communication cost was imperfectly computed. Finally, some problems will be presented.

The paper applies the segmentation of peer-to- peer network to the defense process of P2P-based botnet, in order to cause the greatest damage on the P2P network. A lot of papers have been researching how to find the key nodes in P2P networks. To solve this problem, this paper proposes distributed detection algorithm NEI and centralized detection algorithm COR for detecting cut vertex, NEI algorithm not only apply to detect cut vertex of directed graph but also to the undirected graph. COR algorithm can reduce the additional communication. Then, this paper carries out simulation on P2P botnet, the simulation results show that the maximum damage on the botnet can be achieved by destructing key nodes.

In this paper, we firstly propose a new simple method to calculate entanglement swapping of χ-type entangled states, and then present a novel quantum steganography protocol with large payload. The new protocol adopts entanglement swapping to build up the hidden channel within quantum secure direct communication with χ-type entangled states for securely transmitting secret messages. Comparing with the previous quantum steganographies, the capacity of the hidden channel is much higher, which is increased to eight bits. Meanwhile, due to the quantum uncertainty theorem and the no-cloning theorem its imperceptibility is proved to be great in the analysis, and its security is also analyzed in detail, which is proved that intercept-resend attack, measurement-resend attack, ancilla attack, man-in-the-middle attack or even Dos(Denial of Service) attack couldn't threaten it. As a result, the protocol can be applied in various fields of quantum communication.

In this paper, by constructing some useful measurement bases, we first show that two senders can jointly prepare a three-qubit state of complex coefficients to a remote receiver via the shared three GHZ states. Then, the success probability can be improved by using the permutation group to classify the preparation state. Furthermore, under some different measurement bases, we propose another scheme to jointly prepare a three-qubit state of real coefficients with less restrictions. Finally, the present schemes are extended to multi-sender, and the classical communication costs of all the schemes are also calculated.

The diminished accuracy of port-based and payload-based classification motivates use of transport layer statistics for network traffic classification. A semi-supervised clustering approach based on improved K -Means clustering algorithm is proposed in this paper to partition a training network flows set that contains a huge number of unlabeled flows and scarce labeled flows. The variance of flow attributes is used to initialize clusters centers instead of the random selection of the cluster centers in initialization. Scarce labeled flows are selected to construct a mapping from the clusters to the predefined traffic classes set. The experimental results show that both the overall accuracy and square error (SSE) value of our algorithm present better than those based on normal K -Means algorithm defined in Ref. [5].

Our concern, in the paper, is to construct information-theoretic secure network coding in the presence of eavesdroppers. Based on the generalized attack model and all-or-nothing transformation, the security of network coding in the generalized combination network can be characterized by the network capacity and the min-cut bound of wiretapping set from the source. Furthermore, it can be extended to any directed acyclic networks with single source. Compared with the traditional results, we construct information-theoretic secure network coding without additional encryptions and giving up any capacity.

The development of quantum computation casts serious threats to the securities of most existing public-key cryptosystems. Braid-based cryptography is one of the alternatives that have potential advantages in resisting quantum attacks. In this paper, the state of the art of braid cryptography is surveyed, and then a new cryptographic problem—conjugate adjoining problem related to braid groups is proposed. Based on this problem, we design a new braid-based signature scheme. This scheme is efficient and provably secure in the random oracle model. Further, we present the comparison between braid-based signatures and RSA-based ones. The signing process of the braid-based schemes is more efficient than that of RSA-based ones, while the verifying process of the braid-based ones is observably slow. Hence, braid-based signatures are suitable for scenarios where the signing process has to be as quick as possible but delays are permitted in the verifying process, for example, in off-line e-cash systems. The key sizes in braid-based schemes are considerably large—about 2K bits in the case of secret keys and 12K bits in the case of public keys. However, braid operations are much simpler and more efficient than modular exponential operations. Therefore, braid-based schemes can be embedded into devices with low computational ability and large memory space. The capability of braid cryptosystems to resist currently known quantum attacks is also discussed from the perspective of hidden subgroup problems.

The method of vitrification has been widely used for cryopreservation. However, the effectiveness of this method for mammalian oocytes could be improved by optimizing each step of the process. In the present study, we tested the effects of varying several key parameters to determine the most effective protocol for mouse oocyte vitrification. We found that cryoprotectant containing ethylene glycol and dimethylsulfoxide plus 20% fetal calf serum produced the highest rates of oocyte survival, fertilization and blastocyst formation. The duration and temperature of oocyte exposure to vitrification and thawing solutions influenced survival rate. The presence of cumulus cells surrounding oocytes and the incubation of thawed oocytes in Toyoda-Yokoyama-Hosoki medium also increased oocyte survival. Open pulled straw and nylon loop methods were more effective than the mini-drop method. Finally, the combination of these improved methods resulted in better spindle morphology when compared to the unimproved methods. These results demonstrate that the outcomes of mouse oocyte vitrification can be improved by a suitable combination of cryopreservation methods, which could be applied to future clinical research with human oocytes.

Women over 35 have higher rates of infertility, largely due to deterioration of oocyte quality characterized by fragmentation, abnormal meiotic spindle-chromosome complexes, and oxidative stress. C-phycocyanin (PC) is a biliprotein enriched in Spirulina platensis that is known to possess antioxidant, anti-inflammatory, and radical-scavenging properties. D-galactose-induced aging acceleration in mice has been extensively used to study aging mechanisms and for pharmaceutical screening. In this study, adult female B6D2F/1 mice injected with D-galactose were used as a model to test the age-reversing effects of PC on degenerated reproductive ability. Our results show that PC can prevent oocyte fragmentation and aneuploidy by maintaining cytoskeletal integrity. Moreover, PC can reverse the expression of antioxidant genes, increase superoxide dismutase (SOD) activity and decrease methane dicarboxylic aldehyde (MDA) content, and normalize mitochondria distribution. PC exerts its benefit by inhibiting reactive oxygen species (ROS) production, which decreases apoptosis. Finally, we observe a significant increase in litter size after PC administration to D-galactose-induced aging mice. Our study demonstrates for the first time that D-galactose-induced impaired female reproductive capability can be partially rescued by the antioxidant effects of PC.