2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)最新文献

筛选
英文 中文
Analysis of Machine Learning Techniques for Ransomware Detection 勒索软件检测中的机器学习技术分析
Fakhroddin Noorbehbahani, Farzaneh Rasouli, Mohammad Saberi
{"title":"Analysis of Machine Learning Techniques for Ransomware Detection","authors":"Fakhroddin Noorbehbahani, Farzaneh Rasouli, Mohammad Saberi","doi":"10.1109/ISCISC48546.2019.8985139","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985139","url":null,"abstract":"In parallel with the increasing growth of the Internet and computer networks, the number of malwares has been increasing every day. Today, one of the newest attacks and the biggest threats in cybersecurity is ransomware. The effectiveness of applying machine learning techniques for malware detection has been explored in much scientific research, however, there is few studies focused on machine learning-based ransomware detection. In this paper, the effectiveness of ransomware detection using machine learning methods applied to CICAndMal2017 dataset is examined in two experiments. First, the classifiers are trained on a single dataset containing different types of ransomware. Second, different classifiers are trained on datasets of 10 ransomware families distinctly. Our findings imply that in both experiments random forest outperforms other tested classifiers and the performance of the classifiers are not changed significantly when they are trained on each family distinctly. Therefore, the random forest classification method is very effective in ransomware detection.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129000839","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}
引用次数: 19
Cryptanalysis of SP2DAS and 3PDA, Two Data Aggregation Schemes for Smart Grid 智能电网两种数据聚合方案SP2DAS和3PDA的密码分析
Hamid Amiryousefi, Z. Ahmadian
{"title":"Cryptanalysis of SP2DAS and 3PDA, Two Data Aggregation Schemes for Smart Grid","authors":"Hamid Amiryousefi, Z. Ahmadian","doi":"10.1109/ISCISC48546.2019.8985140","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985140","url":null,"abstract":"This paper analyses the security of two recently proposed privacy preserving data aggregation schemes, called SP2DAS and 3PDA. We show that, for both of these protocols, despite the designers' claims, there are efficient forgery attacks on the signature schemes used in. We present a selective forgery attack on the signature scheme of SP2DAS in the key-only attack model and a selective forgery attack on the 3PDA's signature scheme in the known-message attack model, requiring only two pairs of message-signature. Our results show that in both of these schemes, the attacker can inject any arbitrary faulty data into the data aggregated by the network, without being detected, which is a serious threat to the performance of the whole network.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123654097","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}
引用次数: 1
Investigating the Streaming Algorithms Usage in Website Fingerprinting Attack Against Tor Privacy Enhancing Technology 针对Tor隐私增强技术的流算法在网站指纹攻击中的应用研究
Reyhane Attarian, S. Hashemi
{"title":"Investigating the Streaming Algorithms Usage in Website Fingerprinting Attack Against Tor Privacy Enhancing Technology","authors":"Reyhane Attarian, S. Hashemi","doi":"10.1109/ISCISC48546.2019.8985162","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985162","url":null,"abstract":"Website fingerprinting attack is a kind of traffic analysis attack that aims to identify the URL of visited websites using the Tor browser. Previous website fingerprinting attacks were based on batch learning methods which assumed that the traffic traces of each website are independent and generated from the stationary probability distribution. But, in realistic scenarios, the websites' concepts can change over time (dynamic websites) that is known as concept drift. To deal with data whose distribution change over time, the classifier model must update its model permanently and be adaptive to concept drift. Streaming algorithms are dynamic models that have these features and lead us to make a comparison of various representative data stream classification algorithms for website fingerprinting. Given to our experiments and results, by considering streaming algorithms along with statistical flow-based network traffic features, the accuracy grows significantly.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131609982","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
CRT-Based Robust Data Hiding Method by Extracting Features in DCT Domain 基于ct的DCT域特征提取鲁棒数据隐藏方法
Alireza Ghaemi, H. Danyali
{"title":"CRT-Based Robust Data Hiding Method by Extracting Features in DCT Domain","authors":"Alireza Ghaemi, H. Danyali","doi":"10.1109/ISCISC48546.2019.8985163","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985163","url":null,"abstract":"In this paper a robust data hiding method is presented by applying Discrete Cosine Transform (DCT) to the host signal and performing feature extraction, based on Chinese Remainder Theorem (CRT). Improving the robustness reduces the imperceptibility in watermarking systems due to the tradeoff between imperceptibility, robustness and capacity in data hiding schemes. The proposed method offers high imperceptibility alongside robustness. To embed the hidden information CRT based feature extraction process is carried out in DCT domain. Extracted features are distances of CRT remainders. These distances are not varied much in noisy situations thus it is possible to extract the hidden bits with high accuracy. To analyze the robustness of the proposed method common signal processing manipulations are applied to the watermarked images. Bit Correct Rate (BCR) values are calculated for extracted watermarks to evaluate the robustness. Results are compared to other state of the art methods and confirm the superiority of the proposed method.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"109 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116548551","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
Inferring API Correct Usage Rules: A Tree-based Approach 推断API正确使用规则:基于树的方法
Majid Zolfaghari, Solmaz Salimi, M. Kharrazi
{"title":"Inferring API Correct Usage Rules: A Tree-based Approach","authors":"Majid Zolfaghari, Solmaz Salimi, M. Kharrazi","doi":"10.1109/ISCISC48546.2019.8985157","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985157","url":null,"abstract":"The lack of knowledge about API correct usage rules is one of the main reasons that APIs are employed incorrectly by programmers, which in some cases lead to serious security vulnerabilities. However, finding a correct usage rule for an API is a time-consuming and error-prone task, particularly in the absence of an API documentation. Existing approaches to extract correct usage rules are mostly based on majority API usages, assuming the correct usage is prevalent. Although statistically extracting API correct usage rules achieves reasonable accuracy, it cannot work correctly in the absence of a fair amount of sample usages. We propose inferring API correct usage rules independent of the number of sample usages by leveraging an API tree structure. In an API tree, each node is an API, and each node's children are APIs called by the parent API. Starting from lower-level APIs, it is possible to infer the correct usage rules for them by utilizing the available correct usage rules of their children. We developed a tool based on our idea for inferring API correct usages rules hierarchically, and have applied it to the source code of Linux kernel v4.3 drivers and found 24 previously reported bugs.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132759480","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
Ransomware detection using process mining and classification algorithms 基于过程挖掘和分类算法的勒索软件检测
A. Bahrani, Amir Jalaly Bidgly
{"title":"Ransomware detection using process mining and classification algorithms","authors":"A. Bahrani, Amir Jalaly Bidgly","doi":"10.1109/ISCISC48546.2019.8985149","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985149","url":null,"abstract":"The fast growing of ransomware attacks has become a serious threat for companies, governments and internet users, in recent years. The increasing of computing power, memory and etc. and the advance in cryptography has caused the complicating the ransomware attacks. Therefore, effective methods are required to deal with ransomwares. Although, there are many methods proposed for ransomware detection, but these methods are inefficient in detection ransomwares, and more researches are still required in this field. In this paper, we have proposed a novel method for identify ransomware from benign software using process mining methods. The proposed method uses process mining to discover the process model from the events logs, and then extracts features from this process model and using these features and classification algorithms to classify ransomwares. This paper shows that the use of classification algorithms along with the process mining can be suitable to identify ransomware. The accuracy and performance of our proposed method is evaluated using a study of 21 ransomware families and some benign samples. The results show j48 and random forest algorithms have the best accuracy in our method and can achieve to 95% accuracy in detecting ransomwares.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124799721","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
Classical-Quantum Multiple Access Wiretap Channel 经典量子多址窃听信道
Hadi Aghaee, Bahareh Akhbari
{"title":"Classical-Quantum Multiple Access Wiretap Channel","authors":"Hadi Aghaee, Bahareh Akhbari","doi":"10.1109/ISCISC48546.2019.8985142","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985142","url":null,"abstract":"In this paper, the quantum wiretap channel (QWTC) and quantum multiple access channel (QMAC) are used so as to introduce the classical-quantum multiple access wiretap channel (C-QMA-WTC). In this regard, the classical concepts about the multiple access wiretap channel (MA-WTC) are defined. Moreover, the multiple access wiretap channel with classical inputs and quantum output is considered. An achievable secrecy rate region of C-QMA-WTC is derived. After presenting the results of quantum wiretap channel, we illustrate how mutual information can be used instead of the Holevo information in the expression of the secrecy capacity region.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117020377","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}
引用次数: 10
Cryptanalysis of a Certificateless Signcryption Scheme 无证书签名加密方案的密码分析
Parvin Rastegari, Mohammad Dakhilalian
{"title":"Cryptanalysis of a Certificateless Signcryption Scheme","authors":"Parvin Rastegari, Mohammad Dakhilalian","doi":"10.1109/ISCISC48546.2019.8985158","DOIUrl":"https://doi.org/10.1109/ISCISC48546.2019.8985158","url":null,"abstract":"In 2016, Zheng and Li proposed a certificateless signcryption (CL-SC) scheme and claimed that their scheme is confidential (IND-CCA) and unforgeable (EUF-CMA) against both key replacement and malicious KGC attacks, in the standard model. In this paper, we propose both key replacement and malicious KGC attacks against confidentiality and unforgeability of their scheme. Our proposed attacks show that in contrast to Zheng and Li's claim, their scheme is neither confidential (IND-CCA) nor unforgeable (EUF-CMA) against key replacement and malicious KGC attacks.","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125793885","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}
引用次数: 1
Organazing Committee Organazing委员会
{"title":"Organazing Committee","authors":"","doi":"10.1109/iscisc48546.2019.8985156","DOIUrl":"https://doi.org/10.1109/iscisc48546.2019.8985156","url":null,"abstract":"","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131890573","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
ISCISC 2019 Papers ISCISC 2019论文
{"title":"ISCISC 2019 Papers","authors":"","doi":"10.1109/iscisc48546.2019.8985151","DOIUrl":"https://doi.org/10.1109/iscisc48546.2019.8985151","url":null,"abstract":"","PeriodicalId":128407,"journal":{"name":"2019 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology (ISCISC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131180679","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信