in most applications, security attributes are pretty difficult to meet but security becomes even a bigger challenge when talking about Grid Computing. Providing secure communication between elements of a computational Grid, by encrypting data passes between them using enhanced encryption algorithms that do not affect the Performance of the grid middleware completely comparable to the actual execution time.In this paper we will cover two points. First, accelerating RC4 encryption algorithm using our developed Grid Security Scheme "ULTRA GRIDSEC" and our developed "HIMAN" middleware and show that RC4 was accelerated by about 873.52% comparable to that accelerated by "GRIDCRYPT" Scheme that applied by "Alchemi" middleware developed by Melbourne University. Second, using the accelerated RC4 scheme to secure communication between elements of "HIMAN", the stream ciphering algorithms like RC4 are the most suitable encryption algorithms for applying inside "HIMAN" as we will show.
{"title":"A New Accelerated RC4 Scheme Using “Ultra Gridsec” and “HIMAN” and use this Scheme to Secure “HIMAN” Data","authors":"H. Kholidy, K. Alghathbar","doi":"10.1109/IAS.2009.140","DOIUrl":"https://doi.org/10.1109/IAS.2009.140","url":null,"abstract":"in most applications, security attributes are pretty difficult to meet but security becomes even a bigger challenge when talking about Grid Computing. Providing secure communication between elements of a computational Grid, by encrypting data passes between them using enhanced encryption algorithms that do not affect the Performance of the grid middleware completely comparable to the actual execution time.In this paper we will cover two points. First, accelerating RC4 encryption algorithm using our developed Grid Security Scheme \"ULTRA GRIDSEC\" and our developed \"HIMAN\" middleware and show that RC4 was accelerated by about 873.52% comparable to that accelerated by \"GRIDCRYPT\" Scheme that applied by \"Alchemi\" middleware developed by Melbourne University. Second, using the accelerated RC4 scheme to secure communication between elements of \"HIMAN\", the stream ciphering algorithms like RC4 are the most suitable encryption algorithms for applying inside \"HIMAN\" as we will show.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115371243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A digital certificate scheme in content protection system for high definition digital interfaces is proposed. Before transferring the encryption content, the device interface is firstly confirmed whether it is passed the certification. After the certification, then transfers the content. The interface of the receiver detects whether the recognition management unit has passed the certification. The digital content is ensured by the recognition management unit, which can prevent the invalid capturing the information. In the period of certification, the characteristics of the certificate are fully made use of. The application shows the system is high secure, which can be used in the high definition digital interface.
{"title":"A Digital Certificate Application Scheme in Content Protection System for High Definition Digital Interface","authors":"Kefeng Fan, Subing Zhang, W. Mo","doi":"10.1109/IAS.2009.31","DOIUrl":"https://doi.org/10.1109/IAS.2009.31","url":null,"abstract":"A digital certificate scheme in content protection system for high definition digital interfaces is proposed. Before transferring the encryption content, the device interface is firstly confirmed whether it is passed the certification. After the certification, then transfers the content. The interface of the receiver detects whether the recognition management unit has passed the certification. The digital content is ensured by the recognition management unit, which can prevent the invalid capturing the information. In the period of certification, the characteristics of the certificate are fully made use of. The application shows the system is high secure, which can be used in the high definition digital interface.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115682949","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}
Building trust has been recognized as a new security approach for wireless distributed networks. In the paper, we try to provide a completely new view by building trust territory in ad hoc networks. The concept of trust territory is addressed and the approach to build trust territory is also discussed. A trust territory contains all nodes trusted by the node. It is considered secure to communicate with nodes in the trust territories. Theories of sets, relations and graphs help to build trust territories. Trust territory could work in all layers of networks, so its potential for future applications is very promising.
{"title":"Building Trust Territory in Ad Hoc Networks","authors":"Yuan Bai, Xing Zhang, Bin Sun","doi":"10.1109/IAS.2009.235","DOIUrl":"https://doi.org/10.1109/IAS.2009.235","url":null,"abstract":"Building trust has been recognized as a new security approach for wireless distributed networks. In the paper, we try to provide a completely new view by building trust territory in ad hoc networks. The concept of trust territory is addressed and the approach to build trust territory is also discussed. A trust territory contains all nodes trusted by the node. It is considered secure to communicate with nodes in the trust territories. Theories of sets, relations and graphs help to build trust territories. Trust territory could work in all layers of networks, so its potential for future applications is very promising.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115718461","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 have been investigating a speech processing system for ensuring safety and security, namely, acoustic-based security system. Focusing on indoor security, we have been studying for an advanced security system which can discriminate emergency shout from the other acoustic sound events based on automatic understanding of speech events.In this paper, we present our investigations, and describe fundamental results.
{"title":"Acoustic-Based Security System: Towards Robust Understanding of Emergency Shout","authors":"H. Nanjo, T. Nishiura, Hiroshi Kawano","doi":"10.1109/IAS.2009.121","DOIUrl":"https://doi.org/10.1109/IAS.2009.121","url":null,"abstract":"We have been investigating a speech processing system for ensuring safety and security, namely, acoustic-based security system. Focusing on indoor security, we have been studying for an advanced security system which can discriminate emergency shout from the other acoustic sound events based on automatic understanding of speech events.In this paper, we present our investigations, and describe fundamental results.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114253027","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, the intrusion detection system is introduced, and point out two important prerequisite that the IDS work normally must depend on, and in view of the prerequisite, the paper proposed a solution which is based on k-nearest neighbor algorithm of kernel and the active defence technology anti-host intrusion. The solution can distinguish normal event from the unknown event efficiently, and can detect unknown event more accurately.
{"title":"Research on Active Defence Technology with Host Intrusion Based on K-Nearest Neighbor Algorithm of Kernel","authors":"Xuedou Yu","doi":"10.1109/IAS.2009.255","DOIUrl":"https://doi.org/10.1109/IAS.2009.255","url":null,"abstract":"In this paper, the intrusion detection system is introduced, and point out two important prerequisite that the IDS work normally must depend on, and in view of the prerequisite, the paper proposed a solution which is based on k-nearest neighbor algorithm of kernel and the active defence technology anti-host intrusion. The solution can distinguish normal event from the unknown event efficiently, and can detect unknown event more accurately.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115884560","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 proposed a hardware system with Field Programmable Gate Array (FPGA) for facial expression recognition which used Haar Discrete Wavelet Transform (DWT) and Cerebellar Model Articulation Controller (CMAC). Firstly, the facial expression features are automatically extracted and preprocessed to obtain the frontal view of faces. A 2D DWT IP is then used to decrease the size of images. Thirdly, a block size of the lower frequency of DWT coefficients is rearranged as input vectors with binary manner to send into the proposed CMAC IP that can rapidly obtain output using non-linear mapping with look-up table in training or recognizing phase. Finally, the experimental results demonstrated recognition rates with a block size of coefficient in lower frequency to recognize six expressions, including happiness, sadness, surprise, anger, disgust and natural to show promising recognition results.
{"title":"Facial Expression Recognition Based on Field Programmable Gate Array","authors":"Jzau-Sheng Lin, Shao-Han Liu, Wu-Chih Hsieh, Yu-Yi Liao, HongChao Wang, QingHua Lan","doi":"10.1109/IAS.2009.266","DOIUrl":"https://doi.org/10.1109/IAS.2009.266","url":null,"abstract":"In this paper, we proposed a hardware system with Field Programmable Gate Array (FPGA) for facial expression recognition which used Haar Discrete Wavelet Transform (DWT) and Cerebellar Model Articulation Controller (CMAC). Firstly, the facial expression features are automatically extracted and preprocessed to obtain the frontal view of faces. A 2D DWT IP is then used to decrease the size of images. Thirdly, a block size of the lower frequency of DWT coefficients is rearranged as input vectors with binary manner to send into the proposed CMAC IP that can rapidly obtain output using non-linear mapping with look-up table in training or recognizing phase. Finally, the experimental results demonstrated recognition rates with a block size of coefficient in lower frequency to recognize six expressions, including happiness, sadness, surprise, anger, disgust and natural to show promising recognition results.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124827061","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}
Chinese words segmentation is an important technique for Chinese web data mining. After the research made on some Chinese word segmentation nowadays, an improved algorithm is proposed in this paper. The algorithm updates dictionary by using Two-way Markov Chain, and does word segmentation by applying an improved Forward Maximum Matching Method based on word frequency statistic. The simulation shows this algorithm can finish word segmentation for a given text quickly and accurately.
{"title":"Research on Improved Algorithm for Chinese Word Segmentation Based on Markov Chain","authors":"Pang Baomao, Shi Haoshan","doi":"10.1109/IAS.2009.317","DOIUrl":"https://doi.org/10.1109/IAS.2009.317","url":null,"abstract":"Chinese words segmentation is an important technique for Chinese web data mining. After the research made on some Chinese word segmentation nowadays, an improved algorithm is proposed in this paper. The algorithm updates dictionary by using Two-way Markov Chain, and does word segmentation by applying an improved Forward Maximum Matching Method based on word frequency statistic. The simulation shows this algorithm can finish word segmentation for a given text quickly and accurately.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123507754","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}
S. Tai, Yi-Ying Chang, Kang-Ming Li, Ting-Chou Tsai
In this paper, we proposed a method to enhance global contrast of an image based on Average Luminance with Weighted Histogram Equalization (ALWHE) for Low Dynamic Range Images (LDRI). Automation of parameter selection can easily be done by iteratively using the proposed method. The purposed method overcomes the disadvantage of HE like luminance shifting and washed-out looking. We present experimental results to compare results of contrast enhancement with other methods.
{"title":"Contrast Enhancement Method Based on Average Luminance with Weighted Histogram Equalization","authors":"S. Tai, Yi-Ying Chang, Kang-Ming Li, Ting-Chou Tsai","doi":"10.1109/IAS.2009.369","DOIUrl":"https://doi.org/10.1109/IAS.2009.369","url":null,"abstract":"In this paper, we proposed a method to enhance global contrast of an image based on Average Luminance with Weighted Histogram Equalization (ALWHE) for Low Dynamic Range Images (LDRI). Automation of parameter selection can easily be done by iteratively using the proposed method. The purposed method overcomes the disadvantage of HE like luminance shifting and washed-out looking. We present experimental results to compare results of contrast enhancement with other methods.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122789601","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. Zamani, A. Manaf, R. Ahmad, A. Zeki, Pritheega Magalingam
This paper presents a novel, principled approach to resolve the remained problems of substitution technique of audio watermarking. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well.
{"title":"A Novel Approach for Audio Watermarking","authors":"M. Zamani, A. Manaf, R. Ahmad, A. Zeki, Pritheega Magalingam","doi":"10.1109/IAS.2009.22","DOIUrl":"https://doi.org/10.1109/IAS.2009.22","url":null,"abstract":"This paper presents a novel, principled approach to resolve the remained problems of substitution technique of audio watermarking. Using the proposed genetic algorithm, message bits are embedded into multiple, vague and higher LSB layers, resulting in increased robustness. The robustness specially would be increased against those intentional attacks which try to reveal the hidden message and also some unintentional attacks like noise addition as well.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123926370","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}
Although the Internet allows people to release, convey and obtain information freely and conveniently, the excessive spread of illegal and harmful information negatively affects the Internet development and obstructs Internet culture from thriving. On the basis of analyzing the root cause of illegal and harmful content on the Internet, this article helps to establish an index system for measuring them. At the same time, it suggests methods to collect data on measurement indicators.
{"title":"The Research on the Measurement of China Internet Illegal and Harmful Content","authors":"Qiang Song, Gang Li","doi":"10.1109/IAS.2009.230","DOIUrl":"https://doi.org/10.1109/IAS.2009.230","url":null,"abstract":"Although the Internet allows people to release, convey and obtain information freely and conveniently, the excessive spread of illegal and harmful information negatively affects the Internet development and obstructs Internet culture from thriving. On the basis of analyzing the root cause of illegal and harmful content on the Internet, this article helps to establish an index system for measuring them. At the same time, it suggests methods to collect data on measurement indicators.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123928396","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
扫码关注我们
求助内容：
应助结果提醒方式：