Earticle

With the smart phone app, BIS can be implemented easily and conveniently without big cost. This BIS system, however, has a weak point that the location information of the bus can be revised easily. For the purpose of augmenting the security aspect of the proposed BIS service, this paper introduces the security augmenting scheme for the bus information system that is composed of the smart phone app without extra infrastructure like wireless LAN or wireless relay system.

Graphical Authentication Systems are a potential replacement or supplement for conventional authentication systems. Several studies have suggested graphical authentication may offer greater resistance to guessing and capture attacks but there are other attacks against graphical authentication including social engineering, brute force attacks, shoulder surfing, intercepted communication and spyware. In this paper we give a brief description and classification of different graphical password schemes followed by information about vulnerabilities in the various schemes and recommendations for future development.

In order to be a long time alive, modern malware often make anti-emulation check after launched for evading dynamic analysis. Malware authors gain fingerprint information of target environment through several API to detect whether their creations are running in monitored state or not. If an emulated analysis environment is detected, the malware will change its running to avoid malicious behavior exposing. The existing approaches are based on trace matching with a intuition that, given the same inputs, the execution of a program should be the same in simulated analysis environment and on a real hardware reference system. However those approaches are too fine-grained to be inefficient. In this paper we propose an approach to deal with anti-emulation using instruction traces and dynamic slicing. With a difference from trace matching solutions presented in existing references, our approach is performed on one instruction trace derived from our dynamic analysis platform. We evaluate our approach with 189 malware samples collected in the wild. The experience shows that our proposed approach can spot efAPI used for anti-emulation check in an efficient way.

This article presented a novel robust video watermarking algorithm that satisfies robustness and real-time performance requirements in client-side embedding environments such as IP TV set-top boxes. A watermarked video is generated by temporally modulating the mean chrominance value of each chrominance channel in relation to the watermark pattern according to the watermark message. The watermark pattern is generated based on a histogram analysis of the luminance channel. To improve the robustness, we employed the BCH codes followed by repetition codes during the encoding of the watermark message. The experimental results showed that the proposed watermarking algorithm is resistant to geometrical distortions such as rotation, cropping, scaling, and projective transforms. The proposed watermarking algorithm is also robust against signal processing attacks including compression format conversion and other temporal attacks.

Spread Spectrum technique transmits the information message (signal) over a bandwidth much larger than its frequency contents or the original bandwidth of information message. In SS technique, a signal (having a specific bandwidth) is spread in the frequency domain and results in a signal having wider bandwidth. Remember, the new resulting bandwidth of a signal is much larger than the minimum required frequency spectrum. In Direct Sequence Spread Spectrum, i.e., DSSS (one of the common techniques of SS) the transmitting information signal is multiplied or combined with the spreading signal (usually Barker code) of wider bandwidth and results in a modulation signal that take up the wide bandwidth of the spreading signal. This new consequential signal is then combined with a carrier signal before transmission. The most important advantage of DSSS technology is the accepted transmission security. In this paper, a novel scheme is proposed that helps out the traditional DSSS system to enhance the transmission security by using random selection of multiple spreading codes in DSSS. In this paper the 11-bit spreading (Barker’s) code is taken under the consideration as the spreading code.

As the amount of digitized private data grows, security requirements such as irrecoverable file deletion are gaining importance. Existing secure file deletion tools, which repeatedly over-write the contents to be deleted, do not work properly with NAND-based block devices because these devices perform out-of-place updates on over-write requests, retaining the original data. This paper presents a method for secure file deletion in NAND-based block devices. The presented scheme maintains the over-write count and the physical locations of the original data. If the over-write count exceeds a predefined threshold, the scheme finds the original data that has been invalidated by previous over-write operations and removes the original data using the block erasure operation. The erased data is irrecoverable. Trace-driven simulation shows that the presented scheme reduces the total I/O time up to 104 % under a realistic workload compared to existing file deletion schemes.

This paper proposes a text clustering method using the reweighted term based on semantic features for utilizing NFC content. The proposed method uses text document samples of cluster by user to reduce the semantic gap between the user’s requirement and clustering results by machine for utilizing NFC access information. The method can enhance the text clustering because it uses the reweighted term which can well represent an inherent structure of text document set relevant to a user’s requirement regarding NFC tags.

In this present paper, a new counting algorithm for tangerine yield estimation is adapted to obtain better results with respect to partially / semi partially occluded tangerine and its clusters. To optimize tangerine counting, and to minimize typical background noises from orchards (i.e. bare soil, weeds, and man-made objects), a tangerine fruit counting algorithm is implemented, and compared between before harvesting, after harvesting tangerine fruits, and results of yield estimation through tangerine flower recognition. Under natural lighting conditions prediction of the tangerine fruits from the orchards is computed and compared based on observers, and with tangerine counting algorithm. The simulation outputs show that new counting algorithm is found to be suitable, and effective.

Software defects are the major risks of system stable operation. Its error localization technology of automation is one of the key research content for trust computing and software assurance. In this paper, we have proposed a new model, which integrates the current methods by analyzing the program structure. We put forward a new automated fault localization method, this method without the degree loss of automation, at the same time, particle size down to basic positioning code statements, makes the position more accurately. We have designed an experiment to examine the effectiveness of CPD base on SIR. And we proved that the CPD is more effective.