The three traditional objectives of computer security are confidentiality, integrity and availability. Availability can be defined as the prevention of denial of service. Confidentiality and integrity have been addressed in several theoretical works whereas the concept of availability has not been much investigated by the scientific community. This paper is an attempt to define through a case study the concept of availability. We first define a set of availability constraints that avionic data bus protocols should enforce. Then, we consider the ARINC 629 basic protocol (BP) which was implemented on the Boeing 777, and we check whether that ARINC 629 BP respects our availability constraints or not.
{"title":"Availability constraints for avionic data buses","authors":"A. Gabillon, L. Gallon","doi":"10.1109/ARES.2006.35","DOIUrl":"https://doi.org/10.1109/ARES.2006.35","url":null,"abstract":"The three traditional objectives of computer security are confidentiality, integrity and availability. Availability can be defined as the prevention of denial of service. Confidentiality and integrity have been addressed in several theoretical works whereas the concept of availability has not been much investigated by the scientific community. This paper is an attempt to define through a case study the concept of availability. We first define a set of availability constraints that avionic data bus protocols should enforce. Then, we consider the ARINC 629 basic protocol (BP) which was implemented on the Boeing 777, and we check whether that ARINC 629 BP respects our availability constraints or not.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"19 4 Part 2 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":"130784249","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}
Today's high performance computing systems have several reliability deficiencies resulting in availability and serviceability issues. Head and service nodes represent a single point of failure and control for an entire system as they render it inaccessible and unmanageable in case of a failure until repair, causing a significant downtime. This paper introduces two distinct replication methods (internal and external) for providing symmetric active/active high availability for multiple head and service nodes running in virtual synchrony. It presents a comparison of both methods in terms of expected correctness, ease-of-use and performance based on early results from ongoing work in providing symmetric active/active high availability for two HPC system services (TORQUE and PVFS metadata server). It continues with a short description of a distributed mutual exclusion algorithm and a brief statement regarding the handling of Byzantine failures. This paper concludes with an overview of past and ongoing work, and a short summary of the presented research.
{"title":"Active/active replication for highly available HPC system services","authors":"C. Engelmann, S. Scott, C. Leangsuksun, Xubin He","doi":"10.1109/ARES.2006.23","DOIUrl":"https://doi.org/10.1109/ARES.2006.23","url":null,"abstract":"Today's high performance computing systems have several reliability deficiencies resulting in availability and serviceability issues. Head and service nodes represent a single point of failure and control for an entire system as they render it inaccessible and unmanageable in case of a failure until repair, causing a significant downtime. This paper introduces two distinct replication methods (internal and external) for providing symmetric active/active high availability for multiple head and service nodes running in virtual synchrony. It presents a comparison of both methods in terms of expected correctness, ease-of-use and performance based on early results from ongoing work in providing symmetric active/active high availability for two HPC system services (TORQUE and PVFS metadata server). It continues with a short description of a distributed mutual exclusion algorithm and a brief statement regarding the handling of Byzantine failures. This paper concludes with an overview of past and ongoing work, and a short summary of the presented research.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"49 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":"133001640","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}
Peer-to-peer-based file replication is a proven approach to provide cooperative robust backup for data: if one peer does not have a specific datum, another one might. If enough peers participate, the overall system can survive isolated failures. Applying this approach to distributed file integrity checking (or similar security-sensitive areas) requires that current and untampered information is distributed among the peers in such a way that a limited number of malicious peers cannot subvert or sabotage the overall system. This paper presents a mechanism to provide such tamper-resistant replicated storage in a decentralised peer-to-peer system where no component is trusted a priori. We present a system model for our mechanism, and discuss the threats and countermeasures used to detect tampering. We also give an analysis of various distribution strategies and their respective costs and benefits as observed in our research implementation.
{"title":"Tamper-resistant replicated peer-to-peer storage using hierarchical signatures","authors":"Alexander Zangerl","doi":"10.1109/ARES.2006.129","DOIUrl":"https://doi.org/10.1109/ARES.2006.129","url":null,"abstract":"Peer-to-peer-based file replication is a proven approach to provide cooperative robust backup for data: if one peer does not have a specific datum, another one might. If enough peers participate, the overall system can survive isolated failures. Applying this approach to distributed file integrity checking (or similar security-sensitive areas) requires that current and untampered information is distributed among the peers in such a way that a limited number of malicious peers cannot subvert or sabotage the overall system. This paper presents a mechanism to provide such tamper-resistant replicated storage in a decentralised peer-to-peer system where no component is trusted a priori. We present a system model for our mechanism, and discuss the threats and countermeasures used to detect tampering. We also give an analysis of various distribution strategies and their respective costs and benefits as observed in our research implementation.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"10 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":"132319056","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}
A. Solanas, A. Martmez-Balleste, J. Domingo-Ferrer, J. M. Mateo-Sanz
Blocking is a well-known technique used to partition a set of records into several subsets of manageable size. The standard approach to blocking is to split the records according to the values of one or several attributes (called blocking attributes). This paper presents a new blocking method based on 2/sup d/-trees for intelligently partitioning very large data sets for micro aggregation. A number of experiments has been carried out in order to compare our method with the most typical univariate one.
{"title":"A 2/sup d/-tree-based blocking method for microaggregating very large data sets","authors":"A. Solanas, A. Martmez-Balleste, J. Domingo-Ferrer, J. M. Mateo-Sanz","doi":"10.1109/ARES.2006.1","DOIUrl":"https://doi.org/10.1109/ARES.2006.1","url":null,"abstract":"Blocking is a well-known technique used to partition a set of records into several subsets of manageable size. The standard approach to blocking is to split the records according to the values of one or several attributes (called blocking attributes). This paper presents a new blocking method based on 2/sup d/-trees for intelligently partitioning very large data sets for micro aggregation. A number of experiments has been carried out in order to compare our method with the most typical univariate one.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"49 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":"121332586","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}
José Daniel García Sánchez, J. Carretero, Javier Fernández, Félix García, D. E. Singh, A. Calderón
Traditionally, distributed Web servers have used two strategies for allocating files on server nodes: full replication and full distribution. While full replication provides a highly reliable solution, it limits storage capacity to the capacity of the smallest node. On the other hand, full distribution provides higher storage capacity at the cost of lower reliability. A hybrid solution is partial replication where every file is allocated to a small number of nodes. The most promising architecture for a partial replication strategy is the Web cluster architecture. However, Web clusters present a big flaw from reliability perspective as they contain a single point of failure. To correct this flaw, in this paper we present a modified architecture: the Web cluster with distributed Web switch. Reliability of Web clusters is evaluated for different replication strategies. System evaluations show that our proposal leads to a highly reliable solution with high scalability.
{"title":"On the reliability of Web clusters with partial replication of contents","authors":"José Daniel García Sánchez, J. Carretero, Javier Fernández, Félix García, D. E. Singh, A. Calderón","doi":"10.1109/ARES.2006.90","DOIUrl":"https://doi.org/10.1109/ARES.2006.90","url":null,"abstract":"Traditionally, distributed Web servers have used two strategies for allocating files on server nodes: full replication and full distribution. While full replication provides a highly reliable solution, it limits storage capacity to the capacity of the smallest node. On the other hand, full distribution provides higher storage capacity at the cost of lower reliability. A hybrid solution is partial replication where every file is allocated to a small number of nodes. The most promising architecture for a partial replication strategy is the Web cluster architecture. However, Web clusters present a big flaw from reliability perspective as they contain a single point of failure. To correct this flaw, in this paper we present a modified architecture: the Web cluster with distributed Web switch. Reliability of Web clusters is evaluated for different replication strategies. System evaluations show that our proposal leads to a highly reliable solution with high scalability.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"56 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":"126494559","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}
Intrusion detection is important in network security. Most current network intrusion detection systems (NIDSs) employ either misuse detection or anomaly detection. However, misuse detection cannot detect unknown intrusions, and anomaly detection usually has high false positive rate. To overcome the limitations of both techniques, we incorporate both anomaly and misuse detection into the NIDS. In this paper, we present our framework of the hybrid system. The system combines the misuse detection and anomaly detection components in which the random forests algorithm is applied. We discuss the advantages of the framework and also report our experimental results over the KDD'99 dataset. The results show that the proposed approach can improve the detection performance of the NIDSs, where only anomaly or misuse detection technique is used.
{"title":"A hybrid network intrusion detection technique using random forests","authors":"Jiong Zhang, Mohammad Zulkernine","doi":"10.1109/ARES.2006.7","DOIUrl":"https://doi.org/10.1109/ARES.2006.7","url":null,"abstract":"Intrusion detection is important in network security. Most current network intrusion detection systems (NIDSs) employ either misuse detection or anomaly detection. However, misuse detection cannot detect unknown intrusions, and anomaly detection usually has high false positive rate. To overcome the limitations of both techniques, we incorporate both anomaly and misuse detection into the NIDS. In this paper, we present our framework of the hybrid system. The system combines the misuse detection and anomaly detection components in which the random forests algorithm is applied. We discuss the advantages of the framework and also report our experimental results over the KDD'99 dataset. The results show that the proposed approach can improve the detection performance of the NIDSs, where only anomaly or misuse detection technique is used.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"85 4 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":"126084565","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}
Peer-to-peer (P2P) networks offer a great potential that goes well beyond simple file-sharing. We present a novel approach for using P2P-overlay networks to ensure a sustainable operation of a distributed system. In particular, we show how to detect and localize the causes of physical link failures using the maintenance traffic of a P2P overlay network. The network monitoring architecture can be set up autonomously thereby reducing both the installation costs and the traffic overhead.
{"title":"Efficient link failure detection and localization using P2P-overlay networks","authors":"B. Emmert, A. Binzenhöfer","doi":"10.1109/ARES.2006.58","DOIUrl":"https://doi.org/10.1109/ARES.2006.58","url":null,"abstract":"Peer-to-peer (P2P) networks offer a great potential that goes well beyond simple file-sharing. We present a novel approach for using P2P-overlay networks to ensure a sustainable operation of a distributed system. In particular, we show how to detect and localize the causes of physical link failures using the maintenance traffic of a P2P overlay network. The network monitoring architecture can be set up autonomously thereby reducing both the installation costs and the traffic overhead.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"159 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":"116611646","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}
Summary form only given. We present an approach to integrating security into the system design process. Namely, models are made of system designs along with their security requirements, and security architectures are automatically generated from the resulting security-design models. We call the resulting approach "model driven security" as it represents a specialization of model driven development to the domain of system security. To illustrate these ideas we present SecureUML, a modeling language based on UML for modeling system designs along with their security requirements. From SecureUML models, we automatically generate security architectures, built from declarative and procedural access control mechanisms, for distributed middleware-based applications. The process has been implemented in the ArcStyler tool, which generates security infrastructures based on Sun's Enterprise Java Bean standard. We report on case studies using this tool, which illustrate the flexibility and power of our approach.
{"title":"Model driven security","authors":"D. Basin","doi":"10.1109/ARES.2006.82","DOIUrl":"https://doi.org/10.1109/ARES.2006.82","url":null,"abstract":"Summary form only given. We present an approach to integrating security into the system design process. Namely, models are made of system designs along with their security requirements, and security architectures are automatically generated from the resulting security-design models. We call the resulting approach \"model driven security\" as it represents a specialization of model driven development to the domain of system security. To illustrate these ideas we present SecureUML, a modeling language based on UML for modeling system designs along with their security requirements. From SecureUML models, we automatically generate security architectures, built from declarative and procedural access control mechanisms, for distributed middleware-based applications. The process has been implemented in the ArcStyler tool, which generates security infrastructures based on Sun's Enterprise Java Bean standard. We report on case studies using this tool, which illustrate the flexibility and power of our approach.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"877 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":"123031103","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. Payeras-Capellà, J. Ferrer-Gomila, L. H. Rotger
In ACISP 04, the authors of (F. Bao et al., 2004) suggested a fair exchange protocol for electronic contract signing between two parts. The protocol is an improvement of a previous one (S. Micali, 2003) and solves the vulnerabilities of that protocol. In (F. Bao et al., 2004) one of the signers can contact a trusted third party to resolve the exchange if he can't conclude it in the usual way. However, the other signer cannot contact the trusted third party, and for this reason, this signer can't know the final state of the exchange until, if it is the case, the trusted third party contact him or her. In this paper we have improved the protocol so that both signers can contact the TTP and solve the exchange whenever they want. We propose an asynchronous and fair protocol that improves the protocol presented in (F. Bao et al., 2004) maintaining the efficiency of the original protocol.
在ACISP 04中，(F. Bao et al.， 2004)的作者提出了一个公平的交换协议，用于双方之间的电子合同签署。该协议是对先前协议(S. Micali, 2003)的改进，并解决了该协议的漏洞。在(F. Bao et al.， 2004)中，如果签名者不能以通常的方式完成交易，可以联系可信的第三方来解决交易。但是，另一个签名者不能联系可信的第三方，因此，在可信的第三方联系他或她之前，该签名者无法知道交换的最终状态。在本文中，我们对协议进行了改进，使双方签名者可以随时联系到TTP并解决交换问题。我们提出了一种异步和公平的协议，它改进了(F. Bao et al.， 2004)中提出的协议，保持了原始协议的效率。
{"title":"Achieving fairness and timeliness in a previous electronic contract signing protocol","authors":"M. Payeras-Capellà, J. Ferrer-Gomila, L. H. Rotger","doi":"10.1109/ARES.2006.22","DOIUrl":"https://doi.org/10.1109/ARES.2006.22","url":null,"abstract":"In ACISP 04, the authors of (F. Bao et al., 2004) suggested a fair exchange protocol for electronic contract signing between two parts. The protocol is an improvement of a previous one (S. Micali, 2003) and solves the vulnerabilities of that protocol. In (F. Bao et al., 2004) one of the signers can contact a trusted third party to resolve the exchange if he can't conclude it in the usual way. However, the other signer cannot contact the trusted third party, and for this reason, this signer can't know the final state of the exchange until, if it is the case, the trusted third party contact him or her. In this paper we have improved the protocol so that both signers can contact the TTP and solve the exchange whenever they want. We propose an asynchronous and fair protocol that improves the protocol presented in (F. Bao et al., 2004) maintaining the efficiency of the original protocol.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"1 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":"116091440","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}
When IEEE 802.11i draft proposed TKIP, it is expected to improve WEP on both active and passive attack methods. TKIP uses more sophisticated methods to distribute and manage secret keys and also requires software upgrade only instead of changing hardware equipment. However, implementing TKIP on the exiting equipment, the transmission performance is decreased dramatically. This paper, therefore, proposes a new transfer scheme to enhance previous WEP and TKIP protocols - secure enhanced wireless transfer protocol (SEWTP). SEWTP provides an encryption algorithm on top of current hardware that improves low performance in TKIP but without compromising security level in the mean time. This is achieved by encrypting secret key twice. Secret key are stored at both access point (AP) and wireless client so that it can be compared and validated.
{"title":"Secure enhanced wireless transfer protocol","authors":"Jin-Cherng Lin, Yu-Hsin Kao, Chengjin Yang","doi":"10.1109/ARES.2006.122","DOIUrl":"https://doi.org/10.1109/ARES.2006.122","url":null,"abstract":"When IEEE 802.11i draft proposed TKIP, it is expected to improve WEP on both active and passive attack methods. TKIP uses more sophisticated methods to distribute and manage secret keys and also requires software upgrade only instead of changing hardware equipment. However, implementing TKIP on the exiting equipment, the transmission performance is decreased dramatically. This paper, therefore, proposes a new transfer scheme to enhance previous WEP and TKIP protocols - secure enhanced wireless transfer protocol (SEWTP). SEWTP provides an encryption algorithm on top of current hardware that improves low performance in TKIP but without compromising security level in the mean time. This is achieved by encrypting secret key twice. Secret key are stored at both access point (AP) and wireless client so that it can be compared and validated.","PeriodicalId":106780,"journal":{"name":"First International Conference on Availability, Reliability and Security (ARES'06)","volume":"33 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":"122968005","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
扫码关注我们
求助内容：
应助结果提醒方式：