2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)最新文献

筛选
英文 中文
Machine Learning-based RF Jamming Detection in Wireless Networks 基于机器学习的无线网络射频干扰检测
Zhutian Feng, Cunqing Hua
{"title":"Machine Learning-based RF Jamming Detection in Wireless Networks","authors":"Zhutian Feng, Cunqing Hua","doi":"10.1109/SSIC.2018.8556709","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556709","url":null,"abstract":"Due to the open and shared nature of wireless medium, wireless networks are vulnerable to Radio Frequency (RF) jamming attacks since an attacker can easily emit an interference signal to prevent legitimate access to the medium or disrupt the reception of signal. An attacker may utilize different jamming strategies by exploiting the vulnerabilities of wireless protocols at different layers. Therefore, the detection and classification of jamming attacks is important to take proper countermeasures. In this paper, we firstly discuss some classic jamming strategies and some performance metrics for jamming detection. We then implement the jamming attack modules based on the NS-3 simulator, and study the effects of different types of jamming strategies. We propose some jamming detection schemes based on a variety of machine learning algorithms. The effectiveness of the proposed jamming detection schemes are valuated and optimized based on the collected data for different jamming attacks.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115604586","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}
引用次数: 16
VEPP:A Verifiable, Highly Efficient and Privacy-Preserving Protocol for Outsourcing Large Matrix Multiplication VEPP:外包大矩阵乘法的可验证、高效和隐私保护协议
Li Hui, Xiaolei Dong, Jiachen Shen, Z. Cao, Hongyuan Chen, Yunong Liang
{"title":"VEPP:A Verifiable, Highly Efficient and Privacy-Preserving Protocol for Outsourcing Large Matrix Multiplication","authors":"Li Hui, Xiaolei Dong, Jiachen Shen, Z. Cao, Hongyuan Chen, Yunong Liang","doi":"10.1109/SSIC.2018.8556689","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556689","url":null,"abstract":"The highly development of Internet and cloud computing technology makes it possible to share computing power, storage and data. Cloud computing makes users with limited computing resources be able to carry out large computational tasks with the help of cloud. but security is a major concern that hinders the widespread use of outsourcing computing. We focus on outsourcing large matrix multiplication in this paper. Firstly, we exploit Chinese Remainder Theorem(CRT) to construct a large matrix multiplication outsourcing protocol which is highly efficient in the malicious cloud model. Then formal security proof and extensive performance evaluation show that our protocol achieves a higher security level i.e., information-theoretic security for input privacy and adaptive chosen ciphertext attack (CCA2) security for output privacy). Compared with previous works, users in the proposed protocol are able to verify the results received from the cloud with tiny error rate.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"11622 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133508268","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
VTET: A Virtual Industrial Control System Testbed for Cyber Security Research 面向网络安全研究的虚拟工业控制系统测试平台
Yaobin Xie, Wei Wang, F. Wang, Rui Chang
{"title":"VTET: A Virtual Industrial Control System Testbed for Cyber Security Research","authors":"Yaobin Xie, Wei Wang, F. Wang, Rui Chang","doi":"10.1109/SSIC.2018.8556732","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556732","url":null,"abstract":"Nowadays Industrial Control System (ICS) are suffering the increasing cyber attacks. The ICS testbed is a ideal platform since that it could make the security research more controllable and safe. In contrast to the physically replication testbed, the virtual testbed is more economic, safe and maintainable which will makes it advantageous in the laboratorial environment. In this paper, we present VTET, a virtual ICS testbed for cyber security research. VTET contains a virtual chemical industrial process, and both virtual and physical controllers. We provide a detailed description of VTET implementation such as the migration of controllers and the configuration of network. And we also demonstrate the 5 attack schemes simulated in VTET to prove its availability. Since the convenience of configuration and deployment, VTET is very suitable for academic ICS security research.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"171 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290397","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
A Novel Android Malware Detection Approach Using Operand Sequences 一种基于操作数序列的Android恶意软件检测方法
Peng Zhang, Shaoyin Cheng, Songhao Lou, Fan Jiang
{"title":"A Novel Android Malware Detection Approach Using Operand Sequences","authors":"Peng Zhang, Shaoyin Cheng, Songhao Lou, Fan Jiang","doi":"10.1109/SSIC.2018.8556755","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556755","url":null,"abstract":"Android malware detection has become increasingly important over the past few years, due to the popularity of Android devices and the explosive growth of Android applications. This asks for more effective techniques to detect the Android malware. Some works in the literature show that the opcode sequences have a remarkable effect on Android malware detection. However, they omitted the information contained in operand sequences. In this paper, we do not analyse the opcode sequences but the API calls used in operand sequences, and abstract the API calls to their package names with the aim to be resilient to API changes in different Android API levels. In order to avoid to be computationally expensive, we only capitalize on the n-grams analysis. In addition, we apply the package level information extracted from API calls to build a Android malware prediction model. We perform experiments on malicious Android applications, composed of 5560 malware samples which are belong to Drebin dataset, 361 malware samples collected from Contagio Mobile Malware and 5900 benign Android applications retrieved from Google Play. Results show that the accuracy of our approach exceeds the opcode n-grams in some ways.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123952682","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}
引用次数: 8
SSIC 2018 Index
{"title":"SSIC 2018 Index","authors":"","doi":"10.1109/ssic.2018.8556728","DOIUrl":"https://doi.org/10.1109/ssic.2018.8556728","url":null,"abstract":"","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129431245","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
Data Hiding for Color Image by Rubik’s Cube 魔方彩色图像的数据隐藏
Chih-Wei Shiu, Wien Hong, Jeanne Chen, Tung-Shou Chen, Wan-Yi Ji
{"title":"Data Hiding for Color Image by Rubik’s Cube","authors":"Chih-Wei Shiu, Wien Hong, Jeanne Chen, Tung-Shou Chen, Wan-Yi Ji","doi":"10.1109/SSIC.2018.8556660","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556660","url":null,"abstract":"In this paper, we proposed a novel Rubik’s cube hiding scheme for the RGB images. The Rubik’s cube is a $256times 256times 256$ index composed of sub-cube $3times 3times 3$ matrices which were based on the RGB color components. Hiding sequence was setup for the sub-cube which was based on the eye sensitivity, from least to most, to colors B, R and G, respectively. Experimental results showed that the proposed scheme has high hiding capacities and PSNRs. The hiding capacity may also be manipulated by using different sized sub-cube matrices.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132380182","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
Detection of DGA Domains Based on Support Vector Machine 基于支持向量机的DGA域检测
Yu Chen, Sheng Yan, Tianyu Pang, Rui Chen
{"title":"Detection of DGA Domains Based on Support Vector Machine","authors":"Yu Chen, Sheng Yan, Tianyu Pang, Rui Chen","doi":"10.1109/SSIC.2018.8556788","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556788","url":null,"abstract":"Domain Generation Algorithm (DGA) technique has been widely used by botnets as a covert command and control (C &C) channel of issuing control or attack commands through various DGA domains. This method can evade blacklisting detection and bring new challenges to the current detection method. This paper extracts feature set which is helpful to differentiate between malicious DGA domains and benign domains, and uses the Support Vector Machine (SVM) algorithm to train the detection model. Experimental results demonstrate that the detection method proposed in this paper is powerful with a high true positive rate 95% and a low false positive rate 1%.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126774636","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}
引用次数: 5
SSIC 2018 Technical Program Committee SSIC 2018技术计划委员会
{"title":"SSIC 2018 Technical Program Committee","authors":"","doi":"10.1109/ssic.2018.8556700","DOIUrl":"https://doi.org/10.1109/ssic.2018.8556700","url":null,"abstract":"","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117082606","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
Least Cost Rumor Community Blocking optimization in Social Networks 社交网络中最小成本谣言社区拦截优化
Jianguo Zheng, Li Pan
{"title":"Least Cost Rumor Community Blocking optimization in Social Networks","authors":"Jianguo Zheng, Li Pan","doi":"10.1109/SSIC.2018.8556739","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556739","url":null,"abstract":"The rapid development of online social networks (OSNs) makes it possible for rumors to spread quickly and widely, which can result in undesirable social effects. Hence, it is necessary to design an effective strategy to contain the spread of rumors in OSNs. In this paper, we assume rumors originate from one community CR in a social network and adopt a given influence diffusion model as the rumor diffusion model, then we consider the Least Cost Rumor Community Blocking Optimization (LCRCBO) problem. The problem can be summarized as identifying a minimal subset of nodes and then removing all the nodes in this subset as well as their incoming and outgoing edges from the network, such that we can not only block rumors withinCR but also guarantee that the expected number of nodes influenced by the rumor does not exceed a given positive integer K at the end of rumor diffusion process. Under these two constraints, the Minimum Vertex Cover Based Greedy (MVCBG) algorithm is proposed to solve the LCRCBO problem in this paper. Finally, to validate the effectiveness of the MVCBG algorithm, we conduct experiments on three real-world networks and two artificial networks. The simulation results show that the MVCBG algorithm outperforms other heuristics.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126170643","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}
引用次数: 17
A UCB1-Based Online Job Dispatcher for Heterogeneous Mobile Edge Computing System 基于ucb1的异构移动边缘计算系统在线作业调度器
Xiaoliang Wang, Junhua Tang, Mengdi Yu, Gubei Yin, Jianhua Li
{"title":"A UCB1-Based Online Job Dispatcher for Heterogeneous Mobile Edge Computing System","authors":"Xiaoliang Wang, Junhua Tang, Mengdi Yu, Gubei Yin, Jianhua Li","doi":"10.1109/SSIC.2018.8556796","DOIUrl":"https://doi.org/10.1109/SSIC.2018.8556796","url":null,"abstract":"Mobile edge computing is widely believed to be a key technology in 5G networks. It promises dramatic reduction in latency and mobile energy consumption by offloading computation intensive and latency critical jobs to edge servers for execution. In this paper, we consider the job dispatching problem at the access proxies in a heterogeneous mobile edge computing system. The problem is modeled as a multi-armed bandit problem, and an online job dispatcher algorithm based on UCBI strategy is proposed. The performance of the proposed dispatcher and the edge servers are theoretically modeled and analyzed. Simulation experiments are conducted to evaluate the effectiveness of the proposed algorithm.","PeriodicalId":302563,"journal":{"name":"2018 Third International Conference on Security of Smart Cities, Industrial Control System and Communications (SSIC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127666576","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
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学术文献互助群
群 号:481959085
Book学术官方微信