Smart grid is a very efficient and intelligent system for managing and monitoring the electricity usage and it can be applied in many useful areas. It supports energy producers and consumers efficiently by supporting the estimation and provision of the proper amount of electricity in proper time. However, when the information is altered or forged by the attackers, it could cause the system malfunction. In addition to that, some attacks could waste the system resources on purpose and could lead to disastrous results. In this work, we propose a secure data aggregation mechanism providing verification of the aggregated data and detection of the compromised node to prevent the DoS(Denial of Service) attack based on the homomorphic encryption.
{"title":"Secure Aggregation and Attack Detection for Smart Grid System","authors":"Inshil Doh, Jiyoung Lim, K. Chae","doi":"10.1109/NBiS.2013.41","DOIUrl":"https://doi.org/10.1109/NBiS.2013.41","url":null,"abstract":"Smart grid is a very efficient and intelligent system for managing and monitoring the electricity usage and it can be applied in many useful areas. It supports energy producers and consumers efficiently by supporting the estimation and provision of the proper amount of electricity in proper time. However, when the information is altered or forged by the attackers, it could cause the system malfunction. In addition to that, some attacks could waste the system resources on purpose and could lead to disastrous results. In this work, we propose a secure data aggregation mechanism providing verification of the aggregated data and detection of the compromised node to prevent the DoS(Denial of Service) attack based on the homomorphic encryption.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121027551","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}
Due to the increasing amount of data handled by business applications and the need of an easy way to access data by multiple servers, storage area networks (SAN) have been proposed as a solution to be deployed in enterprises networks. Introducing the wireless aspects to the SAN environment enables more flexibility but it introduces at the same time a set of threats and vulnerabilities that may be exploited by the intruder in order to cause damage to network resources. The integration of transaction-based applications in these environment introduces an additional set of threats that may prevent the correct processing in the wireless storage area network (WSAN) environment. In this context, we propose a marking intrusion for WSAN environment.
{"title":"Marking Intrusion of Transaction-Based Applications in Wireless Storage Area Network","authors":"S. Chatti, Habib Ounelli","doi":"10.1109/NBiS.2013.91","DOIUrl":"https://doi.org/10.1109/NBiS.2013.91","url":null,"abstract":"Due to the increasing amount of data handled by business applications and the need of an easy way to access data by multiple servers, storage area networks (SAN) have been proposed as a solution to be deployed in enterprises networks. Introducing the wireless aspects to the SAN environment enables more flexibility but it introduces at the same time a set of threats and vulnerabilities that may be exploited by the intruder in order to cause damage to network resources. The integration of transaction-based applications in these environment introduces an additional set of threats that may prevent the correct processing in the wireless storage area network (WSAN) environment. In this context, we propose a marking intrusion for WSAN environment.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123215802","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}
System call is high-cost operation because it causes switch the running mode of a process. As a solution reduce overhead of system call, we have proposed the Dynamic running Mode Switch Mechanism (DMSM) which can switch the running mode of process dynamically. Because DMSM enables that system call is substituted by simple function call, it dramatically improved of overhead of system call. However, DMSM cannot protect the OS to access an applications program executing by supervisor-mode. In this paper, we propose protection function of OS from an application with a supervisor-mode. We propose two types of protection function, i.e., virtual space switch mechanism and segmentation switch mechanism. We also evaluate the effectiveness of two protection functions compared with original DMSM.
{"title":"Evaluation of Dynamic Running Mode Switch Mechanism by Presence of OS Protection","authors":"K. Yokoyama, H. Kumon, H. Taniguchi","doi":"10.1109/NBiS.2013.56","DOIUrl":"https://doi.org/10.1109/NBiS.2013.56","url":null,"abstract":"System call is high-cost operation because it causes switch the running mode of a process. As a solution reduce overhead of system call, we have proposed the Dynamic running Mode Switch Mechanism (DMSM) which can switch the running mode of process dynamically. Because DMSM enables that system call is substituted by simple function call, it dramatically improved of overhead of system call. However, DMSM cannot protect the OS to access an applications program executing by supervisor-mode. In this paper, we propose protection function of OS from an application with a supervisor-mode. We propose two types of protection function, i.e., virtual space switch mechanism and segmentation switch mechanism. We also evaluate the effectiveness of two protection functions compared with original DMSM.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117143843","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}
Mebae Ushida, Kouichi Itoh, Yoshinori Katayama, Fumihiko Kozakura, H. Tsuda
In recent years, the evolution of the cloud computing increases the demand of the services which provides profitable information analyzed from huge data from heterogeneous information sources. In order to reduce the user's anxiety to store the private and confidential information in the cloud, various Privacy Preserving Data Mining (PPDM) techniques are developed, which enable the cloud to perform data mining from secured data. In this paper, we propose a PPDM technique specialized in data aggregation that satisfies following two requirements: (1)The information stored in the cloud is guaranteed against information leakage, because no profitable information is obtained from the secured data without the users' secret information, which is not stored in the cloud. (2)The cloud provides multi-level granularity of the aggregation results according to the user's authority.
{"title":"A Proposal of Privacy-Preserving Data Aggregation on the Cloud Computing","authors":"Mebae Ushida, Kouichi Itoh, Yoshinori Katayama, Fumihiko Kozakura, H. Tsuda","doi":"10.1109/NBiS.2013.24","DOIUrl":"https://doi.org/10.1109/NBiS.2013.24","url":null,"abstract":"In recent years, the evolution of the cloud computing increases the demand of the services which provides profitable information analyzed from huge data from heterogeneous information sources. In order to reduce the user's anxiety to store the private and confidential information in the cloud, various Privacy Preserving Data Mining (PPDM) techniques are developed, which enable the cloud to perform data mining from secured data. In this paper, we propose a PPDM technique specialized in data aggregation that satisfies following two requirements: (1)The information stored in the cloud is guaranteed against information leakage, because no profitable information is obtained from the secured data without the users' secret information, which is not stored in the cloud. (2)The cloud provides multi-level granularity of the aggregation results according to the user's authority.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115279261","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}
E-learning applications and processes include Web-based learning, computer-based learning, virtual classrooms and digital collaboration. Recently, in the system development case, cloud computing has applied for learning system. This research aims to make a model for mobile cloud learning system and its application. In the system, it has three layers; system layer, application layer and user layer.
{"title":"Application for Mobile Cloud Learning","authors":"Jae Dong Lee, J. Park","doi":"10.1109/NBiS.2013.46","DOIUrl":"https://doi.org/10.1109/NBiS.2013.46","url":null,"abstract":"E-learning applications and processes include Web-based learning, computer-based learning, virtual classrooms and digital collaboration. Recently, in the system development case, cloud computing has applied for learning system. This research aims to make a model for mobile cloud learning system and its application. In the system, it has three layers; system layer, application layer and user layer.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130774615","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}
M. Durresi, Tamara Luarasi, I. Baholli, A. Durresi
Targeted advertisement is an efficient way of matching clients' buying preferences with potential products from various vendors. We propose an application architecture that uses smart phones and cloud computing to distribute in real time advertisement information to clients by matching their location, preferences and price range with available products. Our tests of the proposed application show its applicability in targeted advertisement.
{"title":"Targeted Advertisement Using Smartphones and Cloud Computing","authors":"M. Durresi, Tamara Luarasi, I. Baholli, A. Durresi","doi":"10.1109/NBiS.2013.22","DOIUrl":"https://doi.org/10.1109/NBiS.2013.22","url":null,"abstract":"Targeted advertisement is an efficient way of matching clients' buying preferences with potential products from various vendors. We propose an application architecture that uses smart phones and cloud computing to distribute in real time advertisement information to clients by matching their location, preferences and price range with available products. Our tests of the proposed application show its applicability in targeted advertisement.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"108 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128693198","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}
Junyoung Park, Youngjun Lee, Kyungroul Lee, Hanggon Kim, Dmitry Volokhov, Kangbin Yim
This paper introduces a framework for a ubiquitous sensor network along with its prototype platform, as a testbed for cognitive computing and routing algorithms. As wireless sensor networks have attracted worldwide attention as an important building block of the "Internet of Things", the cognitive sensor network is currently becoming a popular research topic as an intelligently-enhanced and power-efficient dynamic network. However, related research is still at the conceptual stage, and a realized test platform is essential. The combination of a framework and platform introduced in this paper is expected to be a useful testbed for cognitive computations and dynamic routing algorithms.
{"title":"GEESE: A Cognitive USN Platform","authors":"Junyoung Park, Youngjun Lee, Kyungroul Lee, Hanggon Kim, Dmitry Volokhov, Kangbin Yim","doi":"10.1109/NBiS.2013.145","DOIUrl":"https://doi.org/10.1109/NBiS.2013.145","url":null,"abstract":"This paper introduces a framework for a ubiquitous sensor network along with its prototype platform, as a testbed for cognitive computing and routing algorithms. As wireless sensor networks have attracted worldwide attention as an important building block of the \"Internet of Things\", the cognitive sensor network is currently becoming a popular research topic as an intelligently-enhanced and power-efficient dynamic network. However, related research is still at the conceptual stage, and a realized test platform is essential. The combination of a framework and platform introduced in this paper is expected to be a useful testbed for cognitive computations and dynamic routing algorithms.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127031789","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}
Our previous work proposed a clustering algorithm to cluster research documents automatically. It used Web hit counts of AND-search on two words as a document vector. Target documents are clustered with a result of k-means clustering method, in which cosine similarity is used to calculate a distance. This paper uses this algorithm to cluster twitter users. However, the twitter users have different characteristics from the research documents. Therefore, we investigate problems of the using our algorithm for twitter users and propose some ideas to resolve it.
{"title":"A Clustering Algorithm Using Twitter User Biography","authors":"Masaki Kohana, S. Okamoto, Masaya Kaneko","doi":"10.1109/NBiS.2013.70","DOIUrl":"https://doi.org/10.1109/NBiS.2013.70","url":null,"abstract":"Our previous work proposed a clustering algorithm to cluster research documents automatically. It used Web hit counts of AND-search on two words as a document vector. Target documents are clustered with a result of k-means clustering method, in which cosine similarity is used to calculate a distance. This paper uses this algorithm to cluster twitter users. However, the twitter users have different characteristics from the research documents. Therefore, we investigate problems of the using our algorithm for twitter users and propose some ideas to resolve it.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114405481","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}
In order to realize high-realistic sensation tele-communication over wide-area network, we consider that non-verbal communication play an important role, and displaying the existence of participant by high-quality video streaming on large-scale screen system in each remote site is effective. However, the display specification of these systems such as commercial projector and wide-area monitor is low-resolution, and displaying of real video streaming with sufficient quality is difficult. Moreover, displaying video streaming with realistic high-resolution is serious, because there is a limit in the display resolution of video image captured by a single camera. We have constructed the tele-communication environment to display ultra resolution video streaming by multi-transmitting each video image which captured by four cameras with tiled display wall which is a technology to display various high-resolution contents by configuring the large-scale display with two or more LCD panels. In this paper, we have conducted an experiment on ultra-resolution video transmission between remote sites via wide-area network by using this tiled display wall environment in order to examine the feasibility of high-realistic sensation tele-communication, and have reported the experimental results.
{"title":"An Experiment on Ultra-resolution Video Transmission with Tiled Display Wall in Wide-Area Network","authors":"Yasuo Ebara, S. Noda, Akira Sakuraba, Y. Shibata","doi":"10.1109/NBiS.2013.49","DOIUrl":"https://doi.org/10.1109/NBiS.2013.49","url":null,"abstract":"In order to realize high-realistic sensation tele-communication over wide-area network, we consider that non-verbal communication play an important role, and displaying the existence of participant by high-quality video streaming on large-scale screen system in each remote site is effective. However, the display specification of these systems such as commercial projector and wide-area monitor is low-resolution, and displaying of real video streaming with sufficient quality is difficult. Moreover, displaying video streaming with realistic high-resolution is serious, because there is a limit in the display resolution of video image captured by a single camera. We have constructed the tele-communication environment to display ultra resolution video streaming by multi-transmitting each video image which captured by four cameras with tiled display wall which is a technology to display various high-resolution contents by configuring the large-scale display with two or more LCD panels. In this paper, we have conducted an experiment on ultra-resolution video transmission between remote sites via wide-area network by using this tiled display wall environment in order to examine the feasibility of high-realistic sensation tele-communication, and have reported the experimental results.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114949684","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}
An improved addition formula for an elliptic curve given by Weierstrass form is proposed. First, the coordinate is converted so that P = (0, y1) and Q = (x2, y2), and then the equation of the elliptic curve becomes y2 = x3 + ax2 + bx + c. The proposed formula is thus “x-coordinate of P + Q= (b - 2λy1)/x2”, where λ is the slope of the line through P and Q. The proposed formula can be derived by the geometric definition of point addition. Applying the proposed formula reduces the cost of adding point by about 20% on a system using the mixed coordinate of affine + projective = projective. However, it increases the cost of doubling point, and so we require a further improvement in the future.
{"title":"An Improved Addition Formula on Elliptic Curves Given by Weierstrass Normal Form","authors":"Masaaki Shirase","doi":"10.1109/NBiS.2013.88","DOIUrl":"https://doi.org/10.1109/NBiS.2013.88","url":null,"abstract":"An improved addition formula for an elliptic curve given by Weierstrass form is proposed. First, the coordinate is converted so that P = (0, y<sub>1</sub>) and Q = (x<sub>2</sub>, y<sub>2</sub>), and then the equation of the elliptic curve becomes y<sup>2</sup> = x<sup>3</sup> + ax<sup>2</sup> + bx + c. The proposed formula is thus “x-coordinate of P + Q= (b - 2λ<sub>y1</sub>)/x<sub>2</sub>”, where λ is the slope of the line through P and Q. The proposed formula can be derived by the geometric definition of point addition. Applying the proposed formula reduces the cost of adding point by about 20% on a system using the mixed coordinate of affine + projective = projective. However, it increases the cost of doubling point, and so we require a further improvement in the future.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122676450","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
扫码关注我们
求助内容：
应助结果提醒方式：