DOI: 10.3897/jucs.171777

Authors: Sangeetha E, Deny J

Abstract: The development of sixth-generation (6G) mobile communications aims to deliver super-fast connections at terahertz frequencies, surpassing those of 5G. Nonetheless, these improvements come with challenges of data leakage and packet misinsertion, and they place greater pressure on secure and efficient routing. An Energy Optimized Network Route Cluster Bandwidth (EONRCB) is an Enhanced Service Data Transmission (ESDT) model proposed in this paper to circumvent these problems. The model contains several significant factors, such as Transmission Node Support Weight (TNSW), which evaluates network traffic and petite access control, which provides packet fragmentation and a secure route. Then, the Service Level Route Count Rollback Node Aggregator (SLR-CRNA), which validates active route node interaction. Further, the Sleeper Node Controller improves the consistency of node operations, whereas Slicing Neighbour Node Path Routing (SN2PR) introduces consistency in the source-to-destination connectivity within edge networks. Additional optimisation can be achieved through functionality such as Priority Cycle Tags (PCT) and Recursive Scheduling Time (RST), which provide mechanisms to improve overall RTPS throughput and node scheduling by minimising latency via a depth-first task alignment scheme. The suggested architecture achieves higher energy efficiency, reduced congestion, and a longer network lifespan. The performance of the proposed 6G framework will be validated against existing models to assess its effectiveness.

HTML

PDF

DOI: 10.3897/jucs.108446

Authors: Shanshan Jia, Gaukhar A. Kamalova, Dmytro Mykhalevskiy

Abstract: The importance of the topic under investigation stems from the burgeoning prominence of the Internet of Things (IoT) paradigm and the consequent imperative to devise and institute an efficacious methodology for neighbour detection that facilitates supplementary connections to mobile nodes. This research primarily aims to elucidate a mobile handover technique aligning with the neighbour discovery paradigm inherent in 6LoWPAN. The methodological framework employed herein amalgamates a systematic analysis of the foundational tenets governing 6LoWPAN communication standards over the IPv6 protocol in the context of IEEE 802.15.4aa personal wireless networks, supplemented with empirical evaluation of message propagation dynamics among discrete nodes of a designated personal wireless network. The findings of this investigation underscore the pre-eminence of the 6LoWPAN networking standard as a prime vehicle for bolstering the dependable communication of IoT's remote entities, contingent upon the utilization of the IPv6 communication protocol. This iteration of the Internet protocol is superior, particularly in surveillance contexts, given its expansive address capacity (128 bits) juxtaposed against its antecedent, the IPv4 protocol (32 bits). The inherent adaptability of this network connection augments the quality of mobile handover, especially when one considers the real-world application of 6LoWPAN's neighbour discovery auxiliary communication standard. The tangible implications of these findings beckon their potential utility in satiating the demands of IoT system users and actualizing the network collaboration ethos intrinsic to the 6LoWPAN communication standard.

HTML

PDF

DOI: 10.3897/jucs.80625

Authors: Derya Yiltas-Kaplan

Abstract: Software-defined networking (SDN) has emerged as a solution to the cumbersome structures of classical computer networks. It separates control and data planes to give independence to devices with respect to either traffic routing or network management. The two isolated planes communicate with each other via the help of software modules, which are located in an SDN controller, such as Floodlight, NOX, or Ryu. In this study, Floodlight is used and an SDN topology with 20 switches is constructed with Python code in Mininet. All algorithms have been coded with Java. The default routing algorithm in Floodlight is Dijkstra’s algorithm. Four different network optimization algorithms, namely Bellman-Ford, Ford-Fulkerson, Auction, and Dual Ascent algorithms, are utilized in ordinary network routing instead of Dijkstra’s algorithm. None of these four algorithms were used in SDN before and network implementations using Ford-Fulkerson, Auction, or Dual Ascent algorithms were scarce in the literature. The results are analyzed with multiple types of normalization on a new user interface communicating with Floodlight part via HTTP requests. There has not been a user interface that performs the same operations in Floodlight. In the future, this study may possibly be improved with considering normalization processes based on various proportions among the metric values and accounting the computational time of the algorithms.

HTML

XML

PDF

DOI: 10.3897/jucs.2020.079

Authors: Ján Molnár, Simona Kirešová, Tibor Vince, Dobroslav Kováč, Patrik Jacko, Matej Bereš, Peter Hrabovský

Abstract: IoT technology is gaining more and more popularity in practice, as it collects, processes, evaluates and stores important measured data. The IoT is used every day in the work, in the home or smart houses or in public areas. It realizes the connectivity between real world and digital world which means, that it converts physical quantities of the real world in the form of analog signals into digital numbers stored in clauds. It is essential that students gain practical experience in the design and implementation of the IoT systems during their studies. The article first describes IoT issues and communication protocols used in IoT generally are closer described. Then the design and implementation of an educational model of IoT system - Weather station with the ThingSpeak cloud support is described. The created IoT model interconnects microcontroller programming, sensors and measuring, cloud API interfaces, MATLAB scripts which are useful to analyses the stored data, Windows and Android application developing.

HTML

XML

PDF

DOI: 10.3897/jucs.2020.074

Authors: Tibor Vince, Matej Bereš, Irena Kováčová, Ján Molnár, Branislav Fecko, Jozef Dziak, Iveta Tomčiková, Milan Guzan

Abstract: The paper presents analyses of the implementation of IoT in the patent technology of the remote measuring laboratory (VMLab). The technology allows to create a new electrical connection between different devices, where the connection diagram was not defined before. This may be done remotely around the world. To begin with, an application of this technology as a remote measuring laboratory is presented and described. Analyses of the possible application of IoT technology in the Remote Measurement Laboratory (VMLAB) with a final design are also presented. The research focuses on an efficient way to retrieve measured values synchronized over the Internet from multiple measuring devices and controllable devices, without an Ethernet or Wi-Fi interface from the manufacturer. The analyses may also be useful when implementing an additional IoT approach to existing systems.

HTML

XML

PDF

DOI: 10.3897/jucs.2020.072

Authors: Sathishkumar Natesan, Rajakumar Krishnan

Abstract: The Routing Protocol for Low Power and Lossy Networks (RPL) is operated by gadgets comprised of many devices of embedded type with limited energy, memory as well as resources that do their process. The improvements in the life of the network and energy conservation are the key challenging features in Low Power and Lossy Networks (LLN). Obviously, the LLN has a key strategic part in routing. The Internet of Things (IoT) device is expected to make the apt choice. In LLN, the poor routing choice leads to traffic congestion, reduction in power as well as packet loss ratio. The task in the proposal analyzes Delay (D), Load (L) and Battery Discharge Index (BDI) pivoted Energy Efficient Composite Metric Routing (EECMR) protocol for LLN. The performance of the work in the proposal is evaluated by the COOJA simulator. It outperforms with respect to Network Lifetime (NL), Delay as well as Packet Delivery Ratio (PDR) contrasted to the routing metrics like Traffic Load (TL), Link Quality (LQ), Residual Energy (RE), RE-Battery Discharge Index (RE-BDI) and Hop Count (HC).

HTML

XML

PDF

DOI: 10.3217/jucs-025-11-1396

Authors: Steffen Wendzel, Florian Link, Daniela Eller, Wojciech Mazurczyk

Abstract: Network covert channels enable stealthy communications for malware and data exfiltration. For this reason, developing effective countermeasures for these threats is important for the protection of individuals and organizations. However, due to the large number of available covert channel techniques, it is considered impractical to develop countermeasures for all existing covert channels. In recent years, researchers started to develop countermeasures that (instead of only countering one particular hiding technique) can be applied to a whole family of similar hiding techniques. These families are referred to as hiding patterns. Considering above, the main contribution of this paper is to introduce the concept of countermeasure variation. Countermeasure variation is a slight modification of a given countermeasure that was designed to detect covert channels of one specific hiding pattern so that the countermeasure can also detect covert channels that are representing other hiding patterns. We exemplify countermeasure variation using the compressibility score, the ε-similarity and the regularity metric originally presented by Cabuk et al. All three methods are used to detect covert channels that utilize the Inter-packet Times pattern and we show that countermeasure variation allows the application of these countermeasures to detect covert channels of the Size Modulation pattern, too.

HTML

XML

PDF

DOI: 10.3217/jucs-024-09-1282

Authors: Pir Shah, Peer Shah, Sadaf Yasmin, Zahoor Ur-Rehman, Akhlaque Ahmad, Yunyoung Nam, Seungmin Rho

Abstract: Content Centric Networking (CCN) is recently gaining attention for its potential to support emerging applications within Internet of Things (IoT). IoT generates huge volumes of data, with millions of nodes frequently requesting or generating different contents. CCN helps in breaking the coupling between a content and its location by addressing data with name rather than its location. This paper supports a CCN based approach in the IoT environment. To address scalability problems associated with CCN-assisted IoTs, we propose a new crumbling walls log quorum system based name resolution routing technique. The proposed system supports scalability, as the intersection property of a quorum system, inevitably minimizes the read/write operations overhead on distributed name resolution servers. Results show that the proposed technique increases the availability of the system along with low lookup overhead, latency, and load on distributed servers.

HTML

XML

PDF

DOI: 10.3217/jucs-024-09-1258

Authors: Nipon Theera-Umpon, Kun-Hee Han, Woo-Sik Bae, Sanghyuk Lee, Van Pham

Abstract: The evolving Internet of Things (IoT) technology has driven the advancement of communication technology for implantable devices and relevant services. Still, concerns are raised over implantable medical devices (IMDs), because the wireless transmission section between patients and devices is liable to intrusions on privacy attributable to hacking attacks and resultant leakage of patients' personal information. Also, manipulating and altering patients' medical information may lead to serious leakage of personal information and thus adverse medical incidents. To address the foregoing challenges, the present paper proposes a security protocol that copes with a range of vulnerabilities in communication between IMDs and other devices. In addition, the proposed protocol encrypts the communication process and data to eliminate the likelihood of personal information being leaked. The verification highlights the safety and security of the proposed protocol in wireless communication.

HTML

XML

PDF

DOI: 10.3217/jucs-023-05-0454

Authors: Grzegorz Blinowski, Krzysztof Szczypiorski

Abstract: One of the areas in which wireless networks based on visible light communication (VLC) is considered superior to traditional radio-based communication is security. The common slogan summarizing VLC security features is WYSIWYS - "What You See Is What You Send". However, especially in the case of infrastructure downlink communication, security must be accounted for also in case of VLC. In this paper, we analyze the possibilities of implementing a steganographic channel in VLC systems on the physical (PHY) and medium access control (MAC) layers. We introduce new steganographic techniques for VLC: hiding data in dimming patterns and color visibility dimming (CVD) frames, and adapt methods previously proposed for radio networks, such as using unused header bits and pseudo-corrupted frames to hide data. We use the IEEE 802.15.7 standard as a reference model for protocol structure, but the steganographic techniques that we describe can also be used in networks based on different standards.

HTML

XML

PDF

DOI: 10.3217/jucs-023-04-0404

Authors: Kai Simon, Cornelius Moucha, Jörg Keller

Abstract: The increasing number of attacks on internet-based systems calls for security measures on behalf those systems' operators. Beside classical methods and tools for penetration testing, there exist additional approaches using publicly available search engines. We present an alternative approach using contactless vulnerability analysis with both classical and subject-specific search engines. Based on an extension and combination of their functionality, this approach provides a method for obtaining promising results for audits of IT systems, both quantitatively and qualitatively. We evaluate our approach and confirm its suitability for a timely determination of vulnerabilities in large-scale networks. In addition, the approach can also be used to perform vulnerability analyses of network areas or domains in unclear legal situations.

HTML

XML

PDF

DOI: 10.3217/jucs-022-07-0896

Authors: Unai Aguilera, Diego López-De-Ipiña

Abstract: Service discovery is a fundamental aspect of many services oriented applications; however, it cannot be directly applied to mobile ad hoc networks (MANET) due to their dynamic nature. The lack of central manager nodes results in the need of specific discovery solutions for this kind of networks. In this paper, we present a solution for the discovery of services in MANETs that is based on the classification of service's parameters according to a shared domain ontology. Our proposed discovery protocol encompasses two main processes: dissemination and search. The search process defines a pruning mechanism that enables to detect if search messages must be propagated or not, reducing the number of messages communicated through the network. The dissemination and search processes are integrated within the route management mechanism that enables to reduce the number of propagated messages. We have implemented and tested our discovery solution using the ns-2 network simulator. Experiments have been performed using rigorously constructed scenarios for testing the characteristics of the proposed solution. The obtained results show how the inclusion of the ontology not only increments the expressiveness of the search and discovery process, but also enables to reduce the number of propagated messages due to the grouping and pruning processes.

HTML

XML

PDF

DOI: 10.3217/jucs-020-04-0462

Authors: Sana Ajmal, Asim Rasheed, Amir Qayyum, Aamir Hasan

Abstract: Human safety considerations linked with rapidly growing auto mobile market has given special attention to the Intelligent Transportation System (ITS). ITS provides a set of standards for inter vehicular communication with emphasis on safety, traffic efficiency and infotainment related applications. In ITS, the vehicles acting as mobile nodes, form a specialized ad hoc network, known as Vehicular Ad-hoc Network (VANET). Although, VANET and ITS are under intense research since last decade, technology still lacks large scale deployment. Vehicle to Vehicle (V2V) and Vehicle to Infrastructure (V2I) communications are the main research goals of ITS. High relative node velocity and high active node density has presented peculiar challenges to connectivity within VANET. VANET connectivity and routing requirements range from the time critical safety applications, to the time and space hovering, delay tolerant and infotainment applications. This paper reviews connectivity issues in VANET with emphasis on routing, and offers comprehensive literature review on state of the art in VANET routing, with its detailed classifications. It also compares some standard architectures of VANET from MAC, routing and management perspective, i.e., WAVE by IEEE, CALM by ISO, C2CNet by C2C consortium / GeoNet.

HTML

XML

PDF

DOI: 10.3217/jucs-018-12-1643

Authors: Pedro Martinez-Julia, Antonio Skarmeta

Abstract: In this paper we show a network architecture for Next Generation Internet (NGI) that prevents operation traceability and protects the privacy of communication parties while raising their identity to be a central element of the network. As a side effect, our architecture inherently supports authentication and mobility of the entities involved in the communication. Moreover, it is designed to be agnostic to any underlying network infrastructure and can be used to enhance them with reduced penalty, which makes it a perfect component to take its features to existing networks without defining a brand new transport layer. We also show the successful verification of the protocol security and demonstrate its feasibility and scalability showing its behavior when instantiated on top of two different architectures.

HTML

XML

PDF

DOI: 10.3217/jucs-018-09-1112

Authors: Huansheng Ning, Hong Liu, Qing Liu, Genlin Ji

Abstract: The Internet of Things (IoT) is emerging as an attractive paradigm, and several IoT models and related security issues have received widespread attentions. In this paper, we focus on an existing U2IoT architecture (i.e., Unit IoT and Ubiquitous IoT), and propose a directed path based authentication scheme (DPAS) to realize security protection for the U2IoT architecture. Particularly, the directed path descriptor is introduced for the secret key distribution and cross-network authentication, and the proof mapping is applied to establish tri-dimensional equivalence relations among diverse nodes for achieving mutual authentication. Moreover, security analysis shows that DPAS achieves data confidentiality and integrity, authentication, anonymity and forward security, and performance analysis indicates that DPAS with moderate communication overhead and computation load is suitable for the IoT applications.

HTML

XML

PDF

DOI: 10.3217/jucs-018-06-0857

Authors: Jezabel Molina-Gil, Pino Caballero-Gil, Cándido Caballero-Gil

Abstract: A key aspect to ensure that Vehicular Ad-hoc NETworks (VANETS) work properly is the provision of reliable and real time information to users. In order to achieve this goal, on the one hand, nodes must cooperate actively in relaying the messages to reach as many users as possible to warn them about possible hazards. On the other hand, users should be able to rely on the received information, so they should be able to verify that the relayed network data are true. As distributed and decentralized networks, security problems such as prevention of false information injection, and detection of misbehaviour could be solved through cooperation among nodes. In this work we propose a set of countermeasures to prevent selfish behaviour and malicious attacks, making use of node revocation through cooperation enforcement mechanisms and isolation of malicious nodes from the network. The proper performance of the proposed techniques has been evaluated with many simulations, and the results show that the countermeasures described in this work increase not only efficiency but also security of communications.

HTML

XML

PDF

DOI: 10.3217/jucs-017-08-1202

Authors: Hajar Mousannif, Ismail Khalil, Hassan Moatassime

Abstract: Vehicular Networks, including Vehicular Adhoc Networks (VANETs) and Vehicular Sensor Networks (VSNs), stimulate a brand new variety of services, ranging from driver safety services, traffic information and warnings regarding traffic jams and accidents, to providing weather or road condition, parking availability, and advertisement. 3G networks and sophisticated Intelligent Transportation Systems (ITS), including deploying costly roadside base stations, can indeed be used to offer such services, but these come with a cost, both at network and hardware levels. In this paper we introduce Cooperation as a service (CaaS): A novel architecture that will allow providing a set of services for free and without any additional infrastructure, by taking advantage of Vehicle-to-Vehicle communications. CaaS uses a hybrid publish/subscribe mechanism where the driver (or subscriber) expresses his interests regarding a service (or a set of services) and where cars having subscribed to the same service will cooperate to provide the subscriber with the necessary information regarding the service he subscribed to, by publishing this information in the network. CaaS structures the network into clusters, and uses Content Based Routing (CBR) for intra-cluster communications and geographic routing for inter-cluster communications.

HTML

XML

PDF

DOI: 10.3217/jucs-016-21-3299

Authors: Khaled Salah, Mohamed Hamawi

Abstract: These days, commodity-off-the-shelf (COTS) hardware and software are used to build high-end and powerful workstations and servers to be deployed in today's local area networks of private homes and small- to medium-sized business. Typically, these servers are multipurpose and shared - running networking functionalities involving IP packet forwarding in addition to other CPU intensive applications. In this paper we study and investigate the impact of running CPU-bound applications on the performance of IP packet forwarding. We measure and compare the impact and performance for the two operating systems of choice for home and small-business users, namely Linux and Windows XP. The performance is studied in terms of key performance metrics which include throughput, packet loss, round-trip delay, and CPU availability. For our measurements, we consider today's typical home network hosts of modern processors and Gigabit network cards. We also consider different configuration setups and utilize open-source tools to generate relatively high traffic rates. Our empirical results show that Linux exhibits superior performance over Windows XP in terms of IP forwarding performance. Results also show that, unlike Windows XP, the IP forwarding performance of Linux is not significantly impacted by running CPU-bound applications.

HTML

XML

PDF

DOI: 10.3217/jucs-016-10-1343

Authors: Lei Shu, Manfred Hauswirth, Yan Zhang, Jianhua Ma, Geyong Min, Yu Wang

Abstract: The use of multimedia sensor nodes can significantly enhance the capability of wireless sensor networks (WSNs) for event description. In a number of scenarios, e.g., an erupting volcano, the WSNs are not deployed to work for an extremely long time. Instead, the WSNs aim to deliver continuous and reliable multimedia data as much as possible within an expected lifetime. In this paper, we focus on the efficient gathering of multimedia data in WSNs within an expected lifetime. An adaptive scheme to dynamically adjust the transmission Radius and data generation Rate Adjustment (RRA) is proposed based on a cross layer design by considering the interaction among physical, network and transport layers. We first minimize the end-to-end transmission delay in WSNs while using the minimum data generation rate. In this phase, an optimal transmission radius can be derived. Then, using this transmission radius, we adaptively adjust the data generation rate to increase the amount of gathered data. Simulation results show that the proposed RRA strategy can effectively enhance the data gathering performance in wireless multimedia sensor networks (WMSNs) by dynamically adjusting the transmission radius of sensor nodes and the data generation rate of source nodes.

HTML

XML

PDF

DOI: 10.3217/jucs-016-09-1215

Authors: Sajjad Madani, Daniel Weber, Stefan Mahlknecht

Abstract: We present a table-less position based routing scheme for low power data centric wireless sensor networks. Our proposed scheme is localized, uses greedy forwarding approach, and does not rely on neighborhood information. These characteristics reduce the communication overhead (no neighborhood information exchange), make the protocol highly scalable (no routing tables are maintained and beacons are not exchanged when a node leaves or enters a network), and performs better in mobile environments (as the next hop is non-deterministic and is computed at run time). It also deals with dead end problem by a recovery strategy in a distributed and localized way. The proposed protocol is implemented in the OMNET++ based discrete event simulation environment PAWiS. The results show that the proposed protocol provides guaranteed delivery, extended network lifetime, and a mechanism to route on the basis of end-to-end delay and/or energy consumption.

HTML

XML

PDF

DOI: 10.3217/jucs-015-13-2506

Authors: Chenn-Jung Huang, I-Fan Chen, Kai-Wen Hu, Hung-Yen Shen, You-Jia Chen, Dian-Xiu Yang

Abstract: With the growth up of internet in mobile commerce, researchers have reproduced various mobile applications that vary from entertainment and commercial services to diagnostic and safety tools. Resource management for real-time traffic has widely been recognized as one of the most challenging problems for seamless access to vehicular networks. In this paper, a novel load balancing and congestion-avoidance routing mechanism over short communication range is proposed to satisfy the stringent QoS requirement of real-time traffic in vehicular ad hoc networks. Fuzzy logic systems are used to select the intermediate nodes on the routing path via inter-vehicle communications, and H-infinity technique is used to adjust the membership functions employed in the fuzzy logic systems to adapt to the volatile characteristics of the vehicular networks. Notably, a prediction of the remaining connection time among each vehicle and its neighbors is derived to assisting in the determination of the intermediate nodes on the routing path. The experimental results verify the effectiveness and feasibility of the proposed schemes, in terms of several performance metrics such as packet delivery ratio, end-to-end delay, control overhead, throughputs, call blocking probability and call dropping probability.

HTML

XML

PDF

DOI: 10.3217/jucs-015-05-1090

Authors: Yao Ho, Ai Ho, Kien Hua, Fei Xie

Abstract: Operations of mobile ad hoc networks rely on the collaboration of participating nodes to route data for each other. This standard approach using a fixed set of nodes for each communication link cannot cope with high mobility due to a high frequency of link breaks. A recent approach based on virtual routers has been proposed to address this problem. In this new environment, virtual routers are used for forwarding data. The functionality of each virtual router is provided by the mobile devices currently within its spatial proximity. Since these routers do not move, the communication links are much more robust compared to those of the conventional techniques. In this paper, we investigate techniques to enforce collaboration among mobile devices by identify and punish misbehaving users in supporting the virtual router functionality. Simulation results based on various system configurations are given. They indicate that the proposed technique is effective.

HTML

XML

PDF

DOI: 10.3217/jucs-015-03-0555

Authors: Antonio Ruiz-Martínez, C. Marín-López, Laura Baño-López, Antonio Skarmeta

Abstract: The participation of an e-notary, acting as an on-line Trusted Third Party is required in some scenarios, such as Business to Business, Intellectual Property Rights contracting, or even as a legal requirement, in contract signing is frequently necessary. This e-notary gives validity to the contract or performs some tasks related to the contract, e.g. contract registration. In the abovementioned contracting scenarios, two important additional features are needed: the negotiation of the e-contract and confidentiality. However, until now, e-contract signing protocols have not considered these issues as an essential part of the protocol. In this paper, we present a new protocol which is designed to make negotiation and contract signing processes secure and confidential. Moreover, compared to other previous proposals based on an on-line Trusted Third Party, this protocol reduces the e-notary’s workload. Finally, we describe how the protocol is being used to achieve agreements on the rights of copyrighted works.

HTML

XML

PDF

DOI: 10.3217/jucs-014-07-1105

Authors: SungSoo Lee, HangKon Kim, ChongGun Kim

Abstract: A central characteristic of ad hoc mobile networks is the frequent changes of their topology. This is the source of many problems that need to be solved. AODV is an on-demand routing protocol for decreasing maintenance overhead in ad hoc networks. However, some path breaks can cause significant overhead and transmission delays. If the maintenance overhead of the ro uting table can be reduced, table -driven routing methods could be an efficient substitution. In this paper , we propose a knowledge discovery agent for an effective routing method that uses simple bit -map topology information. The agent node gathers topology knowledge and creates topology bit -map information. All available paths from a source to a destination can easily be calculate d using the bit-map. All the nodes in the network maintain the bit-map distributed from the agent, and use it for the source of routing. The performance and the correctness of the proposed agent method is verified by computer simulations.

HTML

XML

PDF

DOI: 10.3217/jucs-014-03-0441

Authors: Guomin Yang, Duncan Wong, Xiaotie Deng

Abstract: In a secure roaming scenario, a user U travels to a foreign network and communicates with a foreign server V securely so that no one other than U and V can obtain the messages exchanged between them. U may also want to travel anonymously so that no one including V can find out its identity or trace its whereabouts except its home server H. There have been many key establishment protocols proposed for secure roaming. A typical application of these protocols is the mobile roaming service which may be deployed to interconnected WLAN and 3G networks. Despite the importance of these protocols, most of the protocols are analyzed heuristically. They are lack of formal security treatment. In this paper, we propose a formal key exchange definition and formalize secure roaming under the Canetti-Krawczyk (CK) model. We also propose a formal model for capturing the notions of user anonymity and untraceability. By using the modular approach supported by the CK-model, we construct an efficient key exchange protocol for roaming and then extend it to support user anonymity and untraceability. The protocols are efficient and each of them requires only four message flows among the three parties U, H and V. For building our protocols, we construct a one-pass counter based MT-authenticator and show its security under the assumption of a conventional MAC secure against chosen message attack.

HTML

XML

PDF

DOI: 10.3217/jucs-014-03-0318

Authors: Yeveniy Dodis, Pil Lee, Dae Yum

Abstract: This paper addresses the security of optimistic fair exchange in a multi-user setting. While the security of public key encryption and public key signature schemes in a single-user setting guarantees the security in a multi-user setting, we show that the situation is different in the optimistic fair exchange. First, we show how to break, in the multi-user setting, an optimistic fair exchange scheme provably secure in the single-user setting. This example separates the security of optimistic fair exchange between the single-user setting and the multi-user setting. We then define the formal security model of optimistic fair exchange in the multi-user setting, which is the first complete security model of optimistic fair exchange in the multi-user setting. We prove the existence of a generic construction meeting our multi-user security based on oneway functions in the random oracle model and trapdoor one-way permutations in the standard model. Finally, we revisit two well-known methodologies of optimistic fair exchange, which are based on the verifiably encrypted signature and the sequential two-party multisignature, respectively. Our result shows that these paradigms remain valid in the multi-user setting.

HTML

XML

PDF

DOI: 10.3217/jucs-013-13-2076

Authors: Hossein Hojjat, Hootan Nakhost, Marjan Sirjani

Abstract: In the IEEE 802.1D standard for the Media Access Control layer (MAC layer) bridges, there is an STP (Spanning Tree Protocol) definition, based on the algorithm that was proposed by Radia Perlman. In this paper, we give a formal proof for correctness of the STP algorithm by showing that finally a single node is selected as the root of the tree and the loops are eliminated correctly. We use formal inductive reasoning to establish these requirements. In order to ensure that the bridges behave correctly regardless of the topology of the surrounding bridges and LANs, the Rebeca modular verification techniques are applied. These techniques are shown to be efficiently applicable in model checking of open systems.

HTML

XML

PDF

DOI: 10.3217/jucs-013-04-0479

Authors: Zoran Đurić, Ognjen Marić, Dragan Gašević

Abstract: Payment systems need to address a number of security issues in order to be an effective and secure means of transferring payments across the Internet. To be accessible to a wider audience, they also need to be easy to use for their end-users (customers and merchants). Trying to address these issues, we created the Internet Payment System (IPS). IPS tries to combine the advantages of several existing payment systems. While strong emphasis is made on the mobility and ease of use for its customers, IPS still retains strong security properties. It achieves privacy, integrity, authentication and non-repudiation by using different cryptographic algorithms and techniques. To demonstrate that the protocol satisfies the desired security properties, we use a recently proposed tool for formal verification, called AVISPA.

HTML

XML

PDF

DOI: 10.3217/jucs-013-01-0110

Authors: Nisar Hundewale, Sunsook Jung, Alex Zelikovsky

Abstract: Enhancing route request broadcasting protocols constitutes a substantial part of recent research in mobile ad-hoc network (MANET) routing. We suggest a novel approach to modify route request broadcast based on node caching. The intuition behind node caching is that the nodes involved in recent data packet forwarding have more reliable information about its neighbors and have better locations (e.g., on the intersection of several data routes) than other nodes. We cache nodes which are recently involved in data packet forwarding, and use only them to forward route requests. Stopping forwarding route requests from the other nodes considerably reduces routing overhead at the expense of possible destination missing. The suggested node caching techniques can be also viewed as a dynamic implementation of a connected dominating set (CDS). We overcome the known drawback of CDS - overuse of dominating (cached) nodes - by a new load-balancing scheme.

HTML

XML

PDF

DOI: 10.3217/jucs-013-01-0087

Authors: Min Qin, Roger Zimmermann

Abstract: Clustering provides an effective mechanism for energy-efficient data delivery in wireless sensor networks. To reduce communication cost, most clustering algorithms rely on a sensor's local properties in electing cluster heads. They often result in unsatisfactory cluster formations, which may cause the network to suffer from load imbalance or extra energy consumption. In this paper, we propose a novel Voting-based Clustering Algorithm (VCA) for energy-efficient data dissemination in wireless sensor networks. This new approach lets sensors vote for their neighbors to elect suitable cluster heads. VCA is completely distributed, location-unaware and independent of network size and topology. It combines load balancing, energy and topology information together by using very simple voting mechanisms. Simulation results show that VCA can reduce the number of clusters by 5-25% and prolong the lifetime of a sensor network by 10-30% over that of existing energy-efficient clustering protocols.

HTML

XML

PDF

DOI: 10.3217/jucs-013-01-0056

Authors: Dang-Quan Nguyen, Pascale Minet

Abstract: Ad hoc wireless networks have enormous commercial and military potential becauseof their self-organizing capacity and mobility support. However, some specificities of these networks such as radio interferences and limited resources make more complex the quality of service(QoS) support. Indeed, on the one hand, the bandwidth offered to users is strongly affected by radio interferences. On the other hand, flooding information in such a network must be optimizedin order to save resources. Therefore, we propose in this paper, a solution taking into account radio interferences in mobile ad hoc network routing and optimizing flooding. This solution isbased on a modified version of the OLSR routing protocol that considers bandwidth requests and radio interferences in the route selection process while providing a very efficient flooding.A comparative performance evaluation based on NS simulations shows that despite the overhead due to QoS management, this solution outperforms classical OLSR in terms of QoS perceivedby the users (e.g. bandwidth amount granted to a flow and delivery rate). The efficiency of the optimized flooding is equal to that provided by the native version of OLSR.

HTML

XML

PDF

DOI: 10.3217/jucs-013-01-0004

Authors: Saadi Boudjit, Cédric Adjih, Paul Mühlethaler, Anis Laouiti

Abstract: Mobile Ad hoc NETworks (MANETs) are infrastructure-free, highly dynamic wireless networks, where central administration or configuration by the user is very difficult. In hardwired networks nodes usually rely on a centralized server and use a dynamic host configuration protocol, like DHCP [Droms et al. 2003], to acquire an IP address. Such a solution cannot be deployed in MANETs due to the unavailability of any centralized DHCP server. For small scale MANETs, it may be possible to allocate free IP addresses manually. However, the procedure becomes impractical for a large-scale or open system where mobile nodes are free to join and leave.

HTML

XML

PDF

DOI: 10.3217/jucs-012-09-1373

Authors: Péter Takács

Abstract: The purpose of the present paper is to give an expansion of the results of Michiharu Kudo and Anish Mathuria. We present the base-protocol and formulate three properties of the protocol with modal logic tools. After that we expand the baseprotocol and prove four new properties. We prove that the third trusted partner can not read the message of the sender until a predetermined time.

HTML

XML

PDF

DOI: 10.3217/jucs-012-09-1128

Authors: Balázs Benyó, Miklós Hatwágner, Tamás Heckenast, Katalin Kovács, Ágnes Varga, Norbert Varjasi

Abstract: ENUM is a technology based on a procedure that assigns a sequence of traditional telephone numbers to Internet domain names. It specifies a rule that makes it possible to relate a domain to a telephone number without any risk of ambiguity. This domain can then be used to identify various communication services like fax, mobile phone numbers, voice-mail systems, e-mail addresses, IP telephone addresses, web pages, GPS coordinates, call diverts or unified messaging. In our paper we deal with three main problem areas in connection with the business model of the ENUM service and with the introduction of new services, i.e. the questions of tariffs, legal regulations and financial return. For the ENUM procedure to spread out in use specific services have to be implemented that can exploit the advantages of the ENUM and efficient methods have to be elaborated to base existing services on ENUM. We will outline the two new services invented by our group and that we have implemented in our project.

HTML

XML

PDF

DOI: 10.3217/jucs-012-03-0340

Authors: Celeste Campo, Florina Almenares, Daniel Díaz, Carlos García-Rubio, Andrés López

Abstract: In ad-hoc networks, mobile devices communicate via wireless links without the aid of any fixed networking infrastructure. These devices must be able to discover services dynamically and share them safely, taking into account ad-hoc net-works requirements such as limited processing and communication power, decentralised management, and dynamic network topology, among others. Legacy solutions fail in addressing these requirements. In this paper, we propose a service discovery protocol with security features, the Secure Pervasive Discovery Protocol. SPDP is a fully distributed protocol in which services offered by devices can be discovered by others, without a central server. It is based on an anarchy trust model, which provides location of trusted services, as well as protection of confidential information, secure communications, or access control.

HTML

XML

PDF

DOI: 10.3217/jucs-011-06-0874

Authors: N. Elramly, A. Habib, O. Essa, H. Harb

Abstract: Recently, some problems related to the use of the Real-time Control Protocol (RTCP) in very large dynamic group have arisen. Some of these problems are: feedback delay, increasing storage state at every member, and ineffective RTCP bandwidth usage, especially for the receivers that obtain incoming RTCP reports through low bandwidth links. More schemes are proposed to alleviate the RTCP problems. The famous and recent one, which was introduced by EL-Marakby and was named Scalable RTCP (S-RTCP), still has several drawbacks. This paper will evaluate the previous model by introducing all its drawbacks. Consequently, we will demonstrate a design of More Scalable RTCP (MS-RTCP) scheme based on hierarchical structure, distributed management, and EL-Marakby scheme. Also, we will show how our scheme will alleviate all the drawbacks found in the S-RTCP. Finally, we will introduce our scheme implementation to analyze and evaluate its performance.

HTML

XML

PDF

DOI: 10.3217/jucs-011-01-0175

Authors: Aleksandra Nenadic, Ning Zhang, Barry Cheetham, Carole Goble

Abstract: Delivering electronic goods over the Internet is one of the e-commerce applications that will proliferate in the coming years. Certified e-goods delivery is a process where valuable e-goods are exchanged for an acknowledgement of their reception. This paper proposes an efficient security protocol for certified e-goods delivery with the following features: (1) it ensures strong fairness for the exchange of e-goods and proof of reception, (2) it ensures non-repudiation of origin and non-repudiation of receipt for the delivered e-goods, (3) it all ows the receiver of e-goods to verify, during the exchange process, that the e-goods to be received are the one he is signing the receipt for, (4) it uses an off-line and transparent semi-trusted third party (STTP) only in cases when disput es arise, (5) it provides the confidentiality protection for the exchanged items from the STTP, and (6) achieves these features with less computational and communicational overheads than related protocols.

HTML

XML

PDF

DOI: 10.3217/jucs-010-10-1469

Authors: Petr Matoušek

Abstract: Protocol analysis involves several parameters in model specification, for instance, transmission delay or the length of the transmitting window. Verification of the model with parameters is a semi-decision process that depends on the number of clocks, parameters and counters in the model. Using combination of different verification tools for timed models as HyTech, TReX and UPPaal we are able to find relation between parameters satisfying desired property. The paper gives a report on the synthesis of parameters of PGM protocol. We built a formal model based on extended time automata with parameters and verified the reliability property. Our results automatically obtained from the model are consistent with previous results derived manually. The paper describes our experience with parametric verification of multicast protocol PGM. Results mentioned in the work were made with collaboration with Mihaela Sighireanu (Mihaela.Sighireanu@liafa.jussieu.fr) from LIAFA, Paris.

HTML

XML

PDF

DOI: 10.3217/jucs-010-09-1156

Authors: Stéphane Lafrance

Abstract: The specification and validation of security protocols often requires viewing function calls - like encryption/decryption and the generation of fake messages - explicitly as actions within the process semantics. Following this approach, this paper introduces a symbolic framework based on value-passing processes able to handle symbolic values like fresh nonces, fresh keys, fake addresses and fake messages. The main idea in our approach is to assign to each value-passing process a formula describing the symbolic values conveyed by its semantics. In such symbolic processes, called constrained processes, the formulas are drawn from a logic based on a message algebra equipped with encryption, signature and hashing primitives. The symbolic operational semantics of a constrained process is then established through semantic rules updating formulas by adding restrictions over the symbolic values, as required for the process to evolve. We then prove that the logic required from the semantic rules is decidable. We also define a bisimulation equivalence between constrained processes, this amounts to a generalisation of the standard bisimulation equivalence between (non-symbolic) value-passing processes. Finally, we provide a complete symbolic bisimulation method for constructing the bisimulation between constrained processes.

HTML

XML

PDF

DOI: 10.3217/jucs-009-11-1350

Authors: Stéphane Lafrance, John Mullins

Abstract: Meadows recently proposed a formal cost-based framework for the analysis of denial of service, showing how to formalize some existing principles used to make cryptographic protocols more resistant to denial of service by comparing the cost to the defender against the cost to the attacker. The firrst contribution of this paper is to introduce a new security property called impassivity designed to capture the abiity of a protocol to achieve these goals in the framework of a generic value-passing process algebra called Security Process Algebra (SPPA) extended with local function calls, cryptographic primitives and special semantic features in order to handle cryptographic protocols. Impassivity is defined as an information flow property founded on bisimulation-based non-deterministic admissible interference. A sound and complete proof method for impassivity is provided. The method extends previous results of the authors on bisimulation-based non-deterministic admissible interference and its application to the analysis of cryptographic protocols. It is illustrated by its application to the TCP/IP protocol. Key Words: Denial of service, Protocols, Ad

HTML

XML

PDF

DOI: 10.3217/jucs-009-10-1220

Authors: Ousmane Koné

Abstract: Internet services can now be used from mobile terminals. The main standard supporting this technology, WAP, will enable new services since it is compatible with network technologies like IP and UMTS. In parallel, powerful methods must be proposed to validate the underlying protocols in order to guaratee reliability and interoperability of new products. Our work, based on formal methods, contributes to WAP testing efforts by proposing an approach to the development of interoperability tests. We illustrate this approach with the design of tests suites for the WSP-protocol operating over a WAP transaction service.

HTML

XML

PDF

DOI: 10.3217/jucs-009-02-0138

Authors: Robi Malik, Reinhard Mühlfeld

Abstract: We discuss our experience obtained during the PROFIsafe verification and test case generation project at Siemens Corporate Technology. In this project, a formal analysis of the PROFIsafe protocol for failsafe communication has been carried out. A formal model based on denite-state machines has been obtained from the UML specification of the protocol. This model has been analysed with formal verification techniques, and several important properties have been proven. Based on the verified model, a set of test cases for the automatic execution of conformance tests has been derived. The paper explains how the UML statecharts defining the PROFIsafe protocol are translated into denite-state machines, and points out important aspects and problems occurring during the modelling and verification of industrial applications.

HTML

XML

PDF

DOI: 10.3217/jucs-003-12-1337

Authors: Giampaolo Bella, Elvinia Riccobene

Abstract: The Gurevich's Abstract State Machine formalism is used to specify the well known Kerberos Authentication System based on the Needham-Schroeder authentication protocol. A complete model of the system is reached through stepwise refinements of ASMs, and is used as a basis both to discover the minimum assumptions to guarantee the correctness of the system and to analyse its security weaknesses. Each refined model comes together with a correctness refinement theorem.

HTML

XML

PDF