{"title":"Long-Lived Self-Healing Group Key Distribution Scheme with Backward Secrecy","authors":"Tomasz Rams, P. Pacyna","doi":"10.1109/NetSys.2013.19","DOIUrl":"https://doi.org/10.1109/NetSys.2013.19","url":null,"abstract":"Self-healing group key distribution schemes allow for the establishment of a secure multicast communication between a group manager and group members through an unreliable broadcast channel. They can be used in multicast networks with centralized management, such as machine-to-machine systems, embedded and sensor networks, cellular networks and wireless networks. Constructions based on the exponential arithmetic are currently the most efficient long-lived schemes, but they lack backward secrecy. In this paper we present a new mechanism, which allows to achieve backward secrecy in this class of schemes and we illustrate its use in a long-lived key distribution scheme. Then, we perform security and performance analyses of the scheme, in order to show that it is efficient, achieves forward and backward secrecy, and resists collusion between the newly joined users and the revoked ones.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116808392","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}
B. Schilling, B. Koldehofe, K. Rothermel, U. Ramachandran
{"title":"Access Policy Consolidation for Event Processing Systems","authors":"B. Schilling, B. Koldehofe, K. Rothermel, U. Ramachandran","doi":"10.1109/NetSys.2013.18","DOIUrl":"https://doi.org/10.1109/NetSys.2013.18","url":null,"abstract":"Current event processing systems lack methods to preserve privacy constraints of incoming event streams in a chain of subsequently applied stream operations. This is a problem in large-scale distributed applications like a logistic chain where event processing operators may be spread over multiple security domains. An adversary can infer from legally received outgoing event streams confidential input streams of the event processing system. This paper presents a fine-grained access management for complex event processing. Each incoming event stream can be protected by the specification of an access policy and is enforced by algorithms for access consolidation. The utility of the event processing system is increased by providing and computing in a scalable manner a measure for the obfuscation of event streams. An obfuscation threshold as part of the access policy allows to ignore access requirements and deliver events which have achieved a sufficient high obfuscation level.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"90 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129441330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Context-Aware Prediction of QoS and QoE Properties for Web Services","authors":"Harun Baraki, D. Comes, K. Geihs","doi":"10.1109/NetSys.2013.14","DOIUrl":"https://doi.org/10.1109/NetSys.2013.14","url":null,"abstract":"Web Services are commonly used for integrating applications between partners over the Internet. Since services with the same functionality are advertised with different Quality of Service (QoS) levels and are assessed with different Quality of Experience (QoE), choosing the right service may be quite challenging. It is essential for a user to predict QoS and QoE values as accurately as possible in order to find a suitable service. Usually collaborative filtering is applied using similar users and services for predictive purposes. We hypothesize a correlation between context data and QoS and QoE dimensions which can be additionally incorporated to improve predictive accuracy and scalability. In this paper we present the two algorithms PredReg and PredNet in order to predict QoS and QoE values for Web Services. The PredReg algorithm is based on multiple linear regression. The PredNet algorithm uses additionally a neural network for prediction. Both algorithms include context data of users and services generating personalized predictions for the requesting user. In addition, PredNet is able to process categorical variables so that user profiles can also be considered for predictions. We evaluated PredReg and PredNet and compared them with the state-of-the-art approach WSRec [1] which is a memory-based collaborative filtering approach. Our experiments demonstrated that PredReg and PredNet provide a higher predictive accuracy and a significantly improved scalability. Therefore, we recommend the application of PredReg and PredNet for future personalized predictions.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114724048","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Jadex WfMS: Distributed Workflow Management for Private Clouds","authors":"Kai Jander, W. Lamersdorf","doi":"10.1109/NetSys.2013.20","DOIUrl":"https://doi.org/10.1109/NetSys.2013.20","url":null,"abstract":"Structuring an organization around its business processes has many benefits for both the processes themselves as well as the workflow and business process management within an organization in general. However, there are many challenges that make such a transition from a classical hierarchic to a state-of-the-art process organization difficult. In particular, traditional departments often resist loss of autonomy within their organization and, thus, may prevent successful implementation of business process management techniques such as process-oriented workflow management systems. Therefore, this paper proposes a flexible workflow management system architecture consisting of multiple parts that can be replicated and distributed within an organization's private cloud network. Based on distributed components of a workflow management system, it supports both organizations with legacy organizational structures as well as those which require increased autonomy of their respective organizational units. As a result, this system allows, on the one hand side, to manage some organizational units independently and to regulate them in a distributed, process-driven way while, on the other, still allowing the overall organization to exploit many advantages of a centralized workflow management system. The resulting system is based on experiences of a DFG funded technology transfer project aiming at applying previous research results in autonomous business process management to practical needs and requirements of a real production system application.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132505596","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Evaluating the Impact on Application-Related Metrics for Sensor Data with Concurrent Voice Transmission in Mobile Wireless Mesh Scenarios","authors":"N. Aschenbruck, Christoph Fuchs","doi":"10.1109/NetSys.2013.12","DOIUrl":"https://doi.org/10.1109/NetSys.2013.12","url":null,"abstract":"The transmission of sensor data over wireless mesh networks in mobile scenarios is a strongly emerging application in the field of tactical and mission critical networking. In these scenarios, sensor data from the deployed units like GPSposition, vital and environmental data is transported over a wireless mesh network to a centralized command point. The inherently imprecise sensor measurements are processed at the command point using sensor data fusion algorithms in order to improve their precision and reliability. For evaluating the influence of node mobility and the effects of the wireless mesh network on the quality of the sensor data fusion result, it is not sufficient to only consider network-related metrics like throughput, delay or loss rate. Instead, application-related metrics must be considered that directly rate the precision of the processed data based on the fusion result. For this reason, we developed an integrated simulation and evaluation environment for sensor data fusion applications based on the popular network simulator ns-2 that allows for the inclusion and processing of real sensor data. In this paper, we present evaluation results for the transmission of GPS data in a typical tactical scenario. By doing so, we confirm that the quality of the fusion result can not be judged by evaluating network-related metrics only. Using the integrated simulation and evaluation environment, though, allows to analyze the effective impact on application level.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122347098","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}
Franz Girlich, M. Rossberg, G. Schäfer, T. Böhme, Jens Schreyer
{"title":"Bounds for the Security of the Vivaldi Network Coordinate System","authors":"Franz Girlich, M. Rossberg, G. Schäfer, T. Böhme, Jens Schreyer","doi":"10.1109/NetSys.2013.21","DOIUrl":"https://doi.org/10.1109/NetSys.2013.21","url":null,"abstract":"Network coordinate systems have gained much attention as they allow for an elegant estimation of distances between nodes in distributed systems. Their most prominent representative is Vivaldi, which is using a mass-spring-damper system to embed peers into a two-dimensional Euclidean coordinate space with an additional height coordinate. In unimpaired overlay networks this simple method leads to a good approximation of pair wise delays. Unfortunately, like most distributed algorithms, Vivaldi is vulnerable to Byzantine failures, leading to possible routing attacks in peer-to-peer systems. Hence, several attack methods and countermeasures have been proposed. In this article, we analyze bounds for protection of Vivaldi network coordinates and show by theory and simulation how triangle inequality violations can be exploited to create instabilities, despite the proposed countermeasures.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130315884","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. Benter, M. Divband, Sebastian Kniesburges, Andreas Koutsopoulos, Kalman Graffi
{"title":"Ca-Re-Chord: A Churn Resistant Self-Stabilizing Chord Overlay Network","authors":"M. Benter, M. Divband, Sebastian Kniesburges, Andreas Koutsopoulos, Kalman Graffi","doi":"10.1109/NetSys.2013.11","DOIUrl":"https://doi.org/10.1109/NetSys.2013.11","url":null,"abstract":"Self-stabilization is the property of a system to transfer itself regardless of the initial state into a legitimate state. Chord as a simple, decentralized and scalable distributed hash table is an ideal showcase to introduce self-stabilization for p2p overlays. In this paper, we present Re-Chord, a self-stabilizing version of Chord. We show, that the stabilization process is functional, but prone to strong churn. For that, we present Ca-Re-Chord, a churn resistant version of Re-Chord, that allows the creation of a useful DHT in any kind of graph regardless of the initial state. Simulation results attest the churn resistance and good performance of Ca-Re-Chord.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121325154","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}
Ulrich Lampe, André Miede, T. Lusa, Stefan Schulte, R. Steinmetz, S. Dustdar
{"title":"An Analysis of Anonymity Side Effects in the Internet of Services","authors":"Ulrich Lampe, André Miede, T. Lusa, Stefan Schulte, R. Steinmetz, S. Dustdar","doi":"10.1109/NETSYS.2013.15","DOIUrl":"https://doi.org/10.1109/NETSYS.2013.15","url":null,"abstract":"The Internet of Services will facilitate cross-organizational collaboration by allowing companies to utilize services from external providers. Even though standard security mechanisms such as message encryption may be in place, attackers could create detailed profiles of service consumers, providers, and marketplaces by monitoring communication endpoints. This threatens the security objective of relationship anonymity and potentially permits sensitive information about the underlying business processes or relationships between service consumers and providers to be revealed. While state-of-the-art countermeasures in the form of anonymity systems allow this problem to be addressed, they may have undesired side effects on the Quality of Service. This work provides a detailed empirical analysis of these side effects, based on an extensive measurement of the response time, availability, and throughput of representative, globally distributed services. Our experimental results are available to the interested public within the comprehensive dataset WS-Anon.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125391593","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Face the Enemy: Attack Detection for Planar Graph Routing","authors":"Adrian Loch, M. Hollick","doi":"10.1109/NetSys.2013.16","DOIUrl":"https://doi.org/10.1109/NetSys.2013.16","url":null,"abstract":"Localized geographic forwarding on planar graphs has been proposed for making routing scalable and efficient in large-scale wireless multihop networks. This approach, which is also known as face routing or perimeter routing, scales almost independently of the network size and is, hence, a promising scheme for the given class of networks. Existing work on this kind of routing focuses on the forwarding mechanisms, but does not yet consider security issues. In this paper, we analyze the specific security vulnerabilities of face routing and present several concepts that exploit its unique characteristics in order to detect attacks on the forwarding process. Our schemes are based on the same abstraction as face routing, namely the so-called faces, which are the polygons formed by the edges of the planar graph. They are defined as own entities in order to abstract from the underlying wireless multihop network. By operating on face abstraction level, the detection responsibility is shared among all the nodes that form the face, which increases the complexity of attacks, since all nodes inside one face need to collude for circumventing our security mechanisms. We implement the proposed mechanisms and perform a simulation study to analyze the effectiveness of our approach. The results show that our schemes sustain a true positive rate close to 100% and can provide improvements in the packet loss ratio of above 90% compared to security mechanisms defined at lower abstraction levels. Exploiting the face abstraction for providing security could be potentially used not only for face routing, but also for general geographic routing schemes in future work.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128418133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Greedy Embedding, Routing and Content Addressing for Darknets","authors":"Andreas Höfer, Stefanie Roos, T. Strufe","doi":"10.1109/NetSys.2013.23","DOIUrl":"https://doi.org/10.1109/NetSys.2013.23","url":null,"abstract":"To achieve anonymous and censorship-resistant overlay communication, darknets restrict overlay links to trusted parties. Efficient data retrieval in such a restricted topology requires a decentralized addressing scheme. We propose a greedy embedding algorithm, which is used to realize efficient routing and content addressing for darknets. The embedding guarantees success of greedy routing using compact address representations. Evaluation on trust graphs obtained from PGP's web of trust shows that our embedding enables much more efficient routing than existing dark net embeddings. Though, content addressing based on the embedding exhibits unbalanced load.","PeriodicalId":198664,"journal":{"name":"2013 Conference on Networked Systems","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124239327","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}