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}
Zongkai Yang, Qingtang Liu, Kun Yan, Wanting Deng, Jing Jin
With the rapid increase of learning resources, the contradiction between learning content intelligent properties and its share and reuse becomes an outstanding event. In order to solve the problem, the authors probed into a way that is to integrate the DRM technologies and learning technology standards into the development of learning content management system. The authors also designed a novel online management system for broadcasting environments of virtual classroom or courseware on demand based on a browser/server framework, which carries out learning content management for reuse, share, interoperation and security. Particular emphases was placed on the strategies of integration of digital rights management and flexible commercial model by license services into applications, management, exchange and trade of Web-based learning content and try to solve the problem between reuse and protection.
{"title":"Integration of digital rights management into learning content management system","authors":"Zongkai Yang, Qingtang Liu, Kun Yan, Wanting Deng, Jing Jin","doi":"10.1109/ITCC.2005.176","DOIUrl":"https://doi.org/10.1109/ITCC.2005.176","url":null,"abstract":"With the rapid increase of learning resources, the contradiction between learning content intelligent properties and its share and reuse becomes an outstanding event. In order to solve the problem, the authors probed into a way that is to integrate the DRM technologies and learning technology standards into the development of learning content management system. The authors also designed a novel online management system for broadcasting environments of virtual classroom or courseware on demand based on a browser/server framework, which carries out learning content management for reuse, share, interoperation and security. Particular emphases was placed on the strategies of integration of digital rights management and flexible commercial model by license services into applications, management, exchange and trade of Web-based learning content and try to solve the problem between reuse and protection.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"61 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":"127048618","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}
The idea developed in this paper is the creation of standard information retrieval modules in a distributed manner in order to create testing systems to validate methods and algorithms. An investigator in information retrieval can construct a retrieval test system just by integrating different modules and manipulating the input variables of each module.
{"title":"Web services for information retrieval","authors":"J. Ferreira, A. Silva, J. Delgado","doi":"10.1109/ITCC.2005.297","DOIUrl":"https://doi.org/10.1109/ITCC.2005.297","url":null,"abstract":"The idea developed in this paper is the creation of standard information retrieval modules in a distributed manner in order to create testing systems to validate methods and algorithms. An investigator in information retrieval can construct a retrieval test system just by integrating different modules and manipulating the input variables of each module.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"22 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":"125686322","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}
We show the design of a network processing system in an IPv6 based media gateway based on abstract state machine (ASM) logic and show how the design features may help in scalability realization for end-to-end QoS issues in next generation networks. The novelty of the approach lies in the formal algorithmic definition of the processing hardware and generation of physical design unit from the data-driven algorithm function computation at compile time. The design in this paper is used to build an implementation prototype of an IPv6 media gateway with a feature of MPEG4 BIFS-MPEG4 LASeR transcoding, standardization activities of which are being currently pursued at the ISO MPEG MDS.
{"title":"Abstract state machine based next generation IPv6 network","authors":"D. Guha, Qonita M. Shahab, J. Choi","doi":"10.1109/ITCC.2005.56","DOIUrl":"https://doi.org/10.1109/ITCC.2005.56","url":null,"abstract":"We show the design of a network processing system in an IPv6 based media gateway based on abstract state machine (ASM) logic and show how the design features may help in scalability realization for end-to-end QoS issues in next generation networks. The novelty of the approach lies in the formal algorithmic definition of the processing hardware and generation of physical design unit from the data-driven algorithm function computation at compile time. The design in this paper is used to build an implementation prototype of an IPv6 media gateway with a feature of MPEG4 BIFS-MPEG4 LASeR transcoding, standardization activities of which are being currently pursued at the ISO MPEG MDS.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"11 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":"125303752","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}
"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}
Color quantization is wildly exploited for many applications especially in the fields of computer graphics and image processing. After studying the approaches of color clustering, a new approach based on ant colony clustering algorithm applied in color image quantization is proposed in the paper. According to the picking up-dropping theory, a promoted ant algorithm is applied to group colors into certain clusters in RGB space. It finishes color quantization after colors mapping of every pixel. Our experiment shows that the algorithm proposed in this paper has rather good performance with an excellent robustness, a less time consumption, and a simple realization.
{"title":"A new approach of color quantization based on ant colony clustering algorithm","authors":"Xinrong Hu, Tianzhen Wang, Dehua Li","doi":"10.1109/ITCC.2005.18","DOIUrl":"https://doi.org/10.1109/ITCC.2005.18","url":null,"abstract":"Color quantization is wildly exploited for many applications especially in the fields of computer graphics and image processing. After studying the approaches of color clustering, a new approach based on ant colony clustering algorithm applied in color image quantization is proposed in the paper. According to the picking up-dropping theory, a promoted ant algorithm is applied to group colors into certain clusters in RGB space. It finishes color quantization after colors mapping of every pixel. Our experiment shows that the algorithm proposed in this paper has rather good performance with an excellent robustness, a less time consumption, and a simple realization.","PeriodicalId":326887,"journal":{"name":"International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II","volume":"15 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":"133529925","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}
Results from any existing clustering algorithm that are used for segmentation are highly sensitive to features that limit their generalization. Shape is one important attribute of an object. The detection and separation of an object using fuzzy ring-shaped clustering (FKR) and elliptic ring-shaped clustering (FKE) already exists in the literature. Not all real objects however, are ring or elliptical in shape, so to address these issues, this paper introduces a new shape-based algorithm, called fuzzy image segmentation combining ring and elliptic shaped clustering algorithms (FCRE) by merging the initial segmented results produced by FKR and FKE. The distribution of unclassified pixels is performed by connectedness and fuzzy c-means (FCM) using a combination of pixel intensity and normalized pixel location. Both qualitative and quantitative analysis of the results for different varieties of images proves the superiority of the proposed FCRE algorithm compared with both FKR and FKE.
{"title":"Fuzzy image segmentation combining ring and elliptic shaped clustering algorithms","authors":"Mohammed Ameer Ali, L. Dooley, G. Karmakar","doi":"10.1109/ITCC.2005.157","DOIUrl":"https://doi.org/10.1109/ITCC.2005.157","url":null,"abstract":"Results from any existing clustering algorithm that are used for segmentation are highly sensitive to features that limit their generalization. Shape is one important attribute of an object. The detection and separation of an object using fuzzy ring-shaped clustering (FKR) and elliptic ring-shaped clustering (FKE) already exists in the literature. Not all real objects however, are ring or elliptical in shape, so to address these issues, this paper introduces a new shape-based algorithm, called fuzzy image segmentation combining ring and elliptic shaped clustering algorithms (FCRE) by merging the initial segmented results produced by FKR and FKE. The distribution of unclassified pixels is performed by connectedness and fuzzy c-means (FCM) using a combination of pixel intensity and normalized pixel location. Both qualitative and quantitative analysis of the results for different varieties of images proves the superiority of the proposed FCRE algorithm compared with both FKR and FKE.","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":"116903147","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
扫码关注我们
求助内容：
应助结果提醒方式：