IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)最新文献_第2页

A Practical Intrusion Visualization Analyzer based on Self-organizing Map 一种实用的基于自组织映射的入侵可视化分析方法

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093752

Jie Wang, Yun Lin, Lei Chen

{"title":"A Practical Intrusion Visualization Analyzer based on Self-organizing Map","authors":"Jie Wang, Yun Lin, Lei Chen","doi":"10.1109/infocomwkshps47286.2019.9093752","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093752","url":null,"abstract":"In the era of big data, devices and services are interconnected through the network. For the purpose of ensuring the security and reliability of network communication and resisting the threat of intrusions, Network Intrusion Detection Systems (NIDS) have become an infrastructure in the Internet ecosystem. It is challenging to develop an effective NIDS which can provide visualization ability due to the high-dimensional characteristic of network traffic. In our work, a practical NIDS based on the Self-Organizing Map (SOM) neuron network is presented. The proposed method can arrange high-dimensional data in a 2D topological graph in an orderly manner, which enables an easy-to-understand insight of the distribution of normal or abnormal data. With the training, similar data is grouped together, based on which intrusions can be identified. In addition, a hybrid preprocessing model that combines two different feature selection methods is adopted to accelerate the detection process. In order to evaluate the performance of the proposed framework in terms of several different metrics, experiments are performed over a benchmark dataset UNSWNB15 which is widely used in intrusion detection research. Experiment results show that the proposed approach provides a user-friendly visualization and enhances the detection of intrusions.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133238754","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

Survey of Mobile Device Authentication Methods Based on RF Fingerprint 基于射频指纹的移动设备认证方法研究

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093755

Xinghao Guo, Zhen Zhang, Jie Chang

{"title":"Survey of Mobile Device Authentication Methods Based on RF Fingerprint","authors":"Xinghao Guo, Zhen Zhang, Jie Chang","doi":"10.1109/infocomwkshps47286.2019.9093755","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093755","url":null,"abstract":"Radio frequency (RF) fingerprint is the physical layer nature of wireless communication devices. It is like different people have different fingerprints, different wireless devices also have different RF fingerprints, which can be used for identification and access authentication of wireless devices in mobile communication. This paper mainly reviews the research progress of RF fingerprint technology in the past ten years. According to the typical process of RF fingerprint authentication, the basic concept of RF fingerprint and the overall framework of identity authentication are introduced. Then, the paper expounds two kinds of RF fingerprint authentication models of \"1 to 1\" and \"1 to N\" respectively, and briefly describes its implementation process. Subsequently, this paper has reviewed the papers on RF fingerprint authentication in recent years, and we select representative papers for introduction. This paper also conducts experiments on 10 communication devices of the same model, and we divide them into legal devices and illegal devices. The RF fingerprint authentication model is used to classify legal devices and reject illegal devices.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122263872","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}

引用次数: 12

Data Anonymization for Big Crowdsourcing Data 大众包数据的数据匿名化

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093748

Xiaofeng Deng, Fan Zhang, Hai Jin

{"title":"Data Anonymization for Big Crowdsourcing Data","authors":"Xiaofeng Deng, Fan Zhang, Hai Jin","doi":"10.1109/infocomwkshps47286.2019.9093748","DOIUrl":"https://doi.org/10.1109/infocomwkshps47286.2019.9093748","url":null,"abstract":"In traditional database systems, data anonymization has been extensively studied, it provides an effective solution for data privacy preservation, and multidimensional anonymization scheme among them is widely used. However, without delicate parameter settings, these technologies may cause uncontrollable information loss and decrease the accuracy of data analytic tasks. Furthermore, crowdsourcing data is usually huge in amount and must be distributed stored in clouds, which makes the conventional data anonymization technologies not applicable. In this paper, we propose a framework that uses MapReduce to anonymize large-scale data before disseminating them to human workers. In order to guarantee the number and distribution of data records to be similar in all nodes, our framework first redistributes the original data to all participating nodes. Then a heuristic two-phase anonymization schema, which can be seamlessly integrated into the framework, is proposed. Experimental results show that with the same objective of privacy, our approach is scalable for large-scale data and can improve the average accuracy of human worker’s analytic tasks.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"36 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127445722","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

Protection Research of Sink Location Privacy in Underwater Sensor Networks 水下传感器网络中Sink位置隐私保护研究

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093749

Xiaoning Feng, Zhuo Wang, Ning Han

引用次数: 1

Internet of Thing Wireless Sensor Entity Authentication Scheme Based on Merkle 基于Merkle的物联网无线传感器实体认证方案

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093765

Jianguo Sun, Duo Liu, Libo Yin, Ge Zhang, Sizhao Li

引用次数: 3

From centralized to decentralized blockchain-based product registration systems: the use case of lighting and appliances 从集中式到分散式基于区块链的产品注册系统:照明和电器的用例

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/INFCOMW.2019.8845267

Rafael Angarita, Alexandre Dejous, Patrick Blake

{"title":"From centralized to decentralized blockchain-based product registration systems: the use case of lighting and appliances","authors":"Rafael Angarita, Alexandre Dejous, Patrick Blake","doi":"10.1109/INFCOMW.2019.8845267","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845267","url":null,"abstract":"In the last years, lighting only accounted for more than 15% of global electricity consumption. Moreover, we expect a high increase of energy consumption in the next years due to the large growth in lighting and appliances usage in developing economies. As the United Nations Secretary-Generals Sustainable Energy for All initiative identified, there exists a high potential of reducing the world's greenhouse gas emissions by improving the energy efficiency of lighting and appliances. For that, we have developed in the past a “centralized” product registration system to allow suppliers, manufactures, or traders to register their products to enter into a market. This product registration system is a crucial tool for identifying non-compliant, inefficient products. It serves as an entry-point for testers and regulators to examine the energy efficiency of the registered products, verify if they satisfy the minimum standards, and decide to let them enter into their markets. Our product registration system, as well as any other centralized implementation, suffers from isolated data storage hindering the collaboration between different markets from both governance and technical perspectives. In this paper, we examine the limits of centralized product registration systems and the advantages of a decentralized model based on the blockchain. Our analysis and prototype suggest that a blockchain-based product registration system can help to reduce the barriers between markets and play an important role in the quest for energy efficiency.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131095304","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

Blockchain–Based Location Proof Generation and Verification 基于区块链的位置证明生成和验证

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/INFOCOMWKSHPS47286.2019.9093768

Mohammad Reza Nosouhi, Shui Yu, M. Grobler, Qingyi Zhu, Yong Xiang

{"title":"Blockchain–Based Location Proof Generation and Verification","authors":"Mohammad Reza Nosouhi, Shui Yu, M. Grobler, Qingyi Zhu, Yong Xiang","doi":"10.1109/INFOCOMWKSHPS47286.2019.9093768","DOIUrl":"https://doi.org/10.1109/INFOCOMWKSHPS47286.2019.9093768","url":null,"abstract":"In location–sensitive applications, service providers need to verify the location of users in order to provide them with access to a service or benefit. This provides dishonest users with an incentive to cheat on their location by submitting fake location claims. To address this issue, a number of location proof mechanisms have been proposed in literature to date. However, they are faced with different security and privacy challenges. In this paper, we utilize the unique features of the blockchain technology to design a decentralized architecture in which mobile users act as witnesses and generate location proofs for other users. In the proposed scheme, a location proof is issued as part of a transaction that is broadcasted into a peer–to–peer network where it can be picked up by verifiers for further verification. Once a transaction is successfully verified, it is stored in a public ledger. Our security and privacy analysis shows that the proposed scheme preserves users’ privacy and achieves a reliable performance against Prover–Prover and Prover–Witness collusions. Moreover, our prototype implementation on the Android platform shows that the location proof generation process in the proposed scheme is faster than the current decentralized schemes and requires low computational resources.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133145841","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

Demo: Simulating a 6TiSCH Network using Connectivity Traces from Testbeds 演示:使用试验台的连接轨迹模拟6TiSCH网络

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/INFCOMW.2019.8845200

Yasuyuki Tanaka, Keoma Brun-Laguna, T. Watteyne

{"title":"Demo: Simulating a 6TiSCH Network using Connectivity Traces from Testbeds","authors":"Yasuyuki Tanaka, Keoma Brun-Laguna, T. Watteyne","doi":"10.1109/INFCOMW.2019.8845200","DOIUrl":"https://doi.org/10.1109/INFCOMW.2019.8845200","url":null,"abstract":"The 6TiSCH simulator is an existing Python-based simulation tool that captures the full behavior of 6TiSCH, the Industrial IoT protocol stack standardized by the IETF. The existing 6TiSCH simulator uses a radio propagation model. In this demo, we present an extension to the 6TiSCH simulator which allows a simulation to be run against connectivity traces previously gathered on testbeds and real-world deployments. We demonstrate four elements. First, Mercator, the OpenWSN-based tool we developed to collect connectivity traces from different testbeds. Second, K7, the generic format we defined for these connectivity traces. Third, the set of 17 connectivity traces we gathered from testbeds and real-world deployments, and which are publicly available. Fourth, the extension of the 6TiSCH simulator which enables it to replay K7 connectivity traces rather than using a propagation model. Using connectivity traces for simulation is a way to increase the confidence the result are representative of a real-world deployment. Furthermore, it allows better repeatability than re-running an experiment on a testbed where the connectivity necessarily changes over time.","PeriodicalId":321862,"journal":{"name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)","volume":"87 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131968611","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

Demo Abstract: Spatial modulation based transmission using a reconfigurable antenna 摘要:基于空间调制的可重构天线传输

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/INFCOMW.2019.8845164

Y. Kokar, K. Rachedi, A. Ourir, J. Rosny, D. P. Huy, Jean-Christophe Prévotet, M. Hélard

引用次数: 4

Wireless Physical-Layer Identification Assisted 5G Network Security 无线物理层识别辅助5G网络安全

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS) Pub Date : 2019-04-29 DOI: 10.1109/infocomwkshps47286.2019.9093751

Jie Chang, Yihan Xiao, Zhen Zhang

引用次数: 4