{"title":"The Efficiency of Periodic Rekeying in Dynamic Group Key Management","authors":"Tam-Thanh Pham, P. Watters","doi":"10.1109/ECUMN.2007.52","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.52","url":null,"abstract":"The efficiency of group key management is a key issue in secure group communications, since the group key must be renewed each time the group membership changes. This paper examines the performance of a periodic rekeying technique for the key management of groups that exhibit bursty behaviour. Experimental results demonstrate that this technique costs far fewer key generations than existing approaches, and is therefore more efficient in terms of computation. When the pre-processing of joining members can be performed during the rekeying period, this technique reduces the rekeying time at the end of the rekeying period to the lower bound","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130877599","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":"A Spatial Communication Model for Ubiquitous Computing Services","authors":"I. Satoh","doi":"10.4304/jnw.3.4.10-20","DOIUrl":"https://doi.org/10.4304/jnw.3.4.10-20","url":null,"abstract":"The paper presents an approach for location-aware communications in ubiquitous computing environments. It is constructed on a symbolic location model, which links everyday objects, including non-smart objects and places, with counterpart objects, which are executable software components that are dynamically organized like a tree based on geographical containment, such as in a user-room-floor-building hierarchy. The approach enables physical entities and places to communicate with one another through their counterpart objects, even when the entities and places are not smart. It supports a mechanism to detect objects and communicate with them according to their locations. This paper presents the design for the approach and describes an implementation of it","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121526018","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}
Nguyen Ngoc Diep, L. X. Hung, Y. Zhung, Sungyoung Lee, Young-Koo Lee, Heejo Lee
{"title":"Enforcing Access Control Using Risk Assessment","authors":"Nguyen Ngoc Diep, L. X. Hung, Y. Zhung, Sungyoung Lee, Young-Koo Lee, Heejo Lee","doi":"10.1109/ECUMN.2007.19","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.19","url":null,"abstract":"Context-based access control is an emerging approach for modeling adaptive solution, making access control management more flexible and powerful. But in the ubiquitous environment, this approach is not enough for many emerging security vulnerabilities. Thus, improving current access control mechanisms is still necessary. Risk is an effective tool used for decision-making in economics. In this paper, we design a new model for risk assessment in ubiquitous environment and use risk as a key component in decision-making process in our access control model. This solution makes access control management more dynamic and precise","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"191 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115621466","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":"A Novel Face Hashing Method with Feature Fusion for Biometric Cryptosystems","authors":"Z. Zeng, P. Watters","doi":"10.1109/ECUMN.2007.2","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.2","url":null,"abstract":"We present a novel approach to generate cryptographic keys from biometric face data so that their privacy and biometric template can be protected by using helper data schema (HDS). Our method includes three components: feature extraction, feature discretization and key generation. During feature extraction stage, the global features (PCA-transformed) and local features (Gabor wavelet-transformed) of face images are used to produce newly fused feature sets as input feature vectors of generalized PCA in the unitary space so as to achieve superior performance. Then, in the feature discretization stage, a discretization process is introduced to generate a stable binary string from the fused feature vectors. Finally, the stable binary string is protected by helper data schema (HDS) and used as the input parameter of cryptographic key generating algorithms to produce the renewable biometric crypto key","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121225359","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":"Network-Initiated Triggering for Mobility in Voice over 3GPP-WLAN","authors":"Wei-Kuo Chiang, Hsin-Fu Huang","doi":"10.1109/ECUMN.2007.38","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.38","url":null,"abstract":"This paper proposes a network-initiated triggering mechanism to facilitate terminal mobility with the session initiation protocol (SIP) in 3GPP voice over WLAN (VoWLAN). We design the E2E tunnel state model running on the packet data gateway (PDG) using the CAMEL concept, and introduce the mobility server to re-establish sessions with third party call control (SPCC). The mobility server is triggered to provide the terminal mobility service from the PDG by detecting the state transition of E2E tunnel state model that represents the occurrence of a handover. This mechanism can advance the time to re-establish sessions. That is, our approach can provide smaller handover delay than SIP mobility; moreover, it can handle mobility without additional support from the mobile host. In addition, the handover missing problem (messages lost) might happen when the MH moves under communication. With the help of the mobility server, the lost messages are re-sent, and the handover missing problem, including simultaneous movement, is therefore solved","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127397711","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":"Messo & Preso Practical Sensor-Network Messaging Protocols","authors":"S. Rooney, L. Garcés-Erice","doi":"10.1109/ECUMN.2007.35","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.35","url":null,"abstract":"We present two protocols one of which supports the publication by sensors in a sensor-network of messages on a named topic, the other that allows sensors to subscribe to messages on a named topic. We separate the publish and subscribe functions into different protocols as it is not necessary for a given device to support both. The publication protocol is designed for management systems in which nodes take readings from a sensor and transmit them to monitoring applications while the subscription protocol is for actuating systems in which the state of certain nodes is changed by control applications. The protocols use cross-layer optimization techniques for reducing transmissions within the messaging layer of the sensor-network. We show that the path characteristics of such network are highly variable leading to frequent topology changes motivating our description of the protocols which can function even over fluctuating network topologies. Finally, we use simulation to compare the actuation protocol with an epidemic approach, showing that our protocol is more efficient when the topics that the nodes are interested in are non-uniform","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125237974","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":"Approach for Reducing Control Packets in AODV-Based MANETs","authors":"D. Espès, C. Teyssié","doi":"10.1109/ECUMN.2007.7","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.7","url":null,"abstract":"Movements of nodes in MANETs result in route changes, thus requiring the transmission of control packets. As MANETs have limited resources, it is important to reduce the number of control packets which consume bandwidth. We propose a AODV-based protocol which uses a backbone network to reduce control packets. The destination location is given by GPS and transmitted to the source by the backbone network. Our routing algorithm limits the route search to zones smaller than those used by the original AODV (ad hoc on-demand distance vector) protocol, thus reducing the number of control packets. This routing algorithm represents a significant improvement of our previous work on AODV (D. Espes and Z. Mammeri, 2006). To show the efficiency of our protocol, we present simulations using NS-2","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115117564","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":"CoSE: A SRLG-Disjoint Routing Algorithm","authors":"M. Rostami, S. Khorsandi, A. A. Khodaparast","doi":"10.1109/ECUMN.2007.15","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.15","url":null,"abstract":"A SRLG is a group of network links that share a common physical resource whose failure will cause the failure of all links of the group. To protect a logical connection in a network from a single SRLG failure, two different paths are usually assigned to the connection. The two paths must be disjoint to avoid synchronous failure. In this paper, we extend a high-performance link-disjoint routing algorithm called CoLE to SRLG-disjoint routing. The analysis and the simulation results demonstrate improvement over the previous algorithms","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"200 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115660301","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":"A PKI Approach Targeting the Provision of a Minimum Security Level within Internet","authors":"M. Laurent-Maknavicius","doi":"10.1109/ECUMN.2007.3","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.3","url":null,"abstract":"After decades of expansion, Internet became an essential tool useful for professionals and private individuals providing a large range of services like entailing, management of bank accounts, reservation of hotels, train time schedules, real time traffic information, Internet search... If not targeted at the beginning, information system security became rapidly a key challenge for professionals and strong security solutions emerged on the market mainly for professionals. Internet security is thus today two-speed: pretty strong security for professionals or private individuals anxious to protect their computer equipments and no security for professionals or private individuals who can not afford security products and do no have sufficient technical expertise to set up cheap solutions by themselves. In this context, this paper targets the provision of a minimum security level within internet by defining a PKI solution based on LDAP and DNS (extended with DNSSEC). The originality of the paper is related to the design of the chain of trust that is built over both LDAP and DNSSEC PKIs, the certificate verification method, and indications to extend those concepts to the secure emailing application","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124129231","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":"Enabling Adaptive Service Access Management for Next Generation Mult-Service Networks","authors":"M. Calisti, D. Greenwood","doi":"10.1109/ECUMN.2007.17","DOIUrl":"https://doi.org/10.1109/ECUMN.2007.17","url":null,"abstract":"This paper describes the living systems adaptive service management, LS/ASM, Suite, an innovative and comprehensive middleware solution that assists operators with effectively delivering next-generation converged services by dynamically combining end-users and service-centric requirements with network-facing management and control functionality. The main goal is to discuss how a comprehensive policy-driven and autonomic solution such as the LS/ASM Suite, spanning basic infrastructures and end-user devices and building adaptive control functionality directly into the corresponding elements, enables the shift of focus from technology to value-added services","PeriodicalId":202819,"journal":{"name":"Fourth European Conference on Universal Multiservice Networks (ECUMN'07)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-02-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127159306","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}