With rapid changes in the modern communication environment such as ad hoc networks and ubiquitous computing, it is necessary to construct a secure end-to-end channel between clients. The fundamental security goal of PAKE is security against dictionary attacks. The protocols for verifier-based PAKE are additionally required to be secure against server compromise. This paper presents a new password authentication and key-exchange protocol suitable for client-to-client without a server public key in different realms to agree on a common session key using different passwords over an untrusted network. The proposed protocol's security, simplicity, and speed make it ideal for a wide range of real-world applications in which secure password authentication is required.
{"title":"An Efficient Client-to-Client Password-Authenticated Key Exchange Resilient to Server Compromise","authors":"Hongfeng Zhu, Tianhua Liu, Jie Liu, G. Chang","doi":"10.1109/PRDC.2007.32","DOIUrl":"https://doi.org/10.1109/PRDC.2007.32","url":null,"abstract":"With rapid changes in the modern communication environment such as ad hoc networks and ubiquitous computing, it is necessary to construct a secure end-to-end channel between clients. The fundamental security goal of PAKE is security against dictionary attacks. The protocols for verifier-based PAKE are additionally required to be secure against server compromise. This paper presents a new password authentication and key-exchange protocol suitable for client-to-client without a server public key in different realms to agree on a common session key using different passwords over an untrusted network. The proposed protocol's security, simplicity, and speed make it ideal for a wide range of real-world applications in which secure password authentication is required.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"15 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":"126787806","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 ability to predict defective modules can help us allocate limited quality assurance resources effectively and efficiently. In this paper, we propose a complexity- based method for predicting defect-prone components. Our method takes three code-level complexity measures as input, namely Lines of Code, McCabe's Cyclomatic Complexity and Halstead's Volume, and classifies components as either defective or non-defective. We perform an extensive study of twelve classification models using the public NASA datasets. Cross-validation results show that our method can achieve good prediction accuracy. This study confirms that static code complexity measures can be useful indicators of component quality.
{"title":"Predicting Defective Software Components from Code Complexity Measures","authors":"Hongyu Zhang, Xiuzhen Zhang, Ming Gu","doi":"10.1109/PRDC.2007.28","DOIUrl":"https://doi.org/10.1109/PRDC.2007.28","url":null,"abstract":"The ability to predict defective modules can help us allocate limited quality assurance resources effectively and efficiently. In this paper, we propose a complexity- based method for predicting defect-prone components. Our method takes three code-level complexity measures as input, namely Lines of Code, McCabe's Cyclomatic Complexity and Halstead's Volume, and classifies components as either defective or non-defective. We perform an extensive study of twelve classification models using the public NASA datasets. Cross-validation results show that our method can achieve good prediction accuracy. This study confirms that static code complexity measures can be useful indicators of component quality.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"126 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":"123515088","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 topology control algorithm can be applied to wireless sensor networks to construct a virtual backbone for maintaining network connectivity. For handling node failure, previous algorithms typically prefer to have redundant nodes so the power efficiency was compromised. This paper describes a Power-CDS (P-CDS) mechanism that schedules active and backup sensor nodes in the backbone for tolerating failures. When node failure is detected, both active and backup nodes will adjust their transmission ranges to maintain connectivity. Simulation results show that P-CDS forms a smaller connected dominating set than the other fault- tolerant topology control algorithm. P-CDS also provides efficient broadcast with relatively low energy consumption.
{"title":"Fault-Tolerant Topology Control with Adjustable Transmission Ranges in Wireless Sensor Networks","authors":"Chiu-Wen Chen, K. Ssu, H. C. Jiau","doi":"10.1109/PRDC.2007.47","DOIUrl":"https://doi.org/10.1109/PRDC.2007.47","url":null,"abstract":"A topology control algorithm can be applied to wireless sensor networks to construct a virtual backbone for maintaining network connectivity. For handling node failure, previous algorithms typically prefer to have redundant nodes so the power efficiency was compromised. This paper describes a Power-CDS (P-CDS) mechanism that schedules active and backup sensor nodes in the backbone for tolerating failures. When node failure is detected, both active and backup nodes will adjust their transmission ranges to maintain connectivity. Simulation results show that P-CDS forms a smaller connected dominating set than the other fault- tolerant topology control algorithm. P-CDS also provides efficient broadcast with relatively low energy consumption.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"43 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":"125667888","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}
Path diversity is an important index of the dependability and fault tolerance capability of networks. Most path diversity metrics are designed under an implicit hypothesis that all candidate paths for a divergence node are always equally chosen. This may not be true due to the effect of routing policy with consideration of cost or other factors. A new simple metric is proposed in this paper for path diversity measurement of end-to-end networks. An end-to-end network is firstly transformed into a sequence of cascading segments. With the assumption that only one of all available branches is chosen each time, a probability based metric is calculated for each segment, and the joint entropy is calculated as path diversity measurement for the overall end-to-end network. The metric is fitful for both single-hop and multi-hop topologies. A comparison between the new metric and other ones is given at the end.
{"title":"A Path Diversity Metric for End-to-End Network","authors":"Song Huang, Yong Xu, Ling Zhang","doi":"10.1109/PRDC.2007.15","DOIUrl":"https://doi.org/10.1109/PRDC.2007.15","url":null,"abstract":"Path diversity is an important index of the dependability and fault tolerance capability of networks. Most path diversity metrics are designed under an implicit hypothesis that all candidate paths for a divergence node are always equally chosen. This may not be true due to the effect of routing policy with consideration of cost or other factors. A new simple metric is proposed in this paper for path diversity measurement of end-to-end networks. An end-to-end network is firstly transformed into a sequence of cascading segments. With the assumption that only one of all available branches is chosen each time, a probability based metric is calculated for each segment, and the joint entropy is calculated as path diversity measurement for the overall end-to-end network. The metric is fitful for both single-hop and multi-hop topologies. A comparison between the new metric and other ones is given at the end.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"13 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":"115661040","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 an efficient fault-tolerant approach for the super-peers of peer-to-peer (P2P) file sharing systems. In the super-peer based P2P file sharing system, peers are organized into multiple groups. In each group, it has a special peer called super peer to serve the regular peers within the group. In this hierarchical architecture, if the super peer departs (fails), any file queries to its serving regular peers cannot be delivered. In the proposed approach, we propose a multiple publication technique to make each regular peer logically connect with two or more super peers in other groups. If a regular peer finds that its serving super peer cannot work, one of its other connected super peers will be selected as its new serving super peer to continuously process the file queries. To examine the effectiveness of the proposed approach, comprehensive simulations are performed to quantify the performance and overhead of the proposed approach.
{"title":"Fault Tolerance for Super-Peers of P2P Systems","authors":"Jenn-Wei Lin, M. Yang, Jichiang Tsai","doi":"10.1109/PRDC.2007.5","DOIUrl":"https://doi.org/10.1109/PRDC.2007.5","url":null,"abstract":"This paper presents an efficient fault-tolerant approach for the super-peers of peer-to-peer (P2P) file sharing systems. In the super-peer based P2P file sharing system, peers are organized into multiple groups. In each group, it has a special peer called super peer to serve the regular peers within the group. In this hierarchical architecture, if the super peer departs (fails), any file queries to its serving regular peers cannot be delivered. In the proposed approach, we propose a multiple publication technique to make each regular peer logically connect with two or more super peers in other groups. If a regular peer finds that its serving super peer cannot work, one of its other connected super peers will be selected as its new serving super peer to continuously process the file queries. To examine the effectiveness of the proposed approach, comprehensive simulations are performed to quantify the performance and overhead of the proposed approach.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"9 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":"126417584","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}
Henrique Moniz, N. Neves, M. Correia, A. Casimiro, P. Veríssimo
This paper presents a study on the performance of intrusion-tolerant protocols in wireless LANs. The protocols are evaluated in several different environmental settings, and also within the context of a car platooning application for distributed cruise control. The experimental evaluation reveals how performance is affected by the various environmental parameters such as the wireless standard, group size, and network topology. The distributed cruise control application demonstrates the practicability of such protocols, even when subjected to malicious faults.
{"title":"Intrusion Tolerance in Wireless Environments: An Experimental Evaluation","authors":"Henrique Moniz, N. Neves, M. Correia, A. Casimiro, P. Veríssimo","doi":"10.1109/PRDC.2007.33","DOIUrl":"https://doi.org/10.1109/PRDC.2007.33","url":null,"abstract":"This paper presents a study on the performance of intrusion-tolerant protocols in wireless LANs. The protocols are evaluated in several different environmental settings, and also within the context of a car platooning application for distributed cruise control. The experimental evaluation reveals how performance is affected by the various environmental parameters such as the wireless standard, group size, and network topology. The distributed cruise control application demonstrates the practicability of such protocols, even when subjected to malicious faults.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"91 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":"133262721","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}
Model-based development is state of the art in software engineering, due to its potential regarding automatic code synthesis. Nevertheless for embedded systems, where there exists a huge heterogeneity of used platforms, it is obvious that it is impossible to design a code generator that supports a priori all required platforms. Instead a code generator architecture is needed that is suited for an easy extensibility of the code generation ability. One possible solution is the use of template-based approaches. In this paper, we describe an approach1 to develop safety-critical realtime systems by using open architecture ware, a modular MDA/MDD generator framework. We will present the tool-chain and discuss two lab applications.
{"title":"Model Based Development of Safety-Critical Systems Using Template Based Code Generation","authors":"M. Regensburger, C. Buckl, A. Knoll, G. Schrott","doi":"10.1109/PRDC.2007.25","DOIUrl":"https://doi.org/10.1109/PRDC.2007.25","url":null,"abstract":"Model-based development is state of the art in software engineering, due to its potential regarding automatic code synthesis. Nevertheless for embedded systems, where there exists a huge heterogeneity of used platforms, it is obvious that it is impossible to design a code generator that supports a priori all required platforms. Instead a code generator architecture is needed that is suited for an easy extensibility of the code generation ability. One possible solution is the use of template-based approaches. In this paper, we describe an approach1 to develop safety-critical realtime systems by using open architecture ware, a modular MDA/MDD generator framework. We will present the tool-chain and discuss two lab applications.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"9 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":"133476598","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 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.
{"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}
While email is fairly reliable, messages do get lost. This can be due to the store-and-forward nature of e-mail, which passes responsibility for delivering email from one mail server to another, but in doing so exposes messages to loss, should a server not fulfil its responsibility. Some end users are more sensitive to email unreliability than others, and seek tools with which they can detect and recover from email failures. This paper describes tools that allow email sending software to automatically respond to reports of undeliverability by persisting with retransmission or retransmitting to alternate recipients.
{"title":"Improving Email Reliability by Sender Retransmission","authors":"T. Moors, P. Chu","doi":"10.1109/PRDC.2007.38","DOIUrl":"https://doi.org/10.1109/PRDC.2007.38","url":null,"abstract":"While email is fairly reliable, messages do get lost. This can be due to the store-and-forward nature of e-mail, which passes responsibility for delivering email from one mail server to another, but in doing so exposes messages to loss, should a server not fulfil its responsibility. Some end users are more sensitive to email unreliability than others, and seek tools with which they can detect and recover from email failures. This paper describes tools that allow email sending software to automatically respond to reports of undeliverability by persisting with retransmission or retransmitting to alternate recipients.","PeriodicalId":183540,"journal":{"name":"13th Pacific Rim International Symposium on Dependable Computing (PRDC 2007)","volume":"190 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":"129258015","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
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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：