Anomaly detection based on monitoring of sequences of system calls has proved to be an effective approach for detection of previously unknown attacks on programs. This paper describes a new model for profiling normal program behavior that can be used to detect intrusions that change application execution flow. The model (hybrid push down automaton, HPDA) incorporates call stack information and can be learned by dynamic analysis of training data captured from the call stack log. The learning algorithm uses call stack information maintained by the program to build a finite state automaton. When compared to other approaches including VtPath which also uses call stack information, the HPDA model produces a more compact and general representation of control flow, handles recursion naturally, can be learned with less training data, and has a lower false positive rate when used for anomaly detection. In addition, dynamic learning can also be used to supplement a model acquired from static analysis.
{"title":"Dynamic learning of automata from the call stack log for anomaly detection","authors":"Z. Liu, S. Bridges","doi":"10.1109/ITCC.2005.136","DOIUrl":"https://doi.org/10.1109/ITCC.2005.136","url":null,"abstract":"Anomaly detection based on monitoring of sequences of system calls has proved to be an effective approach for detection of previously unknown attacks on programs. This paper describes a new model for profiling normal program behavior that can be used to detect intrusions that change application execution flow. The model (hybrid push down automaton, HPDA) incorporates call stack information and can be learned by dynamic analysis of training data captured from the call stack log. The learning algorithm uses call stack information maintained by the program to build a finite state automaton. When compared to other approaches including VtPath which also uses call stack information, the HPDA model produces a more compact and general representation of control flow, handles recursion naturally, can be learned with less training data, and has a lower false positive rate when used for anomaly detection. In addition, dynamic learning can also be used to supplement a model acquired from static analysis.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"05 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123520576","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}
Location is one of the most important contexts used in pervasive computing environments. GPS systems are intensely used to detect the location information; they mainly work in outdoor environment. Applications call for precise, easy-to-build, and easy-to-use indoor location systems. This paper presents our work to implement an indoor location determination system for Microsoft-Windows-based platforms using a preexisting IEEE 802.11 wireless network. The location is determined from radio signal strength information collected from multiple base stations at different physical locations. Our experiments show a high accuracy rate of this approach.
{"title":"Towards an indoor location system using RF signal strength in IEEE 802.11 networks","authors":"A. Harder, Lanlan Song, Yu Wang","doi":"10.1109/ITCC.2005.278","DOIUrl":"https://doi.org/10.1109/ITCC.2005.278","url":null,"abstract":"Location is one of the most important contexts used in pervasive computing environments. GPS systems are intensely used to detect the location information; they mainly work in outdoor environment. Applications call for precise, easy-to-build, and easy-to-use indoor location systems. This paper presents our work to implement an indoor location determination system for Microsoft-Windows-based platforms using a preexisting IEEE 802.11 wireless network. The location is determined from radio signal strength information collected from multiple base stations at different physical locations. Our experiments show a high accuracy rate of this approach.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"172 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123566297","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}
Web crawlers are one of the most crucial components in search engines and their optimization would have a great effect on improving the searching efficiency. In this paper, we introduce an intelligent crawler called Gcrawler that uses a genetic algorithm for improving its crawling performance. Gcrawler estimates the best path for crawling on one hand and expands its initial keywords by using a genetic algorithm during the crawling on the other hand. This is the first crawler that acts intelligently without any relevance feedback or training. All the processes are online and there is no need for direct interaction with the users.
{"title":"Enhancing focused crawling with genetic algorithms","authors":"Milad Shokouhi, P. Chubak, Zaynab Raeesy","doi":"10.1109/ITCC.2005.145","DOIUrl":"https://doi.org/10.1109/ITCC.2005.145","url":null,"abstract":"Web crawlers are one of the most crucial components in search engines and their optimization would have a great effect on improving the searching efficiency. In this paper, we introduce an intelligent crawler called Gcrawler that uses a genetic algorithm for improving its crawling performance. Gcrawler estimates the best path for crawling on one hand and expands its initial keywords by using a genetic algorithm during the crawling on the other hand. This is the first crawler that acts intelligently without any relevance feedback or training. All the processes are online and there is no need for direct interaction with the users.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125134895","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}
"Mobile Internet" arguably means more than just a new technique for communication; many analysts believe that it revolutionized the business world and innovate the way individuals live. This study concentrates on switching existing e-commerce applications from the wired Internet to the mobile Internet. Web services technologies are currently the most appropriate technologies to realize e-commerce applications. This study develops a mobile commerce application framework based on Web services technologies and mobile Internet functions. To investigate the feasibility of the proposed framework, an m-store implementation is deployed in a laboratory and simulated using HTTP transactions with secure sockets layer connections in a multi-user access environment. The minimum response time is stable (0.170 seconds for 5 users, 0.196 seconds for 50 users); the maximum throughput is invariable (0.365 Mbps for 5 users, 0.317 Mbps for 50 users), and the maximum transaction rate has little variation (5.882 per seconds for 5 users, 5.102 per seconds for 50 users). Results of this study demonstrate that the proposed framework is flexible, stable and scalable.
{"title":"A mobile commerce framework based on Web services architecture","authors":"Yao-Chung Chang, Jiann-Liang Chen, Wen-Ming Tseng","doi":"10.1109/ITCC.2005.16","DOIUrl":"https://doi.org/10.1109/ITCC.2005.16","url":null,"abstract":"\"Mobile Internet\" arguably means more than just a new technique for communication; many analysts believe that it revolutionized the business world and innovate the way individuals live. This study concentrates on switching existing e-commerce applications from the wired Internet to the mobile Internet. Web services technologies are currently the most appropriate technologies to realize e-commerce applications. This study develops a mobile commerce application framework based on Web services technologies and mobile Internet functions. To investigate the feasibility of the proposed framework, an m-store implementation is deployed in a laboratory and simulated using HTTP transactions with secure sockets layer connections in a multi-user access environment. The minimum response time is stable (0.170 seconds for 5 users, 0.196 seconds for 50 users); the maximum throughput is invariable (0.365 Mbps for 5 users, 0.317 Mbps for 50 users), and the maximum transaction rate has little variation (5.882 per seconds for 5 users, 5.102 per seconds for 50 users). Results of this study demonstrate that the proposed framework is flexible, stable and scalable.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128784887","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 this paper, we present a polling scheme, which allows for augmenting the support of voice communications in point co-ordination function (PCF) of IEEE 802.11 wireless networks. In this scheme, the access point (AP) of the basic service set (BSS) maintains two polling lists, i.e. the talking list and the silence list. Based on the talking status of the stations identified via silence detection, the two lists are dynamically adjusted by the AP. Temporary removal is applied to the stations in the silence list to further upgrade the performance. The conducted study based on simulation has shown that the proposed scheme is able to support more voice stations and has a lower packet loss rate compared to that obtained by four reference polling algorithms.
{"title":"An improved polling scheme for voice support in IEEE 802.11 wireless network","authors":"Jun Zheng, E. Regentova","doi":"10.1109/ITCC.2005.80","DOIUrl":"https://doi.org/10.1109/ITCC.2005.80","url":null,"abstract":"In this paper, we present a polling scheme, which allows for augmenting the support of voice communications in point co-ordination function (PCF) of IEEE 802.11 wireless networks. In this scheme, the access point (AP) of the basic service set (BSS) maintains two polling lists, i.e. the talking list and the silence list. Based on the talking status of the stations identified via silence detection, the two lists are dynamically adjusted by the AP. Temporary removal is applied to the stations in the silence list to further upgrade the performance. The conducted study based on simulation has shown that the proposed scheme is able to support more voice stations and has a lower packet loss rate compared to that obtained by four reference polling algorithms.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130330152","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}
Design patterns document good design solutions to a recurring problem in a particular context. They are typically modeled using UML. In practice, however, pattern-related information is lost when a design pattern is applied or composed because UML does not keep track of this information. Consequently, the designer cannot identify design patterns used in software system design diagrams. The benefits of design patterns are compromised because the designers cannot communicate with each other in terms of the design patterns they use and their design decisions and tradeoffs. In this paper, we present a Web service (VisDP) for explicitly visualizing design patterns in UML diagrams. This Web service is developed based on a UML profile containing new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. With this service, the user is able to identify design patterns by moving the mouse and viewing color changes in UML diagrams. Additional pattern-related information can be dynamically displayed based on the mouse location.
{"title":"VisDP: a Web service for visualizing design patterns on demand","authors":"Jing Dong, Sheng Yang, Kang Zhang","doi":"10.1109/ITCC.2005.293","DOIUrl":"https://doi.org/10.1109/ITCC.2005.293","url":null,"abstract":"Design patterns document good design solutions to a recurring problem in a particular context. They are typically modeled using UML. In practice, however, pattern-related information is lost when a design pattern is applied or composed because UML does not keep track of this information. Consequently, the designer cannot identify design patterns used in software system design diagrams. The benefits of design patterns are compromised because the designers cannot communicate with each other in terms of the design patterns they use and their design decisions and tradeoffs. In this paper, we present a Web service (VisDP) for explicitly visualizing design patterns in UML diagrams. This Web service is developed based on a UML profile containing new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. With this service, the user is able to identify design patterns by moving the mouse and viewing color changes in UML diagrams. Additional pattern-related information can be dynamically displayed based on the mouse location.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131132876","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 requirements, which define automatic behavior within a domain model, appear variously as business policies, engineering rules, domain laws, constraints, and state transitions. At first glance, such requirements seem easy to implement in the conventional object oriented (OO) space, but when looked closely, the most natural way of expressing such behavior is the rule based approach. Given a seamless bridge between the two paradigms, the combination not only provides ease of programming but also conceptual clarity at a higher level. In this paper, we consider the features of logic languages and their advantages in representation of various aforesaid system requirements. We look at the conventional three tier object oriented architecture and its advantage and disadvantages using different examples. We propose an optimum architecture that combines the best of both. We also apply the proposed architecture in the context of building highly configurable systems.
{"title":"Need for incorporating a rule-based component in conventional object oriented systems","authors":"Bhuwan Lodha, K. Dinesha, Pavan Kumar","doi":"10.1109/ITCC.2005.209","DOIUrl":"https://doi.org/10.1109/ITCC.2005.209","url":null,"abstract":"System requirements, which define automatic behavior within a domain model, appear variously as business policies, engineering rules, domain laws, constraints, and state transitions. At first glance, such requirements seem easy to implement in the conventional object oriented (OO) space, but when looked closely, the most natural way of expressing such behavior is the rule based approach. Given a seamless bridge between the two paradigms, the combination not only provides ease of programming but also conceptual clarity at a higher level. In this paper, we consider the features of logic languages and their advantages in representation of various aforesaid system requirements. We look at the conventional three tier object oriented architecture and its advantage and disadvantages using different examples. We propose an optimum architecture that combines the best of both. We also apply the proposed architecture in the context of building highly configurable systems.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336338","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}
As a general design criterion, a symmetric key cipher should not be closed under functional composition due to the implications on the security of the cipher. However, there are scenarios in which this property is desirable and can be obtained without reducing the security of a cipher by increasing the computational workload of the cipher. We expand the idea of a symmetric key cipher being closed under functional composition to a more general scenario where there exists a function that converts the ciphertext resulting from encryption under a specific key to the ciphertext corresponding to encryption with another key. We show how to perform such a conversion without exposing the plaintext. We discuss the tradeoff between the computational workload and security, and the relationship between such conversions and proxy cryptography. We conclude with a description of some practical applications of our results.
{"title":"Conversion and proxy functions for symmetric key ciphers","authors":"Debra L. Cook, A. Keromytis","doi":"10.1109/ITCC.2005.115","DOIUrl":"https://doi.org/10.1109/ITCC.2005.115","url":null,"abstract":"As a general design criterion, a symmetric key cipher should not be closed under functional composition due to the implications on the security of the cipher. However, there are scenarios in which this property is desirable and can be obtained without reducing the security of a cipher by increasing the computational workload of the cipher. We expand the idea of a symmetric key cipher being closed under functional composition to a more general scenario where there exists a function that converts the ciphertext resulting from encryption under a specific key to the ciphertext corresponding to encryption with another key. We show how to perform such a conversion without exposing the plaintext. We discuss the tradeoff between the computational workload and security, and the relationship between such conversions and proxy cryptography. We conclude with a description of some practical applications of our results.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515187","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, a lot of effort has been done to investigate all kinds of explicit formulae for speeding up group operation of hyperelliptic curve cryptosystem (HECC). In this paper, explicit formulae without using inversion for genus 3 HECC are given for the first time. When genus 3 HECC is defined over a prime field, our explicit formulae will cost respectively 122M + 9S, 105M + 8S and 110M + 11S to perform a group addition, mixed addition and doubling. If we use special genus 3 hyperelliptic curves with h(x) = 1 over a binary field, our explicit formulae will need only 119M + 9S, 102M + 8S and 42M + 15S for a group addition, mixed addition and doubling, respectively. In the second part of our contribution, we implement inversion-free arithmetic on genus 3 hyperelliptic curves defined over one prime field and three binary fields on a Pentium-M processor and compare the speed of explicit formulae in affine and projective coordinate system. The proposed explicit formulae show excellent performance on Pentium-M processors. We were able to get an increase in performance of over 40% compared to the affine coordinate case. Hence, our newly derived formulae are another step towards the use of HECC in practical applications.
{"title":"Inversion-free arithmetic on genus 3 hyperelliptic curves and its implementations","authors":"Xinxin Fan, T. Wollinger, Yumin Wang","doi":"10.1109/ITCC.2005.179","DOIUrl":"https://doi.org/10.1109/ITCC.2005.179","url":null,"abstract":"Recently, a lot of effort has been done to investigate all kinds of explicit formulae for speeding up group operation of hyperelliptic curve cryptosystem (HECC). In this paper, explicit formulae without using inversion for genus 3 HECC are given for the first time. When genus 3 HECC is defined over a prime field, our explicit formulae will cost respectively 122M + 9S, 105M + 8S and 110M + 11S to perform a group addition, mixed addition and doubling. If we use special genus 3 hyperelliptic curves with h(x) = 1 over a binary field, our explicit formulae will need only 119M + 9S, 102M + 8S and 42M + 15S for a group addition, mixed addition and doubling, respectively. In the second part of our contribution, we implement inversion-free arithmetic on genus 3 hyperelliptic curves defined over one prime field and three binary fields on a Pentium-M processor and compare the speed of explicit formulae in affine and projective coordinate system. The proposed explicit formulae show excellent performance on Pentium-M processors. We were able to get an increase in performance of over 40% compared to the affine coordinate case. Hence, our newly derived formulae are another step towards the use of HECC in practical applications.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125693133","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}
Ying-Chieh Chen, Jing-Jang Hwang, R. Song, George Yee, L. Korba
Along with the development of multimedia, animation, and network bandwidth, online gaming has become a very successful and outstanding industry recently, especially in Asia Pacific. However, due to the lack of security consideration, legal regulation, management, auditing and related legislation, more and more players have violated the law or become the victims while they are indulging in the virtual world. Virtual properties are getting more and more valuable in the real-world marketplace, and trade or exchange of virtual properties between players have become prevalent. Unfortunately, using illegal fraudulent means or programs to grab others' UserID or password are increasing as well. This paper provides a detailed overview of the online cheating threat and the associated security flaws, examines its consequences for online businesses, and outlines technical solutions and implications.
{"title":"Online gaming cheating and security issue","authors":"Ying-Chieh Chen, Jing-Jang Hwang, R. Song, George Yee, L. Korba","doi":"10.1109/ITCC.2005.215","DOIUrl":"https://doi.org/10.1109/ITCC.2005.215","url":null,"abstract":"Along with the development of multimedia, animation, and network bandwidth, online gaming has become a very successful and outstanding industry recently, especially in Asia Pacific. However, due to the lack of security consideration, legal regulation, management, auditing and related legislation, more and more players have violated the law or become the victims while they are indulging in the virtual world. Virtual properties are getting more and more valuable in the real-world marketplace, and trade or exchange of virtual properties between players have become prevalent. Unfortunately, using illegal fraudulent means or programs to grab others' UserID or password are increasing as well. This paper provides a detailed overview of the online cheating threat and the associated security flaws, examines its consequences for online businesses, and outlines technical solutions and implications.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126692063","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
扫码关注我们
求助内容：
应助结果提醒方式：