N. Memon, K. C. Kristoffersen, D. Hicks, H.L. Larsen
{"title":"Notice of Violation of IEEE Publication PrinciplesDetecting Critical Regions in Covert Networks: A Case Study of 9/11 Terrorists Network","authors":"N. Memon, K. C. Kristoffersen, D. Hicks, H.L. Larsen","doi":"10.1109/ARES.2007.70","DOIUrl":"https://doi.org/10.1109/ARES.2007.70","url":null,"abstract":"This paper presents the study of structural cohesion which is discussed in social network analysis (SNA), but can also be used in several other important application areas including investigative data mining for destabilizing terrorist networks. Structural cohesion is defined as the number of actors who, if removed from a group, would disconnect the group. In this paper we discuss structural cohesion concepts, such as cliques, n-cliques, n-clans and k-plex to determine familiarity, robustness and reachability within subgroups of the 9/11 terrorist network. Moreover we also propose a methodology of detecting critical regions in covert networks; removing/capturing those nodes will disrupt most of the network","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125267968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Error Modeling in RF-based Location Detection (EMLD) for Pervasive Computing Environments","authors":"Niraj Swami, Sheikh Iqbal Ahamed","doi":"10.1109/ARES.2007.80","DOIUrl":"https://doi.org/10.1109/ARES.2007.80","url":null,"abstract":"In recent years, a plethora of signal-based (radio frequency based) location detection techniques have been proposed for pervasive computing due to the limited scope of GPS when considering indoor and highly urban environments. However, these techniques have a major drawback in the error they incorporate. This paper addresses the problem of erratic location detection of mobile devices when signal-based technologies (non-GPS based solutions) are used. It generates an error model, EMLD, the parameters of which may be modified and used based on the surroundings of the target location to generate accurate location coordinates. This paper also provides an implementation of EMLD that can be used in order to determine location coordinates. It is a highly generalized approach that becomes more specific based on clients' needs that result in the assumptions and setup criteria of the approach","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131497257","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Modular Architecture for Secure and Reliable Distributed Communication","authors":"C. Jayalath, R. Fernando","doi":"10.1109/ARES.2007.7","DOIUrl":"https://doi.org/10.1109/ARES.2007.7","url":null,"abstract":"Over the past decade various efforts were taken to provide mechanisms to do secure and reliable message exchanges in distributed systems. With the advance of the Internet and concept of SOA much focus and effort were given to realizing this based on Web services. Our goal was to come up with a solution which implements these features in a usable and a modular manner. The implementation was done on top of the Apache Axis2 platform and the result was a framework which facilitates fully secure and reliable Web service message exchange","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133216872","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Realizing fine-granular Read andWrite Rights on Tree Structured Documents","authors":"Franz Kollmann","doi":"10.1109/ARES.2007.121","DOIUrl":"https://doi.org/10.1109/ARES.2007.121","url":null,"abstract":"Partial encryption of contents in tree structured documents like XML allows to define a fine-granular local access control on nodes for different users: depending on the read permissions a user gets keys and can decrypt encrypted document parts. However, this approach leads to a management of countless keys. The main goal of the presented key management scheme is to reduce the effort for the key management in tree structured documents in order to achieve a simple key retrieval. In contrast to existing approaches, write permissions are introduced allowing only authorized users valid write operations in such documents. To reduce the key storage, a derivation of read permissions from write permissions is presented, while read permissions and write permissions are inherited from parent nodes. Among read and write permissions, rights for structural modifications are included to guarantee the authenticity of such documents. Additionally the problem of key transmission, the evaluation of data overhead for a realization of this scheme, and security aspects are discussed","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131846640","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Comparing Classifier Combining Techniques for Mobile-Masquerader Detection","authors":"O. Mazhelis, S. Puuronen","doi":"10.1109/ARES.2007.58","DOIUrl":"https://doi.org/10.1109/ARES.2007.58","url":null,"abstract":"Contemporary mobile terminals (smartphones, PDAs, communicators) are often used to store or access sensitive private or corporate information, and an unauthorized use of these terminals may result in an abuse of this information. In order to resist such unauthorized use, along with traditional authentication mechanisms, the means of masquerader detection can be employed. In this paper, the problem of mobile-masquerader detection is approached as a classification problem. The detection is based on the monitoring of the current user behavior and environment, and matching them with the behavior and the environment of the legitimate user. The matching is performed by an ensemble of the so-called one-class classifiers each analyzing a separate set of behavioral or environmental features, and classifying the current values of these features as belonging to the legitimate user or not. Using a combining scheme, the individual classifications of these classifiers are combined so as to improve the final classification accuracy. In the paper, three combining schemes are empirically compared in the context of mobile-masquerader detection; these are the mean of the estimated probabilities (MP), the product combination of probabilities (PP), and the modified mean of the estimated probabilities (modMP) rules. According to the results of experiments, the use of modMP rule is justified in mobile-masquerader detection, since this rule provides the classification accuracy greater than or approximately equal to the accuracy of the other rules. Meanwhile, the obtained results suggest that, for the modMP rule to provide high classification accuracy, the means of the classifier outputs need to be estimated accurately","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114521222","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Castellano, G. Mastronardi, A. Aprile, G. B. D. Grecis, F. Fiorino
{"title":"Applying a Flexible Mining Architecture to Intrusion Detection","authors":"M. Castellano, G. Mastronardi, A. Aprile, G. B. D. Grecis, F. Fiorino","doi":"10.1109/ARES.2007.41","DOIUrl":"https://doi.org/10.1109/ARES.2007.41","url":null,"abstract":"Data mining is becoming a pervasive technology in several activities as using historical data to predict the success of a marketing campaign, looking for patterns in financial transactions to discover illegal activities or analyzing genome sequences. In this paper we adopt a reference flexible mining architecture able to discover knowledge in a distributed and heterogeneous environment. In the context of security, the information we are seeking is the knowledge of whether a security breach has been experienced, and if the answer is yes, who is the perpetrator. To this purpose, the guide lines of the service oriented architecture, SOA, and the orchestration model have been considered as a way to realize our proposal of knowledge discovery process to intrusion detection","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114472916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"RWAR: A Resilient Window-consistent Asynchronous Replication Protocol","authors":"Yanlong Wang, Zhanhuai Li, Wei Lin","doi":"10.1109/ARES.2007.128","DOIUrl":"https://doi.org/10.1109/ARES.2007.128","url":null,"abstract":"Asynchronous replication protocol is playing an increasingly important role in the design of a remote disaster-tolerance system. A resilient window-consistent asynchronous replication protocol (RWAR) is presented in this paper RWAR increases the synchronous feature of asynchronous replication protocol by setting replication space-windows. This can achieve widow-consistency and decrease the risk of the inconsistency between the primary and backup systems. Simultaneously, RWAR dynamically adjusts the size of every space-window by setting checkpoints behind space-windows and calculating the system bandwidth-utility. This can strengthen the resiliency and flexibility of every space-window and ensure the replication performance of the primary system. It's proved with experiments that RWAR affords trade-off between data consistency and replication performance. It is helpful to construct a practical replication-based disaster-tolerance system","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"53 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113942129","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distributed Stream Processing Analysis in High Availability Context","authors":"M. Gorawski, Pawel Marks","doi":"10.1109/ARES.2007.72","DOIUrl":"https://doi.org/10.1109/ARES.2007.72","url":null,"abstract":"Not so long ago data warehouses were used to process data sets loaded periodically during ETL process (extraction, transformation and loading). We could distinguish two kinds of ETL processes: full and incremental. Now we often have to process real-time data and analyse them almost on-the-fly, so the analyses are always up to date. There are many possible applications for real-time data warehouses. In most cases two features are important: delivering data to the warehouse as quick as possible, and not losing any tuple in case of failures. In this paper we propose an architecture for gathering and processing data from geographically distributed data sources. We present theoretical analysis, mathematical model of a data source, some rules of system modules configuration and results of experiments. At the end of the paper our future plans are described briefly","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"32 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122992989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Why Trust is not Proportional to Risk","authors":"Bjørnar Solhaug, D. Elgesem, K. Stølen","doi":"10.1109/ARES.2007.161","DOIUrl":"https://doi.org/10.1109/ARES.2007.161","url":null,"abstract":"Trust is inherently related to risk, but for trust assessment to be integrated with the management of the risks involved in trust based cooperation, the exact relation must be well understood. Existing literature on trust management is neither clear nor unambiguous on this issue. This paper discusses notions of trust as presented within the disciplines of sociology and economics for the purpose of motivating trust management. A critical survey of state of the art literature on trust management is provided, where weaknesses and ambiguities with respect to clarifying the notion of trust are discussed. An analysis and explanation of the exact relationship between risk and trust is presented, and implications of the subjectivity of trust relations are accounted for","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125355189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Specification and Detection of TCP/IP Based Attacks Using the ADM-Logic","authors":"Meriam Ben-Ghorbel-Talbi, Mehdi Talbi, M. Mejri","doi":"10.1109/ARES.2007.142","DOIUrl":"https://doi.org/10.1109/ARES.2007.142","url":null,"abstract":"Intrusion detection systems (IDS) are considered nowadays as one of the most important components in the security architecture of information systems. For misuse-based IDS also known as signature based IDS, the efficiency of detection is highly correlated to the quality of signatures. It is therefore very important to select a suitable formal language that provides both high expressiveness and simplicity when specifying attack signatures. It is also fundamental to have a user friendly and automatic tool allowing the specification and the verification of these signatures. This paper shows the efficiency and the suitability of the ADM-logic and formal language to specify a large variety of signatures characterizing attacks based on the TCP/IP protocols. A prototype of an IDS based on this logic will be also introduced","PeriodicalId":383015,"journal":{"name":"The Second International Conference on Availability, Reliability and Security (ARES'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121604782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}