I. Woungang, M. Obaidat, S. K. Dhurandher, I. Traoré
{"title":"A timed and secured monitoring implementation against wormhole attacks in AODV-based Mobile Ad Hoc Networks","authors":"I. Woungang, M. Obaidat, S. K. Dhurandher, I. Traoré","doi":"10.1109/CITS.2013.6705712","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705712","url":null,"abstract":"Mobile Ad Hoc Networks (MANETs) offer a dynamic environment where data exchange and routing between nodes occur without the help of any centralized server or human intervention, providing that nodes cooperate with each other. In such environment, the presence of malevolent nodes may result in wormhole attacks. In this paper, a secured AODV-based routing scheme (referred to as Timed and Secured Monitoring Implementation - (TSMI)) is proposed for mitigating such attacks. Simulation results are provided to demonstrate the effectiveness of our approach, using the packet delivery ratio, the number of broken links detected, and the number of packets received by destination, as performance indicators.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126579877","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":"Simple arithmetic lessons through an adaptive snake game","authors":"M. Virvou, Spyros Papadimitriou","doi":"10.1109/CITS.2013.6705723","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705723","url":null,"abstract":"Commercial games and educational games are different due to the fact that, the purpose of the first is fun while the second are primarily educative. Educational games may use motivational features of classic video games in order to help the students improve their learning skills in specific educational subjects. In this paper, we present a browser-based snake game, which is associated with the arithmetic operations context. Furthermore, the game contains adaptive attributes and provides students useful guides to overcome possible weaknesses.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130521847","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":"Using efficiently autoregressive estimation in wireless sensor networks","authors":"K. Miranda, V. Ramos, Tahiry Razafindralambo","doi":"10.1109/CITS.2013.6705727","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705727","url":null,"abstract":"Wireless sensor networks (WSNs) are widely deployed nowadays on a large variety of applications. The major goal of a WSN is to collect information about a set of phenomena. Such process is non trivial since batteries' life is limited and thus wireless transmissions as well as computing operations must be minimized. A common task in WSNs is to estimate the sensed data and to spread the estimated samples over the network. Thus, time series estimation mechanisms are vital on this type of processes so as to reduce data transmission. In this paper, we assume a single-hop clustering mechanism in which sensor nodes are grouped into clusters and communicate with a sink through a single hop. We propose a couple of autoregressive mechanisms to predict local sensed samples in order to reduce wireless data communication. We compare our proposal with a model called EEE that has been previously proposed in the literature. We prove the efficiency of our algorithms with real samples publicly available and show that they outperform the EEE mechanism.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131223727","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":"Multiplexing of GNSS data for differential augmentation via satellite IP broadcast links","authors":"R. Mielniczuk, H. Gebhard, Z. Papir","doi":"10.1109/CITS.2013.6705725","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705725","url":null,"abstract":"In this paper, a multiplexing scheme for broadcasting GNSS data for differential augmentation such as Differential GPS (DGPS) and Real-Time Kinematic (RTK) via IP satellite broadcast links is presented. The developed method allows a significant reduction of packetizing overhead and, by the same, decreases the satellite transmission costs. For each input stream, it is possible to preserve an upper limit for the introduced latency to the data transmission. What is more, if the inter departure time and the size of data chunks follow a periodic pattern, it is possible to reduce the introduced latency without significant overhead worsening.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129253172","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}
Marcelo Luiz Brocardo, I. Traoré, Sherif Saad, I. Woungang
{"title":"Authorship verification for short messages using stylometry","authors":"Marcelo Luiz Brocardo, I. Traoré, Sherif Saad, I. Woungang","doi":"10.1109/CITS.2013.6705711","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705711","url":null,"abstract":"Authorship verification can be checked using stylometric techniques through the analysis of linguistic styles and writing characteristics of the authors. Stylometry is a behavioral feature that a person exhibits during writing and can be extracted and used potentially to check the identity of the author of online documents. Although stylometric techniques can achieve high accuracy rates for long documents, it is still challenging to identify an author for short documents, in particular when dealing with large authors populations. These hurdles must be addressed for stylometry to be usable in checking authorship of online messages such as emails, text messages, or twitter feeds. In this paper, we pose some steps toward achieving that goal by proposing a supervised learning technique combined with n-gram analysis for authorship verification in short texts. Experimental evaluation based on the Enron email dataset involving 87 authors yields very promising results consisting of an Equal Error Rate (EER) of 14.35% for message blocks of 500 characters.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122011217","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":"Secure systolic Montgomery modular multiplier resilient to Hardware Trojan and Fault-Injection attacks","authors":"Qi Yang, Zhongping Qin","doi":"10.1109/CITS.2013.6705717","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705717","url":null,"abstract":"During the Montgomery modular multiplication over prime fields, the linear arithmetic code check part of immediate result of each step can be calculated by those of the input parameters and an immediate state. Based on this theory, a novel secure architecture of secure systolic Montgomery modular multiplier resilient to Hardware Trojan and Fault-Injection attacks is proposed. The proposed architecture has been verified by modeling it using VHDL, implementing and testing it on Xilinx Virtex-4 FPGA. The multi-bit error detection capabilities are more than 96.9% if the errors stay for only one cycle, or nearly 99% if the errors stay for multiple cycles; the hardware overhead is about 20.99% and time overhead is zero.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126373172","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":"Secure and integrated handover authentication scheme with FMIPv6","authors":"Imen Elbouabidi, F. Zarai, M. Obaidat, L. Kamoun","doi":"10.1109/CITS.2013.6705718","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705718","url":null,"abstract":"Nowadays, mobility has become an essential aspect in our daily life. Several mobility management protocols have been designed in order to support real time applications. Fast handover for Mobile IPv6 (FMIPv6) provides quality of service (QoS) guarantees for multimedia service applications. Despite the fact that FMIPv6 performs the best performance, it does not take into account wireless security requirements such as authentication and confidentiality. The requirements for strong security scheme adds additional delay. This result is a fundamental trade-off between security and quality of service. In this paper, we propose an enhanced FMIPv6 to secure handover in wireless heterogeneous networks. The proposed protocol (called SFMIPv6) has been modeled and verified using the software SPAN Security Protocol ANimator for AVISPA (Automated Validation of Internet Security Protocols and Applications) and is found to be safe scheme.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131776462","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":"System level design of scalable encryption algorithm by using CoWare","authors":"Abidin Altintas, Berna Örs","doi":"10.1109/CITS.2013.6705720","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705720","url":null,"abstract":"Embedded designers are forced to find new design solutions for fast growing embedded systems due to technological improvements. Despite Radio Frequency Identification (RFID) technology makes the lives of users easier, it also brings privacy and security problems. Therefore RFID designers use cryptographic algorithms to solve security and privacy problems. The aim of this study is to implement SEA algorithm designed for RFID systems by one of the system-level design languages called SystemC.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131427350","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 UML-based environment for test scenarios in mobile settings","authors":"Pierre André, H. Waeselynck, Nicolas Rivière","doi":"10.1109/CITS.2013.6705716","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705716","url":null,"abstract":"TERMOS is an UML-based formal language for specifying scenarios in mobile computing systems. TERMOS scenarios are used for the verification of test traces: they represent mandatory or forbidden interactions that are searched for in the trace. Building upon previous work on the semantics of TERMOS, this paper presents the complete integration of the language into UML support technology. A TERMOS profile has been developed for the editing of scenarios, as well as an Eclipse plugin for the automated checking of traces. We demonstrate the approach on a case study, a group membership protocol in ad hoc networks.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"225 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124226525","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 single-mode, linearly polarized, erbium-doped fiber laser with a stabilized frequency","authors":"Yuanyue Guo, Dongjin Wang, Falin Liu, N. Kishi","doi":"10.1109/CITS.2013.6705730","DOIUrl":"https://doi.org/10.1109/CITS.2013.6705730","url":null,"abstract":"We report on an experimental study of a stabilized single-mode, linearly polarized, erbium-doped fiber laser with an unique structure of double-cavities. In its linear cavity, the effect of spatial-hole burning (SHB) is eliminated to prevent multi-longitudinal-mode oscillation by using 45° Faraday rotator mirror, meanwhile, in its another polarization maintaining ring cavity, the effect of SHB induced by a stable external light and the lasing light is enhanced efficiently to suppress the mode-hopping by the polarization state control method. Consequently, a single-mode, linearly polarized operation is demonstrated with the lasing frequency shift of less than 20MHz, its linewidth less than 3.5 kHz and the degree of polarization of 99. 9%.","PeriodicalId":268943,"journal":{"name":"2013 International Conference on Computer, Information and Telecommunication Systems (CITS)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127241145","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}