{"title":"SSSL: Shoulder Surfing Safe Login","authors":"T. Perković, Mario Cagalj, Nikola Rakić","doi":"10.24138/JCOMSS.V6I2.191","DOIUrl":"https://doi.org/10.24138/JCOMSS.V6I2.191","url":null,"abstract":"Classical PIN-entry methods are vulnerable to a broad class of observation attacks (shoulder surfing, key-logging). A number of alternative PIN-entry methods that are based on human cognitive skills have been proposed. These methods can be classified into two classes regarding information available to a passive adversary: (i) the adversary fully observes the entire input and output of a PIN-entry procedure, and (ii) the adversary can only partially observe the input and/or output. In this paper we propose a novel PIN-entry scheme - Shoulder Surfing Safe Login (SSSL). SSSL is a challenge response protocol that allows a user to login securely in the presence of the adversary who can observe (via key-loggers, cameras) user input. This is accomplished by restricting the access to SSSL challenge values. Compared to existing solutions, SSSL is both user-friendly (not mentally demanding) and cost efficient. Our usability study reveals that the average login time with SSSL is around 8 sec in a 5-digit PIN scenario. We also show the importance of considering side-channel timing attacks in the context of authentication schemes based on human cognitive skills.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129667673","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":"On the choice of the lightning channel current decay constant in the Modified Transmission Line Model with Exponential Decay","authors":"V. Javor, P. Rančić","doi":"10.24138/JCOMSS.V5I4.199","DOIUrl":"https://doi.org/10.24138/JCOMSS.V5I4.199","url":null,"abstract":"For different values of the decay constant in the Modified Transmission Line Model with Exponential Decay (MTLE) and for different channel heights the results for lightning electromagnetic field (LEMF) at different distances from the channel-base are presented in this paper, so as for the spatial and temporal current distribution along the channel. The decay constant influence on LEMF above perfectly conducting ground is analyzed using new lightning channel-base current function and MTLE as an engineering model for a lightning return stroke. The proper choice of this constant can be made based on experimental results but also on the analysis of its influence on electric and magnetic field values and their shape characteristics.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121979569","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":"Equation based rate control and multiple connections for adaptive video streaming over cellular networks","authors":"Abdolkarim Mardanian Dehkordi, V. Vakili","doi":"10.7763/IJCTE.2009.V1.86","DOIUrl":"https://doi.org/10.7763/IJCTE.2009.V1.86","url":null,"abstract":"Rate control is an important issue for video streaming in cellular networks. In this paper, we propose an equation based rate control and multiple connections for adaptive video streaming over cellular networks. In our method the sending rate is calculated as a function of round trip time (RTT), loss event rate (p), packet size (s) and new control parameters α and β, that are able to provide flexible and smooth transmission rate and slowly responsible congestion control and also adaptability to unpredictable wireless channel conditions. On the other hand, by using one TFRC connection, the wireless bandwidth is underutilization, so we introduce a method by using more TFRC connections with new equation, it has the potential to achieve optimal performance, maximum throughput, and minimum packet loss rate. We have simulated this method in UMTS and according to results, this method in addition to network stability increases throughput with low fluctuation by varying α and β and opening appropriate number of connections.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132309367","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 efficient IPv4/IPv6 handovers using host-based identifier-locator split","authors":"Samu Varjonen, M. Komu, A. Gurtov","doi":"10.24138/JCOMSS.V6I1.193","DOIUrl":"https://doi.org/10.24138/JCOMSS.V6I1.193","url":null,"abstract":"Internet architecture is facing at least three major challenges. First, it is running out of IPv4 addresses. IPv6 offers a long-term solution to the problem by offering a vast amount of addresses but is neither supported widely by networking software nor has been deployed widely in different networks. Second, end-to-end connectivity is broken by the introduction of NATs, originally invented to circumvent the address depletion. Third, the Internet architecture lacks a mechanism that supports end-host mobility and multihoming in a coherent way between IPv4 and IPv6 networks.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124770491","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}
Mahsa Armaghan, A. Haghighat, Mohammadreza Armaghan
{"title":"An effective candidate list strategy for Tabu Search based QoS multicast routing","authors":"Mahsa Armaghan, A. Haghighat, Mohammadreza Armaghan","doi":"10.1109/ICAICT.2009.5372603","DOIUrl":"https://doi.org/10.1109/ICAICT.2009.5372603","url":null,"abstract":"Multicast routing with quality-of-service constraints is one of the most important problems in computer networks as constrained Steiner tree problem. It is a well-known NP-complete problem, which has various real-time multimedia applications in high-speed networks. In this paper, we propose algorithms to solve the bandwidth-delay-constrained least-cost multicast routing problem based on Tabu Search. The main feature of proposed TS-based algorithms is use of an effective candidate list strategy. By the use of this strategy not only search speed but also solution quality will be improved. We evaluate the performance and efficiency of the proposed algorithms on a variety of random generated networks. Evaluation results indicate that the proposed algorithms overcome the other existing short-term memory version of TS-based algorithms and heuristics.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422014","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":"Topology control using distributed power management algorithm for mobile ad hoc networks","authors":"N. Pradhan, T. Saadawi","doi":"10.24138/JCOMSS.V5I4.198","DOIUrl":"https://doi.org/10.24138/JCOMSS.V5I4.198","url":null,"abstract":"We propose a distributed power management algorithm that decides on an optimum coverage area for individual node to preserve network connectivity, reduce interference thus improve network performance with changing environment and network topology. In order to be strongly connected in the network, a node may increase its power indiscriminately causing interference. Since interference is one of the major problems in wireless network, the proposed algorithm will co-operatively reduce inter-node interference in the network. Uni-directional links are also a major source of interference as most of the routing protocol only utilizes bi-directional links. So, the algorithm will attempt to prevent such links or if required convert them into bi-directional links. We will show that the algorithm provides strongly connected and more reliable network over dynamic physical channel modeled by log-distance path loss model, log-normal shadowing model and rayleigh fading model. We will show that the proposed algorithm stabilizes node connectivity over the dynamic network and environment and even, to a certain extent, prevent node from being completely disconnected from the network. Further, it reduces interference and improves network performance.","PeriodicalId":322889,"journal":{"name":"SoftCOM 2009 - 17th International Conference on Software, Telecommunications & Computer Networks","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081655","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}