Pub Date : 2018-06-01DOI: 10.1109/ICIST.2018.8426111
S. Aljeddani, F. Mohammadi
The industry trend of Chip Multiprocessors (CMPs) architecture is to move from 2D CMPs to 3D CMPs architecture which obtains higher performance, more reliability, reduced cache access latency, and increased cache bandwidth. Moreover, 3D CMP architectures have recently gained significant attention to tackle the increasing power consumption in single core processors. However, one key challenge in designing the 3D CMP is the thermal issue as a result of maximizing the throughput. The thermal hotspot causes performance degradation and reliability reduction in the 3D CMP. In this paper, a run-time task migration approach is proposed to balance the temperature and reduce the number of hotspots in the 3D CMP without any performance degradation. The proposed approach is divided into two algorithms that aim at maximizing the throughput on the 3D CMP while satisfying the peak temperature constraint. Experimental results on the PARSEC benchmarks show that the proposed architecture yields up to 60 % reduction in overall chip energy with just 17 % performance degradation on average over all the used workloads. The best energy saving was 72 % with a negligible performance degradation.
{"title":"A Novel Migration Technique to Balance Thermal Distribution for Future Heterogeneous 3D Chip Multiprocessors","authors":"S. Aljeddani, F. Mohammadi","doi":"10.1109/ICIST.2018.8426111","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426111","url":null,"abstract":"The industry trend of Chip Multiprocessors (CMPs) architecture is to move from 2D CMPs to 3D CMPs architecture which obtains higher performance, more reliability, reduced cache access latency, and increased cache bandwidth. Moreover, 3D CMP architectures have recently gained significant attention to tackle the increasing power consumption in single core processors. However, one key challenge in designing the 3D CMP is the thermal issue as a result of maximizing the throughput. The thermal hotspot causes performance degradation and reliability reduction in the 3D CMP. In this paper, a run-time task migration approach is proposed to balance the temperature and reduce the number of hotspots in the 3D CMP without any performance degradation. The proposed approach is divided into two algorithms that aim at maximizing the throughput on the 3D CMP while satisfying the peak temperature constraint. Experimental results on the PARSEC benchmarks show that the proposed architecture yields up to 60 % reduction in overall chip energy with just 17 % performance degradation on average over all the used workloads. The best energy saving was 72 % with a negligible performance degradation.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133433672","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426095
Jiayong Li, Wing W. Y. Ng, Xing Tian
Hashing method has the intrinsic problem that a long binary code yields better precision but requires a larger storage cost. Most of existing hashing methods aim to find an optimal code length to trade off the precision and storage. However, in reality, the scale of the face images is enormous and thus the storage burden is unimaginative heavy. We propose to apply a similarity-preserving compression scheme to existing unsupervised hashing methods, so as to reduce storage burden while maintaining a high precision. We employ two different lengths of code, including a long code with original length and a short code with length after m-time compression. The hash code for the query face preserves the original code length while the hash code for stored image is compressed with a ratio m to reduce storage cost. When performing face retrieval, the compressed hash code for the stored face is m-time repeatedly concentrated, in order to be compared with the long hash code for the query based on Hamming distance. Experimental results on large-scale retrieval demonstrate that the proposed compression scheme can be efficiently applied in existing methods and achieves both a high precision and a small storage space.
{"title":"A Compression Hashing Scheme for Large-Scale Face Retrieval","authors":"Jiayong Li, Wing W. Y. Ng, Xing Tian","doi":"10.1109/ICIST.2018.8426095","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426095","url":null,"abstract":"Hashing method has the intrinsic problem that a long binary code yields better precision but requires a larger storage cost. Most of existing hashing methods aim to find an optimal code length to trade off the precision and storage. However, in reality, the scale of the face images is enormous and thus the storage burden is unimaginative heavy. We propose to apply a similarity-preserving compression scheme to existing unsupervised hashing methods, so as to reduce storage burden while maintaining a high precision. We employ two different lengths of code, including a long code with original length and a short code with length after m-time compression. The hash code for the query face preserves the original code length while the hash code for stored image is compressed with a ratio m to reduce storage cost. When performing face retrieval, the compressed hash code for the stored face is m-time repeatedly concentrated, in order to be compared with the long hash code for the query based on Hamming distance. Experimental results on large-scale retrieval demonstrate that the proposed compression scheme can be efficiently applied in existing methods and achieves both a high precision and a small storage space.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114123571","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426080
Yuan Cheng, Jun Xing, Jie Dong, Zhiseng Wang, Xinzhe Wang
The endpoint carbon content of steelmaking is an important criterion for steel quality. Aiming at increasing the accuracy of endpoint carbon content prediction in basic oxygen furnace (BOF) steelmaking, this paper uses case-based reasoning (CBR) method to predict the endpoint carbon content of BOF steelmaking. In CBR, case retrieval makes a significant impact on reasoning result. Therefore, we apply affinity propagation (AP) clustering algorithm and waterfilling algorithm to enhance the case retrieval so as to improve the accuracy and stability of endpoint carbon content prediction. Through the simulation experiment, this paper compares the new model we proposed with the widely used method at present. The results show that the improved CBR can obviously improve the accuracy of endpoint carbon content prediction.
{"title":"AP Based CBR for Endpoint Carbon Content Prediction of BOF Steelmaking","authors":"Yuan Cheng, Jun Xing, Jie Dong, Zhiseng Wang, Xinzhe Wang","doi":"10.1109/ICIST.2018.8426080","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426080","url":null,"abstract":"The endpoint carbon content of steelmaking is an important criterion for steel quality. Aiming at increasing the accuracy of endpoint carbon content prediction in basic oxygen furnace (BOF) steelmaking, this paper uses case-based reasoning (CBR) method to predict the endpoint carbon content of BOF steelmaking. In CBR, case retrieval makes a significant impact on reasoning result. Therefore, we apply affinity propagation (AP) clustering algorithm and waterfilling algorithm to enhance the case retrieval so as to improve the accuracy and stability of endpoint carbon content prediction. Through the simulation experiment, this paper compares the new model we proposed with the widely used method at present. The results show that the improved CBR can obviously improve the accuracy of endpoint carbon content prediction.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125083791","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426128
Huayou Wang, Y. Hu, Liying Yang, Yuqing He
This paper presents a feature-based simultaneous localization and mapping (SLAM) system for RGB-D cameras that operates in real time, in indoor environments. The system is composed of three central components: tracking, mapping and loop closing which are based on ORB-SLAM2 [1]. The tracking part estimates the pose of a frame via optimizing both the reprojection error and inverse depth error of matching feature points, rather than just optimizing the reprojection error like ORB-SLAM2 [1]. The mapping part optimizes the pose of all keyframes and the position of all map points by using bundle adjustment, and an occupancy grid map of the surrounding environment is constructed based on the octree-based mapping framework OctoMap [2] for high-level tasks, and the map is more useful then the sparse points representation in ORB-SLAM2 [1]. The loop closing of ORB-SLAM2 [1] just uses color appearance information, but our system uses both the color appearance information and depth consistency to deal with inaccurate data association. The experiment results in the TUM RGB-D dataset [3] shows that our system achieves better localization accuracy and robustness than ORB-SLAM2 [1].
{"title":"A Robust and Accurate Simultaneous Localization and Mapping System for RGB-D Cameras","authors":"Huayou Wang, Y. Hu, Liying Yang, Yuqing He","doi":"10.1109/ICIST.2018.8426128","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426128","url":null,"abstract":"This paper presents a feature-based simultaneous localization and mapping (SLAM) system for RGB-D cameras that operates in real time, in indoor environments. The system is composed of three central components: tracking, mapping and loop closing which are based on ORB-SLAM2 [1]. The tracking part estimates the pose of a frame via optimizing both the reprojection error and inverse depth error of matching feature points, rather than just optimizing the reprojection error like ORB-SLAM2 [1]. The mapping part optimizes the pose of all keyframes and the position of all map points by using bundle adjustment, and an occupancy grid map of the surrounding environment is constructed based on the octree-based mapping framework OctoMap [2] for high-level tasks, and the map is more useful then the sparse points representation in ORB-SLAM2 [1]. The loop closing of ORB-SLAM2 [1] just uses color appearance information, but our system uses both the color appearance information and depth consistency to deal with inaccurate data association. The experiment results in the TUM RGB-D dataset [3] shows that our system achieves better localization accuracy and robustness than ORB-SLAM2 [1].","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125117902","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426106
Yixiang Liu, Xizhe Zang, Niansong Zhang, Yubin Liu, Ming Wu
The metatarsophalangeal (MTP) joints play critical roles in the push-off phase of human locomotion, but are usually absent in biped robots. Our previous research found that when the unilateral MTP joints were restricted, non-disabled subjects exerted a compensatory mechanism, that is, the intact limb was relied more than the restricted limb. This paper aims to study the effects of unilateral restrictions of the MTP joints on biped robot walking. Gait performance of a biped robot model was analyzed under two conditions, i.e., walking normally, and walking with the MTP joints of the right foot restricted. The results show that unilateral restrictions of the MTP joints lead to larger demands for driving torque and power on partial joints, more total energy consumption, and lower energy efficiency. These results can help understand the functions of the MTP joints in more depth, and offer some inspirations to the researches of biped robots.
{"title":"Effects of Unilateral Restriction of the Metatarsophalangeal Joints on Biped Robot Walking","authors":"Yixiang Liu, Xizhe Zang, Niansong Zhang, Yubin Liu, Ming Wu","doi":"10.1109/ICIST.2018.8426106","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426106","url":null,"abstract":"The metatarsophalangeal (MTP) joints play critical roles in the push-off phase of human locomotion, but are usually absent in biped robots. Our previous research found that when the unilateral MTP joints were restricted, non-disabled subjects exerted a compensatory mechanism, that is, the intact limb was relied more than the restricted limb. This paper aims to study the effects of unilateral restrictions of the MTP joints on biped robot walking. Gait performance of a biped robot model was analyzed under two conditions, i.e., walking normally, and walking with the MTP joints of the right foot restricted. The results show that unilateral restrictions of the MTP joints lead to larger demands for driving torque and power on partial joints, more total energy consumption, and lower energy efficiency. These results can help understand the functions of the MTP joints in more depth, and offer some inspirations to the researches of biped robots.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259898","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426180
Yaxu Xue, Zhaojie Ju, Kui Xiang
This paper proposes a hand motion capture system for recognizing dynamic in-hand manipulation of the subjects based on the famous sensing techniques, then transferring the manipulation skills into different bionic hand applications, such as prosthetic hand, animation hand, human computer interaction. By recoding the ten defined in-hand manipulations demonstrated by different subjects, the hand motion information is captured with hybrid SEMG and Kinect. Through the data preprocessing including motion segmentation and feature extraction, recognizing ten different types of hand motions based on the rich feature information are investigated by using Marquardt-Levenberg algorithm based artificial neural network, and the experimental results show the effectiveness and feasibility of this method.
{"title":"Classification of Dynamic In-Hand Manipulation Based on SEMG and Kinect","authors":"Yaxu Xue, Zhaojie Ju, Kui Xiang","doi":"10.1109/ICIST.2018.8426180","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426180","url":null,"abstract":"This paper proposes a hand motion capture system for recognizing dynamic in-hand manipulation of the subjects based on the famous sensing techniques, then transferring the manipulation skills into different bionic hand applications, such as prosthetic hand, animation hand, human computer interaction. By recoding the ten defined in-hand manipulations demonstrated by different subjects, the hand motion information is captured with hybrid SEMG and Kinect. Through the data preprocessing including motion segmentation and feature extraction, recognizing ten different types of hand motions based on the rich feature information are investigated by using Marquardt-Levenberg algorithm based artificial neural network, and the experimental results show the effectiveness and feasibility of this method.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131813715","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426078
Qingshan Liu, Wei Zhang, Jiang Xiong, Bingrong Xu, Long Cheng
In this paper, a projection-base algorithm is proposed for solving the constrained L1-minimization problem. Furthermore, the algorithm is utilized to sparse signal reconstruction. The L1 -minimization is first converted into some equations which are described by the projections onto a hyer box set and the nonnegative quadrant. Then a iterative algorithm is proposed for solving the L1 -minimization problem. Next, the algorithm is applied to sparse signal reconstruction described as an L1- minimization problem subject to L∞ -norm noise constraint, or equivalently bound constraint. Finally, several experiments are presented to show the performance of the proposed algorithm.
{"title":"A Projection-Based Algorithm for Constrained L1- Minimization Optimization with Application to Sparse Signal Reconstruction","authors":"Qingshan Liu, Wei Zhang, Jiang Xiong, Bingrong Xu, Long Cheng","doi":"10.1109/ICIST.2018.8426078","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426078","url":null,"abstract":"In this paper, a projection-base algorithm is proposed for solving the constrained L1-minimization problem. Furthermore, the algorithm is utilized to sparse signal reconstruction. The L1 -minimization is first converted into some equations which are described by the projections onto a hyer box set and the nonnegative quadrant. Then a iterative algorithm is proposed for solving the L1 -minimization problem. Next, the algorithm is applied to sparse signal reconstruction described as an L1- minimization problem subject to L∞ -norm noise constraint, or equivalently bound constraint. Finally, several experiments are presented to show the performance of the proposed algorithm.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130380312","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426133
Yisha Liu, Yan Zhuang, Long Wan, Ge Guo
It is a classic task for Unmanned Aerial Vehicles (UAVs) to accomplish autonomous scene perception and path planning in unknown 3-D outdoor environments. This paper investigates the problems of obstacle avoidance and path planning using binocular vision system. During the UAV's flight, the binocular vision sensor is used to obtain the local environment information in real time, and the distribution of obstacles in the environment can also be analyzed with the depth images acquired by the binocular vision. Inspired by the idea of dynamic window algorithm, a 3-D path planning algorithm is proposed to convert the global path to the combination of a group of local paths by using a series of 3-D models of predefined local paths. According to the screening algorithm for the passable candidate paths, the UAV will select the optimal one to guide its flight. A series of experiments are conducted by using a quadrotor platform DJI M100 and experimental results show the validity of the proposed approach.
{"title":"Binocular Vision-Based Autonomous Path Planning for UAVs in Unknown Outdoor Scenes","authors":"Yisha Liu, Yan Zhuang, Long Wan, Ge Guo","doi":"10.1109/ICIST.2018.8426133","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426133","url":null,"abstract":"It is a classic task for Unmanned Aerial Vehicles (UAVs) to accomplish autonomous scene perception and path planning in unknown 3-D outdoor environments. This paper investigates the problems of obstacle avoidance and path planning using binocular vision system. During the UAV's flight, the binocular vision sensor is used to obtain the local environment information in real time, and the distribution of obstacles in the environment can also be analyzed with the depth images acquired by the binocular vision. Inspired by the idea of dynamic window algorithm, a 3-D path planning algorithm is proposed to convert the global path to the combination of a group of local paths by using a series of 3-D models of predefined local paths. According to the screening algorithm for the passable candidate paths, the UAV will select the optimal one to guide its flight. A series of experiments are conducted by using a quadrotor platform DJI M100 and experimental results show the validity of the proposed approach.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130779861","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 : 2018-06-01DOI: 10.1109/icist.2018.8426170
{"title":"8th International Conference on Information Science and Technology","authors":"","doi":"10.1109/icist.2018.8426170","DOIUrl":"https://doi.org/10.1109/icist.2018.8426170","url":null,"abstract":"","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125260195","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 : 2018-06-01DOI: 10.1109/ICIST.2018.8426178
J. Khor, M. Sidorov
Internet of Things (IoT) has stimulated great interest in many researchers owing to its capability to connect billions of physical devices to the internet via heterogeneous access network. Security is a paramount aspect of IoT that needs to be addressed urgently to keep sensitive data private. However, from previous research studies, a number of security flaws in terms of keeping data private can be identified. Tewari and Gupta proposed an ultra-lightweight mutual authentication pRotocol that utilizes bitwise operation to achieve security in IoT networks that use RFID tags. The pRotocol is improved by Wang et. al. to prevent a full key disclosure attack. However, this paper shows that both of the pRotocols are susceptible to full disclosure, man-in-the-middle, tracking, and de-synchronization attacks. A detailed security analysis is conducted and results are presented to prove their vulnerability. Based on the aforementioned analysis, the pRotocol is modified and improved using a three pass mutual authentication. GNY logic is used to formally verify the security of the pRotocol.
{"title":"Weakness of Ultra-Lightweight Mutual Authentication PRotocol for IoT Devices Using RFlD Tags","authors":"J. Khor, M. Sidorov","doi":"10.1109/ICIST.2018.8426178","DOIUrl":"https://doi.org/10.1109/ICIST.2018.8426178","url":null,"abstract":"Internet of Things (IoT) has stimulated great interest in many researchers owing to its capability to connect billions of physical devices to the internet via heterogeneous access network. Security is a paramount aspect of IoT that needs to be addressed urgently to keep sensitive data private. However, from previous research studies, a number of security flaws in terms of keeping data private can be identified. Tewari and Gupta proposed an ultra-lightweight mutual authentication pRotocol that utilizes bitwise operation to achieve security in IoT networks that use RFID tags. The pRotocol is improved by Wang et. al. to prevent a full key disclosure attack. However, this paper shows that both of the pRotocols are susceptible to full disclosure, man-in-the-middle, tracking, and de-synchronization attacks. A detailed security analysis is conducted and results are presented to prove their vulnerability. Based on the aforementioned analysis, the pRotocol is modified and improved using a three pass mutual authentication. GNY logic is used to formally verify the security of the pRotocol.","PeriodicalId":331555,"journal":{"name":"2018 Eighth International Conference on Information Science and Technology (ICIST)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115775282","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
扫码关注我们
求助内容：
应助结果提醒方式：