This paper describes the CDRAS (Call Detail Records Analysis System) system, the motivation behind it, its approach and its background. The system aims at dealing with the notorious Man-in-the-Middle attack in the context of VoIP. As the use of such a system constitutes leads to an interference with the privacy of users, the most relevant legal aspects related to this work are also briefly discussed.
本文介绍了CDRAS (Call Detail Records Analysis System)系统的开发动机、开发方法和开发背景。该系统旨在解决VoIP环境中臭名昭著的中间人攻击。由于使用这种系统会导致对用户隐私的干扰，因此还简要讨论了与这项工作相关的最相关的法律方面。
{"title":"CDRAS: An Approach to Dealing with Man-in-the-Middle Attacks in the Context of Voice over IP","authors":"S. Hofbauer, G. Quirchmayr, Christopher C. Wills","doi":"10.1109/ARES.2011.59","DOIUrl":"https://doi.org/10.1109/ARES.2011.59","url":null,"abstract":"This paper describes the CDRAS (Call Detail Records Analysis System) system, the motivation behind it, its approach and its background. The system aims at dealing with the notorious Man-in-the-Middle attack in the context of VoIP. As the use of such a system constitutes leads to an interference with the privacy of users, the most relevant legal aspects related to this work are also briefly discussed.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"96 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123763121","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}
Cloud computing systems continue to grow in their scale and complexity. They are changing dynamically as well due to the addition and removal of system components, changing execution environments, frequent updates and upgrades, online repairs and more. In such large-scale complex and dynamic systems, failures are common. In this paper, we present a failure prediction mechanism exploiting both unsupervised and semi-supervised learning techniques for building dependable cloud computing systems. The unsupervised failure detection method uses an ensemble of Bayesian models. It characterizes normal execution states of the system and detects anomalous behaviors. After the anomalies are verified by system administrators, labeled data are available. Then, we apply supervised learning based on decision tree classier to predict future failure occurrences in the cloud. Experimental results in an institute-wide cloud computing system show that our proposed method can forecast failure dynamics with high accuracy.
{"title":"Proactive Failure Management by Integrated Unsupervised and Semi-Supervised Learning for Dependable Cloud Systems","authors":"Qiang Guan, Ziming Zhang, Song Fu","doi":"10.1109/ARES.2011.20","DOIUrl":"https://doi.org/10.1109/ARES.2011.20","url":null,"abstract":"Cloud computing systems continue to grow in their scale and complexity. They are changing dynamically as well due to the addition and removal of system components, changing execution environments, frequent updates and upgrades, online repairs and more. In such large-scale complex and dynamic systems, failures are common. In this paper, we present a failure prediction mechanism exploiting both unsupervised and semi-supervised learning techniques for building dependable cloud computing systems. The unsupervised failure detection method uses an ensemble of Bayesian models. It characterizes normal execution states of the system and detects anomalous behaviors. After the anomalies are verified by system administrators, labeled data are available. Then, we apply supervised learning based on decision tree classier to predict future failure occurrences in the cloud. Experimental results in an institute-wide cloud computing system show that our proposed method can forecast failure dynamics with high accuracy.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121623255","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}
The federated Cloud paradigm aims to provide flexible and reliable services composed of a mixture of internal and external mini-clouds, but this heterogeneous nature is also fuelling the security concerns of the customers. To allay the fears and deal with the threats associated with outsourcing data and applications to the Cloud, new methods for security assurance are urgently needed. This paper presents current work on Cloud Security Service Level Agreements and our approach on how to manage this in the context of hybrid clouds. The purpose is to facilitate rapid service composition and agreements based on the necessary security requirements and establish trust between the customer and provider. We also show how this can be applied on a realistic case study related to a hybrid Unified Communication service.
{"title":"Security SLAs for Federated Cloud Services","authors":"K. Bernsmed, M. Jaatun, P. H. Meland, A. Undheim","doi":"10.1109/ARES.2011.34","DOIUrl":"https://doi.org/10.1109/ARES.2011.34","url":null,"abstract":"The federated Cloud paradigm aims to provide flexible and reliable services composed of a mixture of internal and external mini-clouds, but this heterogeneous nature is also fuelling the security concerns of the customers. To allay the fears and deal with the threats associated with outsourcing data and applications to the Cloud, new methods for security assurance are urgently needed. This paper presents current work on Cloud Security Service Level Agreements and our approach on how to manage this in the context of hybrid clouds. The purpose is to facilitate rapid service composition and agreements based on the necessary security requirements and establish trust between the customer and provider. We also show how this can be applied on a realistic case study related to a hybrid Unified Communication service.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122780497","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}
Dependability analysis of a dynamic system which is embedded with several complex interrelated components raises two main problems. First, it is difficult to represent in a single coherent and complete picture how the system and its constituent parts behave in conditions of failure. Second, the analysis can be unmanageable due to a considerable number of failure events which increases with the number of components involved. To remedy this problem, in this paper we outline a scalable analysis approach that converts failure behavioural models -- state machines (SMs) -- to temporal fault trees (TFTs), which can then be analysed using Pandora (a recent technique for introducing temporal logic to fault trees). The improved scalability of the approach stems from a compositional synthesis of the TFTs (generated from the individual component SMs) for Pandora analysis. We show, by using a Generic Triple Redundant (GTR) system, how the approach enables a more accurate and full analysis of an increasingly complex system.
{"title":"Compositional Synthesis of Temporal Fault Trees from State Machines","authors":"Nidhal Mahmud, M. Walker, Y. Papadopoulos","doi":"10.1145/2185395.2185444","DOIUrl":"https://doi.org/10.1145/2185395.2185444","url":null,"abstract":"Dependability analysis of a dynamic system which is embedded with several complex interrelated components raises two main problems. First, it is difficult to represent in a single coherent and complete picture how the system and its constituent parts behave in conditions of failure. Second, the analysis can be unmanageable due to a considerable number of failure events which increases with the number of components involved. To remedy this problem, in this paper we outline a scalable analysis approach that converts failure behavioural models -- state machines (SMs) -- to temporal fault trees (TFTs), which can then be analysed using Pandora (a recent technique for introducing temporal logic to fault trees). The improved scalability of the approach stems from a compositional synthesis of the TFTs (generated from the individual component SMs) for Pandora analysis. We show, by using a Generic Triple Redundant (GTR) system, how the approach enables a more accurate and full analysis of an increasingly complex system.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"126 50","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120935391","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}
Zhendong Ma, Juergen Mangler, C. Wagner, T. Bleier
Web services are loosely coupled Web-enabled applications that can be dynamically invoked to facilitate business interactions through well-defined interfaces over the Internet. However, since personal data will be exchanged between nested Web services, the question how to preserve a user's data privacy becomes a challenging issue. In this paper we aim to minimize personal data disclosure in service composition that consists several nested Web services. To do so, we propose a practical, scalable and light-weight privacy-enhanced design that uses a privacy proxy to achieve data privacy. We furthermore show that by utilizing the privacy proxy in combination with advertising its capabilities and requirements as service level agreements (SLA's), it is possible to enhance data privacy in existing service infrastructure in a minimal invasive manner.
{"title":"Enhance Data Privacy in Service Compositions through a Privacy Proxy","authors":"Zhendong Ma, Juergen Mangler, C. Wagner, T. Bleier","doi":"10.1109/ARES.2011.94","DOIUrl":"https://doi.org/10.1109/ARES.2011.94","url":null,"abstract":"Web services are loosely coupled Web-enabled applications that can be dynamically invoked to facilitate business interactions through well-defined interfaces over the Internet. However, since personal data will be exchanged between nested Web services, the question how to preserve a user's data privacy becomes a challenging issue. In this paper we aim to minimize personal data disclosure in service composition that consists several nested Web services. To do so, we propose a practical, scalable and light-weight privacy-enhanced design that uses a privacy proxy to achieve data privacy. We furthermore show that by utilizing the privacy proxy in combination with advertising its capabilities and requirements as service level agreements (SLA's), it is possible to enhance data privacy in existing service infrastructure in a minimal invasive manner.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132700750","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}
This paper extends RBAC sessions with share ability, reusability and switch ability properties. We define the Smatch (Secure Management of switch) model in which authorized users can join, leave, reopen and reuse dynamic sessions. In Smatch, subjects can also share sessions and dynamically switch their role or function with other subjects from the same or die rent organizations. Subjects can authenticate using their function which will automatically activate the set of roles associated with this function. The Smatch model is based on first order logic with actions. It provides means to specify contextual access control and authentication policies which apply to control functional behavior of dynamic sessions. We suggest an implementation of Smatch using virtual machines.
{"title":"Smatch Model: Extending RBAC Sessions in Virtualization Environment","authors":"N. Cuppens-Boulahia, F. Cuppens, Marie Nuadi","doi":"10.1109/ARES.2011.13","DOIUrl":"https://doi.org/10.1109/ARES.2011.13","url":null,"abstract":"This paper extends RBAC sessions with share ability, reusability and switch ability properties. We define the Smatch (Secure Management of switch) model in which authorized users can join, leave, reopen and reuse dynamic sessions. In Smatch, subjects can also share sessions and dynamically switch their role or function with other subjects from the same or die rent organizations. Subjects can authenticate using their function which will automatically activate the set of roles associated with this function. The Smatch model is based on first order logic with actions. It provides means to specify contextual access control and authentication policies which apply to control functional behavior of dynamic sessions. We suggest an implementation of Smatch using virtual machines.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132822626","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}
Standard multilevel security (MLS) poli- cies lack flexibility as data classification is consid- ered static. Previous works have addressed this issue and defined declassification requirements, especially in programming languages using a language-based security approach. In this paper, we suggest a dif- ferent approach. We show how to define and enforce declassification policies in databases, seen as sets of logical facts. We first define an information flow con- trol model where data classification may dynamically change. This model combines both confidentiality and integrity requirements to enforce security. We then specify how to enforce declassification policies. Our approach relies on Event-Condition-Action (ECA) rules and provides means to manage the four basic di- mensions of declassification, namely the what?, who?, where? and when? which respectively refer to model- ing information to be declassified, entities responsible for declassification, localization of the declassification and contextual conditions that control declassifica- tion. We formalize and specify our declassification policies and prove it safe and secure with respect to the information flow control model.
{"title":"Declassification Policy Management in Dynamic Information Systems","authors":"Julien A. Thomas, N. Cuppens-Boulahia, F. Cuppens","doi":"10.1109/ARES.2011.30","DOIUrl":"https://doi.org/10.1109/ARES.2011.30","url":null,"abstract":"Standard multilevel security (MLS) poli- cies lack flexibility as data classification is consid- ered static. Previous works have addressed this issue and defined declassification requirements, especially in programming languages using a language-based security approach. In this paper, we suggest a dif- ferent approach. We show how to define and enforce declassification policies in databases, seen as sets of logical facts. We first define an information flow con- trol model where data classification may dynamically change. This model combines both confidentiality and integrity requirements to enforce security. We then specify how to enforce declassification policies. Our approach relies on Event-Condition-Action (ECA) rules and provides means to manage the four basic di- mensions of declassification, namely the what?, who?, where? and when? which respectively refer to model- ing information to be declassified, entities responsible for declassification, localization of the declassification and contextual conditions that control declassifica- tion. We formalize and specify our declassification policies and prove it safe and secure with respect to the information flow control model.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"19 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132434090","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 investments are evaluated using varying criteria, in which financial aspects play a central role. Today a financial estimation of the Total Cost of Ownership (TCO) or the Life Cycle Cost (LCC) is one of the pillars of IT investment decisions. While this approach works well for known cost factors, we argue that the existing cost-based approaches are insufficient for handling cost associated with stochastic elements (risks). In this paper, we present a short review of existing cost-based investment evaluations and use an example to illustrate why we feel that these approaches do not cover all necessary aspects of the consequences triggered by IT investments. We also suggest a rough outline for a solution to this problem as a roadmap for our future work.
{"title":"Preliminary Thoughts on Cost-based Investment Decisions in IT: A Problem Analysis","authors":"R. Gitzel, Christian Cuske, Carsten Munch","doi":"10.1109/ARES.2011.64","DOIUrl":"https://doi.org/10.1109/ARES.2011.64","url":null,"abstract":"IT investments are evaluated using varying criteria, in which financial aspects play a central role. Today a financial estimation of the Total Cost of Ownership (TCO) or the Life Cycle Cost (LCC) is one of the pillars of IT investment decisions. While this approach works well for known cost factors, we argue that the existing cost-based approaches are insufficient for handling cost associated with stochastic elements (risks). In this paper, we present a short review of existing cost-based investment evaluations and use an example to illustrate why we feel that these approaches do not cover all necessary aspects of the consequences triggered by IT investments. We also suggest a rough outline for a solution to this problem as a roadmap for our future work.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132035747","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}
This article focuses on optimization of cryptographic mechanisms used in association rules multiparty mining algorithms with preserving data privacy. The major part of attention is focused on increasing the performance because the computation expense can be prohibitive when applying to large databases. We introduce how to use a Common Decrypting Key for commutative encryption in Secure Set Union to improve performance. As an example of the above mentioned mechanism application, the article presents a new algorithm of mining association rules on horizontally partitioned data with preserving data privacy-CDKSU (Secure Union with Common Decrypting Key). CDKSU is an application of the Common Decrypting Key for a commutative encryption in a Secure Set Union. This algorithm is compared to the KCS scheme (referenced as HPSU also) since they are both based on FDM. As far as the performance optimization is concerned, the application of Elliptic Curve Cryptography versus Exponential Cryptography is presented as well. We believe that this is the first description of application of the Elliptic Curve Pohlig-Hellman Cipher. The system implementing given algorithms is described and subjected to performance tests. Finally, the results of these tests are presented and analyzed.
本文重点研究了在保护数据隐私的前提下，对关联规则多方挖掘算法中使用的加密机制进行优化。关注的主要部分集中在提高性能上，因为在应用于大型数据库时，计算费用可能会令人望而却步。介绍了如何在安全集联合中使用公共解密密钥进行交换加密以提高性能。作为上述机制应用的一个实例，本文提出了一种新的水平分区数据关联规则挖掘算法——cdksu (Secure Union with Common Decrypting Key)。CDKSU是安全集合联合中交换加密的公共解密密钥的一种应用。该算法与KCS方案(也称为HPSU)进行了比较，因为它们都是基于FDM的。在性能优化方面，还介绍了椭圆曲线密码与指数密码的应用。我们认为这是椭圆曲线波利-赫尔曼密码应用的第一个描述。描述了实现给定算法的系统，并进行了性能测试。最后，给出了试验结果并进行了分析。
{"title":"Optimization of Privacy Preserving Mechanisms in Homogeneous Collaborative Association Rules Mining","authors":"M. Gorawski, Zacheusz Siedlecki","doi":"10.1109/ARES.2011.58","DOIUrl":"https://doi.org/10.1109/ARES.2011.58","url":null,"abstract":"This article focuses on optimization of cryptographic mechanisms used in association rules multiparty mining algorithms with preserving data privacy. The major part of attention is focused on increasing the performance because the computation expense can be prohibitive when applying to large databases. We introduce how to use a Common Decrypting Key for commutative encryption in Secure Set Union to improve performance. As an example of the above mentioned mechanism application, the article presents a new algorithm of mining association rules on horizontally partitioned data with preserving data privacy-CDKSU (Secure Union with Common Decrypting Key). CDKSU is an application of the Common Decrypting Key for a commutative encryption in a Secure Set Union. This algorithm is compared to the KCS scheme (referenced as HPSU also) since they are both based on FDM. As far as the performance optimization is concerned, the application of Elliptic Curve Cryptography versus Exponential Cryptography is presented as well. We believe that this is the first description of application of the Elliptic Curve Pohlig-Hellman Cipher. The system implementing given algorithms is described and subjected to performance tests. Finally, the results of these tests are presented and analyzed.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"411 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132937687","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}
This paper presents a web-based tool to supplement defense against security misconfiguration vulnerabilities in web applications. The tool automatically audits security configuration settings of server environments in web application development and deployment. It also offers features to automatically adjust security configuration settings and quantitatively rates level of safety for server environments before deploying web applications. Using the tool, we were able to evaluate eleven server packages for Apache, PHP and MySQL across three operating system platforms. Our evaluation revealed that the tool is able to audit current security configuration settings and alert users to fix the server environment to achieve the level of safety of security configuration with respect to recommended configurations for real-life web application deployment.
{"title":"Early Detection of Security Misconfiguration Vulnerabilities in Web Applications","authors":"Birhanu Eshete, Adolfo Villafiorita, Komminist Weldemariam","doi":"10.1109/ARES.2011.31","DOIUrl":"https://doi.org/10.1109/ARES.2011.31","url":null,"abstract":"This paper presents a web-based tool to supplement defense against security misconfiguration vulnerabilities in web applications. The tool automatically audits security configuration settings of server environments in web application development and deployment. It also offers features to automatically adjust security configuration settings and quantitatively rates level of safety for server environments before deploying web applications. Using the tool, we were able to evaluate eleven server packages for Apache, PHP and MySQL across three operating system platforms. Our evaluation revealed that the tool is able to audit current security configuration settings and alert users to fix the server environment to achieve the level of safety of security configuration with respect to recommended configurations for real-life web application deployment.","PeriodicalId":254443,"journal":{"name":"2011 Sixth International Conference on Availability, Reliability and Security","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132946053","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
扫码关注我们
求助内容：
应助结果提醒方式：