Pub Date : 2015-12-01DOI: 10.1109/IntelCIS.2015.7397224
Amr S. Abdelfattah, T. Abdelkader, El-Sayed M. El-Horbaty
The Mobile intermittent wireless connectivity limits the evolution of the mobile landscape, such that this progress coupled with the ubiquitous nature of the Internet and the web services. The web service Reliability achieves the low overhead communication and retrieves the appropriate state response from the web service consumption. This paper discusses and analyzes the most recent approaches that achieve the reliability of web services consumed by mobile devices. Achieving the reliable web service consumption is tended to two approaches: Middleware approach and Mobile Agent (MA) approach. Both of them focus on ensuring the request execution under the communication limitations and services temporary unavailability.
{"title":"Reliable web services approaches of Mobile Cloud Computing: A comparative study","authors":"Amr S. Abdelfattah, T. Abdelkader, El-Sayed M. El-Horbaty","doi":"10.1109/IntelCIS.2015.7397224","DOIUrl":"https://doi.org/10.1109/IntelCIS.2015.7397224","url":null,"abstract":"The Mobile intermittent wireless connectivity limits the evolution of the mobile landscape, such that this progress coupled with the ubiquitous nature of the Internet and the web services. The web service Reliability achieves the low overhead communication and retrieves the appropriate state response from the web service consumption. This paper discusses and analyzes the most recent approaches that achieve the reliability of web services consumed by mobile devices. Achieving the reliable web service consumption is tended to two approaches: Middleware approach and Mobile Agent (MA) approach. Both of them focus on ensuring the request execution under the communication limitations and services temporary unavailability.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90821391","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397193
Hamed Al-Rubaiee, Renxi Qiu, Dayou Li
Sentiment analysis has become the heart of social media research and many studies have been applied to obtain users' opinion in fields such as electronic commerce and trade, management and also regarding political figures. Social media has recently become a rich resource in mining user sentiments. Social opinion has been analysed using sentiment analysis and some studies show that sentiment analysis of news, documents, quarterly reports, and blogs can be used as part of trading strategies. In this paper, Twitter has been chosen as a platform for opinion mining in trading strategy with the Saudi stock market in order to carry out and illustrate the relationship between Saudi tweets (that is standard and Arabian Gulf dialects) and the Saudi market index. To the best of our knowledge, this is the first study performed on Saudi tweets and the Saudi stock market.
{"title":"Analysis of the relationship between Saudi twitter posts and the Saudi stock market","authors":"Hamed Al-Rubaiee, Renxi Qiu, Dayou Li","doi":"10.1109/INTELCIS.2015.7397193","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397193","url":null,"abstract":"Sentiment analysis has become the heart of social media research and many studies have been applied to obtain users' opinion in fields such as electronic commerce and trade, management and also regarding political figures. Social media has recently become a rich resource in mining user sentiments. Social opinion has been analysed using sentiment analysis and some studies show that sentiment analysis of news, documents, quarterly reports, and blogs can be used as part of trading strategies. In this paper, Twitter has been chosen as a platform for opinion mining in trading strategy with the Saudi stock market in order to carry out and illustrate the relationship between Saudi tweets (that is standard and Arabian Gulf dialects) and the Saudi market index. To the best of our knowledge, this is the first study performed on Saudi tweets and the Saudi stock market.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86612699","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397226
Marwah Hashim Eawna, Salma Hamdy, El-Sayed M. El-Horbaty
Cloud Computing is an emerging trend in the outsourced information technology (OIT) and provides a lot of functions as services. However, it suffers from many challenges such as resource provisioning, integrity, federation, and security. This paper focuses on the major problem, resource provisioning, that explored by many companies and researchers as a critical problem. Such researches are attempted to find method that minimizes provisioning time and reduces the number of resources in the cloud environment. Consequently, this paper proposes a dynamic resources provisioning algorithm by using Artificial Bees Colony (ABC) and Ant Colony Optimization (ACO) and focus on time optimization in multi-tier clouds. Accordingly, the obtained results show that the ACO faster than other meta-heuristic algorithm such as ABC, Particle Swarm Optimization (PSO), Simulated Annealing (SA) and hybrid Particle Swarm Optimization-Simulated Annealing (PSO-SA).
{"title":"New trends of resource provisioning in multi-tier Cloud computing","authors":"Marwah Hashim Eawna, Salma Hamdy, El-Sayed M. El-Horbaty","doi":"10.1109/INTELCIS.2015.7397226","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397226","url":null,"abstract":"Cloud Computing is an emerging trend in the outsourced information technology (OIT) and provides a lot of functions as services. However, it suffers from many challenges such as resource provisioning, integrity, federation, and security. This paper focuses on the major problem, resource provisioning, that explored by many companies and researchers as a critical problem. Such researches are attempted to find method that minimizes provisioning time and reduces the number of resources in the cloud environment. Consequently, this paper proposes a dynamic resources provisioning algorithm by using Artificial Bees Colony (ABC) and Ant Colony Optimization (ACO) and focus on time optimization in multi-tier clouds. Accordingly, the obtained results show that the ACO faster than other meta-heuristic algorithm such as ABC, Particle Swarm Optimization (PSO), Simulated Annealing (SA) and hybrid Particle Swarm Optimization-Simulated Annealing (PSO-SA).","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75995607","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397286
Nehal Magdy, M. Sakr, T. Mostafa, Khaled El-Bahnasy
The availability of devices that can be used to track moving objects has increased dramatically leading to a great growth in movement data from almost every application domain. Therefore, there has been an increasing interest in proposing new methodologies for indexing, classifying, clustering, querying and measuring similarity between moving objects' data. One of the main functions for a wide range of application domains is to measure the similarity between two moving objects' trajectories. In this paper, we present a comparative study between widely used trajectory similarity measures observing the advantages and disadvantages of these measures.
{"title":"Review on trajectory similarity measures","authors":"Nehal Magdy, M. Sakr, T. Mostafa, Khaled El-Bahnasy","doi":"10.1109/INTELCIS.2015.7397286","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397286","url":null,"abstract":"The availability of devices that can be used to track moving objects has increased dramatically leading to a great growth in movement data from almost every application domain. Therefore, there has been an increasing interest in proposing new methodologies for indexing, classifying, clustering, querying and measuring similarity between moving objects' data. One of the main functions for a wide range of application domains is to measure the similarity between two moving objects' trajectories. In this paper, we present a comparative study between widely used trajectory similarity measures observing the advantages and disadvantages of these measures.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91522716","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397242
S. M. Nafea, L. Maglaras, F. Siewe, M. E. Shehab
The success of web technologies has prompted a developing consideration on e-learning activities. Notwithstanding, most current e-Learning systems give static web-based learning with the goal that learners get to the same learning contents through the web, regardless of individual learners profiles. These learners may have altogether different learning foundations, information levels, learning styles, and capacities. The `one size fit all' in an e-Learning frameworks is unmistakably a commonplace issue. To defeat this impediment and build powerful learning, versatile and customized learning is as of now a dynamic examination range. This paper propose a novel approach for designing and implementing adaptive learning management system based on ontology and semantic web technologies by offering a tailored model which represents the different activities that should be completed by learner. It offers a framework that is based on both learning styles and ontology to address the impact of student behavior.
{"title":"A novel adaptive learning management system using ontology","authors":"S. M. Nafea, L. Maglaras, F. Siewe, M. E. Shehab","doi":"10.1109/INTELCIS.2015.7397242","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397242","url":null,"abstract":"The success of web technologies has prompted a developing consideration on e-learning activities. Notwithstanding, most current e-Learning systems give static web-based learning with the goal that learners get to the same learning contents through the web, regardless of individual learners profiles. These learners may have altogether different learning foundations, information levels, learning styles, and capacities. The `one size fit all' in an e-Learning frameworks is unmistakably a commonplace issue. To defeat this impediment and build powerful learning, versatile and customized learning is as of now a dynamic examination range. This paper propose a novel approach for designing and implementing adaptive learning management system based on ontology and semantic web technologies by offering a tailored model which represents the different activities that should be completed by learner. It offers a framework that is based on both learning styles and ontology to address the impact of student behavior.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87062705","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397267
Mohamed H. Elgazzar
In the last years, the Machine-to-Machine (M2M) communications evolved as one of the major trends shaping the development of services in the future Internet. The use of M2M technologies is rapidly increasing in different fields such as Health Care, Automotive, Energy, Consumer Electronics, manufacturing, security and Banking. With that rapid increase different protocols had been developed for M2M communications and device management such as CoAP, MQTT and LwM2M. The objective of the paper is to provide synopsis of the different M2M protocols. The paper discusses the pros and cons of each of the protocols and identify their open problems. Up to our knowledge, it is the first study to provide such comparison between the different M2M protocol. The comparison is based on supported functions, network overhead, network reliability and security beside highlighting the different protocol architectures. The paper works as a start point for producing efficient M2M protocols.
{"title":"Perspectives on M2M protocols","authors":"Mohamed H. Elgazzar","doi":"10.1109/INTELCIS.2015.7397267","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397267","url":null,"abstract":"In the last years, the Machine-to-Machine (M2M) communications evolved as one of the major trends shaping the development of services in the future Internet. The use of M2M technologies is rapidly increasing in different fields such as Health Care, Automotive, Energy, Consumer Electronics, manufacturing, security and Banking. With that rapid increase different protocols had been developed for M2M communications and device management such as CoAP, MQTT and LwM2M. The objective of the paper is to provide synopsis of the different M2M protocols. The paper discusses the pros and cons of each of the protocols and identify their open problems. Up to our knowledge, it is the first study to provide such comparison between the different M2M protocol. The comparison is based on supported functions, network overhead, network reliability and security beside highlighting the different protocol architectures. The paper works as a start point for producing efficient M2M protocols.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88942498","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397261
Taha M. Mohamed
Breast cancer is one of the most dangerous cancers in the world especially in the Arab countries and Egypt. Due to the large spreading of the disease, automatic recognition systems can help physicians to classify the tumors as benign or malignant. However, performing a lot of pathological analysis consumes time and money. In this paper, we propose an algorithm for decreasing the number of features required to detect the tumor. Two classifiers are chosen to test the classification accuracy; linear and quadratic. The experimental results show that, there are strong correlations between the features in the data set. When using the sequential feature selection algorithm, results show that, discarding more than 50% of the features has no significant loss on classification accuracy when using the quadratic discriminate classifier. Additionally, only four PCA components can be used with the same accuracy as using nine components when being classified by the linear discriminate classifier. Additionally, the outliers in the data set have no notable effect on the classification accuracy. The data set is proved to be homogenous using the k-means clustering algorithm.
{"title":"Efficient breast cancer detection using sequential feature selection techniques","authors":"Taha M. Mohamed","doi":"10.1109/INTELCIS.2015.7397261","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397261","url":null,"abstract":"Breast cancer is one of the most dangerous cancers in the world especially in the Arab countries and Egypt. Due to the large spreading of the disease, automatic recognition systems can help physicians to classify the tumors as benign or malignant. However, performing a lot of pathological analysis consumes time and money. In this paper, we propose an algorithm for decreasing the number of features required to detect the tumor. Two classifiers are chosen to test the classification accuracy; linear and quadratic. The experimental results show that, there are strong correlations between the features in the data set. When using the sequential feature selection algorithm, results show that, discarding more than 50% of the features has no significant loss on classification accuracy when using the quadratic discriminate classifier. Additionally, only four PCA components can be used with the same accuracy as using nine components when being classified by the linear discriminate classifier. Additionally, the outliers in the data set have no notable effect on the classification accuracy. The data set is proved to be homogenous using the k-means clustering algorithm.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86139010","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397268
Ahmed E. Abdel Raouf, N. Badr, M. Tolba
Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.
{"title":"An optimized scheme for vertical fragmentation, allocation and replication of a distributed database","authors":"Ahmed E. Abdel Raouf, N. Badr, M. Tolba","doi":"10.1109/INTELCIS.2015.7397268","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397268","url":null,"abstract":"Distributed databases have become the most essential technology for recent business organizations. One of the main issues of the distributed database management system (DDBMS) is the distributed database design. The performance and efficiency of a distributed database design largely depend on the fragmentation of global relations. It also depends on the allocation and replication of those fragments to several sites of the network. Earlier approaches suggest vertical fragmentation solutions based on the frequency of the user queries. However, these approaches have the limitation of higher complexity and availability of the frequency of user queries at the initial stage of the database design, iterative binary partitioning in case of n-ary partitioning which will increase the complexity and predetermined threshold value that is used to enhance the results, as well as the problem of more computation. Consequently in this paper, we present a vertical fragmentation, allocation and replication scheme of a distributed database called (VFAR). The proposed scheme partitions the distributed database relations vertically at the initial stage of distributed database design, without the need for the frequency of user queries which are not available at this stage. It also allocates and replicates the resulted fragments to the sites of the distributed database, using manipulates and read operations of each site to each fragment. Experimental results showed that firstly; the proposed scheme reduces the overheads and the complexity of complicated computations of previous vertical partitioning approaches. Secondly, it solves the problem of the frequency of the user queries that are not available at the initial stage. Thirdly, it solves the problem of iterative binary partitioning in the case of n-ary partitioning by generating all fragments of one iteration. Finally, it gets the optimal results without the need to determine a threshold value that is used to enhance the results.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84612180","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}
Pub Date : 2015-12-01DOI: 10.1109/INTELCIS.2015.7397273
H. ElMadany, Marco Alfonse, M. Aref
eXtensible Markup Language (XML) is one of the standard data representation nowadays. It can be used in various applications as its flexibility and easy to use so the need to summarize XML document become increasingly an important topic to save time and cost. For these reasons, there are more interest for developing tools for summarizing XML Documents. This paper surveys different approaches for summarizing XML documents regarding to both its structure and content.
{"title":"XML summarization: A survey","authors":"H. ElMadany, Marco Alfonse, M. Aref","doi":"10.1109/INTELCIS.2015.7397273","DOIUrl":"https://doi.org/10.1109/INTELCIS.2015.7397273","url":null,"abstract":"eXtensible Markup Language (XML) is one of the standard data representation nowadays. It can be used in various applications as its flexibility and easy to use so the need to summarize XML document become increasingly an important topic to save time and cost. For these reasons, there are more interest for developing tools for summarizing XML Documents. This paper surveys different approaches for summarizing XML documents regarding to both its structure and content.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72978463","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}
Pub Date : 2015-12-01DOI: 10.1109/IntelCIS.2015.7397256
Mohammed Abdrabou, A. Elbayoumy, Essam Abd El-Wanis
Extensible Authentication Protocol (EAP) is an authentication framework in Long Term Evolution (LTE) networks. EAP-AKA is one of the methods of EAP which uses the Authentication and Key Agreement (AKA) mechanism based on challenge-response mechanisms, EAP-AKA is used in the 3rd generation mobile networks then modified and inherited to 4th generation mobile networks (LTE) as Evolved Packet System Authentication and Key Agreement (EPS-AKA) mechanism which is used when the user access the network through EUTRAN. EPS-AKA vulnerabilities are disclosure of the user identity, Man in the Middle attack and Denial of Services (DoS) attacks so a robust authentication mechanism must replace EPSAKA to avoid such attacks. In this paper, Modified Evolved Packet System Authentication and Key Agreement (MEPS-AKA) protocol based on Simple Password Exponential Key Exchange (SPEKE) and symmetric key cryptography is proposed to solve these problems by performing a pre-authentication procedure to generate a dynamic key every time user access to the network, also each message send or received is confidentially protected. Scyther tool is used to verify the efficiency of the proposed protocol. EPS-AKA and MEPS-AKA are simulated using C programming language to calculate the execution time for both algorithms. The proposed protocol is simulated using a client-server application program using C# programming language.
EAP (Extensible Authentication Protocol)是LTE (Long Term Evolution)网络中的一种认证框架。EAP-AKA是基于挑战-响应机制的认证和密钥协议(AKA)机制的EAP方法之一，EAP-AKA用于第三代移动网络，然后修改并继承到第四代移动网络(LTE)作为演进分组系统认证和密钥协议(EPS-AKA)机制，当用户通过EUTRAN访问网络时使用。EPS-AKA漏洞是用户身份泄露、中间人攻击和拒绝服务(DoS)攻击，因此必须有一个强大的身份验证机制取代EPSAKA来避免此类攻击。为了解决这些问题，本文提出了基于简单密码指数密钥交换(SPEKE)和对称密钥加密的改进进化分组系统认证与密钥协议(MEPS-AKA)协议，该协议在用户每次访问网络时执行预认证程序生成动态密钥，并对发送或接收的每条消息进行保密保护。使用Scyther工具验证了所提出协议的有效性。用C语言对EPS-AKA和MEPS-AKA进行了仿真，计算了两种算法的执行时间。采用c#编程语言，用客户端-服务器应用程序对所提出的协议进行了仿真。
{"title":"LTE Authentication Protocol (EPS-AKA) weaknesses solution","authors":"Mohammed Abdrabou, A. Elbayoumy, Essam Abd El-Wanis","doi":"10.1109/IntelCIS.2015.7397256","DOIUrl":"https://doi.org/10.1109/IntelCIS.2015.7397256","url":null,"abstract":"Extensible Authentication Protocol (EAP) is an authentication framework in Long Term Evolution (LTE) networks. EAP-AKA is one of the methods of EAP which uses the Authentication and Key Agreement (AKA) mechanism based on challenge-response mechanisms, EAP-AKA is used in the 3rd generation mobile networks then modified and inherited to 4th generation mobile networks (LTE) as Evolved Packet System Authentication and Key Agreement (EPS-AKA) mechanism which is used when the user access the network through EUTRAN. EPS-AKA vulnerabilities are disclosure of the user identity, Man in the Middle attack and Denial of Services (DoS) attacks so a robust authentication mechanism must replace EPSAKA to avoid such attacks. In this paper, Modified Evolved Packet System Authentication and Key Agreement (MEPS-AKA) protocol based on Simple Password Exponential Key Exchange (SPEKE) and symmetric key cryptography is proposed to solve these problems by performing a pre-authentication procedure to generate a dynamic key every time user access to the network, also each message send or received is confidentially protected. Scyther tool is used to verify the efficiency of the proposed protocol. EPS-AKA and MEPS-AKA are simulated using C programming language to calculate the execution time for both algorithms. The proposed protocol is simulated using a client-server application program using C# programming language.","PeriodicalId":6478,"journal":{"name":"2015 IEEE Seventh International Conference on Intelligent Computing and Information Systems (ICICIS)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75719303","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
扫码关注我们
求助内容：
应助结果提醒方式：