Cloud-based outsourced storage alleviates the client's burden for storage management and maintenance by providing a comparably low-cost, scalable, location-independent platform. Nevertheless, the new conception does triggers lots of security issues. A major concern is how to ensure the integrity of the outsourced data. To deal with the problem, Chen et al. Recently proposed a remote data possession checking (RDPC) scheme based on homomorphic hashing and argued that it was efficient and secure. Unfortunately, through our security analysis, we find out that the scheme is vulnerable to attack by an active adversary. In this paper, we analyze the scheme and point out our attack on their scheme. Through launching the attack, the adversary is able to arbitrarily modify the cloud data without being detected by the data owner in the auditing process. Then we also put forward our solution to fix the problems without losing any desirable features of the original scheme.
{"title":"On the Security of a Remote Data Possession Checking Scheme in Cloud Storage","authors":"Xinlong Liang, R. Jiang","doi":"10.1109/BWCCA.2014.56","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.56","url":null,"abstract":"Cloud-based outsourced storage alleviates the client's burden for storage management and maintenance by providing a comparably low-cost, scalable, location-independent platform. Nevertheless, the new conception does triggers lots of security issues. A major concern is how to ensure the integrity of the outsourced data. To deal with the problem, Chen et al. Recently proposed a remote data possession checking (RDPC) scheme based on homomorphic hashing and argued that it was efficient and secure. Unfortunately, through our security analysis, we find out that the scheme is vulnerable to attack by an active adversary. In this paper, we analyze the scheme and point out our attack on their scheme. Through launching the attack, the adversary is able to arbitrarily modify the cloud data without being detected by the data owner in the auditing process. Then we also put forward our solution to fix the problems without losing any desirable features of the original scheme.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133881584","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}
Recently, highly accurate positioning devices enable us to provide various types of location based services (LBS). Since location information may reveal private information, preserving location privacy has become a significant issue in LBS. Lots of different techniques for securing the location privacy have been proposed, for instance the concept of Silent period, the concept of Dummy node, and the concept of Cloaking-region. However, many of these were not focused on information leakage on the servers. In this paper, we propose a user location management method based on the secure computation algorithm which protects information leakage from the location management servers. This algorithm is based on the multi-party computation and the computation complexity is not so high. We evaluated the proposed scheme in comparison with the method based on the homomorphic cryptographic method.
{"title":"User Location Anonymization Based on Secret Computation","authors":"Fumiaki Sato","doi":"10.1109/BWCCA.2014.96","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.96","url":null,"abstract":"Recently, highly accurate positioning devices enable us to provide various types of location based services (LBS). Since location information may reveal private information, preserving location privacy has become a significant issue in LBS. Lots of different techniques for securing the location privacy have been proposed, for instance the concept of Silent period, the concept of Dummy node, and the concept of Cloaking-region. However, many of these were not focused on information leakage on the servers. In this paper, we propose a user location management method based on the secure computation algorithm which protects information leakage from the location management servers. This algorithm is based on the multi-party computation and the computation complexity is not so high. We evaluated the proposed scheme in comparison with the method based on the homomorphic cryptographic method.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371393","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}
Atsushi Takeda, Takuma Oide, Akiko Takahashi, T. Suganuma
Sensor devices of many types have come into widespread use, producing huge amounts of data. If the observed data can be aggregated via the internet, then new applications can be produced to provide useful information for wide areas. As described in this paper, we propose a time-slot-based data aggregation mechanism on a structured p2p network. The proposed mechanism uses routing tables of the structured p2p network to achieve scalable data collection. In addition, the proposed system uses a time-slot idea to aggregate the observed data accurately. Nodes in the system record the observed data as time slot values. Then the nodes send the time slot values to other nodes. When nodes receive the time slot values, the nodes aggregate the received values as data aggregation results. As described in this paper, we explain an algorithm and a communication protocol for the proposed data aggregation mechanism. Furthermore, using experimentally obtained results, we demonstrate that the proposed mechanism achieves more accurate data aggregation than existing mechanisms.
{"title":"Scalable and Accurate Data Aggregation Mechanism on Structured P2P Network","authors":"Atsushi Takeda, Takuma Oide, Akiko Takahashi, T. Suganuma","doi":"10.1109/BWCCA.2014.94","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.94","url":null,"abstract":"Sensor devices of many types have come into widespread use, producing huge amounts of data. If the observed data can be aggregated via the internet, then new applications can be produced to provide useful information for wide areas. As described in this paper, we propose a time-slot-based data aggregation mechanism on a structured p2p network. The proposed mechanism uses routing tables of the structured p2p network to achieve scalable data collection. In addition, the proposed system uses a time-slot idea to aggregate the observed data accurately. Nodes in the system record the observed data as time slot values. Then the nodes send the time slot values to other nodes. When nodes receive the time slot values, the nodes aggregate the received values as data aggregation results. As described in this paper, we explain an algorithm and a communication protocol for the proposed data aggregation mechanism. Furthermore, using experimentally obtained results, we demonstrate that the proposed mechanism achieves more accurate data aggregation than existing mechanisms.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288054","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}
Kale Timothy Girry, S. Ohzahata, Celimuge Wu, Toshihiko Kato
The Tor Network is a low-latency anonymity and censorship resistance network, which relaying traffics through series of onion routers (OR) before being forwarded to the destination. Tor is vulnerable to network congestion and performance problems, due to bulk and light traffics are competing to transfer data on a single TCP connection. A large fraction of the available network capacity is consumed by bulk users' traffic, resulting in higher buffer occupancy and delays for interactive light users. To address the problems, we propose a method of switching the bulk traffic that contributes to increasing delays to another path, which built preemptively at the beginning. This approach allows the light interactive circuits to utilize the bandwidth resources well and, easily writes their cells from the circuit queue to the output buffer and outgoing TCP socket. Our approach of switching bulk circuits in the overloaded ORs comes to effect if the Tor output queues increases beyond the threshold value, and when sending TCP socket is congested and un-writable. Our goal is to reduce the congestion in the ORs and improve the throughput from the incoming traffic (upstream), and outgoing traffic (downstream). Through measurements and evaluation conducted in the live Tor network, we observed that the throughput of the light interactive traffic is improved. The light circuit traffics are no longer forced to wait behind the bulk traffic when transfer their data to the outgoing TCP socket.
{"title":"A Circuit Switching Method for Improving Congestion of Tor Network","authors":"Kale Timothy Girry, S. Ohzahata, Celimuge Wu, Toshihiko Kato","doi":"10.1109/BWCCA.2014.97","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.97","url":null,"abstract":"The Tor Network is a low-latency anonymity and censorship resistance network, which relaying traffics through series of onion routers (OR) before being forwarded to the destination. Tor is vulnerable to network congestion and performance problems, due to bulk and light traffics are competing to transfer data on a single TCP connection. A large fraction of the available network capacity is consumed by bulk users' traffic, resulting in higher buffer occupancy and delays for interactive light users. To address the problems, we propose a method of switching the bulk traffic that contributes to increasing delays to another path, which built preemptively at the beginning. This approach allows the light interactive circuits to utilize the bandwidth resources well and, easily writes their cells from the circuit queue to the output buffer and outgoing TCP socket. Our approach of switching bulk circuits in the overloaded ORs comes to effect if the Tor output queues increases beyond the threshold value, and when sending TCP socket is congested and un-writable. Our goal is to reduce the congestion in the ORs and improve the throughput from the incoming traffic (upstream), and outgoing traffic (downstream). Through measurements and evaluation conducted in the live Tor network, we observed that the throughput of the light interactive traffic is improved. The light circuit traffics are no longer forced to wait behind the bulk traffic when transfer their data to the outgoing TCP socket.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123986863","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}
Sybil attacks are becoming increasingly serious in online social networks. A number of schemes to defend against Sybil attacks have been developed in the past decade. However, only a few of these schemes are widely used in real-world social networks. In this article, we provide an overview of the key challenges in detecting and defending against Sybil attacks and the work performed so far. We aim to provide inspiration to future researchers who wish to overcome the said challenges. This study lays a foundation for the development of defence schemes and their application in real-world social networks.
{"title":"Detecting and Defending against Sybil Attacks in Social Networks: An Overview","authors":"Faxin Li, Bo Liu, Zhefeng Xiao, Yi Fu","doi":"10.1109/BWCCA.2014.67","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.67","url":null,"abstract":"Sybil attacks are becoming increasingly serious in online social networks. A number of schemes to defend against Sybil attacks have been developed in the past decade. However, only a few of these schemes are widely used in real-world social networks. In this article, we provide an overview of the key challenges in detecting and defending against Sybil attacks and the work performed so far. We aim to provide inspiration to future researchers who wish to overcome the said challenges. This study lays a foundation for the development of defence schemes and their application in real-world social networks.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774143","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}
Noriki Uchida, N. Kawamura, Tomoyuki Ishida, Y. Shibata
Although the information network has become more important for the daily life, there are some considerable subjects such as the poor connectivity in disasters, local areas, and developing areas. On the other hands, the rapid developments of Information Technology expect to bring new usages of technologies, and one of the expectations is autonomous flight drones with IP wireless networks. Therefore, in this paper, the Autonomous Flight Wireless Node (AFW) is introduced for the delivery of message data under the poor network conditions such as disasters or local areas. This paper especially discusses the data connections with the DTN (Delay Tolerant Networks) and autonomous flights for seeking possible encounters. Then, the implementations and the experimentations of the prototype system are carried out for the effectiveness of the functions. Finally, the results are used for the discussions of the future studies.
{"title":"Proposal of Seeking Wireless Station by Flight Drones Based on Delay Tolerant Networks","authors":"Noriki Uchida, N. Kawamura, Tomoyuki Ishida, Y. Shibata","doi":"10.1109/BWCCA.2014.129","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.129","url":null,"abstract":"Although the information network has become more important for the daily life, there are some considerable subjects such as the poor connectivity in disasters, local areas, and developing areas. On the other hands, the rapid developments of Information Technology expect to bring new usages of technologies, and one of the expectations is autonomous flight drones with IP wireless networks. Therefore, in this paper, the Autonomous Flight Wireless Node (AFW) is introduced for the delivery of message data under the poor network conditions such as disasters or local areas. This paper especially discusses the data connections with the DTN (Delay Tolerant Networks) and autonomous flights for seeking possible encounters. Then, the implementations and the experimentations of the prototype system are carried out for the effectiveness of the functions. Finally, the results are used for the discussions of the future studies.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"C-35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126489866","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}
A group of wireless devices with the ability to sense physical events (sensors) or/and to perform relatively complicated actions (actors), is referred to as Wireless Sensor and Actor Network (WSAN). In WSANs, sensors gather information about the physical events, while actors perform appropriate actions upon the environment, based on the sensed data shared by sensors. In order to provide effective sensing and acting, a distributed local coordination mechanism is necessary among sensors and actors. In this work, we focus on actor selection problem and implement a fuzzy-based system. The system decides whether the actor will be selected for the required job or not, based on data supplied by sensors and actual actor condition. We use three input parameters: Type of Required Action (TRA), Distance to Event (DE) and Remaining Power (RP). The output parameter is Actor Selection Decision (ASD). The simulation results show that the proposed system decides the actor selection in order to have short delays, low energy consumption and proper task assignment.
{"title":"A Fuzzy-Based Method for Selection of Actor Nodes in Wireless Sensor and Actor Networks","authors":"Elis Kulla, Tetsuya Oda, L. Barolli","doi":"10.1109/BWCCA.2014.37","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.37","url":null,"abstract":"A group of wireless devices with the ability to sense physical events (sensors) or/and to perform relatively complicated actions (actors), is referred to as Wireless Sensor and Actor Network (WSAN). In WSANs, sensors gather information about the physical events, while actors perform appropriate actions upon the environment, based on the sensed data shared by sensors. In order to provide effective sensing and acting, a distributed local coordination mechanism is necessary among sensors and actors. In this work, we focus on actor selection problem and implement a fuzzy-based system. The system decides whether the actor will be selected for the required job or not, based on data supplied by sensors and actual actor condition. We use three input parameters: Type of Required Action (TRA), Distance to Event (DE) and Remaining Power (RP). The output parameter is Actor Selection Decision (ASD). The simulation results show that the proposed system decides the actor selection in order to have short delays, low energy consumption and proper task assignment.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129623357","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}
Y. Lv, Yuanlong Li, Shouzhong Tu, Shuang Xiang, C. Xia
Scanning acquires status information regarding target hosts. In networks, attackers often conduct coordinated scans of the target host or network segment because such scans are efficient and stealthy. However, an algorithm that effectively detects coordinated scans has not yet been developed. In this study, we identify a coordinated scan under a single controller during a clustering analysis of the scan sequence. This scan sequence was determined through time sequence, and the clustering analysis was based on the global characteristics of the time sequence. Simulation and test results demonstrated that the proposed algorithm can detect scans more frequently and more accurately than existing algorithms.
{"title":"Coordinated Scan Detection Algorithm Based on the Global Characteristics of Time Sequence","authors":"Y. Lv, Yuanlong Li, Shouzhong Tu, Shuang Xiang, C. Xia","doi":"10.1109/BWCCA.2014.64","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.64","url":null,"abstract":"Scanning acquires status information regarding target hosts. In networks, attackers often conduct coordinated scans of the target host or network segment because such scans are efficient and stealthy. However, an algorithm that effectively detects coordinated scans has not yet been developed. In this study, we identify a coordinated scan under a single controller during a clustering analysis of the scan sequence. This scan sequence was determined through time sequence, and the clustering analysis was based on the global characteristics of the time sequence. Simulation and test results demonstrated that the proposed algorithm can detect scans more frequently and more accurately than existing algorithms.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121781617","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}
Gil-Jin Jang, Jeong-Sik Park, Ahra Jo, Ji-Hwan Kim
This paper investigates various emotion recognition techniques from the facial expression of human subjects. To describe human facial expressions, a number of characteristic points are extracted from input face images using active shape models (ASMs), and translated 49 scalar features so that they are invariant to scale and position changes. The scalar feature values then construct a 49-dimensional feature vector for each still image. Statistical pattern recognizers, such as support vector machine (SVM) and multi-layer perceptron (MLP), are used to identify various emotions from the feature vectors. To analyze the performances of the various pattern recognizers on the limited amount of image data, 5-fold cross-validation is carried out, with varying numbers of emotions from 3 to 6. Evaluation results show that SVM is the most stable and best in terms of emotion classification rates.
{"title":"Facial Emotion Recognition Using Active Shape Models and Statistical Pattern Recognizers","authors":"Gil-Jin Jang, Jeong-Sik Park, Ahra Jo, Ji-Hwan Kim","doi":"10.1109/BWCCA.2014.110","DOIUrl":"https://doi.org/10.1109/BWCCA.2014.110","url":null,"abstract":"This paper investigates various emotion recognition techniques from the facial expression of human subjects. To describe human facial expressions, a number of characteristic points are extracted from input face images using active shape models (ASMs), and translated 49 scalar features so that they are invariant to scale and position changes. The scalar feature values then construct a 49-dimensional feature vector for each still image. Statistical pattern recognizers, such as support vector machine (SVM) and multi-layer perceptron (MLP), are used to identify various emotions from the feature vectors. To analyze the performances of the various pattern recognizers on the limited amount of image data, 5-fold cross-validation is carried out, with varying numbers of emotions from 3 to 6. Evaluation results show that SVM is the most stable and best in terms of emotion classification rates.","PeriodicalId":195099,"journal":{"name":"2014 Ninth International Conference on Broadband and Wireless Computing, Communication and Applications","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117297754","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
扫码关注我们
求助内容：
应助结果提醒方式：