{"title":"Scalability Evaluation of Aspen Tree and Fat Tree Using NS3","authors":"Yeremia Nikanor Nugroho, F. Andika, R. F. Sari","doi":"10.1109/AINS47559.2019.8968700","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968700","url":null,"abstract":"When discussing data center networks (DCN), topology has a significant influence on the availability of data to the host. The performance of DCN is relative to the scale of the network. On a particular network scale, it can even cause a connection to the host to be disconnected due to the overhead of routing information. It takes a long time to get connected again so that the data packet that has been sent is lost. The length of time for updating routing information to all parts of the topology so that it can be reconnected or referred to as the time of convergence is the cause. Scalability of a network is proportional to the time of convergence. This article discusses Aspen Tree and Fat Tree, which is about the modification of multi-root trees that have been modified. In Fat Tree, a final set of hosts from a network can be disconnected from a network topology until there is an update of routing information that is disseminated to each switch on the network, due to a link failure. Aspen Tree is a reference topology because it is considered to reduce convergence time and control the overhead of network failure recovery. The DCN topology performance models are implemented using the open source NS-3 platform to support validation of performance evaluations.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124637511","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":"Blockchain for Identity Management: The Implications to Personal Data Protection","authors":"Wie Liang Sim, Hui Na Chua, Mohammad Tahir","doi":"10.1109/AINS47559.2019.8968708","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968708","url":null,"abstract":"Identity symbolizes a personal level of an individual and becomes an embodiment of who we are, and Identity Management in Information Communication Technologies field represents the basis of authenticating a specific individual. Therefore, it is important to protect and control identity as personal information so that unfortunate misconduct would be avoided. Currently, how individuals are represented in the digital ecosystem appears to be permissive with the management of centralized control on identity. Recently, blockchain technology has been making its mark as a revolutionized approach to exceed expectations with its decentralized approach. Popularized with the cryptocurrency, blockchain technology could also create a disruptive effect in the area of identity management. In the domain of identity management, privacy protection is crucial to the security of personal data. However, there is a lack of systematic study on how the identity management aspect of blockchain technology supports personal data protection based on the requirement of regulations. In this paper, we aim to close this gap through a systematic review to examine how the identity management aspect of blockchain technology supports or contradicts personal data protection based on the requirements of the General Data Protection Regulation (GDPR) requirements.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127868915","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}
Wataru Matsuda, Mariko Fujimoto, T. Aoyama, Takuho Mitsunaga
{"title":"Cyber Security Risk Assessment on Industry 4.0 using ICS testbed with AI and Cloud","authors":"Wataru Matsuda, Mariko Fujimoto, T. Aoyama, Takuho Mitsunaga","doi":"10.1109/AINS47559.2019.8968698","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968698","url":null,"abstract":"Industry 4.0 is a new concept, thus risk assessment is necessary. Several risk assessment methods for Industrial Control System (ICS) and Industry 4.0 have been proposed, however, it is difficult to identify impacts on the physical world caused by cyber attacks against ICS since many of these are based on tabletop analysis or software simulations. Therefore, we focus on the risk assessment using actual machines (ICS testbed) which can help to solve the above problems. In Industry 4.0, autonomous judgment and execution are required for the cyber-physical system, it is based on information exchange using Artificial Intelligence (AI) and cloud technologies. In this research, we evaluate cyber risks through attacks against ICS with AI and cloud using ICS testbed. The proposed method can clarify cyber risks and impacts on the real world, and corresponding countermeasures.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"9 46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122557848","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Bettayeb, O. A. Waraga, M. A. Talib, Q. Nasir, Omar Einea
{"title":"IoT Testbed Security: Smart Socket and Smart Thermostat","authors":"M. Bettayeb, O. A. Waraga, M. A. Talib, Q. Nasir, Omar Einea","doi":"10.1109/AINS47559.2019.8968694","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968694","url":null,"abstract":"Internet of Things (IoT) technology is changing the shape of our lives, however they are raising many security issues. Attackers can exploit the security vulnerabilities of IoT devices for malicious ends. Assessing the security of IoT devices is important before they are distributed to reduce the attack surface. However, the security assessment could be difficult due to the wide variety of IoT devices and their functionalities. Moreover, replicating the testing scenarios and environments can be challenging without a fully documented test scenario. The aim of this research is to design a structure for an IoT security testbed that can analyze the vulnerabilities of IoT devices. The paper provides a road map for an easy-to-setup IoT Security Testbed and a general methodology for constructing the testbed. The structure includes the hardware and software setup as well as a testcase template that standardizes test cases and ensures test replication. Moreover, a simple GUI was developed for managing the test cases, launching them and reporting their results. To showcase the feasibility of the testbed structure proposed, three test cases have been launched on a smart socket and smart thermostat followed by a discussion on assessment results.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123597562","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}
Muhammad Harith Noor Azam, F. Ridzuan, M. Sayuti, Ahmed A. Alsabhany
{"title":"Balancing the Trade-Off Between Capacity and Imperceptibility for Least Significant Bit Audio Steganography Method: A New Parameter","authors":"Muhammad Harith Noor Azam, F. Ridzuan, M. Sayuti, Ahmed A. Alsabhany","doi":"10.1109/AINS47559.2019.8968707","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968707","url":null,"abstract":"Data is vulnerable to unauthorized interception communication hence steganography is used to protect it. However, there is a trade-off between capacity and imperceptibility features in audio steganography. Based on the existing study, number of bit embedded per sample and the ratio of size secret message to the number of cover audio sample affects the quality of stego-file but lack of focus was given on reducing the trade-off problem. An evaluation study on 6 Least Significant Bit (LSB) embedding methods was carried out to capture the performance of the stego-file based on Peak Signal to Noise Ratio (PSNR). The selected cover audio files were 44.1 kHz mono with 16-bit depth. Different size of data was embedded at 30 different initial embedding points. Based on that study, this paper proposes a new parameter to improve the imperceptibility feature while maintaining the capacity feature. A new parameter which is the initial embedding point is proposed to maximize imperceptibility given a capacity value. The experimental result shows that there is an effect by selecting the initial embedding point towards imperceptibility features of each LSB method. However, the significant effect was only recorded by the embedding method at the 4th level and higher levels of LSB. In conclusion, the selection on the initial embedding point could improve the imperceptibility feature while maintaining the capacity feature at the higher levels of LSB embedding. However, the selection on initial embedding point will become completely insignificant if bigger size of data is embedded and become completely insignificant at 0.05 standard deviation, as the embedded data increases.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121488130","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}
S. Berenjian, Saeed Hajizadeh, Reza Ebrahimi Atani
{"title":"An Incentive Security Model to Provide Fairness for Peer-to-Peer Networks","authors":"S. Berenjian, Saeed Hajizadeh, Reza Ebrahimi Atani","doi":"10.1109/AINS47559.2019.8968699","DOIUrl":"https://doi.org/10.1109/AINS47559.2019.8968699","url":null,"abstract":"Peer-to-Peer networks are designed to rely on the resources of their own users. Therefore, resource management plays an important role in P2P protocols. Early P2P networks did not use proper mechanisms to manage fairness. However, after seeing difficulties and rise of freeloaders in networks like Gnutella, the importance of providing fairness for users have become apparent. In this paper, we propose an incentive-based security model which leads to a network infrastructure that lightens the work of Seeders and makes Leechers to contribute more. This method is able to prevent betrayals in Leecher-to-Leecher transactions and helps Seeders to be treated more fairly. This is what other incentive methods such as Bittorrent are incapable of doing. Additionally, by getting help from cryptography and combining it with our method, it is also possible to achieve secure channels, immune to spying, next to a fair network. This is the first protocol designed for P2P networks which has separated Leechers and Seeders without the need to a central server. The simulation results clearly show how our proposed approach can overcome free-riding issue. In addition, our findings revealed that our approach is able to provide an appropriate level of fairness for the users and can decrease the download time.","PeriodicalId":309381,"journal":{"name":"2019 IEEE Conference on Application, Information and Network Security (AINS)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116143186","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}