We propose a method of diagnosis that tackles multiple diagnoses of reliable devices with large numbers of components. We use prior component failure probability and compute posterior probabilities of diagnoses. Bayesian networks allow to take into account the structure of the device but also knowledge about good and bad working order of each individual components and their reliability. The general reliability of such systems means that no list of breakdown scenarios can be exploited to guide the diagnosis. We exploit a list of observed values that reveal a failure of the system in order to find the states of the system that best explain these observations. The large number of components and the possibility of multiple failures mean that lots of sets of failing components can explain the observations. In order to rank them, we propose an algorithm to compute the best diagnoses and an approximation of their posterior probabilities.
{"title":"Computing multiple diagnoses in large devices using Bayesian networks","authors":"V. Delcroix, M. Maalej, S. Piechowiak","doi":"10.1109/ARES.2006.43","DOIUrl":"https://doi.org/10.1109/ARES.2006.43","url":null,"abstract":"We propose a method of diagnosis that tackles multiple diagnoses of reliable devices with large numbers of components. We use prior component failure probability and compute posterior probabilities of diagnoses. Bayesian networks allow to take into account the structure of the device but also knowledge about good and bad working order of each individual components and their reliability. The general reliability of such systems means that no list of breakdown scenarios can be exploited to guide the diagnosis. We exploit a list of observed values that reveal a failure of the system in order to find the states of the system that best explain these observations. The large number of components and the possibility of multiple failures mean that lots of sets of failing components can explain the observations. In order to rank them, we propose an algorithm to compute the best diagnoses and an approximation of their posterior probabilities.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123040929","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}
Web services offer great promise for integrating and automating software applications within and between enterprises over the Internet. However, ensuring that Web services are dependable, and can satisfy their clients' requests when the clients need them is a real challenge because, typically, a business activity involves multiple Web services and a Web service involves multiple components, each of which must be dependable. In this paper, we describe fault tolerance techniques, including replication, checkpointing, and message logging, in addition to reliable messaging and transaction management for which Web services specifications exist. We discuss how those techniques can be applied to the components of the Web services involved in the business activities to render them dependable.
{"title":"Making Web services dependable","authors":"L. Moser, P. Melliar-Smith, Wenbing Zhao","doi":"10.1109/ARES.2006.79","DOIUrl":"https://doi.org/10.1109/ARES.2006.79","url":null,"abstract":"Web services offer great promise for integrating and automating software applications within and between enterprises over the Internet. However, ensuring that Web services are dependable, and can satisfy their clients' requests when the clients need them is a real challenge because, typically, a business activity involves multiple Web services and a Web service involves multiple components, each of which must be dependable. In this paper, we describe fault tolerance techniques, including replication, checkpointing, and message logging, in addition to reliable messaging and transaction management for which Web services specifications exist. We discuss how those techniques can be applied to the components of the Web services involved in the business activities to render them dependable.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"186 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124730007","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}
Many security attacks are caused by software vulnerabilities such as buffer overflow. How to eliminate or mitigate these vulnerabilities, in particular with unstoppable software, is a great challenge for security researchers and practitioners. In this paper, we propose a practical framework to immunize software security vulnerabilities on the fly. We achieve the vulnerability immunization by using a security antibody, which can be implemented independently from the protected software and is used to defend against vulnerability exploitation attacks. And we employ in-core patching technique to attach the antibody quietly into running process, and hence we neither need to re-compile nor re-execute the protected software. The effectiveness of our framework depends on the effectiveness of the antibody that is implemented by redirecting flaw functions into secure ones. As a proof of concept, we have built a prototype and applied it to prevent the software from buffer overflow attacks. Preliminary experimental results show that our framework is practical and efficient for the dynamical immunization of software security vulnerabilities.
{"title":"A practical framework for dynamically immunizing software security vulnerabilities","authors":"Zhiqiang Lin, Bing Mao, Li Xie","doi":"10.1109/ARES.2006.11","DOIUrl":"https://doi.org/10.1109/ARES.2006.11","url":null,"abstract":"Many security attacks are caused by software vulnerabilities such as buffer overflow. How to eliminate or mitigate these vulnerabilities, in particular with unstoppable software, is a great challenge for security researchers and practitioners. In this paper, we propose a practical framework to immunize software security vulnerabilities on the fly. We achieve the vulnerability immunization by using a security antibody, which can be implemented independently from the protected software and is used to defend against vulnerability exploitation attacks. And we employ in-core patching technique to attach the antibody quietly into running process, and hence we neither need to re-compile nor re-execute the protected software. The effectiveness of our framework depends on the effectiveness of the antibody that is implemented by redirecting flaw functions into secure ones. As a proof of concept, we have built a prototype and applied it to prevent the software from buffer overflow attacks. Preliminary experimental results show that our framework is practical and efficient for the dynamical immunization of software security vulnerabilities.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"479 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126166015","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}
Wireless sensor network (WSN) should be capable of fulfilling its mission, in a timely manner, in the middle of intrusion, attacks, accidents and failures in hostile environment. However, current security mechanisms for WSN are able to satisfy confidentiality, integrity, and authentication properties using cipher algorithms, key management schemes, and so on, but they are not enough to meet above requirements. Therefore, we propose a framework of survivability model for WSN. Our model adopts software rejuvenation methodology, which is applicable in security field and also less expensive. We model and analyze each cluster of a hierarchical cluster based WSN as a stochastic process based on semi-Markov process (SMP) and discrete-time Markov chain (DTMC). The model analysis indicates the feasibility of our approach.
{"title":"A framework of survivability model for wireless sensor network","authors":"Dong Seong Kim, K. Shazzad, Jong Sou Park","doi":"10.1109/ARES.2006.6","DOIUrl":"https://doi.org/10.1109/ARES.2006.6","url":null,"abstract":"Wireless sensor network (WSN) should be capable of fulfilling its mission, in a timely manner, in the middle of intrusion, attacks, accidents and failures in hostile environment. However, current security mechanisms for WSN are able to satisfy confidentiality, integrity, and authentication properties using cipher algorithms, key management schemes, and so on, but they are not enough to meet above requirements. Therefore, we propose a framework of survivability model for WSN. Our model adopts software rejuvenation methodology, which is applicable in security field and also less expensive. We model and analyze each cluster of a hierarchical cluster based WSN as a stochastic process based on semi-Markov process (SMP) and discrete-time Markov chain (DTMC). The model analysis indicates the feasibility of our approach.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115195929","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}
It is now commonly accepted that security and dependability largely represent two different aspects of an overall meta-concept that reflects the trust that we put in a computer system. There exist a large number of models of security and dependability with various definitions and terminology. This position paper suggests a high-level conceptual model that is aimed to give a novel approach to the area. The model defines security and dependability characteristics in terms of a system's interaction with its environment via the system boundaries and attempts to clarify the relation between malicious environmental influence, e.g. attacks, and the service delivered by the system. The model is intended to help reasoning about security and dependability and to provide an overall means for finding and applying fundamental defense mechanisms. Since the model is high-level and conceptual it must be interpreted into each specific sub-area of security/dependability to be practically useful.
{"title":"Towards an integrated conceptual model of security and dependability","authors":"E. Jonsson","doi":"10.1109/ARES.2006.138","DOIUrl":"https://doi.org/10.1109/ARES.2006.138","url":null,"abstract":"It is now commonly accepted that security and dependability largely represent two different aspects of an overall meta-concept that reflects the trust that we put in a computer system. There exist a large number of models of security and dependability with various definitions and terminology. This position paper suggests a high-level conceptual model that is aimed to give a novel approach to the area. The model defines security and dependability characteristics in terms of a system's interaction with its environment via the system boundaries and attempts to clarify the relation between malicious environmental influence, e.g. attacks, and the service delivered by the system. The model is intended to help reasoning about security and dependability and to provide an overall means for finding and applying fundamental defense mechanisms. Since the model is high-level and conceptual it must be interpreted into each specific sub-area of security/dependability to be practically useful.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122842835","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}
Biometric systems are widely used today in different interesting applications. Even though the hotel industry has some instances of biometric room access systems, hotel payment confirmation has yet to be implemented. To find how such a biometric system should be designed, we theoretically analyze different models of biometric systems. Fingerprint systems used alone and with gender filtering, face recognition or an identification element are discussed. The architecture of a biometric system for transaction confirmation in hotels is then proposed based on the analytical findings. We have found that a fingerprint system with an identification element is the most appropriate for hotel payment confirmation. Based on the given results a general design of a device for wireless biometric transaction confirmation is also proposed.
{"title":"Guidelines for biometric recognition in wireless system for payment confirmation","authors":"Leon Grabensek, Sasa Divjak","doi":"10.1109/ARES.2006.70","DOIUrl":"https://doi.org/10.1109/ARES.2006.70","url":null,"abstract":"Biometric systems are widely used today in different interesting applications. Even though the hotel industry has some instances of biometric room access systems, hotel payment confirmation has yet to be implemented. To find how such a biometric system should be designed, we theoretically analyze different models of biometric systems. Fingerprint systems used alone and with gender filtering, face recognition or an identification element are discussed. The architecture of a biometric system for transaction confirmation in hotels is then proposed based on the analytical findings. We have found that a fingerprint system with an identification element is the most appropriate for hotel payment confirmation. Based on the given results a general design of a device for wireless biometric transaction confirmation is also proposed.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"297 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122865851","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}
In this paper we propose architecture and design methodology for the inter-domains security management (IDSM) model for the IP multimedia system (IMS), which is standardized by third generation partnership project (3GPP) and 3GPP2 as next generation mobile networks. The IDSM model is based on trust domain relationship between different network domain operators using policy based security associations and managements. The design methodology introduces inter-domains security gateways for generating and managing keys and certificates based on public key infrastructure (PKI) architecture. IPSec protocol is used for implementing confidentiality and integrity protection. This research work is part of secure service provisioning (SSP) framework for the IMS playground and third generation beyond (3Gb) testbed at the FOKUS Fraunhofer Institute.
{"title":"Inter-domains security management (IDSM) model for IP multimedia subsystem (IMS)","authors":"M. Sher, T. Magedanz, W. T. Penzhorn","doi":"10.1109/ARES.2006.76","DOIUrl":"https://doi.org/10.1109/ARES.2006.76","url":null,"abstract":"In this paper we propose architecture and design methodology for the inter-domains security management (IDSM) model for the IP multimedia system (IMS), which is standardized by third generation partnership project (3GPP) and 3GPP2 as next generation mobile networks. The IDSM model is based on trust domain relationship between different network domain operators using policy based security associations and managements. The design methodology introduces inter-domains security gateways for generating and managing keys and certificates based on public key infrastructure (PKI) architecture. IPSec protocol is used for implementing confidentiality and integrity protection. This research work is part of secure service provisioning (SSP) framework for the IMS playground and third generation beyond (3Gb) testbed at the FOKUS Fraunhofer Institute.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114262718","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}
Efforts have been put for electronization of complementary currencies (alternative forms of monetary media) in the hope that it would reduce their operational cost. However, this paper argues that the problem is more inherent in the core design of MCS (mutual credit system), the most common form of complementary currency today. By simulating a small world of 2,500 traders, we show that growing the number of free-riders in MCS has a paradoxical effect of increasing "welfare" (a "happiness" metric) of the community. Since there is no pressure to stop the growth of the bad users, it is difficult to sustain the soundness of the system without strong interventions from the operators of the system; we need alternatives to the alternatives. We have proposed i-WAT as an electronic descendant of the WAT System, a polycentric complementary currency using "WAT tickets" as its media of exchange. A simulation using the same model as above indicates that i-WAT users can sustain barter relationships even in the presence of free-riders by natural evasive actions to avoid risks.
{"title":"No risk is unsafe: simulated results on dependability of complementary currencies","authors":"Kenji Saito, E. Morino, J. Murai","doi":"10.1109/ARES.2006.88","DOIUrl":"https://doi.org/10.1109/ARES.2006.88","url":null,"abstract":"Efforts have been put for electronization of complementary currencies (alternative forms of monetary media) in the hope that it would reduce their operational cost. However, this paper argues that the problem is more inherent in the core design of MCS (mutual credit system), the most common form of complementary currency today. By simulating a small world of 2,500 traders, we show that growing the number of free-riders in MCS has a paradoxical effect of increasing \"welfare\" (a \"happiness\" metric) of the community. Since there is no pressure to stop the growth of the bad users, it is difficult to sustain the soundness of the system without strong interventions from the operators of the system; we need alternatives to the alternatives. We have proposed i-WAT as an electronic descendant of the WAT System, a polycentric complementary currency using \"WAT tickets\" as its media of exchange. A simulation using the same model as above indicates that i-WAT users can sustain barter relationships even in the presence of free-riders by natural evasive actions to avoid risks.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114513505","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}
In this paper we present an approach for modelling and analyzing time-related properties of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web service timed state transition systems (WSTTS), to capture the timed behavior of the composite Web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior. Building upon of this formalization, we provide techniques and tools for model checking BPEL4WS compositions against time-related requirements. We perform a preliminary experimental evaluation of our approach and tools with the help of the e-government case study.
{"title":"Timed modelling and analysis in Web service compositions","authors":"R. Kazhamiakin, P. Pandya, M. Pistore","doi":"10.1109/ARES.2006.134","DOIUrl":"https://doi.org/10.1109/ARES.2006.134","url":null,"abstract":"In this paper we present an approach for modelling and analyzing time-related properties of Web service compositions defined as a set of BPEL4WS processes. We introduce a formalism, called Web service timed state transition systems (WSTTS), to capture the timed behavior of the composite Web services. We also exploit an interval temporal logic to express complex timed assumptions and requirements on the system's behavior. Building upon of this formalization, we provide techniques and tools for model checking BPEL4WS compositions against time-related requirements. We perform a preliminary experimental evaluation of our approach and tools with the help of the e-government case study.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122108809","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}
In the course of the strengthened activities in eBusiness and the connected increasing awareness of privacy aspects, users of another application area become more and more sensitized of the problem field of the users' privacy $eLearning. With this paper we aim to increase the consciousness of the eLearning community for the relevance of preserving privacy by intra-application partitioning (IAP) in eLearning applications. This, especially, relates to collaborative eLearning environments where the contact to others is the basis of knowledge gathering and building, but, also implies an enhanced risk with respect to one's privacy. Therefore, we discuss concrete collaborative educational examples which illustrate that IAP by means of context recognition improves users' situation from a privacy perspective. Nevertheless, the paper discusses also critical aspects one has to consider when partitioning users' personal data and describes possible solutions. This allows for coming to the conclusion that intra-application data partitioning improves working in the application for the user but does not threaten the enforcement of crucial aspects.
{"title":"Intra-application partitioning in an eLearning environment - a discussion of critical aspects","authors":"Elke Franz, K. Borcea-Pfitzmann","doi":"10.1109/ARES.2006.77","DOIUrl":"https://doi.org/10.1109/ARES.2006.77","url":null,"abstract":"In the course of the strengthened activities in eBusiness and the connected increasing awareness of privacy aspects, users of another application area become more and more sensitized of the problem field of the users' privacy $eLearning. With this paper we aim to increase the consciousness of the eLearning community for the relevance of preserving privacy by intra-application partitioning (IAP) in eLearning applications. This, especially, relates to collaborative eLearning environments where the contact to others is the basis of knowledge gathering and building, but, also implies an enhanced risk with respect to one's privacy. Therefore, we discuss concrete collaborative educational examples which illustrate that IAP by means of context recognition improves users' situation from a privacy perspective. Nevertheless, the paper discusses also critical aspects one has to consider when partitioning users' personal data and describes possible solutions. This allows for coming to the conclusion that intra-application data partitioning improves working in the application for the user but does not threaten the enforcement of crucial aspects.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129312254","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：