Entity

Time filter

Source Type


Hsu C.-F.,Huazhong University of Science and Technology | Cui G.-H.,Huazhong University of Science and Technology | Cheng Q.,Institute of Wuhan Digital Engineering | Chen J.,Wuhan University
Journal of Network and Computer Applications | Year: 2011

Wireless mesh networks (WMNs) have emerged as an increasingly important technology that offers low-cost community wireless services. The community-oriented nature of WMNs facilitates group applications, such as webcast, distance learning, online gaming, video conferencing, and multimedia broadcasting. Security is critical for the deployment of these services. Secure group communication has become an important component in WMNs. In order to provide secure and efficient group communication in WMNs, in this paper we consider an ideal linear multi-secret sharing scheme, in which each authorized subset may have different target secret. In particular, we put forward a general method of construction for such a scheme by using monotone span programs. The correctness and security of proposed scheme are proved. © 2010 Elsevier Ltd. All rights reserved. Source


Zhu Z.,Huazhong University of Science and Technology | Zhu Z.,Institute of Wuhan Digital Engineering
Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition) | Year: 2010

An dynamic nonlinear transform algorithm is propsoed based on the theory of random walking on the symmetric group. From this algorithm, an S-box which is used to transform and improve the output sequence generated by chaos-based pseudorandom sequence generator is built. Furthermore, a novel chaos-based pseudorandom sequence generator is introduced. The shortest period of the output sequence is proved. Some properties of the sequences from the pseudorandom sequence generators wered derived, which demonstrated that the sequences are independent and identically distributed. Moreover, the performance of these proposed generators are more complicated than the performance of the pseudorandom sequence generator based on the model of coding chaotic orbits in the sense of complexity measure by using the symbolic dynamical methods. Source


Zhang B.,Institute of Wuhan Digital Engineering | Yu X.,Wuhan University
Proceedings of SPIE - The International Society for Optical Engineering | Year: 2015

Hyperspectral image visualization reduces high-dimensional spectral bands to three color channels, which are sought in order to explain well the nonlinear data characteristics that are hidden in the high-dimensional spectral bands. Despite the surge in the linear visualization techniques, the development of nonlinear visualization has been limited. The paper presents a new technique for visualization of hyperspectral image using t-distributed stochastic neighbor embedding, called VHI-tSNE, which learns a nonlinear mapping between the high-dimensional spectral space and the three-dimensional color space. VHI-tSNE transforms hyperspectral data into bilateral probability similarities, and employs a heavy-tailed distribution in three-dimensional color space to alleviate the crowding problem and optimization problem in SNE technique. We evaluate the performance of VHI-tSNE in experiments on several hyperspectral imageries, in which we compare it to the performance of other state-of-art techniques. The results of experiments demonstrated the strength of the proposed technique. © 2015 SPIE. Source


Hsu C.-F.,Central China Normal University | Zeng B.,South China University of Technology | Cheng Q.,Institute of Wuhan Digital Engineering
Journal of Communications and Networks | Year: 2013

Secret sharing is that a dealer distributes a piece of information (called a share) about a secret to each participant such that authorized subsets of participants can reconstruct the secret but unauthorized subsets of participants cannot determine the secret. In this paper, an access structure can be represented by a label graph G, where a vertex denotes a participant and a complete subgraph of G corresponds to a minimal authorized subset. The vertices of G are labeled into distinct vectors uniquely determined by the maximum prohibited structure. Based on such a label graph, a verifiable secret sharing scheme realizing general access structures is proposed. A major advantage of this scheme is that it applies to any access structure, rather than only structures rep-resentable as previous graphs, i.e., the access structures of rank two. Furthermore, verifiability of the proposed scheme can resist possible internal attack performed by malicious participants, who want to obtain additional shares or provide a fake share to other participants. © 2011 JCN. Source


Zhu Z.,Institute of Wuhan Digital Engineering
ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings | Year: 2010

A highly robust chaotic synchronization scheme is proposed in this paper. Different from most synchronization scheme, the two continuous chaotic systems is not driven by each other, but the separated standard digital chaotic systems. Since the digital chaotic systems are not affected by the internal noise and external noise, our synchronization scheme is much more robust than other synchronization schemes. Based on this synchronization scheme, a chaos-based secure communication system is designed. We use return-map and spectrum to analyze the security of our system. Simulation results shows that our system is highly security. Source

Discover hidden collaborations