Entity

Time filter

Source Type


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. Source


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. Source


Li J.,Southwest Jiaotong University | Fan J.,Science and Technology on Communication Security Laboratory | Tang X.,Southwest Jiaotong University
IEEE Communications Letters | Year: 2013

In this letter, a generic construction of optimal generalized chirp-like ZCZ sequence sets with reduced alphabet size is presented. Further, we can obtain multiple optimal quaternary ZCZ sequence sets with good inter-set cross-correlation property within the zero correlation zone, which outperforms the binary and ternary counterparts. © 1997-2012 IEEE. Source


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. Source


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. Source

Discover hidden collaborations