Science and Technology on Communication Security Laboratory

Chengdu, China

Science and Technology on Communication Security Laboratory

Chengdu, China
SEARCH FILTERS
Time filter
Source Type

Su W.,Southwestern University of Finance and Economics | Su W.,Science and Technology on Communication Security Laboratory
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences | Year: 2017

In this paper, we present two classes of zero difference balanced (ZDB) functions, which are derived by difference balanced functions, and a class of perfect ternary sequences respectively. The proposed functions have parameters not covered in the literature, and can be used to design optimal constant composition codes, and perfect difference systems of sets. © 2017 The Institute of Electronics, Information and Communication Engineers.


Gao F.,Beijing University of Posts and Telecommunications | Gao F.,Xidian University | Liu B.,Beijing University of Posts and Telecommunications | Wen Q.-Y.,Beijing University of Posts and Telecommunications | Chen H.,Science and Technology on Communication Security Laboratory
Optics Express | Year: 2012

By adding a parameter θ in M. Jakobi et al's protocol [Phys. Rev. A 83, 022301 (2011)], we present a flexible quantum-key-distributionbased protocol for quantum private queries. We show that, by adjusting the value of θ, the average number of the key bits Alice obtains can be located on any fixed value the users wanted for any database size. And the parameter k is generally smaller (even k = 1 can be achieved) when θ < π/4, which implies lower complexity of both quantum and classical communications. Furthermore, the users can choose a smaller θ to get better database security, or a larger θ to obtain a lower probability with which Bob can correctly guess the address of Alice's query. © 2012 Optical Society of America.


Xiao Q.,Beijing University of Posts and Telecommunications | Zheng K.,Beijing University of Posts and Telecommunications | Luo S.,Beijing University of Posts and Telecommunications | Yang Y.,Beijing University of Posts and Telecommunications | Zhang L.,Science and Technology on Communication Security Laboratory
Journal of Convergence Information Technology | Year: 2012

Energy consumption and time delay, i.e., the amount of energy and time consumed by all the nodes for transmitting data, are two critical factors for estimating the efficiency of algorithms in wireless sensor networks. We focus on the application of time-driven data gathering, where all nodes act as sources at the same time to transmit data to an immobile sink node. We propose an efficient algorithm called DGNC for this scenario using inter-session network coding and opportunistic routing. Besides, we theoretically quantify the energy and time delay saving that our algorithm could offer in a rectangular grid network, and demonstrate the fact by simulation results in random networks, which DGNC could offer significant benefits in terms of both energy consumption and time delay in timedriven data gathering.


Zhang W.-W.,Beijing University of Posts and Telecommunications | Zhang W.-W.,CAS Institute of Software | Gao F.,Beijing University of Posts and Telecommunications | Liu B.,Beijing University of Posts and Telecommunications | And 2 more authors.
Quantum Information Processing | Year: 2013

We present a robust watermark strategy for quantum images. The watermark image is embedded into the fourier coefficients of the quantum carrier image, which will not affect the carrier image's visual effect. Before being embedded into the carrier image, the watermark image is preprocessed to be seemingly meaningless using quantum circuit, which further ensures the security of the watermark image. The properties of fourier transform ensure that the watermark embedded in the carrier image resists the unavoidable noise and cropping. © 2012 Springer Science+Business Media, LLC.


Zhang W.-W.,Beijing University of Posts and Telecommunications | Zhang W.-W.,CAS Institute of Software | Gao F.,Beijing University of Posts and Telecommunications | Liu B.,Beijing University of Posts and Telecommunications | And 3 more authors.
International Journal of Theoretical Physics | Year: 2013

Quantum watermarking is the technique which embeds the invisible quantum signal such as the owner's identification into quantum multimedia data (such as audio, video and image) for copyright protection. In this paper, a watermark strategy for quantum images is proposed based on flexible representation for quantum images (FRQI). Compared with the former strategy, which can only be used to verify the identity of the true owner of a carrier image, the proposed method can be used to find out who is the real owner, and our strategy's capacity reaches the largest. It is impossible for anyone except the copyrighter to clear off or extract the watermark images. © 2012 Springer Science+Business Media New York.


Wu X.,Guilin University of Electronic Technology | Zhang R.,Guilin University of Electronic Technology | Zeng B.,Science and Technology on Communication Security Laboratory | Zhou S.,Guilin University of Electronic Technology
Procedia Computer Science | Year: 2013

Trust has attracted extensive attention in social science and computer science as a solution to enhance the security of the system. This paper proposes a trust evaluation model based on D-S evidence theory and sliding windows for cloud computing. The timeliness of the interaction evidence as the first-hand evidence is reflected by introducing sliding windows. The direct trust of entities is computed based on the interaction evidence by D-S evidence theory. The conflict of the recommendation trust as the second-hand evidence is eliminated with a help of an improved fusion approach as far as possible. Finally, the combination of the recommendation trust exposes the credibility of entities. Experimental results show that the proposed model is effective and extensible. © 2013 The Authors. Published by Elsevier B.V.


You Z.,University of Electronic Science and Technology of China | Luo C.,University of Electronic Science and Technology of China | Zhang W.,Science and Technology on Communication Security Laboratory | Chen Y.,University of Electronic Science and Technology of China | And 4 more authors.
Behavioural Brain Research | Year: 2011

The association between pro-inflammatory cytokines and depression has been reported by many studies. However, the mechanisms by which inflammation affects mood are only partially understood. In this study, we detected depression-like behavior in a rat animal model which was induced inflammation in the spleen and brain by chronic mild stress (CMS). Wistar rats receiving CMS treatment for four weeks showed a variety of depression-like behavioral changes, including a significant reduction in sucrose preference and locomotion. Real-time RT-PCR was used to analyze the transcriptional regulation of pro-inflammatory cytokines (IL-1β, TNF-α, IL-6, and IL-18) and anti-inflammatory cytokines (IL-10, IL-4 and TGF-β) in hippocampus, cortex, hypothalamus and spleen. The result showed high expression of pro-inflammatory cytokines IL-1β, TNF-α and IL-6, and low expression of anti-inflammatory cytokines TGF-β and IL-10, thus higher ratio of TNF-α/IL-10 and IL-6/IL-10 in the brain of animal exposed to CMS. Simultaneously, brain derived neurotrophic factor mRNA decreased significantly in the hippocampus and hypothalamus of stressed rats. Immunofluorescence found that the BrdU Positive cells after CMS treatment significantly decreased in the hippocampus. These data suggested a crucial role of dysregulation between pro- and anti-inflammatory in CMS-induced depression, possibly because the imbalance of cytokines affects regeneration of neurons. © 2011 Elsevier B.V.


Cao Y.,Science and Technology on Communication Security Laboratory | Bai J.,Science and Technology on Communication Security Laboratory
Proceedings - 2015 International Conference on Computer Science and Mechanical Automation, CSMA 2015 | Year: 2015

Constructing key exchange protocols which can resist the quantum-attack is a hot topic. In China Crypt2014, S. Mao et al claimed a new quantum-resistant key exchange protocol and also recommended a set of practical parameter. In this paper, we present a passive attack against this key exchange protocol. Specifically, an eavesdropper can recover the exchange key in polynomial time provided with an oracle solving the discrete logarithm problem. Particularly, this key exchange protocol with the recommended parameter can be attacked by a polynomial time algorithm. © 2015 IEEE.


Zhou J.,Science and Technology on Communication Security Laboratory | Zhao T.,University of Sichuan
Proceedings of the 28th Chinese Control and Decision Conference, CCDC 2016 | Year: 2016

This study focuses on observer-based controller synthesis for T-S fuzzy systems under imperfect premise matching. The fuzzy observer and fuzzy controller do not share the same membership functions and rules number with the T-S fuzzy systems. That is to say, the membership functions and rules number of the fuzzy observer and fuzzy controller can be chosen freely, which can enhance robustness and flexibility. Using Lyapunov stability theory and some inequality techniques, the existence conditions of the fuzzy observer and fuzzy controller are formulated in the form of linear matrix inequalities (LMIs). A numerical example is provided to demonstrate the effectiveness of the proposed approach. © 2016 IEEE.


Zhou Y.,Science and Technology on Communication Security Laboratory
Advances in Mathematics of Communications | Year: 2013

In this paper, we study the lower bound on the sum-of-square indicator of balanced Boolean functions obtained by Son, et al. in 1998, and give a sufficient and necessary condition under which balanced Boolean functions achieve this lower bound. We introduce a new general class of balanced Boolean functions in n variables (n ≥ 4) with optimal auto-correlation dis-tribution, and we study two sub-classes more explicitely. Finally, we study the sets of Boolean functions having a same auto-correlation distribution, and derive a lower bound on the number of elements in such set. © 2013 AIMS.

Loading Science and Technology on Communication Security Laboratory collaborators
Loading Science and Technology on Communication Security Laboratory collaborators