Pub Date : 2021-01-01DOI: 10.1504/ijitst.2021.10039177
S. Folorunso, Chinmay Chakraborty, J. B. Awotunde
{"title":"A secured transaction based on blockchain architecture in mobile banking platform","authors":"S. Folorunso, Chinmay Chakraborty, J. B. Awotunde","doi":"10.1504/ijitst.2021.10039177","DOIUrl":"https://doi.org/10.1504/ijitst.2021.10039177","url":null,"abstract":"","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67218334","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}
Pub Date : 2021-01-01DOI: 10.1504/ijitst.2021.10039864
Eugene Rhee
{"title":"Security threats and countermeasures on the internet of things","authors":"Eugene Rhee","doi":"10.1504/ijitst.2021.10039864","DOIUrl":"https://doi.org/10.1504/ijitst.2021.10039864","url":null,"abstract":"","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"25 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67218387","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}
Pub Date : 2021-01-01DOI: 10.1504/ijitst.2021.10040082
M. Mollamotalebi, S. Haghi
{"title":"Providing a model based on Poisson distribution for malware propagation assessment in peer-to-peer networks","authors":"M. Mollamotalebi, S. Haghi","doi":"10.1504/ijitst.2021.10040082","DOIUrl":"https://doi.org/10.1504/ijitst.2021.10040082","url":null,"abstract":"","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"50 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67218446","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}
Pub Date : 2020-12-31DOI: 10.20533/JITST.2046.3723.2020.0082
Arsh Arora, Ragib Hasan, Gary Warner
{"title":"Obsolete Ransomware: A Comprehensive Study of the Continued Threat to Users","authors":"Arsh Arora, Ragib Hasan, Gary Warner","doi":"10.20533/JITST.2046.3723.2020.0082","DOIUrl":"https://doi.org/10.20533/JITST.2046.3723.2020.0082","url":null,"abstract":"","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"58 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72610059","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}
Pub Date : 2020-12-31DOI: 10.20533/JITST.2046.3723.2020.0083
Fabian Schillinger, C. Schindelhauer
Private user storages are used in Online Social Networks (OSN) to securely save private settings and keys on a server. This allows users to access these settings and keys from all their devices. Therefore, private user storages can synchronize these devices. When end-to-end encryption is applied in an OSN to ensure the privacy of users and the communication private user storages can be used to safely store all private and symmetric keys. A user can retrieve the encrypted storage from the server and decrypt it with its password. However, when the password is lost access to the private user storage is lost as well, as the symmetric key cannot be retrieved from the server in contrast to the recovery functions of some OSNs, where a new password can be created. We present a scheme that splits private user storages into different parts and applies two different secret sharing schemes to be able to recover the keys with the help of the other participants of the OSN. The scheme is more robust to missing shares than other secret sharing schemes. Therefore, even when a large fraction of the distributed shares are not accessible because shareholders are inactive or malicious high rates of successful reconstructions can be achieved. Keyword send-to-end encryption, online chat; online social networ, applied secret sharing, private storage, instant messaging service
私有用户存储用于OSN (Online Social Networks)中，用于在服务器上安全地保存私有设置和密钥。这允许用户从他们所有的设备访问这些设置和密钥。因此，私有用户存储可以同步这些设备。当OSN采用端到端加密方式保证用户的隐私时，可以使用通信私钥存储安全地存储所有的私钥和对称密钥。用户可以从服务器检索加密存储并使用其密码对其进行解密。但是，当密码丢失时，由于无法从服务器检索对称密钥，因此也会丢失对私有用户存储的访问权限，而某些osn的恢复功能可以创建新密码。我们提出了一种将私有用户存储分割成不同的部分，并应用两种不同的秘密共享方案，在OSN的其他参与者的帮助下能够恢复密钥的方案。该方案对缺失股份的鲁棒性优于其他秘密共享方案。因此，即使由于股东不活跃或恶意而无法访问大部分已分配股份，也可以实现高成功重建率。关键词发送到端加密，在线聊天;在线社交网络，应用秘密共享，私人存储，即时通讯服务
{"title":"Recovering Private User Storages in Online Social Networks","authors":"Fabian Schillinger, C. Schindelhauer","doi":"10.20533/JITST.2046.3723.2020.0083","DOIUrl":"https://doi.org/10.20533/JITST.2046.3723.2020.0083","url":null,"abstract":"Private user storages are used in Online Social Networks (OSN) to securely save private settings and keys on a server. This allows users to access these settings and keys from all their devices. Therefore, private user storages can synchronize these devices. When end-to-end encryption is applied in an OSN to ensure the privacy of users and the communication private user storages can be used to safely store all private and symmetric keys. A user can retrieve the encrypted storage from the server and decrypt it with its password. However, when the password is lost access to the private user storage is lost as well, as the symmetric key cannot be retrieved from the server in contrast to the recovery functions of some OSNs, where a new password can be created. We present a scheme that splits private user storages into different parts and applies two different secret sharing schemes to be able to recover the keys with the help of the other participants of the OSN. The scheme is more robust to missing shares than other secret sharing schemes. Therefore, even when a large fraction of the distributed shares are not accessible because shareholders are inactive or malicious high rates of successful reconstructions can be achieved. Keyword send-to-end encryption, online chat; online social networ, applied secret sharing, private storage, instant messaging service","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"80 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72850569","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}
Pub Date : 2020-12-31DOI: 10.20533/JITST.2046.3723.2020.0085
Matt Swann, Joseph R. Rose, G. Bendiab, S. Shiaeles, N. Savage
Network traffic generators are invaluable tools that allow for applied experimentation to evaluate the performance of networks, infrastructure, and security controls, by modelling and simulating the communication packets and payloads that would be produced by machines and devices on the network. Specifically for security applications, these tools can be used to consistently simulate malicious activity on the network and test the components designed to detect and mitigate malicious activities, in a highly reliable and customisable way. However, despite the promising features, most of these tools have some problems that can undermine the correctness of experiments. The accuracy of the simulation results depends strongly on the performance and reliability of the used generator. Thus, in this paper, we investigate the performance and accuracy of three of the most reviewed network traffic generators in literature, namely Cisco TRex, Ostinato and Genesids. Mainly, the comparative experiments examine the strengths and limitations of these tools, for malicious trafficwhich can help the research community to choose the most suitable one to assess the performance of their networks and security controls.
{"title":"A Comparative Study of Traffic Generators: Applicability for Malware Detection Testbeds","authors":"Matt Swann, Joseph R. Rose, G. Bendiab, S. Shiaeles, N. Savage","doi":"10.20533/JITST.2046.3723.2020.0085","DOIUrl":"https://doi.org/10.20533/JITST.2046.3723.2020.0085","url":null,"abstract":"Network traffic generators are invaluable tools that allow for applied experimentation to evaluate the performance of networks, infrastructure, and security controls, by modelling and simulating the communication packets and payloads that would be produced by machines and devices on the network. Specifically for security applications, these tools can be used to consistently simulate malicious activity on the network and test the components designed to detect and mitigate malicious activities, in a highly reliable and customisable way. However, despite the promising features, most of these tools have some problems that can undermine the correctness of experiments. The accuracy of the simulation results depends strongly on the performance and reliability of the used generator. Thus, in this paper, we investigate the performance and accuracy of three of the most reviewed network traffic generators in literature, namely Cisco TRex, Ostinato and Genesids. Mainly, the comparative experiments examine the strengths and limitations of these tools, for malicious trafficwhich can help the research community to choose the most suitable one to assess the performance of their networks and security controls.","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82456797","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}
Pub Date : 2020-07-13DOI: 10.20533/JITST.2046.3723.2020.0080
M. Munier, V. Lalanne
Information has become a major asset in companies that have based their business on the production and exploitation of this information, but also in traditional companies that exploit their information with a view to continuously improving their processes. This is the case in collaborative systems where companies are interconnected but also in intelligent systems that have many information exchanges with there environment. It is important that companies keep control of the information they import, process and distribute. In this article, in the context of a risk management approach, we present a new security criterion: controllability.
{"title":"Data Controllability for Risk Management in Smart and Intelligent Systems","authors":"M. Munier, V. Lalanne","doi":"10.20533/JITST.2046.3723.2020.0080","DOIUrl":"https://doi.org/10.20533/JITST.2046.3723.2020.0080","url":null,"abstract":"Information has become a major asset in companies that have based their business on the production and exploitation of this information, but also in traditional companies that exploit their information with a view to continuously improving their processes. This is the case in collaborative systems where companies are interconnected but also in intelligent systems that have many information exchanges with there environment. It is important that companies keep control of the information they import, process and distribute. In this article, in the context of a risk management approach, we present a new security criterion: controllability.","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":"69 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89791607","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}
Pub Date : 2020-04-27DOI: 10.1504/IJITST.2020.10022905
Zahra Mogharrabi-Rad, E. Yaghoubi
Nowadays, three-dimensional network-on-chips (3D-NoCs) have been introduced as the most efficient communication architectures. In these architectures, it is likely to encounter some faults. Therefore, an important goal in designing such architectures is to make them more tolerable against faults. In this paper, an adaptive, distributed and fault-tolerant routing algorithm called ADFT is proposed for 3D mesh-based NoC that is able to tolerate permanent faults and does not require any additional circuit for fault-tolerant. In order to evaluate the performance of the ADFT, we compared it with LOFT in terms of latency and throughput. Simulation results show improvement of the proposed method.
{"title":"ADFT: an adaptive, distributed, fault-tolerant routing algorithm for 3D mesh-based networks-on-chip","authors":"Zahra Mogharrabi-Rad, E. Yaghoubi","doi":"10.1504/IJITST.2020.10022905","DOIUrl":"https://doi.org/10.1504/IJITST.2020.10022905","url":null,"abstract":"Nowadays, three-dimensional network-on-chips (3D-NoCs) have been introduced as the most efficient communication architectures. In these architectures, it is likely to encounter some faults. Therefore, an important goal in designing such architectures is to make them more tolerable against faults. In this paper, an adaptive, distributed and fault-tolerant routing algorithm called ADFT is proposed for 3D mesh-based NoC that is able to tolerate permanent faults and does not require any additional circuit for fault-tolerant. In order to evaluate the performance of the ADFT, we compared it with LOFT in terms of latency and throughput. Simulation results show improvement of the proposed method.","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45998825","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}
Pub Date : 2020-04-27DOI: 10.1504/ijitst.2020.10028984
Baasantsetseg Bold, Young-Hoon Park
In this paper, we propose a tree-based optimal group key management algorithm using a batch rekeying technique, which changes a set of keys at a certain time interval. In batch rekeying, the server collects all the joining and leaving requests during the time interval, and generates rekeying messages. In the proposed algorithm, when a vehicle joins a group, it is located at a certain leaf node of the key-tree according to its leaving time. This reduces the size of the rekeying messages because the vehicles that leave during the same time interval are concentrated on the same parent node. With the proposed scheme, tree-based group key management can be employed to the VANET because it solves the communication overhead problem. Using simulations, we demonstrate that our scheme remarkably reduces the communication cost for updating the group key.
{"title":"Optimising group key management for frequent-membership-change environment in VANET","authors":"Baasantsetseg Bold, Young-Hoon Park","doi":"10.1504/ijitst.2020.10028984","DOIUrl":"https://doi.org/10.1504/ijitst.2020.10028984","url":null,"abstract":"In this paper, we propose a tree-based optimal group key management algorithm using a batch rekeying technique, which changes a set of keys at a certain time interval. In batch rekeying, the server collects all the joining and leaving requests during the time interval, and generates rekeying messages. In the proposed algorithm, when a vehicle joins a group, it is located at a certain leaf node of the key-tree according to its leaving time. This reduces the size of the rekeying messages because the vehicles that leave during the same time interval are concentrated on the same parent node. With the proposed scheme, tree-based group key management can be employed to the VANET because it solves the communication overhead problem. Using simulations, we demonstrate that our scheme remarkably reduces the communication cost for updating the group key.","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45561788","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}
Pub Date : 2020-04-27DOI: 10.1504/ijitst.2020.10028982
M. Poongodi, V. Vijayakumar, N. Chilamkurti
Bitcoin is a highly volatile cryptocurrency with rising popularity. It is a turning point in the way currency is seen. Now the currency, rather than being physical is becoming more and more digital. Due to high variance of solo mining, the number of users joining top most famous bitcoin mining pools is increasing due to the fact that users together under a bitcoin pool will have a higher chance of generating next block in the bitcoins blockchain by reducing the variance and earning the mining reward. In this research paper we are doing a survey on the technology lying underneath bitcoin's network and the various machine learning predictive algorithms. We collected the dataset on bitcoin blockchain from 28 April 2013 to 31 July 2017 which is publicly available on https://coinmarketcap.com and applied the ARIMA model for price prediction of bitcoin.
{"title":"Bitcoin price prediction using ARIMA model","authors":"M. Poongodi, V. Vijayakumar, N. Chilamkurti","doi":"10.1504/ijitst.2020.10028982","DOIUrl":"https://doi.org/10.1504/ijitst.2020.10028982","url":null,"abstract":"Bitcoin is a highly volatile cryptocurrency with rising popularity. It is a turning point in the way currency is seen. Now the currency, rather than being physical is becoming more and more digital. Due to high variance of solo mining, the number of users joining top most famous bitcoin mining pools is increasing due to the fact that users together under a bitcoin pool will have a higher chance of generating next block in the bitcoins blockchain by reducing the variance and earning the mining reward. In this research paper we are doing a survey on the technology lying underneath bitcoin's network and the various machine learning predictive algorithms. We collected the dataset on bitcoin blockchain from 28 April 2013 to 31 July 2017 which is publicly available on https://coinmarketcap.com and applied the ARIMA model for price prediction of bitcoin.","PeriodicalId":38357,"journal":{"name":"International Journal of Internet Technology and Secured Transactions","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2020-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42334906","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：