首页 > 最新文献

Journal of Cyber Security and Mobility最新文献

英文 中文
A Privacy Preserving Framework to Protect Sensitive Data in Online Social Networks 一个保护在线社交网络中敏感数据的隐私保护框架
Q3 Computer Science Pub Date : 2022-11-07 DOI: 10.13052/jcsm2245-1439.1144
Nisha P. Shetty, Balachandra, Niraj Yagnik, Tulika Banerjee, Angad Singh
In this day and age, Internet has become an innate part of our existence. This virtual platform brings people together, facilitating information exchange, sharing photos, posts, etc. As interaction happens without any physical presence in the medium, trust is often compromised in all these platforms operating via the Internet. Although many of these sites provide their ingrained privacy settings, they are limited and do not cater to all users’ needs. The proposed work highlights the privacy risk associated with various personally identifiable information posted in online social networks (OSN). The work is three-facet, i.e. it first identifies the type of private information which is unwittingly revealed in social media tweets. To prevent unauthorized users from accessing private data, an anonymous mechanism is put forth that securely encodes the data. The information loss incurred due to anonymization is analyzed to check how much of privacy-utility trade-off is attained. The private data is then outsourced to a more secure server that only authorized people can access. Finally, to provide effective retrieval at the server-side, the traditional searchable encryption technique is modified, considering the typo errors observed in user searching behaviours. With all its constituents mentioned above, the purported approach aims to give more fine-grained control to the user to decide who can access their data and is the correct progression towards amputating privacy violation.
在这个时代,互联网已经成为我们存在的一部分。这个虚拟平台将人们聚集在一起,促进信息交流,分享照片,帖子等。由于交互是在没有任何实体存在的情况下进行的,因此在通过互联网操作的所有这些平台中,信任经常受到损害。尽管这些网站中的许多都提供了根深蒂固的隐私设置,但它们是有限的,不能满足所有用户的需求。提出的工作强调了与在线社交网络(OSN)中发布的各种个人身份信息相关的隐私风险。这项工作有三个方面,即首先识别在社交媒体推文中无意中泄露的私人信息的类型。为了防止未经授权的用户访问私人数据,提出了一种匿名机制,对数据进行安全编码。分析了由于匿名化而导致的信息丢失,以检查在多大程度上实现了隐私与效用之间的权衡。然后,私人数据被外包到一个更安全的服务器上,只有经过授权的人才能访问。最后,为了在服务器端提供有效的检索,考虑到用户搜索行为中观察到的打字错误,对传统的可搜索加密技术进行了修改。有了上面提到的所有组成部分,这种据称的方法旨在为用户提供更细粒度的控制,以决定谁可以访问他们的数据,这是消除隐私侵犯的正确进展。
{"title":"A Privacy Preserving Framework to Protect Sensitive Data in Online Social Networks","authors":"Nisha P. Shetty, Balachandra, Niraj Yagnik, Tulika Banerjee, Angad Singh","doi":"10.13052/jcsm2245-1439.1144","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1144","url":null,"abstract":"In this day and age, Internet has become an innate part of our existence. This virtual platform brings people together, facilitating information exchange, sharing photos, posts, etc. As interaction happens without any physical presence in the medium, trust is often compromised in all these platforms operating via the Internet. Although many of these sites provide their ingrained privacy settings, they are limited and do not cater to all users’ needs. The proposed work highlights the privacy risk associated with various personally identifiable information posted in online social networks (OSN). The work is three-facet, i.e. it first identifies the type of private information which is unwittingly revealed in social media tweets. To prevent unauthorized users from accessing private data, an anonymous mechanism is put forth that securely encodes the data. The information loss incurred due to anonymization is analyzed to check how much of privacy-utility trade-off is attained. The private data is then outsourced to a more secure server that only authorized people can access. Finally, to provide effective retrieval at the server-side, the traditional searchable encryption technique is modified, considering the typo errors observed in user searching behaviours. With all its constituents mentioned above, the purported approach aims to give more fine-grained control to the user to decide who can access their data and is the correct progression towards amputating privacy violation.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":"32 1","pages":"575-600"},"PeriodicalIF":0.0,"publicationDate":"2022-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87126520","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}
引用次数: 0
Can We Detect Malicious Behaviours in Encrypted DNS Tunnels Using Network Flow Entropy? 我们可以使用网络流熵检测加密DNS隧道中的恶意行为吗?
Q3 Computer Science Pub Date : 2022-08-14 DOI: 10.13052/jcsm2245-1439.1135
Yulduz Khodjaeva, Nur Zincir-Heywood, Ibrahim Zincir
This paper explores the concept of entropy of a flow to augment flow statistical features for encrypted DNS tunnelling detection, specifically DNS over HTTPS traffic. To achieve this, the use of flow exporters, namely Argus, DoHlyzer and Tranalyzer2 are studied. Statistical flow features automatically generated by the aforementioned tools are then augmented with the flow entropy. In this work, flow entropy is calculated using three different techniques: (i) entropy over all packets of a flow, (ii) entropy over the first 96 bytes of a flow, and (iii) entropy over the first n-packets of a flow. These features are provided as input to ML classifiers to detect malicious behaviours over four publicly available datasets. This model is optimized using TPOT-AutoML system, where the Random Forest classifier provided the best performance achieving an average F-measure of 98% over all testing datasets employed.
本文探讨了流量熵的概念,以增强加密DNS隧道检测的流量统计特征,特别是HTTPS流量上的DNS。为了实现这一点,研究了流量导出器的使用,即Argus, DoHlyzer和Tranalyzer2。然后用上述工具自动生成的统计流特征与流熵进行增强。在这项工作中,流熵使用三种不同的技术来计算:(i)流的所有数据包的熵,(ii)流的前96个字节的熵,以及(iii)流的前n个数据包的熵。这些特征作为ML分类器的输入提供,以检测四个公开可用数据集上的恶意行为。该模型使用TPOT-AutoML系统进行了优化,其中随机森林分类器提供了最佳性能,在所有使用的测试数据集上实现了98%的平均f度量。
{"title":"Can We Detect Malicious Behaviours in Encrypted DNS Tunnels Using Network Flow Entropy?","authors":"Yulduz Khodjaeva, Nur Zincir-Heywood, Ibrahim Zincir","doi":"10.13052/jcsm2245-1439.1135","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1135","url":null,"abstract":"This paper explores the concept of entropy of a flow to augment flow statistical features for encrypted DNS tunnelling detection, specifically DNS over HTTPS traffic. To achieve this, the use of flow exporters, namely Argus, DoHlyzer and Tranalyzer2 are studied. Statistical flow features automatically generated by the aforementioned tools are then augmented with the flow entropy. In this work, flow entropy is calculated using three different techniques: (i) entropy over all packets of a flow, (ii) entropy over the first 96 bytes of a flow, and (iii) entropy over the first n-packets of a flow. These features are provided as input to ML classifiers to detect malicious behaviours over four publicly available datasets. This model is optimized using TPOT-AutoML system, where the Random Forest classifier provided the best performance achieving an average F-measure of 98% over all testing datasets employed.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47452889","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}
引用次数: 0
Dynamic List Based Data Integrity Verification in Cloud Environment 云环境下基于动态列表的数据完整性验证
Q3 Computer Science Pub Date : 2022-07-22 DOI: 10.13052/jcsm2245-1439.1134
Akshay Kc, Balachandra Muniyal
Cloud repository gives a proficient way to fathom issues of management and capacity, driven by high-speed information emergence. Consequently, a developing number of governing bodies and people lean towards storing their information within the cloud premises. In any case, due to the partition of information ownership and administration, it becomes exceptionally troublesome for the users or the owners to verify the integrity of data in a routine way. Hence, numerous analysts center on creating various protocols, that remotely check the astuteness of the information saved within the cloud. In this respect, a conceivable solution is proposed for dynamic reviewing by making use of a dynamic list-based index table to verify the integrity of the data which is more efficient than the state of the arts. Besides, with such a verification structure, it is proven that communication cost and storage cost at the client side is diminished effectively. The statistical analysis based on comprehensive tests illustrates that the proposed convention accomplishes the specified properties in comparison with the state of the arts.
云存储库提供了一种精通的方法来理解由高速信息涌现驱动的管理和容量问题。因此,越来越多的管理机构和人员倾向于将他们的信息存储在云环境中。在任何情况下,由于信息所有权和管理的分割,用户或所有者以常规方式验证数据的完整性都变得异常麻烦。因此,许多分析师专注于创建各种协议,远程检查保存在云中的信息的安全性。在这方面,提出了一种可想象的动态审查解决方案,即利用基于列表的动态索引表来验证数据的完整性,这比目前的技术水平更有效。此外,这种验证结构有效地降低了客户端的通信成本和存储成本。基于综合试验的统计分析表明,与现有技术水平相比,拟议的公约达到了规定的性质。
{"title":"Dynamic List Based Data Integrity Verification in Cloud Environment","authors":"Akshay Kc, Balachandra Muniyal","doi":"10.13052/jcsm2245-1439.1134","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1134","url":null,"abstract":"Cloud repository gives a proficient way to fathom issues of management and capacity, driven by high-speed information emergence. Consequently, a developing number of governing bodies and people lean towards storing their information within the cloud premises. In any case, due to the partition of information ownership and administration, it becomes exceptionally troublesome for the users or the owners to verify the integrity of data in a routine way. Hence, numerous analysts center on creating various protocols, that remotely check the astuteness of the information saved within the cloud. In this respect, a conceivable solution is proposed for dynamic reviewing by making use of a dynamic list-based index table to verify the integrity of the data which is more efficient than the state of the arts. Besides, with such a verification structure, it is proven that communication cost and storage cost at the client side is diminished effectively. The statistical analysis based on comprehensive tests illustrates that the proposed convention accomplishes the specified properties in comparison with the state of the arts.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42158815","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}
引用次数: 0
A Systematic Literature Review of Routine Activity Theory’s Applicability in Cybercrimes 常规活动理论在网络犯罪中的应用研究综述
Q3 Computer Science Pub Date : 2022-06-17 DOI: 10.13052/jcsm2245-1439.1133
R. Ahmad, R. Thurasamy
Cybercrimes are increasing at an alarming rate and cause detrimental effects to the victims. Routine Activity Theory (RAT) is commonly used to understand the factors influencing cybercrime victimization. However, there have been inconsistent findings on the applicability of RAT theory. This study performs a Systematic Literature Review analysis to consolidate and provide a coherent analysis of the related studies employing RAT theory for cybercrime victimization. The articles were also differentiated based on the cybercrimes topologies being investigated; (a) cybercrime dependent (hacking and malware) and (b) cybercrime enabled (phishing, fraud and identity theft). The findings suggest that a refined specification and operationalization of RAT’S construct tailoring to the types of cybercrimes can arguably yield more accurate application and interpretation of RAT Theory in cybercrimes. Consequently, this will address the inaccurate measurement issues of some of the RATS’s constructs, leading to inconclusive effects on cybercrime victimization. In addition, there is a need for more longitudinal studies to disentangle the effect of RAT’s construct during pre and post cybercrimes. Security advocates can apply the findings of this research to formulate relevant cybercrime awareness programs. The findings also shed some insights into which groups should be targeted for different cybercrime educational and awareness programs. This study can increase the awareness among citizens in terms of their online activities, their attributes and the types of protection from becoming cybercrime victims.
网络犯罪正以惊人的速度增长,并对受害者造成不利影响。常规活动理论(RAT)是研究网络犯罪受害影响因素的常用理论。然而,对于RAT理论的适用性,研究结果并不一致。本研究通过系统的文献回顾分析,巩固并提供了一个运用RAT理论研究网络犯罪受害的相关研究的一致性分析。文章还根据正在调查的网络犯罪拓扑进行了区分;(a)依赖于网络犯罪(黑客攻击和恶意软件)和(b)支持网络犯罪(网络钓鱼、欺诈和身份盗窃)。研究结果表明,根据网络犯罪类型对RAT的结构进行细化和操作,可以更准确地应用和解释RAT理论在网络犯罪中的应用。因此,这将解决一些RATS的结构测量不准确的问题,导致对网络犯罪受害的不确定影响。此外,还需要更多的纵向研究来解开网络犯罪前后RAT结构的影响。安全倡导者可以应用这项研究的结果来制定相关的网络犯罪意识计划。研究结果还揭示了不同的网络犯罪教育和意识项目应该针对哪些群体。本研究可提高市民对网络活动、网络活动属性及防范网络犯罪的意识。
{"title":"A Systematic Literature Review of Routine Activity Theory’s Applicability in Cybercrimes","authors":"R. Ahmad, R. Thurasamy","doi":"10.13052/jcsm2245-1439.1133","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1133","url":null,"abstract":"Cybercrimes are increasing at an alarming rate and cause detrimental effects to the victims. Routine Activity Theory (RAT) is commonly used to understand the factors influencing cybercrime victimization. However, there have been inconsistent findings on the applicability of RAT theory. This study performs a Systematic Literature Review analysis to consolidate and provide a coherent analysis of the related studies employing RAT theory for cybercrime victimization. The articles were also differentiated based on the cybercrimes topologies being investigated; (a) cybercrime dependent (hacking and malware) and (b) cybercrime enabled (phishing, fraud and identity theft). The findings suggest that a refined specification and operationalization of RAT’S construct tailoring to the types of cybercrimes can arguably yield more accurate application and interpretation of RAT Theory in cybercrimes. Consequently, this will address the inaccurate measurement issues of some of the RATS’s constructs, leading to inconclusive effects on cybercrime victimization. In addition, there is a need for more longitudinal studies to disentangle the effect of RAT’s construct during pre and post cybercrimes. Security advocates can apply the findings of this research to formulate relevant cybercrime awareness programs. The findings also shed some insights into which groups should be targeted for different cybercrime educational and awareness programs. This study can increase the awareness among citizens in terms of their online activities, their attributes and the types of protection from becoming cybercrime victims.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47077558","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}
引用次数: 4
On the Controllability of Artificial Intelligence: An Analysis of Limitations 论人工智能的可控性:局限性分析
Q3 Computer Science Pub Date : 2022-05-25 DOI: 10.13052/jcsm2245-1439.1132
Roman V. Yampolskiy
The invention of artificial general intelligence is predicted to cause a shift in the trajectory of human civilization. In order to reap the benefits and avoid the pitfalls of such a powerful technology it is important to be able to control it. However, the possibility of controlling artificial general intelligence and its more advanced version, superintelligence, has not been formally established. In this paper, we present arguments as well as supporting evidence from multiple domains indicating that advanced AI cannot be fully controlled. The consequences of uncontrollability of AI are discussed with respect to the future of humanity and research on AI, and AI safety and security.
通用人工智能的发明预计将导致人类文明轨迹的转变。为了获得这种强大技术的好处并避免其陷阱,能够控制它是很重要的。然而,控制通用人工智能及其更先进版本超级智能的可能性尚未正式确定。在本文中,我们提出了来自多个领域的论点和支持证据,表明高级人工智能无法完全控制。从人类的未来、人工智能的研究以及人工智能的安全和保障方面讨论了人工智能不可控的后果。
{"title":"On the Controllability of Artificial Intelligence: An Analysis of Limitations","authors":"Roman V. Yampolskiy","doi":"10.13052/jcsm2245-1439.1132","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1132","url":null,"abstract":"The invention of artificial general intelligence is predicted to cause a shift in the trajectory of human civilization. In order to reap the benefits and avoid the pitfalls of such a powerful technology it is important to be able to control it. However, the possibility of controlling artificial general intelligence and its more advanced version, superintelligence, has not been formally established. In this paper, we present arguments as well as supporting evidence from multiple domains indicating that advanced AI cannot be fully controlled. The consequences of uncontrollability of AI are discussed with respect to the future of humanity and research on AI, and AI safety and security.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42287387","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}
引用次数: 6
Classification of Phishing Email Using Word Embedding and Machine Learning Techniques 基于词嵌入和机器学习技术的网络钓鱼邮件分类
Q3 Computer Science Pub Date : 2022-05-07 DOI: 10.13052/jcsm2245-1439.1131
M. Somesha, A. R. Pais
Email phishing is a cyber-attack, bringing substantial financial damage to corporate and commercial organizations. A phishing email is a special type of spamming, used to trick the user to disclose personal information to access his digital assets. Phishing attack is generally triggered by emailing links to spoofed websites that collect sensitive information. The APWG survey suggests that the existing countermeasures remain ineffective and insufficient for detecting phishing attacks. Hence there is a need for an efficient mechanism to detect phishing emails to provide better security against such attacks to the common user. The existing open-source data sets are limited in diversity, hence they do not capture the real picture of the attack. Hence there is a need for real-time input data set to design accurate email anti-phishing solutions. In the current work, it has been created a real-time in-house corpus of phishing and legitimate emails and proposed efficient techniques to detect phishing emails using a word embedding and machine learning algorithms. The proposed system uses only four email header-based heuristics for the classification of emails. The proposed word embedding cum machine learning framework comprises six word embedding techniques with five machine learning classifiers to evaluate the best performing combination. Among all six combinations, Random Forest consistently performed the best with FastText (CBOW) by achieving an accuracy of 99.50% with a false positive rate of 0.053%, TF-IDF achieved an accuracy of 99.39% with a false positive rate of 0.4% and Count Vectorizer achieved an accuracy of 99.18% with a false positive rate of 0.98% respectively for three datasets used.
电子邮件网络钓鱼是一种网络攻击,给企业和商业组织带来巨大的经济损失。网络钓鱼邮件是一种特殊类型的垃圾邮件,用于欺骗用户泄露个人信息以访问其数字资产。网络钓鱼攻击通常是通过发送电子邮件链接到收集敏感信息的欺骗网站来触发的。APWG的调查表明,现有的对策仍然无效,不足以检测网络钓鱼攻击。因此,需要一种有效的机制来检测网络钓鱼电子邮件,以提供更好的安全性,防止普通用户受到此类攻击。现有的开源数据集的多样性有限,因此它们不能捕捉到攻击的真实情况。因此,需要实时输入数据集来设计准确的电子邮件反网络钓鱼解决方案。在目前的工作中,它已经创建了一个实时的内部网络钓鱼和合法电子邮件语料库,并提出了使用词嵌入和机器学习算法检测网络钓鱼电子邮件的有效技术。该系统仅使用四种基于邮件标题的启发式方法对电子邮件进行分类。提出的词嵌入和机器学习框架包括六种词嵌入技术和五种机器学习分类器,以评估最佳表现组合。在所有六种组合中,Random Forest在FastText (CBOW)上的表现一直最好,在使用的三个数据集上,其准确率为99.50%,假阳性率为0.053%,TF-IDF的准确率为99.39%,假阳性率为0.4%,Count Vectorizer的准确率为99.18%,假阳性率为0.98%。
{"title":"Classification of Phishing Email Using Word Embedding and Machine Learning Techniques","authors":"M. Somesha, A. R. Pais","doi":"10.13052/jcsm2245-1439.1131","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1131","url":null,"abstract":"Email phishing is a cyber-attack, bringing substantial financial damage to corporate and commercial organizations. A phishing email is a special type of spamming, used to trick the user to disclose personal information to access his digital assets. Phishing attack is generally triggered by emailing links to spoofed websites that collect sensitive information. The APWG survey suggests that the existing countermeasures remain ineffective and insufficient for detecting phishing attacks. Hence there is a need for an efficient mechanism to detect phishing emails to provide better security against such attacks to the common user. The existing open-source data sets are limited in diversity, hence they do not capture the real picture of the attack. Hence there is a need for real-time input data set to design accurate email anti-phishing solutions. In the current work, it has been created a real-time in-house corpus of phishing and legitimate emails and proposed efficient techniques to detect phishing emails using a word embedding and machine learning algorithms. The proposed system uses only four email header-based heuristics for the classification of emails. The proposed word embedding cum machine learning framework comprises six word embedding techniques with five machine learning classifiers to evaluate the best performing combination. Among all six combinations, Random Forest consistently performed the best with FastText (CBOW) by achieving an accuracy of 99.50% with a false positive rate of 0.053%, TF-IDF achieved an accuracy of 99.39% with a false positive rate of 0.4% and Count Vectorizer achieved an accuracy of 99.18% with a false positive rate of 0.98% respectively for three datasets used.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":"39 1","pages":"279-320"},"PeriodicalIF":0.0,"publicationDate":"2022-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75873911","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}
引用次数: 6
Similarity Analysis of Single-Vendor Marketplaces in the Tor-Network Tor网络中单个供应商市场的相似性分析
Q3 Computer Science Pub Date : 2022-03-22 DOI: 10.13052/jcsm2245-1439.1124
Florian Platzer, Fabian Brenner, M. Steinebach
Single-vendor shops are darknet marketplaces where individuals offer their own goods or services on their own darknet website. There are many single-vendor shops with a wide range of offers in the Tor-network. This paper presents a method to find similarities between these vendor websites to discover possible operational structures between them. In order to achieve this, similarity values between the darknet websites are determined by combining different features from the categories content, structure and metadata. Our results show that the features HTML-Tag, HTML-Class, HTML-DOM-Tree as well as File-Content, Open Ports and Links-To proved to be particularly important and very effective in revealing commonalities between darknet websites. Using the similarity detection method, it was found that only 49% of the 258 single-vendor marketplaces were unique, meaning that there were no similar websites. In addition, 20% of all vendor shops are duplicates. 31% of all single-vendor marketplaces can be sorted into seven similarity groups.
单一供应商商店是暗网市场,个人在自己的暗网网站上提供自己的商品或服务。tor网络中有许多单一供应商的商店提供各种各样的优惠。本文提出了一种寻找这些供应商网站之间相似点的方法,以发现它们之间可能的操作结构。为了实现这一点,暗网网站之间的相似度值是通过结合分类内容、结构和元数据的不同特征来确定的。我们的研究结果表明,HTML-Tag、HTML-Class、HTML-DOM-Tree以及File-Content、Open Ports和Links-To等功能被证明在揭示暗网网站之间的共性方面特别重要且非常有效。使用相似性检测方法,发现258个单一供应商市场中只有49%是唯一的,这意味着没有类似的网站。此外,所有供应商商店中有20%是重复的。31%的单一供应商市场可以分为七个相似组。
{"title":"Similarity Analysis of Single-Vendor Marketplaces in the Tor-Network","authors":"Florian Platzer, Fabian Brenner, M. Steinebach","doi":"10.13052/jcsm2245-1439.1124","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1124","url":null,"abstract":"Single-vendor shops are darknet marketplaces where individuals offer their own goods or services on their own darknet website. There are many single-vendor shops with a wide range of offers in the Tor-network. This paper presents a method to find similarities between these vendor websites to discover possible operational structures between them. In order to achieve this, similarity values between the darknet websites are determined by combining different features from the categories content, structure and metadata. Our results show that the features HTML-Tag, HTML-Class, HTML-DOM-Tree as well as File-Content, Open Ports and Links-To proved to be particularly important and very effective in revealing commonalities between darknet websites. Using the similarity detection method, it was found that only 49% of the 258 single-vendor marketplaces were unique, meaning that there were no similar websites. In addition, 20% of all vendor shops are duplicates. 31% of all single-vendor marketplaces can be sorted into seven similarity groups.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45394656","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}
引用次数: 3
An Introduction to the exFAT File System and How to Hide Data Within exFAT文件系统介绍及如何在其中隐藏数据
Q3 Computer Science Pub Date : 2022-03-22 DOI: 10.13052/jcsm2245-1439.1125
J. Heeger, York Yannikos, M. Steinebach
In the recent years steganographic techniques for hiding data in file system metadata gained focus. While commonly used file systems received tooling and publications the exFAT file system did not get much attention – probably because its structure provides only few suitable locations to hide data. In this work we present an overview of exFAT’s internals and describe the different structures used by the file system to store files. We also introduce two approaches that allow us to embed messages into the exFAT file system using steganographic techniques. The first approach has a lower embedding rate, but has less specific requirements for the embedding location. The other one, called exHide, uses error correcting to allow for an more robust approach. Both approaches are specified, evaluated and discussed in terms of their strengths and weaknesses.
近年来,用于在文件系统元数据中隐藏数据的隐写技术得到了关注。虽然常用的文件系统得到了工具和出版物,但exFAT文件系统并没有得到太多关注——可能是因为它的结构只提供了很少合适的位置来隐藏数据。在这项工作中,我们概述了exFAT的内部结构,并描述了文件系统用于存储文件的不同结构。我们还介绍了两种方法,允许我们使用隐写技术将消息嵌入exFAT文件系统。第一种方法具有较低的嵌入率,但对嵌入位置的特定要求较少。另一个名为exHide,它使用纠错来实现更稳健的方法。这两种方法都根据其长处和短处进行了具体说明、评估和讨论。
{"title":"An Introduction to the exFAT File System and How to Hide Data Within","authors":"J. Heeger, York Yannikos, M. Steinebach","doi":"10.13052/jcsm2245-1439.1125","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1125","url":null,"abstract":"In the recent years steganographic techniques for hiding data in file system metadata gained focus. While commonly used file systems received tooling and publications the exFAT file system did not get much attention – probably because its structure provides only few suitable locations to hide data. In this work we present an overview of exFAT’s internals and describe the different structures used by the file system to store files. We also introduce two approaches that allow us to embed messages into the exFAT file system using steganographic techniques. The first approach has a lower embedding rate, but has less specific requirements for the embedding location. The other one, called exHide, uses error correcting to allow for an more robust approach. Both approaches are specified, evaluated and discussed in terms of their strengths and weaknesses.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46466866","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}
引用次数: 0
Majority Vote-Based Ensemble Approach for Distributed Denial of Service Attack Detection in Cloud Computing 基于多数投票的云计算分布式拒绝服务攻击检测集成方法
Q3 Computer Science Pub Date : 2022-03-22 DOI: 10.13052/jcsm2245-1439.1126
A. Alqarni
Cloud computing is considered as technical advancement in information technology. Many organizations have been motivated by this advancement to outsource their data and computational needs. Such platforms are required to fulfil basic security principles such as confidentiality, availability, and integrity. Cloud computing offers scalable and virtualized services with a high flexibility level and decreased maintenance costs to end-users. The infrastructure and protocols that are behind cloud computing may contain bugs and vulnerabilities. These vulnerabilities are being exploited by attackers, leading to attacks. Among the most reported attacks in cloud computing are distributed denial-of-service (DDOS) attacks. DDOS attacks are conducted by sending many data packets to the targeted infrastructure. This leads to most network bandwidth and server time being consumed, thus causing a denial of the service problem. Several methods have been proposed and experimented with for early DDOS attack detection. Employing a single machine learning classification model may give an adequate level of attack detection accuracy but needs an enhancement. In this study, we propose an approach based on an ensemble of machine learning classifiers. The proposed approach uses a majority vote-based ensemble of classifiers to detect attacks more accurately. A subset of the CICDDOS2019 dataset consisting of 32,000 instances, including 8450 benign and 23,550 DDOS attack instances was used in this study for results and evaluation. The experimental results showed that 98.02% accuracy was achieved with 97.45% sensitivity and 98.65% specificity.
云计算被认为是信息技术的技术进步。许多组织都受到这一进步的推动,将其数据和计算需求外包。这些平台需要满足基本的安全原则,如保密性、可用性和完整性。云计算为最终用户提供了可扩展和虚拟化的服务,具有较高的灵活性,并降低了维护成本。云计算背后的基础设施和协议可能包含漏洞和漏洞。攻击者正在利用这些漏洞进行攻击。云计算中报告最多的攻击是分布式拒绝服务(DDOS)攻击。DDOS攻击是通过向目标基础设施发送许多数据包来进行的。这会导致消耗大部分网络带宽和服务器时间,从而导致拒绝服务问题。已经提出了几种用于早期DDOS攻击检测的方法并进行了实验。采用单个机器学习分类模型可以提供足够水平的攻击检测精度,但需要增强。在这项研究中,我们提出了一种基于机器学习分类器集成的方法。所提出的方法使用基于多数投票的分类器集合来更准确地检测攻击。CICDDOS2019数据集的一个子集由32000个实例组成,包括8450个良性和23550个DDOS攻击实例,用于本研究的结果和评估。实验结果表明,准确率为98.02%,灵敏度为97.45%,特异性为98.65%。
{"title":"Majority Vote-Based Ensemble Approach for Distributed Denial of Service Attack Detection in Cloud Computing","authors":"A. Alqarni","doi":"10.13052/jcsm2245-1439.1126","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1126","url":null,"abstract":"Cloud computing is considered as technical advancement in information technology. Many organizations have been motivated by this advancement to outsource their data and computational needs. Such platforms are required to fulfil basic security principles such as confidentiality, availability, and integrity. Cloud computing offers scalable and virtualized services with a high flexibility level and decreased maintenance costs to end-users. The infrastructure and protocols that are behind cloud computing may contain bugs and vulnerabilities. These vulnerabilities are being exploited by attackers, leading to attacks. Among the most reported attacks in cloud computing are distributed denial-of-service (DDOS) attacks. DDOS attacks are conducted by sending many data packets to the targeted infrastructure. This leads to most network bandwidth and server time being consumed, thus causing a denial of the service problem. Several methods have been proposed and experimented with for early DDOS attack detection. Employing a single machine learning classification model may give an adequate level of attack detection accuracy but needs an enhancement. In this study, we propose an approach based on an ensemble of machine learning classifiers. The proposed approach uses a majority vote-based ensemble of classifiers to detect attacks more accurately. A subset of the CICDDOS2019 dataset consisting of 32,000 instances, including 8450 benign and 23,550 DDOS attack instances was used in this study for results and evaluation. The experimental results showed that 98.02% accuracy was achieved with 97.45% sensitivity and 98.65% specificity.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49330630","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}
引用次数: 9
Evaluating Dynamic Tor Onion Services for Privacy Preserving Distributed Digital Identity Systems 保护隐私分布式数字身份系统的动态Tor洋葱服务评估
Q3 Computer Science Pub Date : 2022-03-22 DOI: 10.13052/jcsm2245-1439.1122
Tobias Höller, Michael Roland, R. Mayrhofer
Digital identity documents provide several key benefits over physical ones. They can be created more easily, incur less costs, improve usability and can be updated if necessary. However, the deployment of digital identity systems does come with several challenges regarding both security and privacy of personal information. In this paper, we highlight one challenge that digital identity systems face if they are set up in a distributed fashion: Network Unlinkability. We discuss why network unlinkability is so critical for a distributed digital identity system that wants to protect the privacy of its users and present a specific definition of unlinkability for our use-case. Based on this definition, we propose a scheme that utilizes the Tor network to achieve the required level of unlinkability by dynamically creating onion services and evaluate the feasibility of our approach by measuring the deployment times of onion services.
与物理身份证件相比,数字身份证件提供了几个关键优势。它们可以更容易地创建,成本更低,提高可用性,并且可以在必要时进行更新。然而,数字身份系统的部署在个人信息的安全和隐私方面确实面临着一些挑战。在本文中,我们强调了数字身份系统在以分布式方式设置时面临的一个挑战:网络不可链接性。我们讨论了为什么网络不可链接性对于想要保护用户隐私的分布式数字身份系统如此重要,并为我们的用例提供了不可链接的具体定义。基于这一定义,我们提出了一种方案,该方案利用Tor网络通过动态创建洋葱服务来实现所需的不可连接性水平,并通过测量洋葱服务的部署时间来评估我们的方法的可行性。
{"title":"Evaluating Dynamic Tor Onion Services for Privacy Preserving Distributed Digital Identity Systems","authors":"Tobias Höller, Michael Roland, R. Mayrhofer","doi":"10.13052/jcsm2245-1439.1122","DOIUrl":"https://doi.org/10.13052/jcsm2245-1439.1122","url":null,"abstract":"Digital identity documents provide several key benefits over physical ones. They can be created more easily, incur less costs, improve usability and can be updated if necessary. However, the deployment of digital identity systems does come with several challenges regarding both security and privacy of personal information. In this paper, we highlight one challenge that digital identity systems face if they are set up in a distributed fashion: Network Unlinkability. We discuss why network unlinkability is so critical for a distributed digital identity system that wants to protect the privacy of its users and present a specific definition of unlinkability for our use-case. Based on this definition, we propose a scheme that utilizes the Tor network to achieve the required level of unlinkability by dynamically creating onion services and evaluate the feasibility of our approach by measuring the deployment times of onion services.","PeriodicalId":37820,"journal":{"name":"Journal of Cyber Security and Mobility","volume":" ","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48823049","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}
引用次数: 2
期刊
Journal of Cyber Security and Mobility
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1