{"title":"Examining Web-Based Spyware Invasion with Stateful Behavior Monitoring","authors":"Ming-Wei Wu, S. Kuo","doi":"10.1109/PRDC.2007.41","DOIUrl":"https://doi.org/10.1109/PRDC.2007.41","url":null,"abstract":"Spyware infection that exploits the vulnerabilities of client-side Web application, especially browser, to install malicious programs has gain significant popularity in recent years. Unlike traditional infection vectors such as software bundling in shareware/freeware and placing Trojan in pirated version of commercial software that generally requires user consent to be successfully installed, Web-based spyware attempts exploits on browser vulnerabilities to achieve automatic installation (a.k.a. drive-by download). In this paper, we characterize the behavior of spyware instances collected from software bundling and of those collected from exploit Web pages in terms of auto-start extensibility points (ASEP) and other spyware behaviors. We use a tool called STARS (Stateful Threat-Aware Removal System) that can monitor critical areas of the system and detect advanced feature of a spyware instance such as self- healing. Experimental results show that traditional spyware and Web-based spyware used a different combination set of ASEP to resist deletion. The latter one hooks to low-level system components and loaded as services and/or drivers employing Layered Service Provider (LSP) to interpret network traffic. Our observations identify the unique behaviors performed by the Web-based spyware that are rarely found on traditional spyware.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121038370","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}
Jiannong Cao, M. Raynal, Corentin Travers, Weigang Wu
{"title":"The Eventual Leadership in Dynamic Mobile Networking Environments","authors":"Jiannong Cao, M. Raynal, Corentin Travers, Weigang Wu","doi":"10.1109/PRDC.2007.27","DOIUrl":"https://doi.org/10.1109/PRDC.2007.27","url":null,"abstract":"Eventual leadership has been identified as a basic building block to solve synchronization or coordination problems in distributed computing systems. However, it is a challenging task to implement the eventual leadership facility, especially in dynamic distributed systems, where the global system structure is unknown to the processes and can vary over time. This paper studies the implementation of a leadership facility in infrastructured mobile networks, where an unbounded set of mobile hosts arbitrarily move in the area covered by fixed mobile support stations. Mobile hosts can crash and suffer from disconnections. We develop an eventual leadership protocol based on a time-free approach. The mobile support stations exchange queries and responses on behalf of mobile hosts. With assumptions on the message exchange flow, a correct mobile host is eventually elected as the unique leader. Since no time property is assumed on the communication channels, the proposed protocol is especially effective and efficient in mobile environments, where time-based properties are difficult to satisfy due to the dynamics of the network.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129047779","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":"Towards Byzantine Fault Tolerance in Many-Core Computing Platforms","authors":"C. M. Jeffery, R. Figueiredo","doi":"10.1109/PRDC.2007.40","DOIUrl":"https://doi.org/10.1109/PRDC.2007.40","url":null,"abstract":"This paper presents a flexible technique that can be applied to many-core architectures to exploit idle resources and ensure reliable system operation. A dynamic fault tolerance layer is interposed between the hardware and OS through the use of a hypervisor. The introduction of a single point of failure is avoided by incorporating the hypervisor into the sphere of replication. This approach simplifies implementation over specialized hardware- or OS-based techniques while offering flexibility in the level of protection provided ranging from duplex to Byzantine protection. The feasibility of the approach is considered for both near- and long-term computing platforms.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124337280","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":"An Automatic Real-Time Analysis of the Time to Reach Consensus","authors":"Tatsuhiro Tsuchiya, A. Schiper","doi":"10.1109/PRDC.2007.10","DOIUrl":"https://doi.org/10.1109/PRDC.2007.10","url":null,"abstract":"Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to solve consensus. Specifically, we model check a distributed algorithm that implements a communication predicate, which is an alternative system abstraction to failure detectors. This model checking problem is challenging because it involves both continuous time and unbounded integers. We solve the problem by reducing it to the satisfiability problem of linear arithmetic constraints over real and integer variables. The proposed method can be used to determine the length of a synchronous period required for implementing a communication predicate for solving consensus.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116403520","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}
Stefan Fenz, G. Goluch, Andreas Ekelhart, Bernhard Riedl, E. Weippl
{"title":"Information Security Fortification by Ontological Mapping of the ISO/IEC 27001 Standard","authors":"Stefan Fenz, G. Goluch, Andreas Ekelhart, Bernhard Riedl, E. Weippl","doi":"10.1109/PRDC.2007.29","DOIUrl":"https://doi.org/10.1109/PRDC.2007.29","url":null,"abstract":"This paper introduces an ontology-based framework to improve the preparation of ISO/IEC 27001 audits, and to strengthen the security state of the company respectively. Building on extensive previous work on security ontologies, we elaborate on how ISO/IEC 27001 artifacts can be integrated into this ontology. A basic introduction to security ontologies is given first. Specific examples show how certain ISO/IEC 27001 requirements are to be integrated into the ontology; moreover, our rule-based engine is used to query the knowledge base to check whether specific security requirements are fulfilled. The aim of this paper is to explain how security ontologies can be used for a tool to support the ISO/IEC 27001 certification, providing pivotal information for the preparation of audits and the creation and maintenance of security guidelines and policies.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127625527","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}
Damián Serrano, M. Patiño-Martínez, R. Jiménez-Peris, Bettina Kemme
{"title":"Boosting Database Replication Scalability through Partial Replication and 1-Copy-Snapshot-Isolation","authors":"Damián Serrano, M. Patiño-Martínez, R. Jiménez-Peris, Bettina Kemme","doi":"10.1109/PRDC.2007.39","DOIUrl":"https://doi.org/10.1109/PRDC.2007.39","url":null,"abstract":"Databases have become a crucial component in modern information systems. At the same time, they have become the main bottleneck in most systems. Database replication protocols have been proposed to solve the scalability problem by scaling out in a cluster of sites. Current techniques have attained some degree of scalability, however there are two main limitations to existing approaches. Firstly, most solutions adopt a full replication model where all sites store a full copy of the database. The coordination overhead imposed by keeping all replicas consistent allows such approaches to achieve only medium scalability. Secondly, most replication protocols rely on the traditional consistency criterion, 1-copy-serializability, which limits concurrency, and thus scalability of the system. In this paper, we first analyze analytically the performance gains that can be achieved by various partial replication configurations, i.e., configurations where not all sites store all data. From there, we derive a partial replication protocol that provides 1-copy-snapshot isolation as correctness criterion. We have evaluated the protocol with TPC-W and the results show better scalability than full replication.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130955188","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 Proposal of New Dependable Database Middleware with Consistency and Concurrency Control","authors":"T. Mishima, Hiroshi Nakamura","doi":"10.1109/PRDC.2007.50","DOIUrl":"https://doi.org/10.1109/PRDC.2007.50","url":null,"abstract":"We propose a new dependable database middleware that can synchronize off-the-shelf database servers for consistency and execute write queries concurrently for high throughput. Our proposal also helps to realize low cost system since both existing servers and client applications can be used without modification. We implemented a prototype using PostgreSQL without modification. Our experimental result reveals that our approach outperforms the conservative proposals.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130154435","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}
Chia-Tai Tsai, R. Jan, Chien Chen, Chia-Yuan Huang
{"title":"Implementation of Highly Available OSPF Router on ATCA","authors":"Chia-Tai Tsai, R. Jan, Chien Chen, Chia-Yuan Huang","doi":"10.1109/PRDC.2007.13","DOIUrl":"https://doi.org/10.1109/PRDC.2007.13","url":null,"abstract":"This paper proposes a highly-available open shortest path first (HA-OSPF) router which consists of two OSPF router modules-active and standby-to support a high-availability network. Each router module runs a Linux operating system, high-availability management middleware (HAM middleware), and OSPF daemon. The HAM middleware consists of an availability management framework (AMF) service, checkpoint service, interface monitor, OSPF fault manager, and fault handler; it provides a health check, state information exchange, and takeover mechanism. The experimental results are given to show the system availability of the HA-OSPF router on a PC-based prototype system. Furthermore, to build a carrier grade commercial product, we realize a HA-OSPF router on an industry standard compliant advanced telecom computing architecture (ATCA) hardware platform. From actual measurements, we show that our PC-based and ATCA-based HA-OSPF routers take only 166 and 131 ms to switch over to a standby router module when there is a software fault and 360 and 331 ms with a hardware failure respectively.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"85 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114291606","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 Measurement Tool of End-User Computing Capability in Competency Perspective","authors":"C. Yoon, Keon-Myung Lee","doi":"10.1109/PRDC.2007.17","DOIUrl":"https://doi.org/10.1109/PRDC.2007.17","url":null,"abstract":"A measurement tool is developed to totally measure the end-user computing capability in a computing environment, and the tool provides the method and process to effectively measure it. The validity of the tool construct is presented by factor analysis through a survey measurement of 137 respondents, and a 17-item measurement tool is proposed. The application of the tool is confirmed by applying it to measuring the computing competency of the end-users in a computing environment and presenting the results for them.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114589136","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 Randomized Distributed Algorithm for Peer-to-Peer Data Replication in Wireless Ad Hoc Networks","authors":"Hong-Zu Chou, Szu-Chi Wang, S. Kuo","doi":"10.1109/PRDC.2007.19","DOIUrl":"https://doi.org/10.1109/PRDC.2007.19","url":null,"abstract":"In this paper, we focus on enhancing the data accessibility of ad hoc networks, with emphasis on peer-to-peer communications. To achieve this goal, we propose a randomized distributed algorithm for data replication. Furthermore, a probabilistic approach is presented to derive the upper bound of convergence by a novel technique, called path coupling, which gives more insight into factors determining system performance. Our analysis demonstrates that data accessibility can be improved by the proposed approach, with very limited memory consumption.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"105 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115559308","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}