Single professionals and small companies come together and form virtual communities to compete with global players. In these collaboration networks, the actual business partners are discovered and alliances formed on demand. However, it is impossible for single members to keep track of the dynamics in large-scale networks. With the wide adoption of service-oriented architectures (SOA), interactions between partners have become observable. Monitoring collaborations enables the inference of social relations and the identification of successful partner compositions. Measuring the quality of social relations, such as the degree of trust based on the success of past interactions, are a powerful means to support the formation of alliances. However, by applying monitoring, also privacy concerns arise. In this paper we deal with concepts and tools to support group formations. We consider the trade-off between the benefits of sharing personal profiles and accounting for privacy concerns of the individual network members.
{"title":"Supporting Network Formation through Mining under Privacy Constraints","authors":"Florian Skopik, D. Schall, S. Dustdar","doi":"10.1109/SAINT.2010.10","DOIUrl":"https://doi.org/10.1109/SAINT.2010.10","url":null,"abstract":"Single professionals and small companies come together and form virtual communities to compete with global players. In these collaboration networks, the actual business partners are discovered and alliances formed on demand. However, it is impossible for single members to keep track of the dynamics in large-scale networks. With the wide adoption of service-oriented architectures (SOA), interactions between partners have become observable. Monitoring collaborations enables the inference of social relations and the identification of successful partner compositions. Measuring the quality of social relations, such as the degree of trust based on the success of past interactions, are a powerful means to support the formation of alliances. However, by applying monitoring, also privacy concerns arise. In this paper we deal with concepts and tools to support group formations. We consider the trade-off between the benefits of sharing personal profiles and accounting for privacy concerns of the individual network members.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115152991","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, many power analysis attacks have been proposed. Since the attacks are powerful, it is very important to implement cryptosystems securely against the attacks. We propose countermeasures against power analysis attacks for elliptic curve cryptosystems based on Koblitz curves (KCs), which are a special class of elliptic curves. That is, we make our countermeasures be secure against SPA, DPA, and new DPA attacks, specially RPA, ZPA, using a random point at each execution of elliptic curve scalar multiplication. And since our countermeasures are designed to use the Frobenius map of KC, those are very fast. Also, we reduce the number of elliptic curve addition up to about 50% using pre-computed tables.
{"title":"Efficient Scalar Multiplication Algorithms Secure against Power Analysis Attacks for Koblitz Curve Cryptosystems","authors":"Yong-hee Jang, Yong-jin Kwon","doi":"10.1109/SAINT.2010.112","DOIUrl":"https://doi.org/10.1109/SAINT.2010.112","url":null,"abstract":"Recently, many power analysis attacks have been proposed. Since the attacks are powerful, it is very important to implement cryptosystems securely against the attacks. We propose countermeasures against power analysis attacks for elliptic curve cryptosystems based on Koblitz curves (KCs), which are a special class of elliptic curves. That is, we make our countermeasures be secure against SPA, DPA, and new DPA attacks, specially RPA, ZPA, using a random point at each execution of elliptic curve scalar multiplication. And since our countermeasures are designed to use the Frobenius map of KC, those are very fast. Also, we reduce the number of elliptic curve addition up to about 50% using pre-computed tables.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123301191","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}
Yoshinori Osawa, S. Imamura, Atsushi Takeda, G. Kitagata, N. Shiratori, K. Hashimoto
Recent use of web services has spread over a wide variety of application areas. Users are requested to disclose private information for the use of web services. Such a disclosure is facing the risk of leaking private information. Privacy leakage is becoming one of the serious social problems. For the better use of web services, it is necessary to provide a reliable scheme for privacy management. There are many cases of private information leakage which are caused by user's misuse or unintended disclosure. In order to prevent users from unnecessarily leaking of private information, the users will be asked to clearly define information disclosure criteria. This paper discusses a privacy management architecture to prevent users from unnecessary leaking of private information. We demonstrate a prototype implementation how the proposed architecture effectively works in the initial setting of web services.
{"title":"A Proposal of Privacy Management Architecture","authors":"Yoshinori Osawa, S. Imamura, Atsushi Takeda, G. Kitagata, N. Shiratori, K. Hashimoto","doi":"10.1109/SAINT.2010.74","DOIUrl":"https://doi.org/10.1109/SAINT.2010.74","url":null,"abstract":"Recent use of web services has spread over a wide variety of application areas. Users are requested to disclose private information for the use of web services. Such a disclosure is facing the risk of leaking private information. Privacy leakage is becoming one of the serious social problems. For the better use of web services, it is necessary to provide a reliable scheme for privacy management. There are many cases of private information leakage which are caused by user's misuse or unintended disclosure. In order to prevent users from unnecessarily leaking of private information, the users will be asked to clearly define information disclosure criteria. This paper discusses a privacy management architecture to prevent users from unnecessary leaking of private information. We demonstrate a prototype implementation how the proposed architecture effectively works in the initial setting of web services.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123417655","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}
Kaori Maeda, M. Nishi, Teruaki Yoshida, Kaoru Suzuki, Hiroyuki Inoue
We propose of a digital signage system with a new audience detection system using TV broadcasting waves and show its experimental trial at our university for about three months. For audience motion detection, we use received level fluctuations of TV broadcasting waves by sensing physical movement. The authors have already developed this detection technique and we applied this as audience detection of digital signage. When our detection method detects human motion, a digital signage system will turned on its display. This flow grabs more attention to the signage display and effectiveness of saving electric power. Through the experimental trial, we show that our detection method provides effectiveness for audience detection of digital signage with a big monitor and we can save the electric power of 60-70% of the signage display and one of 94% in business days and in holidays, respectively.
{"title":"Digital Signage with Audience Detection Using TV Broadcasting Waves","authors":"Kaori Maeda, M. Nishi, Teruaki Yoshida, Kaoru Suzuki, Hiroyuki Inoue","doi":"10.1109/SAINT.2010.99","DOIUrl":"https://doi.org/10.1109/SAINT.2010.99","url":null,"abstract":"We propose of a digital signage system with a new audience detection system using TV broadcasting waves and show its experimental trial at our university for about three months. For audience motion detection, we use received level fluctuations of TV broadcasting waves by sensing physical movement. The authors have already developed this detection technique and we applied this as audience detection of digital signage. When our detection method detects human motion, a digital signage system will turned on its display. This flow grabs more attention to the signage display and effectiveness of saving electric power. Through the experimental trial, we show that our detection method provides effectiveness for audience detection of digital signage with a big monitor and we can save the electric power of 60-70% of the signage display and one of 94% in business days and in holidays, respectively.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125692722","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}
NAT (Network Address Translation) is well-known as one of the short-term solutions of IPv4 address exhaustion. NAT is a technique that shares a single IP address in several PCs, and is widely used for alleviating the IPv4 address exhaustion and as a security solution. However, when a backbone network has access control function for PCs based on their IP addresses, it cannot identify the PCs under a NAT router since their original IP addresses are hidden by the NAT router. In this research, we focus on MAC address which identifies PC at datalink layer and propose a NAT router which relays the MAC addresses of PCs inside of a LAN to the outside. Since the source MAC addresses of packets sent from PCs are preserved even after being relayed by the NAT router, a LAN access control server outside of the NAT router can still identify these PCs based on their MAC addresses instead of their IP addresses.
{"title":"A MAC-address Relaying NAT Router for PC Identification from Outside of a LAN","authors":"R. Murakami, N. Yamai, K. Okayama","doi":"10.1109/SAINT.2010.97","DOIUrl":"https://doi.org/10.1109/SAINT.2010.97","url":null,"abstract":"NAT (Network Address Translation) is well-known as one of the short-term solutions of IPv4 address exhaustion. NAT is a technique that shares a single IP address in several PCs, and is widely used for alleviating the IPv4 address exhaustion and as a security solution. However, when a backbone network has access control function for PCs based on their IP addresses, it cannot identify the PCs under a NAT router since their original IP addresses are hidden by the NAT router. In this research, we focus on MAC address which identifies PC at datalink layer and propose a NAT router which relays the MAC addresses of PCs inside of a LAN to the outside. Since the source MAC addresses of packets sent from PCs are preserved even after being relayed by the NAT router, a LAN access control server outside of the NAT router can still identify these PCs based on their MAC addresses instead of their IP addresses.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129181057","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}
Pervasive computing systems are begging for programming models and methodologies specifically suited to the particular cyber-physical nature of these systems. Reactive (rule-based) programming is an attractive model to use due to its built-in safety features and intuitive application development style. Without careful optimization however, reactive programming engines could turn into monstrous power drains of the pervasive system and its sensor network. In this paper we propose two optimizations for reactivity engines. The first, which we prove to be optimal, assumes all sensors in the space are equally important to the application. The other, which is adaptive, employs and estimates a probability for each sensor based on application usage. Both optimizations use a mixed push/pull approach to achieve optimal or near optimal energy efficiency. We present an experimental evaluation of the two algorithms to quantify their performance over a range of parameters.
{"title":"Reactive Programming Optimizations in Pervasive Computing","authors":"Chao Chen, Yi Xu, Kun Li, A. Helal","doi":"10.1109/SAINT.2010.92","DOIUrl":"https://doi.org/10.1109/SAINT.2010.92","url":null,"abstract":"Pervasive computing systems are begging for programming models and methodologies specifically suited to the particular cyber-physical nature of these systems. Reactive (rule-based) programming is an attractive model to use due to its built-in safety features and intuitive application development style. Without careful optimization however, reactive programming engines could turn into monstrous power drains of the pervasive system and its sensor network. In this paper we propose two optimizations for reactivity engines. The first, which we prove to be optimal, assumes all sensors in the space are equally important to the application. The other, which is adaptive, employs and estimates a probability for each sensor based on application usage. Both optimizations use a mixed push/pull approach to achieve optimal or near optimal energy efficiency. We present an experimental evaluation of the two algorithms to quantify their performance over a range of parameters.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125986354","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}
CUBIQ is a common and shared platform which mediates diversified sensor systems and ubiquitous applications. The platform enhances ubiquitous applications through diversified federations among sensors, services and applications. The platform offer transparent context data access, real-time and scalable data dissemination and processing and intelligent service collaborations.
{"title":"CUBIQ: Cross UBIQuitous Platform Architecture","authors":"H. Dempo, Makiko Yoshida","doi":"10.1109/SAINT.2010.47","DOIUrl":"https://doi.org/10.1109/SAINT.2010.47","url":null,"abstract":"CUBIQ is a common and shared platform which mediates diversified sensor systems and ubiquitous applications. The platform enhances ubiquitous applications through diversified federations among sensors, services and applications. The platform offer transparent context data access, real-time and scalable data dissemination and processing and intelligent service collaborations.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130074389","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}
Hidenobu Watanabe, H. Masaoka, T. Ohigashi, T. Kondo, K. Nishimura, R. Aibara
Virtualization has been also used as desktop utility and supports VM migration, which is a function to migrate a VM (Virtual Machine) from a physical host to another. However, it cannot migrate hardware configuration of peripherals. We focus on USB devices as peripherals and provide the USB device connection method by combination of MAT and USB/IP for the global migration. In our system, MAT is implemented into VM and solves mismatch of VM's IP address caused by VM migration. We define VM migration capable of migrating among distinct hosts over different network segments as the global migration. USB device connectivity between host and VM is ensured by USB/IP. Combination of MAT and USB/IP allows a migrated VM to connect a USB device attaching to any hosts after migration. This paper describes the proposed mechanism for the global migration supporting USB devices.
{"title":"Supporting USB Devices for the Global Migration","authors":"Hidenobu Watanabe, H. Masaoka, T. Ohigashi, T. Kondo, K. Nishimura, R. Aibara","doi":"10.1109/SAINT.2010.59","DOIUrl":"https://doi.org/10.1109/SAINT.2010.59","url":null,"abstract":"Virtualization has been also used as desktop utility and supports VM migration, which is a function to migrate a VM (Virtual Machine) from a physical host to another. However, it cannot migrate hardware configuration of peripherals. We focus on USB devices as peripherals and provide the USB device connection method by combination of MAT and USB/IP for the global migration. In our system, MAT is implemented into VM and solves mismatch of VM's IP address caused by VM migration. We define VM migration capable of migrating among distinct hosts over different network segments as the global migration. USB device connectivity between host and VM is ensured by USB/IP. Combination of MAT and USB/IP allows a migrated VM to connect a USB device attaching to any hosts after migration. This paper describes the proposed mechanism for the global migration supporting USB devices.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130128700","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}
To operate e-mail systems stably multihomed networks are well used. As an operation method on multihomed networks, we have proposed a dynamic route selection method considering status of networks. However, status of Mail Transfer Agents(MTAs) have not been considered in this method so that a heavily loaded MTA would be possibly selected. In this paper, we propose a new dynamic route selection method considering not only status of networks but also that of MTAs. With this method, an appropriate route could be selected based on status of networks and MTAs so that dynamic load balancing of MTAs could be realized. Furthermore in case failed MTAs exist, such MTAs could be avoided automatically.
为了稳定地运行电子邮件系统，多主网络被广泛使用。作为多宿主网络的一种操作方法，我们提出了一种考虑网络状态的动态路由选择方法。但是，在此方法中没有考虑邮件传输代理(Mail Transfer Agents, MTA)的状态，因此可能会选择负载较重的MTA。本文提出了一种既考虑网络状态又考虑mta状态的动态路由选择方法。该方法可以根据网络和mta的状态选择合适的路由，从而实现mta的动态负载均衡。此外，如果存在失败的mta，则可以自动避免此类mta。
{"title":"A Dynamic Routing Method for Inbound E-mail Delivery Considering Route and MTA Conditions on Multihomed Environment","authors":"Sho Jitsuto, Yong Jin, K. Okayama, N. Yamai","doi":"10.1109/SAINT.2010.96","DOIUrl":"https://doi.org/10.1109/SAINT.2010.96","url":null,"abstract":"To operate e-mail systems stably multihomed networks are well used. As an operation method on multihomed networks, we have proposed a dynamic route selection method considering status of networks. However, status of Mail Transfer Agents(MTAs) have not been considered in this method so that a heavily loaded MTA would be possibly selected. In this paper, we propose a new dynamic route selection method considering not only status of networks but also that of MTAs. With this method, an appropriate route could be selected based on status of networks and MTAs so that dynamic load balancing of MTAs could be realized. Furthermore in case failed MTAs exist, such MTAs could be avoided automatically.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124367381","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}
SQL injection attacks occur due to vulnerabilities in the design of queries where a malicious user can take advantage of input opportunities to insert code in the queries that modify the query-conditions resulting in unauthorized database access. We provide a novel technique to identify the possibilities of such attacks. The central theme of our technique is based on automatically developing a model for a SQL query such that the model captures the dependencies between various components (sub-queries) of the query. We, then, analyze the model using CREST test-case generator and identify the conditions under which the query corresponding to the model is deemed vulnerable. We further analyze the obtained condition-set to identify its subset; this subset being referred to as the causal set of the vulnerability. Our technique considers the semantics of the query conditions, i.e., the relationship between the conditions, and as such complements the existing techniques which only rely on syntactic structure of the SQL query. In short, our technique can detect vulnerabilities in nested SQL queries, and can provide results with no false positives or false negatives when compared to the existing techniques.
{"title":"Analysis & Detection of SQL Injection Vulnerabilities via Automatic Test Case Generation of Programs","authors":"Michelle Ruse, Tanmoy Sarkar, Samik Basu","doi":"10.1109/SAINT.2010.60","DOIUrl":"https://doi.org/10.1109/SAINT.2010.60","url":null,"abstract":"SQL injection attacks occur due to vulnerabilities in the design of queries where a malicious user can take advantage of input opportunities to insert code in the queries that modify the query-conditions resulting in unauthorized database access. We provide a novel technique to identify the possibilities of such attacks. The central theme of our technique is based on automatically developing a model for a SQL query such that the model captures the dependencies between various components (sub-queries) of the query. We, then, analyze the model using CREST test-case generator and identify the conditions under which the query corresponding to the model is deemed vulnerable. We further analyze the obtained condition-set to identify its subset; this subset being referred to as the causal set of the vulnerability. Our technique considers the semantics of the query conditions, i.e., the relationship between the conditions, and as such complements the existing techniques which only rely on syntactic structure of the SQL query. In short, our technique can detect vulnerabilities in nested SQL queries, and can provide results with no false positives or false negatives when compared to the existing techniques.","PeriodicalId":381377,"journal":{"name":"2010 10th IEEE/IPSJ International Symposium on Applications and the Internet","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124449687","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
扫码关注我们
求助内容：
应助结果提醒方式：