Wencai Du

Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing 2010

th The purpose of the 11 Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2010) held on June 9 11, 2010 in London, United Kingdom was to bring together researchers and scientists, businessmen and entrepreneurs, teachers and students to discuss the numerous fields of computer science, and to share ideas and information in a meaningful way. Our conference officers selected the best 15 papers from those papers accepted for presentation at the conference in order to publish them in this volume. The papers were chosen based on review scores submitted by members of the program committee, and underwent further rounds of rigorous review. In Chapter 1, Cai Luyuan et al. Present a new method of shape decomposition based on a refined morphological shape decomposition process. In Chapter 2, Kazunori Iwata et al. propose a method for reducing the margin of error in effort and error prediction models for embedded software development projects using artificial neural networks (ANNs). In Chapter 3, Viliam imko et al. describe a model-driven tool that allows system code to be generated from use-cases in plain English. In Chapter 4, Abir Smiti and Zied Elouedi propose a Case Base Maintenance (CBM) method that uses machine learning techniques to preserve the maximum competence of a system. In Chapter 5, Shagufta Henna and Thomas Erlebach provide a simulation based analysis of some widely used broadcasting schemes within mobile ad hoc networks (MANETs) and propose adaptive extensions to an existing broadcasting algorithm.

SoW: A hybrid DWT-SVD based secured image watermarking

The proposed SoW algorithm is based on the scheme present in [5]. Kamble et al. split the watermark into two shares and apply I-level DWT and performed SVD on the HH subbands. While in our algorithm, the watermark is split into four shares, 2-level DWT is applied SVD is performed on the HL/LH subbands. The reason why the watermark is split into four shares in our algorithm is that, once the watermark undergoes serious damage, we still can reconstruct the watermark by comparing the corresponding pixels of the four shares.

Cryptanalysis of the Bisectional MQ Equations System

The security of many recently proposed cryptosystems is mainly based on the difficulty of solving large multivariate quadratic equations systems. Apart from UOV schemes with proper parameter values, the basic types of these schemes can be broken without great difficulty. Moreover, there are some shortages lying in some of these examined schemes. This paper proposes a bisectional multivariate quadratic equation (BMQE) system over a finite field of degree q (denoted as F_q). The BMQE system is analyzed by Kipnis & Shamir’s relinearization, and it is shown that the number of the variables n, together with the number of the equations m and the number of the degree q of F_q, have a great impact on the complexity of the BMQE system. If they are properly set, relinearization cannot be used to solve this system.

Temporal Ordered Image Encryption

The existing image encryption algorithms encrypt images independently, which means the probability of an eavesdropper working out one image stays the same under the same circumstances (same bits of keys and the same algorithm, for example). However, in real-life applications such as communication systems, on one hand, sequences of images may need to be sent with various security demands, and on the other hand, the temporal order of sequences of images may be changed. This paper proposes a novel idea to integrate the notion of temporal order with cryptosystems. Experimental results show that satisfactory security performance is achieved when the order for the sequence of images is changed.

Security and privacy for data mining of RFID-enabled product supply chains

The e-Pedigree used for verifying the authenticity of the products in RFID-enabled product supply chains plays a very important role in product anti-counterfeiting and risk management, but it is also vulnerable to malicious attacks and privacy leakage. While the radio frequency identification (RFID) technology bears merits such as automatic wireless identification without direct eye-sight contact, its security has been one of the main concerns in recent researches such as tag data tampering and cloning. Moreover, privacy leakage of the partners along the supply chains may lead to complete compromise of the whole system, and in consequence all authenticated products may be replaced by the faked ones! Quite different from other conventional databases, datasets in supply chain scenarios are temporally correlated, and every party of the system can only be semi-trusted. In this paper, a system that incorporates merits of both the secure multi-party computing and differential privacy is proposed to address the security and privacy issues, focusing on the vulnerability analysis of the data mining with distributed EPCIS datasets of e-pedigree having temporal relations from multiple range and aggregate queries in typical supply chain scenarios and the related algorithms. Theoretical analysis shows that our proposed system meets perfectly our preset design goals, while some of the other problems leave for future research.

A Dynamic Multiple Digital Watermarking Model based on Temporal Series

This paper introduces a dynamic multiple digital watermarking model based on a formal characterization of time-series in terms of temporal logic. The security analysis shows that the proposed method of mapping multiple watermarks into a single one overcomes the problem of volume limitation and overlapping of multiple watermarks in a multi-digital-watermarking system.