By Topic

Intelligence Information Processing and Trusted Computing (IPTC), 2011 2nd International Symposium on

Date 22-23 Oct. 2011

Filter Results

Displaying Results 1 - 25 of 74
  • [Front cover]

    Publication Year: 2011, Page(s): C1
    Request permission for commercial reuse | PDF file iconPDF (2204 KB)
    Freely Available from IEEE
  • [Title page i]

    Publication Year: 2011, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (19 KB)
    Freely Available from IEEE
  • [Title page iii]

    Publication Year: 2011, Page(s): iii
    Request permission for commercial reuse | PDF file iconPDF (77 KB)
    Freely Available from IEEE
  • [Copyright notice]

    Publication Year: 2011, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (121 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2011, Page(s):v - ix
    Request permission for commercial reuse | PDF file iconPDF (135 KB)
    Freely Available from IEEE
  • Greetings from the General Chairs

    Publication Year: 2011, Page(s): x
    Request permission for commercial reuse | PDF file iconPDF (70 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organizing Committee

    Publication Year: 2011, Page(s): xi
    Request permission for commercial reuse | PDF file iconPDF (70 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2011, Page(s): xii
    Request permission for commercial reuse | PDF file iconPDF (68 KB)
    Freely Available from IEEE
  • A Self Adaptive Jamming Strategy to Restrict Covert Timing Channel

    Publication Year: 2011, Page(s):1 - 4
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (219 KB) | HTML iconHTML

    Covert timing channel may compromise multi-level security system, it's necessary to eliminate or restrict them. Jamming covert timing channel is a main method to restrict the channel's capacity, but existing works' jamming strategies don't take the packets arriving rate and queue's length into account, the jamming strategies they use may affect the overt channel's availability. This paper proposes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Deterministic Protocol for Rational Secret Sharing in Asynchronous Model

    Publication Year: 2011, Page(s):5 - 8
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (174 KB) | HTML iconHTML

    In the problem of rational secret sharing, each player, who prefers to be the only one to learn the secret, acts rationally rather than merely honestly or maliciously in the traditional cryptographic settings. The core issue of rational secret sharing is to construct a mechanism so that all rational participants have incentive to provide their shares in the reconstruction phase. However, lack of e... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Model Update Particle Filter for Multiple Objects Detection and Tracking

    Publication Year: 2011, Page(s):9 - 12
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (540 KB) | HTML iconHTML

    Multiple objects tracking is a challenging task. This article presents an algorithm which can detect and track multiple objects, and update target model automatically. The contributions of this paper as follow: Firstly, we use color histogram(HC) and histogram of orientated gradients(HOG) to represent the objects, model update is realized under the frame of kalman filter and gaussian model, second... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design and Analysis on Direct Anonymous Attestation for Security Chip

    Publication Year: 2011, Page(s):13 - 18
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (226 KB) | HTML iconHTML

    Direct Anonymous Attestation (DAA) is an anonymous protocol designed for TPM/TCM or other embedding devices. Recently, DAA schemes based on the pairing continues to advance rapidly, but it has a certain problems to put the scheme into application. This paper focuses on the practicability and feasibility for the design of the pairing DAA protocol and system. Our first contribution in this paper is ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trusted Bytecode Virtual Machine Module: Towards Dynamic Remote Attestation in Cloud Computing

    Publication Year: 2011, Page(s):19 - 23
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (282 KB) | HTML iconHTML

    Cloud computing bring a tremendous complexity to information security. Many researches have been done to establish and maintain the trust relationship in cloud. Remote attestation is one of the most important feature of trusted computing. But conventional ways of remote attestation can only attest to the presence of a particular binary. They cannot measure program behavior. Existing dynamic remote... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient Power Saving Adaptive Routing Protocol (EPSAR) for MANETs Using AODV and DSDV: Simulation and Feasibility Analysis

    Publication Year: 2011, Page(s):24 - 26
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (649 KB) | HTML iconHTML

    Mobile ad hoc network especially follows multihopping mechanism for routing to make a path from source to destination. If we have a sound and solid routing path that would be efficient, reliable and adaptable to the different scenarios of network too by following the next hop mechanism and also should be the farthest node with in the cluster then we could achieve better performance by the network.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Comprehensive Prediction Method of Visit Priority for Focused Crawler

    Publication Year: 2011, Page(s):27 - 30
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (164 KB) | HTML iconHTML

    The purpose of a focused crawler is to crawl more topical portions of the Internet precisely. How to predict the visit priorities of candidate URLs whose corresponding pages have yet to be fetched is the determining factor in the focused crawler's ability of getting more relevant pages. This paper introduces a comprehensive prediction method to address this problem. In this method, a page partitio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Cooperative Relay Method and Performance for Wireless Networks

    Publication Year: 2011, Page(s):31 - 34
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (370 KB) | HTML iconHTML

    In cooperative relay system, relay nodes forward traffic will cause an increase of network loads, which will affect the system throughput. However, most existing cooperative schemes do not consider the impact of the network loads. In this paper, we propose a novel cooperative relay method called Cooperative communication based on offered load (CCBOL) for wireless networks, in which the relay metho... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Formal Specification for Byzantine Fault Tolerant Algorithm Suiting Web Services

    Publication Year: 2011, Page(s):35 - 38
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (157 KB) | HTML iconHTML

    A Byzantine Fault Tolerant Algorithm suiting web services is proposed considering the features of web services. There are significant differences between the algorithm and the Castro and Liskov's well-known practical Byzantine fault tolerance method. First, we have to create replicas on both sides of communicating web services, while in CLBFT's method, replicas are created only on the server side.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An Active Data Leakage Prevention Model for Insider Threat

    Publication Year: 2011, Page(s):39 - 42
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (190 KB) | HTML iconHTML

    Insider threat has become the main vector of data leakage. Existing research on it mainly focuses on sensing and detection without defense capabilities. Meanwhile, traditional technologies for data leakage prevention rely on the terminal or boundary control which is difficult for data leakage in distributed environment. This paper presents an active data leakage prevention model for insider threat... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-feature Method: An Integrated Content Based Image Retrieval System

    Publication Year: 2011, Page(s):43 - 46
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (233 KB) | HTML iconHTML

    The process of retrieving desired or similar images from a large collection of images on the basis of features is referred as Content Based Image Retrieval (CBIR). In this paper, a integrated CBIR system is proposed using combined features and weighted similarity. The features include visual features of color, texture and shape and key text metadata. Some experimental simulations have been present... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated Visual Saliency Based Local Feature Selection for Image Retrieval

    Publication Year: 2011, Page(s):47 - 50
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (452 KB) | HTML iconHTML

    Nowadays, local features are widely used for content-based image retrieval. Effective feature selection is very important for the improvement of retrieval performance. Among various local feature extraction methods, Scale Invariant Feature Transform (SIFT) has been proven to be the most robust local invariant feature descriptor. However, the algorithm often generates hundreds of thousands of featu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Parallel Gaussian Filtering Algorithm Based on Color Difference

    Publication Year: 2011, Page(s):51 - 54
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (629 KB) | HTML iconHTML

    In order to remove noise effectively and reduce the loss of original information in image processing, a new parallel Gaussian filtering algorithm (PGF) based on Graphics Processing Units (GPU) is presented in this letter. The proposed method compares color difference between neighboring of the pixel and the center of the pixel before making Recursive Gaussian filter, moreover it can improve the sp... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Trust Based Secure Localization in Wireless Sensor Networks

    Publication Year: 2011, Page(s):55 - 58
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    Secure localization in wireless sensor networks (WSNs) has received a great deal of attention with the increasing applications of wireless sensors. Security issues of localization in WSNs need to take into account attacks from both external and internal nodes. In this paper, we propose a secure localization scheme based on trust evaluation called trust based secure localization (TBSL) to evaluate ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Shapes of Halftone-AM-Dots Based on Information Hiding

    Publication Year: 2011, Page(s):59 - 62
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (292 KB) | HTML iconHTML

    While modern anti-counterfeiting printing technologies usually adopt special ink, laser holographic images, line texture, they need to increase certain supporting printing equipment and the cost. They have such shortcomings as high cost, complex technology, narrow application area and no information hiding, etc. This paper aiming at these problems proposes a kind of information hiding technology b... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A High Speed Parallel Timing Recovery Algorithm and Its FPGA Implementation

    Publication Year: 2011, Page(s):63 - 66
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (454 KB) | HTML iconHTML

    The paper presents an efficient and parallel symbol timing recovery algorithm suitable for very high speed demodulator and easy to implement on FPGA platform. The proposed timing recovery algorithm has a dual feedback structure which makes up of frequency domain timing phase correction, first reported in Alternate Parallel Receiver (APRX), and parallel FIFOs based delete-keep algorithm. In the tim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A Feature-Based Robust Digital Image Watermarking Scheme Using Image Normalization and Quantization

    Publication Year: 2011, Page(s):67 - 70
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (814 KB) | HTML iconHTML

    This paper presents a feature point based image watermarking scheme to achieve binary digital image's imbedded and blind extraction. Firstly, the stable image feature points are extracted from the host image by using image normalization and the scale-invariant feature transform, which can resist toward desynchronization attacks. Then Discrete Wavelet Transform (DWT) is used to the local feature re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.