{"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}
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}
Paulo Sousa, A. Bessani, M. Correia, N. Neves, P. Veríssimo
{"title":"Resilient Intrusion Tolerance through Proactive and Reactive Recovery","authors":"Paulo Sousa, A. Bessani, M. Correia, N. Neves, P. Veríssimo","doi":"10.1109/PRDC.2007.52","DOIUrl":"https://doi.org/10.1109/PRDC.2007.52","url":null,"abstract":"Previous works have studied how to use proactive recovery to build intrusion-tolerant replicated systems that are resilient to any number of faults, as long as recoveries are faster than an upper-bound on fault production assumed at system deployment time. In this paper, we propose a complementary approach that combines proactive recovery with services that allow correct replicas to react and recover replicas that they detect or suspect to be compromised. One key feature of our proactive-reactive recovery approach is that, despite recoveries, it guarantees the availability of the minimum amount of system replicas necessary to sustain system's correct operation. We design a proactive-reactive recovery service based on a hybrid distributed system model and show, as a case study, how this service can effectively be used to augment the resilience of an intrusion-tolerant firewall adequate for the protection of critical infrastructures.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"174 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":"124259494","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":"Applying a Threshold Scheme to the Pseudonymization of Health Data","authors":"Bernhard Riedl, V. Grascher, T. Neubauer","doi":"10.1109/PRDC.2007.24","DOIUrl":"https://doi.org/10.1109/PRDC.2007.24","url":null,"abstract":"Due to the cost pressure on the health care system an increase in the need for electronic healthcare records (EHR) could be observed in the last decade because EHRs promise massive savings by digitizing and centrally providing medical data. As highly sensitive patient information is exchanged and stored within such a system, legitimate concerns about the privacy of the stored data occur, as the lifelong storage of medical data is a promising target for attackers. These concerns and the lack of existing approaches that provide a sufficient level of security raise the need for a system that guarantees data privacy and keeps the access to health data under strict control of the patient. This paper introduces PIPE (Pseudonymization of Information for Privacy in e-Health), a new EHR architecture for primary and secondary usage of health data. PIPE's security model is based on pseudonymization instead of encryption.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"14 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":"121631942","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}
Jichiang Tsai, Chia-Yang Chen, Ming-Fa Hu, Jenn-Wei Lin
{"title":"Self-Adjusting Indexing Techniques for Communication-Induced Checkpointing Protocols","authors":"Jichiang Tsai, Chia-Yang Chen, Ming-Fa Hu, Jenn-Wei Lin","doi":"10.1109/PRDC.2007.8","DOIUrl":"https://doi.org/10.1109/PRDC.2007.8","url":null,"abstract":"Communication-induced checkpointing (CIC) protocols can be used to prevent the domino effect. Among such protocols, those belonging to the index-based category associate checkpoints with sequence numbers in a way that checkpoints with an equal sequence number are ensured to be consistent. Specifically, index-based protocols must cooperate with their underlying indexing methods to achieve their goal. The adopted indexing scheme makes a great impact on the number of forced checkpoint the protocol will take. Moreover, an indexing method exhibit different performance for different degrees of heterogeneity imposed on a distributed system. All existing index-based protocols only employ a fixed indexing scheme, however, and thus cannot suit themselves well for all kinds of computing environments. In this paper, we propose two new indexing techniques that can adjust themselves according to the extent of present system heterogeneity. Those new methods are also justified by a simulation study in the text.","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":"129897267","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 Accurate Model of Software Reliability","authors":"Shiyi Xu","doi":"10.1109/PRDC.2007.12","DOIUrl":"https://doi.org/10.1109/PRDC.2007.12","url":null,"abstract":"Software reliability is one of the important attributions of dependable systems. However, for the time being, the assumptions that software reliability measurement makes do not deal with some important factors that influence the accuracy of the software reliability models such as the complexity of the software and the effectiveness of test suite, resulting in inaccuracy or even incorrectness in evaluating the software reliability. Therefore, in this paper, we propose some practical strategies in order to improve the accuracy of software reliability measurement. The idea of the strategies presented in this paper is to incorporate the important factors related to the precision of software reliability measurement into reliability models, which mainly include complexity of software and the test effectiveness, making the software reliability models more adequate and accurate to the real measurement. Experimental results based on five programs selected have shown the feasibility and usefulness of the new approach.","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":"130089511","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}