Emad Elabd

Checking Compatibility and Replaceability in Web Services Business Protocols with Access Control

Recently, most enterprises adapt Web services technologies for designing and building complex inter-enterprise business applications. These applications are built by the coordination between set of Web services. Therefore, checking the compatibility between two services to guarantee that they can interact correctly is an important issue. In case of service update or replacement, there is a need for checking the replaceability to ensure that the new service is compatible with all the services which were compatible with the replaced one. These two type of checking are based on the services descriptions. Enriching services descriptions by including their behaviours is becoming more and more important. This behaviour can be described by business protocols representing the possible sequences of message exchanges. Since a lot of Web services use access control policies to restrict the access to authorized consumers, these policies should be a part of the service description. Checking compatibility and replaceability between Web services by analyzing their business protocols after assigning the access control policies is the main contribution of this work. Access control policies will be presented using ontology.

Timed Web Services Analysis after Removing Complex Implicit Transitions

Time is an important parameter in modeling and analyzing Web services. A Web service can be presented by its behavior which can be described by a business protocol representing the possible sequences of message exchanges. Automated analyses of timed Web services such as compatibility checking are very difficult and in some cases are not possible with the presence of implicit transitions (internal transitions) based on time constraints. The semantics of the implicit transitions is the source of this difficulty because most of well known modeling tools do not express this semantics (e.g., epsilon transition on the timed automata has a different semantics). This paper presents an approach for removing complex implicit transitions of the timed business protocols before performing the interoperability analysis without changing the semantics of the protocols.

Compatibility and Replaceability Analysis of Timed Web Services Protocols

Nowadays, most enterprises use web services as a framework for facilitating application-to-application interaction within and across them. Describing behaviour of web services is becoming more and more important. This behaviour can be described by timed business protocols representing the possible sequences of message exchanges. Studying the behaviour of web services by analyzing their timed business protocols is the main contribution of this work. This paper introduces notions of compatibility and replaceability w.r.t. timed business protocols together with the corresponding verification algorithms.

Semantic anonymization in publishing categorical sensitive attributes

The need of improving the privacy on data publisher becomes more important because data grows very fast. Traditional methods for privacy preserving data publishing cannot prevent privacy leakage. This causes the continuous research to find better methods to prevent privacy leakage. K-anonymity and L-diversity are well-known techniques for data privacy preserving. These techniques cannot prevent the similarity attack on the data privacy because they did not take into consider the semantic relation between the sensitive attributes of the categorical data. In this paper, we proposed an approach to categorical data preservation based on Domain-based of semantic rules to overcome the similarity attacks. The experimental results of the proposal approach focused to categorical data presented. The results showed that the semantic anonymization increases the privacy level with effect data utility.

Minimal privacy disclosure for Accessing Web services

Web services are considered as a powerful solution for information systems integration which is based on the service oriented architecture (SOA). Privacy is a big obstacle when using web services. Therefore, accessing web service with minimal privacy disclosure is an important challenge. Credentials encryption are used for privacy preserving. To the best of our knowledge, in the current privacy preserving approaches for web services, there is no technique that uses the credentials encryption using certificate authority as a third party. In this paper, a proposed approach for minimal privacy disclosure is proposed. This approach is based on the encryption and certificate authorities as third parties. The proposed approach is implemented and tested. The results show that the minimal privacy disclosure is achieved in the proposed approach.

A Semantic Based Framework for Facilitating Integration in ERP Systems

Enterprise Resource Planning (ERP) is a business management system that integrates all aspects found in an enterprise. However, integrating ERP with other enterprise applications is considered a costly and challenging problem. The main reason behind this problem is the heterogeneity of information contents and the semantics generated from various sources. This can be tackled by using semantic web technology to achieve interoperability among software systems. In this paper, a framework is proposed to facilitate ERP integration with other enterprise applications through building a domain specific semantic business logic layer. In this logic layer, Ontology is used to standardize the business process, eliminates semantic conflicts of knowledge, and allows knowledge to be shared and exchanged. Also, a semantic annotation between business process models is utilized to provide integration between business processes represented by different modeling notations. Through our framework, two types of alignments are studied, namely horizontal alignment and vertical alignment. Horizontal alignment aims to identify correspondences between process models to allow the business process to be shared. Meanwhile, vertical alignment seeks to verify compatibility between collaborative business processes to achieve integration. A simulation experiment is performed in the proposed framework for complaint handling case study taken from different systems, and a behavior consistency analysis is performed. The results of the simulated experiment yield in improvement in consistency from 83.4% to 98%. Simulation results also show an improvement of precision and recall value.

Semantic-based Web services selection for mobile

Mobile technology is widely used in recent times, where the user access the Web service at any time in any place. Challenges at this point are summarized in how we can discover more relevant Web services for mobile user requests. Many of research handled this point dependent on user requirement and quality standard of Web services; however, this matchmaking returns a service that is not completely relevant for mobile device due to the device compatibility issues and its limitation. This paper presents a semantic matchmaking model to discover the Web services taking into account the user requirements, Quality of Services (QoS) and Mobile Specification as required parameters. In addition, the degree of match is presented in order to clarify the importance of QoS and Mobile Specification in the discovery process. Finally, the applicability and the efficiency of the proposed model are tested using a case study.