Nickson M. Karie, V. Kebande, R. Ikuesan, Mehdi Sookhak, H. Venter
Even though the cloud paradigm and its associated services has been adopted in various enterprise applications, there has been major issues with regard to authenticating users' critical data. Single Sign on (SSO) is a user authentication technique through which a server authenticates and allows a user to use a single aspect of login credentials, for example, to access multiple services in the cloud. Even though SSO reduces the number of logins that are needed over heterogeneous environments, the risk that might be associated with the security of SSO might be detrimental if, for example, a Man-in-the Middle (MITM) attacker manages to gain control of the SSO credentials. It is also possible to get the identity of the users who have logged into Active Directory or intranet and this identity can easily be used to log into other web-based applications, and this requires the use of the Security Assertion Mark-up Language (SAML). SAML is basically a standard that allows users to be logged into applications as per their sessions. The problem that this paper addresses is the lack of a proactive technique of hardening cloud-based SAML while combining SSO with a Multi-Factor Authentication (MFA) at the time of writing this paper. The authors have, therefore, proposed an effective approach that unifies SSO with MFA in this context. Based on the base score index conducted over Common Vulnerability Scoring System (CVSS), the architecture proves to be reliable, feasible and with better performance.
{"title":"Hardening SAML by Integrating SSO and Multi-Factor Authentication (MFA) in the Cloud","authors":"Nickson M. Karie, V. Kebande, R. Ikuesan, Mehdi Sookhak, H. Venter","doi":"10.1145/3386723.3387875","DOIUrl":"https://doi.org/10.1145/3386723.3387875","url":null,"abstract":"Even though the cloud paradigm and its associated services has been adopted in various enterprise applications, there has been major issues with regard to authenticating users' critical data. Single Sign on (SSO) is a user authentication technique through which a server authenticates and allows a user to use a single aspect of login credentials, for example, to access multiple services in the cloud. Even though SSO reduces the number of logins that are needed over heterogeneous environments, the risk that might be associated with the security of SSO might be detrimental if, for example, a Man-in-the Middle (MITM) attacker manages to gain control of the SSO credentials. It is also possible to get the identity of the users who have logged into Active Directory or intranet and this identity can easily be used to log into other web-based applications, and this requires the use of the Security Assertion Mark-up Language (SAML). SAML is basically a standard that allows users to be logged into applications as per their sessions. The problem that this paper addresses is the lack of a proactive technique of hardening cloud-based SAML while combining SSO with a Multi-Factor Authentication (MFA) at the time of writing this paper. The authors have, therefore, proposed an effective approach that unifies SSO with MFA in this context. Based on the base score index conducted over Common Vulnerability Scoring System (CVSS), the architecture proves to be reliable, feasible and with better performance.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131257449","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}
The internet multimedia subsystem (IMS) has been upgraded to support Peer-to-Peer (P2P) content distribution services. Bittorent can be used with IMS, it uses an scalable process of content distribution. BitTorrent is a P2P file-sharing application designed to distribute large files to a large user population efficiently. This is done by making use of the upload bandwidth of all nodes (called peers) downloading the file. The peer heterogeneity constraint imposes a challenge that is the guarantee of a certain level of Quality of Service (QoS) of the video for the different peers, and the transfer poses a challenge for maintaining quality of service (QoS) in IMS. In parallel of P2P development, recently, video coding standards have appeared, which are enabling the deployment of video content delivery over Internet in real-time with high QoS. In this article we have linked the Scalable Video Coding (SVC) quality adaptation model with the BitTorrent protocol and the IMS network, knowing that the file to be downloaded by the Bittorrent protocol is divided into several chunks, we exploited the chunks selection technique used by Bittorrent to link the SVC coding quality adaptation model with the bittorrent protocol and the P2P IMS network. We performed several simulations with the bittorent protocol to extract the following parameters(Start Time, first Chunk Time, last Chunk Time, Stop Time, dwonload Duration), we made a comparison between the P2P Bittorent protocol and the P2P Zeta protocol.
internet多媒体子系统(IMS)已经升级为支持点对点(P2P)内容分发服务。bittorrent可以与IMS一起使用，它使用可扩展的内容分发过程。BitTorrent是一个P2P文件共享应用程序，旨在有效地将大文件分发给大量用户。这是通过利用下载文件的所有节点(称为对等节点)的上传带宽来完成的。对等体异构约束对保证不同对等体的视频具有一定的服务质量(QoS)提出了挑战，而传输对IMS中保持服务质量(QoS)提出了挑战。在P2P发展的同时，近年来出现了视频编码标准，这些标准使视频内容在互联网上实时、高QoS的传输成为可能。本文将可扩展视频编码(Scalable Video Coding, SVC)质量自适应模型与BitTorrent协议和IMS网络相连接，了解到BitTorrent协议要下载的文件被分成几个块，我们利用BitTorrent使用的块选择技术将SVC编码质量自适应模型与BitTorrent协议和P2P IMS网络相连接。我们对bittorent协议进行了多次模拟，提取了以下参数(Start Time, first Chunk Time, last Chunk Time, Stop Time, download Duration)，并对P2P bittorent协议和P2P Zeta协议进行了比较。
{"title":"Adaptation of quality for video streaming in a Bittorrent P2P IMS network","authors":"A. Ghani, E. I. Elhaj, A. Hammouch, A. Chaoub","doi":"10.1145/3386723.3387824","DOIUrl":"https://doi.org/10.1145/3386723.3387824","url":null,"abstract":"The internet multimedia subsystem (IMS) has been upgraded to support Peer-to-Peer (P2P) content distribution services. Bittorent can be used with IMS, it uses an scalable process of content distribution. BitTorrent is a P2P file-sharing application designed to distribute large files to a large user population efficiently. This is done by making use of the upload bandwidth of all nodes (called peers) downloading the file. The peer heterogeneity constraint imposes a challenge that is the guarantee of a certain level of Quality of Service (QoS) of the video for the different peers, and the transfer poses a challenge for maintaining quality of service (QoS) in IMS. In parallel of P2P development, recently, video coding standards have appeared, which are enabling the deployment of video content delivery over Internet in real-time with high QoS. In this article we have linked the Scalable Video Coding (SVC) quality adaptation model with the BitTorrent protocol and the IMS network, knowing that the file to be downloaded by the Bittorrent protocol is divided into several chunks, we exploited the chunks selection technique used by Bittorrent to link the SVC coding quality adaptation model with the bittorrent protocol and the P2P IMS network. We performed several simulations with the bittorent protocol to extract the following parameters(Start Time, first Chunk Time, last Chunk Time, Stop Time, dwonload Duration), we made a comparison between the P2P Bittorent protocol and the P2P Zeta protocol.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124458045","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}
The configurable process model is an important approach to reduce the redundancy involved in modeling, reengineering, and adapting a business process with its environment. While process mining approaches aim to discover and, verify conformance and enhance a process, connecting configurable processes and process mining shows considerable improvements, especially in terms of time and cost. However, the configurable process has rarely been applied in change mining. Our goal in this paper is to highlight the importance of using variability to improve change mining from a collection of event logs. We propose a framework that can detect and recommend changes, by mining changes from a collection of event logs. The main purpose is to allow engineers and business process designers to easily adjust business process with the environment changes.
{"title":"A new Framework to improve Change Mining in Configurable Process","authors":"A. Hmami, Hanae Sbaï, M. Fredj","doi":"10.1145/3386723.3387853","DOIUrl":"https://doi.org/10.1145/3386723.3387853","url":null,"abstract":"The configurable process model is an important approach to reduce the redundancy involved in modeling, reengineering, and adapting a business process with its environment. While process mining approaches aim to discover and, verify conformance and enhance a process, connecting configurable processes and process mining shows considerable improvements, especially in terms of time and cost. However, the configurable process has rarely been applied in change mining. Our goal in this paper is to highlight the importance of using variability to improve change mining from a collection of event logs. We propose a framework that can detect and recommend changes, by mining changes from a collection of event logs. The main purpose is to allow engineers and business process designers to easily adjust business process with the environment changes.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125019435","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}
Internet of Things (IoT) contributes to development of world through its technological contributions and its daily applications. Several technologies and protocols are used for the implementation of new applications allowing physical objects to connect with each other in support of smart decision-making. To provide efficient and reliable services to its end-users, it guarantees the quality of its pragmatic use by referring to QoS criteria.This implies efficient management of the quality of service in IoT systems in order to meet requirements of their applications. In this paper, we offer an analysis of quality of service mechanisms of communication protocols in IoT environment. This study opens a new perspective of dynamic QoS management.
{"title":"A Survey on QoS-based communication protocols for IoT systems","authors":"Nogaye Lo, I. Niang","doi":"10.1145/3386723.3387834","DOIUrl":"https://doi.org/10.1145/3386723.3387834","url":null,"abstract":"Internet of Things (IoT) contributes to development of world through its technological contributions and its daily applications. Several technologies and protocols are used for the implementation of new applications allowing physical objects to connect with each other in support of smart decision-making. To provide efficient and reliable services to its end-users, it guarantees the quality of its pragmatic use by referring to QoS criteria.This implies efficient management of the quality of service in IoT systems in order to meet requirements of their applications. In this paper, we offer an analysis of quality of service mechanisms of communication protocols in IoT environment. This study opens a new perspective of dynamic QoS management.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123895887","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}
In this paper, we propose a new prediction system in real time using Big Data to improve the VANET network. Firstly, The Traffic density and average speed are calculated in each section of road, and then the risk of vehicle accident is predicted in instantaneous manner with parallel data processing, which makes execution faster.
{"title":"Real-time Prediction of Accident using Big Data System","authors":"Mouad Tantaoui, M. Laanaoui, M. Kabil","doi":"10.1145/3386723.3387886","DOIUrl":"https://doi.org/10.1145/3386723.3387886","url":null,"abstract":"In this paper, we propose a new prediction system in real time using Big Data to improve the VANET network. Firstly, The Traffic density and average speed are calculated in each section of road, and then the risk of vehicle accident is predicted in instantaneous manner with parallel data processing, which makes execution faster.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122822447","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}
E. Zigh, Ayoub Elhoucine, Abderrahmane Mallek, M. Kadiri, Kouninef Belkacem, T. Ensari
Learning should be the preparation of young students (kids) for new ways of thinking: ways that involve creativity, critical analysis, problem solving and decision-making. We propose in this article, a smartphone learning approach using a designed robot car for children. It is a package that could been introduced for kids edutainment in Algeria. In order to be exploited outside Algeria, a software part could been modified according to the educational need of other kids around the world. A designed package includes an android application and a robot car. This last is remotes controlled via a smartphone application. This software part consists into three edutainment games quiz related to three levels respectively. Therefore, the further kid moves into the game, the more control he has over the robot car. A child is enjoying his educational toy and learning in attractive context at the same time. The remote control results are validated, using hardware prototype.
{"title":"Smartphone learning for Kids edutainment","authors":"E. Zigh, Ayoub Elhoucine, Abderrahmane Mallek, M. Kadiri, Kouninef Belkacem, T. Ensari","doi":"10.1145/3386723.3387862","DOIUrl":"https://doi.org/10.1145/3386723.3387862","url":null,"abstract":"Learning should be the preparation of young students (kids) for new ways of thinking: ways that involve creativity, critical analysis, problem solving and decision-making. We propose in this article, a smartphone learning approach using a designed robot car for children. It is a package that could been introduced for kids edutainment in Algeria. In order to be exploited outside Algeria, a software part could been modified according to the educational need of other kids around the world. A designed package includes an android application and a robot car. This last is remotes controlled via a smartphone application. This software part consists into three edutainment games quiz related to three levels respectively. Therefore, the further kid moves into the game, the more control he has over the robot car. A child is enjoying his educational toy and learning in attractive context at the same time. The remote control results are validated, using hardware prototype.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125052090","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}
Elliptic curve cryptography (ECC) is strongly requested for encryption and decryption processes since its guarantees high level of data security, insured by small key sizes that usually lead to fast algorithms. Such processes can only deal with points on elliptic curves on which the message has to be mapped. In this paper, we define a new message mapping algorithm coupled with Elgamal encryption based on an elliptic curve defined over a finite prime field. The established algorithm will be implemented and discussed for a chosen plaintext corresponding to an integer message. Our numerical tests demonstrate that the execution time of the message mapping, encryption, reverse message mapping and decryption, increase linearly versus data sizes. These results are promising for the design of fast and secure cryptosystems desirable for implementations on constrained environments.
{"title":"Definition and Implementation of an Elliptic Curve Cryptosystem using a New Message Mapping Scheme","authors":"Lahraoui Younes, Amal Youssef, S. Lazaar","doi":"10.1145/3386723.3387893","DOIUrl":"https://doi.org/10.1145/3386723.3387893","url":null,"abstract":"Elliptic curve cryptography (ECC) is strongly requested for encryption and decryption processes since its guarantees high level of data security, insured by small key sizes that usually lead to fast algorithms. Such processes can only deal with points on elliptic curves on which the message has to be mapped. In this paper, we define a new message mapping algorithm coupled with Elgamal encryption based on an elliptic curve defined over a finite prime field. The established algorithm will be implemented and discussed for a chosen plaintext corresponding to an integer message. Our numerical tests demonstrate that the execution time of the message mapping, encryption, reverse message mapping and decryption, increase linearly versus data sizes. These results are promising for the design of fast and secure cryptosystems desirable for implementations on constrained environments.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"23 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123732089","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}
Across the world, there are several factors attributed to high crime rates. The prevention of and the fight against crimes is a major concern of all countries. In the era of globalization and new information and communication technologies, reducing these crimes rate by using conventional methods (law enforcement, social interventions...) are not enough. In fact, they have many limits. Today, by analyzing a large volume of crimes data with machine learning algorithms, researchers can take important advantage of these technologies, especially in the context of the world's famous problem of recidivism. By using these recent innovations, security departments can predict how, when, and where reoffending will happen before it actually happens. However, the efficiency, the quality, and the accuracy of these forcasting models and software depend on several factors. The process of feature selection is one of these key factors. By improving the quality of this process, we can reduce over fitting and eliminating redundant data as well as training time. In this context, this investigation paid particular attention to the process of recidivism features selection (first phase of our future recidivism forcasting framework). Based on detailed study of recidivism theoretical factors, previous and recent methods used in recidivism features selection, we present a comparative study on all key elements used in this phase (features, categories of features and methods of features selection). Our main objective is to prepare an important knowledge database for recidivism features. This database will take into account different sets of recidivism features obtained by all previous and recent projects. It will also be used in our recidivism forcasting framework.
{"title":"Recidivism forecasting: A study on process of feature selection","authors":"A. Azeroual, Youssef Taher, B. Nsiri","doi":"10.1145/3386723.3387848","DOIUrl":"https://doi.org/10.1145/3386723.3387848","url":null,"abstract":"Across the world, there are several factors attributed to high crime rates. The prevention of and the fight against crimes is a major concern of all countries. In the era of globalization and new information and communication technologies, reducing these crimes rate by using conventional methods (law enforcement, social interventions...) are not enough. In fact, they have many limits. Today, by analyzing a large volume of crimes data with machine learning algorithms, researchers can take important advantage of these technologies, especially in the context of the world's famous problem of recidivism. By using these recent innovations, security departments can predict how, when, and where reoffending will happen before it actually happens. However, the efficiency, the quality, and the accuracy of these forcasting models and software depend on several factors. The process of feature selection is one of these key factors. By improving the quality of this process, we can reduce over fitting and eliminating redundant data as well as training time. In this context, this investigation paid particular attention to the process of recidivism features selection (first phase of our future recidivism forcasting framework). Based on detailed study of recidivism theoretical factors, previous and recent methods used in recidivism features selection, we present a comparative study on all key elements used in this phase (features, categories of features and methods of features selection). Our main objective is to prepare an important knowledge database for recidivism features. This database will take into account different sets of recidivism features obtained by all previous and recent projects. It will also be used in our recidivism forcasting framework.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520106","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}
Cybersecurity is a growing field that requires a lot of attention due to the remarkable progress made in social networks, cloud and web technologies, online banking, mobile environment, smart networks, etc. Various approaches have been developed to solve many computer security problems, including those based on machine learning. This paper examines and highlights the various works using machine learning in network security. Two types of detection are discussed. Phishing detection and Spam detection. For each type, related work is presented and some proposed methods in the literature are compared taking into account their accuracy and other characteristics.
{"title":"Using machine learning to deal with Phishing and Spam Detection: An overview","authors":"Oumaima El Kouari, H. Benaboud, S. Lazaar","doi":"10.1145/3386723.3387891","DOIUrl":"https://doi.org/10.1145/3386723.3387891","url":null,"abstract":"Cybersecurity is a growing field that requires a lot of attention due to the remarkable progress made in social networks, cloud and web technologies, online banking, mobile environment, smart networks, etc. Various approaches have been developed to solve many computer security problems, including those based on machine learning. This paper examines and highlights the various works using machine learning in network security. Two types of detection are discussed. Phishing detection and Spam detection. For each type, related work is presented and some proposed methods in the literature are compared taking into account their accuracy and other characteristics.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133726997","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}
El Bouti Mohamed, El Ghazi Raouan, Benameur Lamia, A. Jihane
In this paper, a new approach to resolve the problem of frequency assignment problem is proposed. (FAP) is well known in the NP-complete problems and can be modeled as an optimization problem, which the objective is to minimize the costs due to interference generated by a solution. The fireworks algorithm (FWA) is proposed for solving FAP. FWA is a recently developed swarm intelligence algorithm. FWA is a meta-heuristic method and has a good convergence property and can always find the global optimal solutions.
{"title":"Fireworks Algorithm for Frequency Assignment Problem","authors":"El Bouti Mohamed, El Ghazi Raouan, Benameur Lamia, A. Jihane","doi":"10.1145/3386723.3387823","DOIUrl":"https://doi.org/10.1145/3386723.3387823","url":null,"abstract":"In this paper, a new approach to resolve the problem of frequency assignment problem is proposed. (FAP) is well known in the NP-complete problems and can be modeled as an optimization problem, which the objective is to minimize the costs due to interference generated by a solution. The fireworks algorithm (FWA) is proposed for solving FAP. FWA is a recently developed swarm intelligence algorithm. FWA is a meta-heuristic method and has a good convergence property and can always find the global optimal solutions.","PeriodicalId":139072,"journal":{"name":"Proceedings of the 3rd International Conference on Networking, Information Systems & Security","volume":"178 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-03-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130003406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：