Pub Date : 2019-01-01DOI: 10.1109/CCOMS.2019.8821758
Xiujuan Wang, Chenxi Zhang, K. Zheng, Haoyang Tang, Yuanrui Tao
{"title":"Detecting Spear-phishing Emails Based on Authentication","authors":"Xiujuan Wang, Chenxi Zhang, K. Zheng, Haoyang Tang, Yuanrui Tao","doi":"10.1109/CCOMS.2019.8821758","DOIUrl":"https://doi.org/10.1109/CCOMS.2019.8821758","url":null,"abstract":"","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"155 1","pages":"450-456"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73446879","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 : 2019-01-01DOI: 10.1109/CCOMS.2019.8821639
Xiaoyan Zhang, Qiuqiu Wang, Kai Kang
{"title":"Research on Access Control Model in Mobile Environment","authors":"Xiaoyan Zhang, Qiuqiu Wang, Kai Kang","doi":"10.1109/CCOMS.2019.8821639","DOIUrl":"https://doi.org/10.1109/CCOMS.2019.8821639","url":null,"abstract":"","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"192 1","pages":"716-720"},"PeriodicalIF":0.0,"publicationDate":"2019-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77712161","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-10-01DOI: 10.1109/CCCS.2018.8586824
D. Pant, Prasanga Neupane, Anuj Poudel, Anup Pokhrel, Bishnu Lama
The sentiment in Twitter about Bitcoin have direct or indirect influence on overall market value of the Bitcoin. This research is concerned with predicting the volatile price of Bitcoin by analyzing the sentiment in Twitter and to find the relation between them. The tweets of Bitcoin collected from different news account sources are classified to positive or negative sentiments. The obtained percentage of positive and negative tweets are feed to RNN model along with historical price to predict the new price for next time frame. The accuracy for sentiment classification of tweets in two class positive and negative is found to be 81.39 % and the overall price prediction accuracy using RNN is found to be 77.62%.
{"title":"Recurrent Neural Network Based Bitcoin Price Prediction by Twitter Sentiment Analysis","authors":"D. Pant, Prasanga Neupane, Anuj Poudel, Anup Pokhrel, Bishnu Lama","doi":"10.1109/CCCS.2018.8586824","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586824","url":null,"abstract":"The sentiment in Twitter about Bitcoin have direct or indirect influence on overall market value of the Bitcoin. This research is concerned with predicting the volatile price of Bitcoin by analyzing the sentiment in Twitter and to find the relation between them. The tweets of Bitcoin collected from different news account sources are classified to positive or negative sentiments. The obtained percentage of positive and negative tweets are feed to RNN model along with historical price to predict the new price for next time frame. The accuracy for sentiment classification of tweets in two class positive and negative is found to be 81.39 % and the overall price prediction accuracy using RNN is found to be 77.62%.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"212 1","pages":"128-132"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73093476","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-10-01DOI: 10.1109/CCCS.2018.8586802
Hima C., B. M, S. N. George
This paper focused on the process of missing area reconstruction in a video after removing a unwanted moving object, thus can remove or handle the dynamic occlusion. Dynamic occlusion is the result of one moving object in a 3–D spread tackling another object from view, and also it is a challenging problem in many video processing applications like object tracking, video surveillance, movie production etc. Discarding the moving objects from videos is a very time consuming task, that even a visual effects expert generally clear up with a time-taking manual frame-by-frame rephrasing. This paper proposes a new technique to remove dynamic occlusion in video, even in the case of videos with complex scenes and also compared with the other existing method, the proposed method does not require the exact shape, size and structure of the object. Here, the proposed method effectively taking the advantage of the spatio-temporal correlation in the video to refill the hole created by a cut-out object by utilizing the information available on other part of the video, where the occluded object were viewable.
{"title":"A Novel Technique to Remove Marked Dynamic Object from Video Based on Reweighted Low Rank Tensor Completion","authors":"Hima C., B. M, S. N. George","doi":"10.1109/CCCS.2018.8586802","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586802","url":null,"abstract":"This paper focused on the process of missing area reconstruction in a video after removing a unwanted moving object, thus can remove or handle the dynamic occlusion. Dynamic occlusion is the result of one moving object in a 3–D spread tackling another object from view, and also it is a challenging problem in many video processing applications like object tracking, video surveillance, movie production etc. Discarding the moving objects from videos is a very time consuming task, that even a visual effects expert generally clear up with a time-taking manual frame-by-frame rephrasing. This paper proposes a new technique to remove dynamic occlusion in video, even in the case of videos with complex scenes and also compared with the other existing method, the proposed method does not require the exact shape, size and structure of the object. Here, the proposed method effectively taking the advantage of the spatio-temporal correlation in the video to refill the hole created by a cut-out object by utilizing the information available on other part of the video, where the occluded object were viewable.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"10 1","pages":"25-29"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73124667","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-10-01DOI: 10.1109/CCCS.2018.8586828
R. Shrestha, Rojeena Bajracharya, S. Nam
With the evolution of vehicle technology, VANET plays an important role in saving life and property of the drivers by disseminating critical event information. However, the traditional VANET faces several security issues. We propose a new type of blockchain to resolve critical message dissemination issues in VANET. We create a local blockchain for real world event messages exchanged between the vehicles within the scope of the countries. In this paper, we discuss a blockchain suitable for VANET. We present a public blockchain that stores the node trustworthiness and message trustworthiness in a distributed ledger that is appropriate for secure message dissemination.
{"title":"Blockchain-based Message Dissemination in VANET","authors":"R. Shrestha, Rojeena Bajracharya, S. Nam","doi":"10.1109/CCCS.2018.8586828","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586828","url":null,"abstract":"With the evolution of vehicle technology, VANET plays an important role in saving life and property of the drivers by disseminating critical event information. However, the traditional VANET faces several security issues. We propose a new type of blockchain to resolve critical message dissemination issues in VANET. We create a local blockchain for real world event messages exchanged between the vehicles within the scope of the countries. In this paper, we discuss a blockchain suitable for VANET. We present a public blockchain that stores the node trustworthiness and message trustworthiness in a distributed ledger that is appropriate for secure message dissemination.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"175 1","pages":"161-166"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90290567","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-10-01DOI: 10.1109/CCCS.2018.8586813
Lyla B. Das, Raghu C. V., Krishna Rao, P. Srinivas, Dency Daniel, Gautham Nagireddy, S. L.
This work deals with the determination of the location of an object with the help of an identification tag using wireless sensor networks. This uses an array of sensors distributed in the path. When the object with identification tag passes through the path, the sensors calculate the approximate distance from each of them with the help of a series of Received Signal Strength Indicator (RSSI) values. The data is collected and is displayed on a user interface provided. Bluetooth Low Energy (BLE) protocol is used in the wireless sensor network. The RSSI values are mapped to corresponding distances by an initial training and this data is used for estimation of the distance. Path loss exponent and curve fitting methods are proposed for estimation of distance from the initial training data. Further, an error reduction method is also proposed for improving the accuracy of the estimation.
{"title":"Determination Of Microlocation Using the BLE Protocol, and Wireless Sensor Networks","authors":"Lyla B. Das, Raghu C. V., Krishna Rao, P. Srinivas, Dency Daniel, Gautham Nagireddy, S. L.","doi":"10.1109/CCCS.2018.8586813","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586813","url":null,"abstract":"This work deals with the determination of the location of an object with the help of an identification tag using wireless sensor networks. This uses an array of sensors distributed in the path. When the object with identification tag passes through the path, the sensors calculate the approximate distance from each of them with the help of a series of Received Signal Strength Indicator (RSSI) values. The data is collected and is displayed on a user interface provided. Bluetooth Low Energy (BLE) protocol is used in the wireless sensor network. The RSSI values are mapped to corresponding distances by an initial training and this data is used for estimation of the distance. Path loss exponent and curve fitting methods are proposed for estimation of distance from the initial training data. Further, an error reduction method is also proposed for improving the accuracy of the estimation.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"1 1","pages":"64-69"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78188800","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-10-01DOI: 10.1109/CCCS.2018.8586841
R. K. Bachchan, Arun Timalsina
This research work develops two frameworks for detecting plagiarism of Nepali language literatures incorporating Monte Carlo based Artificial Neural Network (MCANN) and Backpropagation (BP) neural network, which was applied for the plagiarism detection on certain document type segment. Both the frameworks are tested on two different datasets and results were analysed and discussed. Convergence of MCANN is faster in comparison to traditional BP algorithm. MCANN algorithm achieved a convergence in the range of $10^{-2}$ to $10^{-7}$ for the training error in 40 epochs while general BP algorithm is unable to achieve such a convergence even in 400 epochs. Also, the mean accuracy of BP and MCANN are respectively found to be in the range of 98.657 and 99.864 during paragraph based and line-based comparison of the documents. Thus, MCANN is efficient for plagiarism detection in comparison to BP for Nepali language documents.
{"title":"Plagiarism Detection Framework Using Monte Carlo Based Artificial Neural Network for Nepali Language","authors":"R. K. Bachchan, Arun Timalsina","doi":"10.1109/CCCS.2018.8586841","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586841","url":null,"abstract":"This research work develops two frameworks for detecting plagiarism of Nepali language literatures incorporating Monte Carlo based Artificial Neural Network (MCANN) and Backpropagation (BP) neural network, which was applied for the plagiarism detection on certain document type segment. Both the frameworks are tested on two different datasets and results were analysed and discussed. Convergence of MCANN is faster in comparison to traditional BP algorithm. MCANN algorithm achieved a convergence in the range of $10^{-2}$ to $10^{-7}$ for the training error in 40 epochs while general BP algorithm is unable to achieve such a convergence even in 400 epochs. Also, the mean accuracy of BP and MCANN are respectively found to be in the range of 98.657 and 99.864 during paragraph based and line-based comparison of the documents. Thus, MCANN is efficient for plagiarism detection in comparison to BP for Nepali language documents.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"10 1","pages":"122-127"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76342556","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-10-01DOI: 10.1109/CCCS.2018.8586827
B. Devkota, H. Miyazaki
Social media platforms contribute a huge part of the content available on the world wide web today. These platforms act as a rich source of real time data from live human sensors. These media disseminate spatiotemporal public opinion regarding a range of events, activities and human information behaviors. This paper explores the active user locations and spatial penetration of popular microblogging platform, Twitter, in Nepal. A heatmap visualization is used to show the intensity and distribution of the spatial patterns of Twitter activities in different parts of Nepal. Clustering is a popular technique for knowledge discovery, so spatial clustering is applied to groups tweets spatially into different classes. Such spatial clustering helps in the identification of areas of similar twitter activities and shows the distribution of the spatial patterns in different parts of Nepal. Tweet clusters are observed mainly in the main cities and the tourism centers. Further, an examination of the twitter data shared by the local Nepalese people and the foreigners are shown. This study contributes the research line by providing insights to better understand the spatiotemporal patterns and hotspots of tweets in Nepal. Such patterns and hotspots have an immense practical value that can be attributable to a place in order to derive meaningful insights related to various domains like a disease, crime, tourism, etc.
{"title":"An Exploratory Study on the Generation and Distribution of Geotagged Tweets in Nepal","authors":"B. Devkota, H. Miyazaki","doi":"10.1109/CCCS.2018.8586827","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586827","url":null,"abstract":"Social media platforms contribute a huge part of the content available on the world wide web today. These platforms act as a rich source of real time data from live human sensors. These media disseminate spatiotemporal public opinion regarding a range of events, activities and human information behaviors. This paper explores the active user locations and spatial penetration of popular microblogging platform, Twitter, in Nepal. A heatmap visualization is used to show the intensity and distribution of the spatial patterns of Twitter activities in different parts of Nepal. Clustering is a popular technique for knowledge discovery, so spatial clustering is applied to groups tweets spatially into different classes. Such spatial clustering helps in the identification of areas of similar twitter activities and shows the distribution of the spatial patterns in different parts of Nepal. Tweet clusters are observed mainly in the main cities and the tourism centers. Further, an examination of the twitter data shared by the local Nepalese people and the foreigners are shown. This study contributes the research line by providing insights to better understand the spatiotemporal patterns and hotspots of tweets in Nepal. Such patterns and hotspots have an immense practical value that can be attributable to a place in order to derive meaningful insights related to various domains like a disease, crime, tourism, etc.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"39 1","pages":"70-76"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86377336","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-10-01DOI: 10.1109/CCCS.2018.8586830
A. Sethi, S. Vijay, J. Saini
Key pairing and enciphering heuristics must be free from complexity whereas amount of confidentiality directs the adaptability of encryption and decryption scheme because an extensive ciphertext requires extra space complexity and more communication time. Fast and secure authenticators are present in the literature. As compared to RSA, an elliptic curve in secure paring using smallest size of key is more efficient without sub-exponential attack on the Discrete Logarithmic problem. This paper focuses on analytical representation of different elliptic curves used in pairing of devices in ad-hoc network. BN, BLS and KSS curves are mostly used in the Elliptic cryptography systems. Assortment of an appropriate Hash function in elliptic curve and constraints for pairing has great impact on security level and complexity. Analytically proved the performance of BLS curve with different embedding degree in terms of computation time is fair enough.
{"title":"Analytical Model for Secure Pairing in ad hoc Network","authors":"A. Sethi, S. Vijay, J. Saini","doi":"10.1109/CCCS.2018.8586830","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586830","url":null,"abstract":"Key pairing and enciphering heuristics must be free from complexity whereas amount of confidentiality directs the adaptability of encryption and decryption scheme because an extensive ciphertext requires extra space complexity and more communication time. Fast and secure authenticators are present in the literature. As compared to RSA, an elliptic curve in secure paring using smallest size of key is more efficient without sub-exponential attack on the Discrete Logarithmic problem. This paper focuses on analytical representation of different elliptic curves used in pairing of devices in ad-hoc network. BN, BLS and KSS curves are mostly used in the Elliptic cryptography systems. Assortment of an appropriate Hash function in elliptic curve and constraints for pairing has great impact on security level and complexity. Analytically proved the performance of BLS curve with different embedding degree in terms of computation time is fair enough.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"34 1","pages":"225-229"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77302098","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-10-01DOI: 10.1109/CCCS.2018.8586844
A. Solanki, A. Rathore
The concept of the search process of GSA (Gravitational Search Algorithm) is pageant and it’s a heuristic algorithm depends on act of motion and gravity which have anamnesia ability. Several algorithms based on metamorphic computation principals have been successfully applied to recognize the optimized parameters for an AVR systems. However, most of algorithm maintain a restraint result of an improper equilibrium between exploration and exploitation in their search strategies. This paper presents performance and design of parameters of Proportional-Integral-Derivative-Acceleration (PIDA) controller by using gravitational search algorithm and applied in electrical applications and various optimization problems like automatic voltage regulator system. GSA has showed optimum performance correlated to other algorithms as GA, PSO, and FA Method.
{"title":"Optimization of PIDA controller for AVR System Using GSA","authors":"A. Solanki, A. Rathore","doi":"10.1109/CCCS.2018.8586844","DOIUrl":"https://doi.org/10.1109/CCCS.2018.8586844","url":null,"abstract":"The concept of the search process of GSA (Gravitational Search Algorithm) is pageant and it’s a heuristic algorithm depends on act of motion and gravity which have anamnesia ability. Several algorithms based on metamorphic computation principals have been successfully applied to recognize the optimized parameters for an AVR systems. However, most of algorithm maintain a restraint result of an improper equilibrium between exploration and exploitation in their search strategies. This paper presents performance and design of parameters of Proportional-Integral-Derivative-Acceleration (PIDA) controller by using gravitational search algorithm and applied in electrical applications and various optimization problems like automatic voltage regulator system. GSA has showed optimum performance correlated to other algorithms as GA, PSO, and FA Method.","PeriodicalId":6570,"journal":{"name":"2018 IEEE 3rd International Conference on Computing, Communication and Security (ICCCS)","volume":"20 1","pages":"236-239"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87519606","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
扫码关注我们
求助内容：
应助结果提醒方式：