Entity

Time filter

Source Type


Wang X.,CAS Institute of Computing Technology | Wang X.,Chinese Academy of Sciences | Wang X.,Chinese National Engineering Laboratory for Information Security Technologies | Shi J.,Chinese Academy of Sciences | And 3 more authors.
Communications in Computer and Information Science | Year: 2013

Data leakage committed by malicious insiders proposes a serious challenge for business secrets and intellectual property. Great efforts have been made to detect and mitigate insider threat. Due to the diversity in the motivations, previous work in this field mostly focuses on designing data holder's data distribution and insider tracing algorithms, with little consideration of malicious insiders' leakage strategies. In this paper, the traitors tracing problem is modeled as an incremental refining multi-step process. For each step, a metric is proposed to measure the efficiency of current tracing status. Theoretical and simulating analysis shows that malicious insiders can adopt sophisticated leakage strategies, which makes it difficult to distinguish them from others and leads to more innocent users involved as suspects. Thus it is important for the data holder to figure out the insiders' leakage strategies and adopt proper tracing scheme to improve the refining process. © Springer-Verlag Berlin Heidelberg 2013. Source


Xu F.,Beijing University of Posts and Telecommunications | Xu F.,Key Laboratory of Trustworthy Distributed Computing and Service BUPT | Tan Q.,Chinese National Engineering Laboratory for Information Security Technologies | Tan Q.,Chinese Academy of Sciences | And 4 more authors.
Communications in Computer and Information Science | Year: 2013

Internet has been the most popular platform for individuals to communicate and share ideas. With increasing threats against network privacy, anonymous and covert communication technology is becoming more and more important. In this paper, an unobservable rendezvous negotiation protocol is proposed based on P2P architecture, which establishes a covert channel leveraging an existing DHT to hide communicating behaviors and utilizes a tagging mechanism to ensure an indirect identification and mutual authentication. Experiments indicate that performance of the protocol is acceptable, and security analysis shows that the protocol can resist various threats. © Springer-Verlag Berlin Heidelberg 2013. Source


Tan Q.-F.,Chinese Academy of Sciences | Tan Q.-F.,Chinese National Engineering Laboratory for Information Security Technologies | Liu P.-P.,CAS Institute of Computing Technology | Shi J.-Q.,Chinese Academy of Sciences | And 4 more authors.
Tongxin Xuebao/Journal on Communications | Year: 2012

A UGC-based covert communication method: UGC 3 was presented, which used fixed infrastructure (UGC sites) to form a fully distributed overlay. To exchange information between sender and receiver, an efficient resource discovery algorithm was proposed to negotiate the rendezvous; and then the targeted resource was published in the corresponding user-generated content hosts using information hiding method. Finally, the security properties were discussed. Source


Pu Y.,Chinese Academy of Sciences | Pu Y.,Chinese National Engineering Laboratory for Information Security Technologies | Shi J.,Chinese Academy of Sciences | Shi J.,Chinese National Engineering Laboratory for Information Security Technologies | And 2 more authors.
Communications in Computer and Information Science | Year: 2013

Image clustering is a crucial task in image retrieving, filtering and organizing. Most of recent work focuses on dealing with color images or gray scale images with features extracted from text content, annotation or image content. This paper aims at binary text images and proposes a novel clustering method that can be used for automatic image procession in digital library and automatic office. The method is divided into three main steps. Firstly images are preprocessed to denoise, correct orientation and produce coarse classes. Secondly, features are extracted and similar images are grouped into new classes with hierarchical clustering algorithm. At last new classes are combined to the nearest old ones under distance condition. To speed clustering Local Sensitive Hash algorithm is imported for boosting merging procedure. Experiments show that this method is faster and efficient compared with the basic clustering method. © Springer-Verlag Berlin Heidelberg 2013. Source


Wang X.,CAS Institute of Computing Technology | Wang X.,Chinese Academy of Sciences | Wang X.,University of Chinese Academy of Sciences | Wang X.,Chinese National Engineering Laboratory for Information Security Technologies | And 12 more authors.
Tongxin Xuebao/Journal on Communications | Year: 2015

Tor family was focused on design and given a family-level measurement of it. Based on Tor node families (over 3000) discovered from live Tor network data (from Jan. 2011 to Dec. 2012), a few characteristics of Tor node families were revealed, such as family size, bandwidth, geographical distribution as well as operators providing a few big families. The analysis validated the irreplaceable role played by family design in enhancing Tor's anonymity. Based on the measurement, security analysis showed the serious availability threat a compromised node family can cause to the Tor network. Besides, It also discussed Tor hidden families and the potential anonymity risk caused by them. ©, 2015, Tongxin Xuebao/Journal on Communications. All right reserved. Source

Discover hidden collaborations