Journal of Advances in Computer Networks最新文献

An Improved Group Key Agreement Scheme with Privacy Preserving Based on Chaotic Maps 一种改进的混沌映射保密组密钥协议方案

Journal of Advances in Computer Networks Pub Date : 2018-01-01 DOI: 10.18178/jacn.2018.6.1.245

Chun-Ta Li, C. Weng

{"title":"An Improved Group Key Agreement Scheme with Privacy Preserving Based on Chaotic Maps","authors":"Chun-Ta Li, C. Weng","doi":"10.18178/jacn.2018.6.1.245","DOIUrl":"https://doi.org/10.18178/jacn.2018.6.1.245","url":null,"abstract":"The decentralized group key agreement scheme allows a group of participants to exchange private multicast messages via the protection of a group session key in the group. Recently, Zhu proposed the first group authentication key agreement scheme based on chaotic maps and the structure of a group is organized in an ordered chain. Thus each participant needs to establish two temporary two-party session keys with its predecessor and successor in a parallel algorithm. In order to cope with dynamic groups, the group session keys are frequently updated whenever a new member joins or a member leaves the group. Zhu claimed that the proposed scheme is secure against various attacks such as replay, man-in-the-middle, impersonation and key compromise attacks. Furthermore, Zhu extended the proposed scheme to high level security attributes such as privacy preserving, no clock synchronization problem, mutual and group authentication and perfect forward secrecy etc. However, in this paper, we found that Zhu’s scheme is vulnerable to successor impersonation problem and this weakness leads to a malicious adversary from deriving group session keys after impersonate attack. Moreover, their scheme is vulnerable to known key attack and this problem may lead to an adversary to compromise the previous and future group session keys. To overcome these security flaws, in this paper, we significantly improve the security of Zhu’s group key agreement scheme without increasing the communication overhead and computation complexity.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123943949","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

Does the IEEE 802.15.4 MAC Protocol Work Well in Wireless Body Area Networks IEEE 802.15.4 MAC协议在无线体域网络中工作良好吗

Journal of Advances in Computer Networks Pub Date : 2016-03-01 DOI: 10.18178/JACN.2016.4.1.203

Sabita Nepal, Saurav Dahal, Seokjoo Shin

引用次数: 13

Clustering and Feature Selection Technique for Improving Internet Traffic Classification Using K-NN 基于K-NN改进互联网流量分类的聚类和特征选择技术

Journal of Advances in Computer Networks Pub Date : 2016-03-01 DOI: 10.18178/JACN.2016.4.1.198

Trianggoro Wiradinata, A. Paramita

{"title":"Clustering and Feature Selection Technique for Improving Internet Traffic Classification Using K-NN","authors":"Trianggoro Wiradinata, A. Paramita","doi":"10.18178/JACN.2016.4.1.198","DOIUrl":"https://doi.org/10.18178/JACN.2016.4.1.198","url":null,"abstract":"This research will use the algorithm K-Nearest Neighbour (K-NN) to classify internet data traffic, K-NN is suitable for large amounts of data and can produce a more accurate classification, K-NN algorithm has a weakness takes computing high because K-NN algorithm calculating the distance of all existing data. One solution to overcome these weaknesses is to do the clustering process before the classification process, because the clustering process does not require high computing time, clustering algorithm that can be used is Fuzzy C-Mean algorithm, the Fuzzy C-Mean algorithm does not need to be determined in first number of clusters to be formed, clusters that form on this algorithm will be formed naturally based datasets be entered, but the algorithm Fuzzy C-Mean has the disadvantage of clustering results obtained are often not the same even though the same input data, this is because the initial dataset that of the Fuzzy C-Mean is not optimal, to optimize initial datasets in this research using feature selection algorithm, after main feature of dataset selected the output from fuzzy C-Mean become consistent. Selection of the features is a method that is expected to provide an initial dataset that is optimum for the algorithm Fuzzy C-Means. Algorithms for feature selection in this study used are Principal Component Analysis (PCA). PCA reduced non significant attribute to created optimal dataset and can improve performance clustering and classification algorithm. Results in this study is an combining method of classification, clustering and feature extraction of data, these three methods successfully modeled to generate a data classification method of internet bandwidth usage that has high accuracy and have a fast performance.","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125213107","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}

引用次数: 4

TXOP Combinatorial Problem in IEEE 802.11e HCCA Networks IEEE 802.11e HCCA网络中的TXOP组合问题

Journal of Advances in Computer Networks Pub Date : 2015-12-01 DOI: 10.18178/JACN.2015.3.4.185

Ming-Hua Cheng, Cheng-Han Lin, W. Hwang, Feng-Cheng Yu

引用次数: 0

Security Threats of URL Shortening: A User's Perspective URL缩短的安全威胁:一个用户的视角

Journal of Advances in Computer Networks Pub Date : 2015-07-07 DOI: 10.7763/JACN.2015.V3.169

Nhien-An Le-Khac, Mohand Tahar Kechadi

引用次数: 2

Forecasting network activities using ARIMA method 使用ARIMA方法预测网络活动

Journal of Advances in Computer Networks Pub Date : 2014-09-03 DOI: 10.7763/JACN.2014.V2.106

H. Haviluddin, R. Alfred

引用次数: 27

Design of application layer services for security automation via a web service approach 通过web服务方法设计用于安全自动化的应用层服务

Journal of Advances in Computer Networks Pub Date : 2014-03-01 DOI: 10.7763/JACN.2014.V2.86

K. Hee, C. Ho

{"title":"Design of application layer services for security automation via a web service approach","authors":"K. Hee, C. Ho","doi":"10.7763/JACN.2014.V2.86","DOIUrl":"https://doi.org/10.7763/JACN.2014.V2.86","url":null,"abstract":"N-tier application design has become very common in the IT industry. Each individual layer, such as the application and data layer has its own main functionality. This design is very helpful in securing the application from unauthorized access and in protecting it from attacks to the data layer. The data layer is the core of a company's business, as all the important information of the company will be stored in the data layer and normally will be located in a secured off- line server with limited local network access. The application layer acts as the medium to exchange data between the client layer and the data layer over a network. As such, the application layer has been increasingly targeted for intrusion and attacks. This paper will introduce a method to minimize the security risks in the n-tier application design. The method introduced in this paper will mainly focus on how to secure the application layer from various attacks such as Denial of Services (DoS) attack and spoofing attacks. This is achieved through data protection such as random encryption key generation, data encryption etc. and so forth at both the client application and the application layer. ","PeriodicalId":232851,"journal":{"name":"Journal of Advances in Computer Networks","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117198024","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

Revisiting Access and Aggregation Network Architecture 重新审视接入和聚合网络架构

Journal of Advances in Computer Networks Pub Date : 2014-01-10 DOI: 10.7763/JACN.2014.V2.104

M. Feknous, B. L. Guyader, A. Gravey

引用次数: 5

Real-Time Offset Error Compensation of 6D IMU Mounted on Ground Vehicles Using Disturbance Observer 利用扰动观测器实时补偿地面车辆6D IMU的偏移误差

Journal of Advances in Computer Networks Pub Date : 2013-02-03 DOI: 10.7763/JACN.2013.V1.18

J. Oh, Y. Noh, Seibum B. Choi

引用次数: 7

Research on Time Division Multi-channel p-Persistent CSMA Based on Binary Trees Conflict Resolution Mechanism 基于二叉树的分时多通道p-Persistent CSMA冲突解决机制研究

Journal of Advances in Computer Networks Pub Date : 1900-01-01 DOI: 10.18178/jacn.2016.4.2.213

Yifan Zhao

引用次数: 0