Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297600
Tan-Hsu Tan, Shih-Wei Chang, C. Yang
Performance evaluation and improvement of speaker recognition over real GSM environment are investigated. A text-independent speaker recognition system based on Gaussian mixture model (GMM) is implemented for performance evaluation. To match the real-world conditions, an NTUT-LAB416 speech corpus is collected over GSM telecommunication network from in-car environment of various driving speeds. An approach employing multistyle training model is proposed to alleviate the adverse effects due to environmental mismatch. Also, a post-processing scheme using auto-regression and moving-average (ARMA) filter is suggested to overcome the varying noise conditions. Experimental results indicate that the proposed approaches can effectively improve the performance of speaker recognition over GSM environment.
{"title":"Performance evaluation and improvement of speaker recognition over GSM environment","authors":"Tan-Hsu Tan, Shih-Wei Chang, C. Yang","doi":"10.1109/CCST.2003.1297600","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297600","url":null,"abstract":"Performance evaluation and improvement of speaker recognition over real GSM environment are investigated. A text-independent speaker recognition system based on Gaussian mixture model (GMM) is implemented for performance evaluation. To match the real-world conditions, an NTUT-LAB416 speech corpus is collected over GSM telecommunication network from in-car environment of various driving speeds. An approach employing multistyle training model is proposed to alleviate the adverse effects due to environmental mismatch. Also, a post-processing scheme using auto-regression and moving-average (ARMA) filter is suggested to overcome the varying noise conditions. Experimental results indicate that the proposed approaches can effectively improve the performance of speaker recognition over GSM environment.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122199748","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297575
M. Faúndez-Zanuy
This paper proposes the use of a discrete cosine transform (DCT) instead of the eigenfaces method (Karhunen-Loeve Transform) for biometric identification based on frontal face images. Experimental results show better recognition accuracies and reduced computational burden. This paper includes results with different classifiers and a combination of them.
{"title":"Face recognition in a transformed domain","authors":"M. Faúndez-Zanuy","doi":"10.1109/CCST.2003.1297575","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297575","url":null,"abstract":"This paper proposes the use of a discrete cosine transform (DCT) instead of the eigenfaces method (Karhunen-Loeve Transform) for biometric identification based on frontal face images. Experimental results show better recognition accuracies and reduced computational burden. This paper includes results with different classifiers and a combination of them.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127787914","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 improve the encryption of oriental language texts in a high-secure official document system such as military or government. As an example, an encryption scheme based on DBS is introduced for large Chinese text files. The ideogram-based Chinese texts are different from the alphabet-based English texts in many important features. First, an English text is a sequence of one-byte characters. A Chinese text is also a sequence of characters, but usually two-bytes of characters. Second, the number of distinct characters appeared in a Chinese text is much higher than that appeared in an English text. Third, the frequency distribution of the Chinese characters is very skewed. In DES, the assumption of random and uniform distribution of characters is unrealistic, especially, for Chinese texts. DES with substitution and transposition based ciphers has been subjected to attacks such as linear cryptanalysis and differential cryptanalysis. Due to the skewness of characters' distribution, Chinese texts encrypted by DES would be vulnerable for these attacks. This paper bases on DES to design a new scheme for encrypting large Chinese texts. We first divide each two-bytes character in a Chinese text into the high-byte group and the low-byte group. They include the high-byte and the low-byte of each character, respectively. According to the distributions of the high-byte and the low-byte of Chinese characters, we recode each byte in these two groups. Finally, we encrypt the recoded bytes in these two groups by using a modified DES algorithm individually. By decrypting and combining these two groups of encrypted data, the original Chinese text can be revealed.
{"title":"An encryption scheme for large Chinese texts","authors":"Bao-Chyuan Guan, Ray-I Chang, Yung Chung Wei, Chia-Ling Hu, Yu-Lin Chiu","doi":"10.1109/CCST.2003.1297620","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297620","url":null,"abstract":"We improve the encryption of oriental language texts in a high-secure official document system such as military or government. As an example, an encryption scheme based on DBS is introduced for large Chinese text files. The ideogram-based Chinese texts are different from the alphabet-based English texts in many important features. First, an English text is a sequence of one-byte characters. A Chinese text is also a sequence of characters, but usually two-bytes of characters. Second, the number of distinct characters appeared in a Chinese text is much higher than that appeared in an English text. Third, the frequency distribution of the Chinese characters is very skewed. In DES, the assumption of random and uniform distribution of characters is unrealistic, especially, for Chinese texts. DES with substitution and transposition based ciphers has been subjected to attacks such as linear cryptanalysis and differential cryptanalysis. Due to the skewness of characters' distribution, Chinese texts encrypted by DES would be vulnerable for these attacks. This paper bases on DES to design a new scheme for encrypting large Chinese texts. We first divide each two-bytes character in a Chinese text into the high-byte group and the low-byte group. They include the high-byte and the low-byte of each character, respectively. According to the distributions of the high-byte and the low-byte of Chinese characters, we recode each byte in these two groups. Finally, we encrypt the recoded bytes in these two groups by using a modified DES algorithm individually. By decrypting and combining these two groups of encrypted data, the original Chinese text can be revealed.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125522538","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 consider access control in a multiattribute hierarchy and propose a new approach to assign cryptographic keys for this hierarchy. Access control through authorization is important to a high-secure system in military or government where unauthorized users are not allowed to access secret data. A real application system for the high-secure military workflow is considered. Every particular working activity in the workflow must associate multiattributes. The application system is based on the Petri net model, we define the access control problem in our system as a multiattribute hierarchy environment. A Petri net is represented by a directed, bipartite graph in which nodes are either places (represent conditions) or transitions (represent activities). A token that is located in a place signifies that its condition is true. When all the places to a transition have a token, the transition is enabled. Our problem objective is to assign suitable cryptographic keys to this multiattribute hierarchy. Based on a description on security requirements, our algorithm can verify and generate the keys automatically.
{"title":"Assigning cryptographic keys to access control in a multi-attribute hierarchy","authors":"Bao-Chyuan Guan, Ping Wang, Yen-Fu Chen, Ray-I Chang","doi":"10.1109/CCST.2003.1297582","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297582","url":null,"abstract":"We consider access control in a multiattribute hierarchy and propose a new approach to assign cryptographic keys for this hierarchy. Access control through authorization is important to a high-secure system in military or government where unauthorized users are not allowed to access secret data. A real application system for the high-secure military workflow is considered. Every particular working activity in the workflow must associate multiattributes. The application system is based on the Petri net model, we define the access control problem in our system as a multiattribute hierarchy environment. A Petri net is represented by a directed, bipartite graph in which nodes are either places (represent conditions) or transitions (represent activities). A token that is located in a place signifies that its condition is true. When all the places to a transition have a token, the transition is enabled. Our problem objective is to assign suitable cryptographic keys to this multiattribute hierarchy. Based on a description on security requirements, our algorithm can verify and generate the keys automatically.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125236688","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297591
I. Lin, Hong-Cheng Yang, Guo-Long Gu, A. C. Lin
There are constant occurrences of Internet security problems due to its rapid development. It is important to maintain Internet security system during and after the occurrences to collect evidence and forensics essences by various devices, such as hard disk, system log, firewall, IDS log, processes, as well as Internet connections. It would be even more beneficial to the forensic process if evidence could be established and kept well before such an incident happened. Most government organizations lack sufficient knowledge of security system techniques and they still believe that this technical part of the work belongs to the police. In fact, we cannot guarantee a perfect stage, but at least we can figure out what the problem is and trace where the attack is from, and that is the mission of computer forensics. Schools or institutes that are engaged in research and development of relative security system techniques are doing their own work; thus, capabilities of computer forensics have been dispersed. Therefore, in order to enhance the forensic skill of information and communication security and ability, what we really need is a complete plan so as to integrate the forensic skill of information and communication security and ability.
{"title":"A study of information and communication security forensic technology capability in Taiwan","authors":"I. Lin, Hong-Cheng Yang, Guo-Long Gu, A. C. Lin","doi":"10.1109/CCST.2003.1297591","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297591","url":null,"abstract":"There are constant occurrences of Internet security problems due to its rapid development. It is important to maintain Internet security system during and after the occurrences to collect evidence and forensics essences by various devices, such as hard disk, system log, firewall, IDS log, processes, as well as Internet connections. It would be even more beneficial to the forensic process if evidence could be established and kept well before such an incident happened. Most government organizations lack sufficient knowledge of security system techniques and they still believe that this technical part of the work belongs to the police. In fact, we cannot guarantee a perfect stage, but at least we can figure out what the problem is and trace where the attack is from, and that is the mission of computer forensics. Schools or institutes that are engaged in research and development of relative security system techniques are doing their own work; thus, capabilities of computer forensics have been dispersed. Therefore, in order to enhance the forensic skill of information and communication security and ability, what we really need is a complete plan so as to integrate the forensic skill of information and communication security and ability.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121816427","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297557
Ping Chen
"Panoramic stabilization" and "common optical path" as designed are two significant issues regarding the technology of periscope detection. The idea of "panoramic stabilization" is to construct a pseudo level coordinate while in 360/spl deg/ searching. Sighting vector to the target expressed by spherical coordinate should be based on this panoramic stabilized level. The design of "common optical path" entirely employs a set of reflection mirrors with folded optical path for various light wave bands to shorten the size of the periscope. Devices associated with these features are developed and wrapped up in terms of an analysis of conceptual configuration.
{"title":"A panoramic stabilized periscope with common optical path","authors":"Ping Chen","doi":"10.1109/CCST.2003.1297557","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297557","url":null,"abstract":"\"Panoramic stabilization\" and \"common optical path\" as designed are two significant issues regarding the technology of periscope detection. The idea of \"panoramic stabilization\" is to construct a pseudo level coordinate while in 360/spl deg/ searching. Sighting vector to the target expressed by spherical coordinate should be based on this panoramic stabilized level. The design of \"common optical path\" entirely employs a set of reflection mirrors with folded optical path for various light wave bands to shorten the size of the periscope. Devices associated with these features are developed and wrapped up in terms of an analysis of conceptual configuration.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116279104","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297549
Jhing-Fa Wang, Sun-Wei Chang, Po-Chuan Lin
We present an intellectual property (IP) core of the entire advanced encryption standard (AES) algorithm. Our design utilizes the T-box algorithm to implement the Rijndael round function. By analyzing the pipelining dataflow, a new architecture, which combines the multiplexing and the iteration architecture, is also proposed. The designs are implemented using the integrated systems engineering (ISE) 5.1i software on a single Virtex-E XCV812E field programmable gate array (FPGA) device. As a result, the AES IP core operates at 61MHz with the key scheduler resulting in a throughput of l.9Gbps for the AES encryption and decryption with the block size of 128 bits and the flexible key size. A comparison is provided between our design and similar existing implementations.
{"title":"A novel round function architecture for AES encryption/decryption utilizing look-up table","authors":"Jhing-Fa Wang, Sun-Wei Chang, Po-Chuan Lin","doi":"10.1109/CCST.2003.1297549","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297549","url":null,"abstract":"We present an intellectual property (IP) core of the entire advanced encryption standard (AES) algorithm. Our design utilizes the T-box algorithm to implement the Rijndael round function. By analyzing the pipelining dataflow, a new architecture, which combines the multiplexing and the iteration architecture, is also proposed. The designs are implemented using the integrated systems engineering (ISE) 5.1i software on a single Virtex-E XCV812E field programmable gate array (FPGA) device. As a result, the AES IP core operates at 61MHz with the key scheduler resulting in a throughput of l.9Gbps for the AES encryption and decryption with the block size of 128 bits and the flexible key size. A comparison is provided between our design and similar existing implementations.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"244 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132556161","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297543
L. Chong, P. Ng, J. Fu
The antenna was fed by a unilateral fin line and then transmitted to its taper slotline radiator. The design and fabrication of the substrate containing the fin line transmission section and tapered slot radiating section were carried out The waveguides were also designed to house the fin line section of the substrate. Simulations were carried out using XFDTD software to determine the radiating characteristic of the antenna. A set of S-parameter and polarization curves of designed 77GHz were shown.
{"title":"Secure 77GHz Vivaldi antenna for millimeter wave communication","authors":"L. Chong, P. Ng, J. Fu","doi":"10.1109/CCST.2003.1297543","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297543","url":null,"abstract":"The antenna was fed by a unilateral fin line and then transmitted to its taper slotline radiator. The design and fabrication of the substrate containing the fin line transmission section and tapered slot radiating section were carried out The waveguides were also designed to house the fin line section of the substrate. Simulations were carried out using XFDTD software to determine the radiating characteristic of the antenna. A set of S-parameter and polarization curves of designed 77GHz were shown.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134450975","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297553
Gen-Yih Liao, Chen Song
The Internet creates an efficient environment for businesses to conduct transactions, while also creating a channel for outsiders to access organizational assets. To determine the reasonable amount of security investment, security officers would conduct risk assessment to evaluate the risk values in existing systems. In traditional risk assessment processes, however, heavy dependence on human experts leads to difficulties in automating risk assessment. We propose a transaction based computer aided system to facilitate risk assessment on information systems. The proposed system evaluates assets with business transactions, which facilitates the procedures of asset evaluation. The likelihood model used by the system can assist the risk analysts in conducting what-if analyses to determine risk values. Therefore, the proposed system contributes in enhancing the level of automation regarding risk assessment.
{"title":"Design of a computer-aided system for risk assessment on information systems","authors":"Gen-Yih Liao, Chen Song","doi":"10.1109/CCST.2003.1297553","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297553","url":null,"abstract":"The Internet creates an efficient environment for businesses to conduct transactions, while also creating a channel for outsiders to access organizational assets. To determine the reasonable amount of security investment, security officers would conduct risk assessment to evaluate the risk values in existing systems. In traditional risk assessment processes, however, heavy dependence on human experts leads to difficulties in automating risk assessment. We propose a transaction based computer aided system to facilitate risk assessment on information systems. The proposed system evaluates assets with business transactions, which facilitates the procedures of asset evaluation. The likelihood model used by the system can assist the risk analysts in conducting what-if analyses to determine risk values. Therefore, the proposed system contributes in enhancing the level of automation regarding risk assessment.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114140343","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}
Pub Date : 2003-10-14DOI: 10.1109/CCST.2003.1297579
Chien-Chang Chen, Kang Fan, Shengquan Wang
We introduce a new wavelet-based image authentication approach that the proposed approach can detect attacks on an authenticated image and indicate the modification area. The proposed authentication procedure first applies the image into a 3-level wavelet transform and the fingerprint of each subimage's block is then encrypted by a cryptosystem to replace the LSB of the block. The block's fingerprint is obtained by calculating the hash value of the block, its neighboring blocks, and its coarse approximation in low-pass subimage. The verification step only requires the user's public key to check whether the new calculated fingerprint is consistent with the decryption result of the LSB. Experimental results show that the proposed approach detects attacks including spatial or wavelet coefficients replacement efficiently, whereas the modification area is clearly indicated.
{"title":"A wavelet-based public key image authentication watermarking","authors":"Chien-Chang Chen, Kang Fan, Shengquan Wang","doi":"10.1109/CCST.2003.1297579","DOIUrl":"https://doi.org/10.1109/CCST.2003.1297579","url":null,"abstract":"We introduce a new wavelet-based image authentication approach that the proposed approach can detect attacks on an authenticated image and indicate the modification area. The proposed authentication procedure first applies the image into a 3-level wavelet transform and the fingerprint of each subimage's block is then encrypted by a cryptosystem to replace the LSB of the block. The block's fingerprint is obtained by calculating the hash value of the block, its neighboring blocks, and its coarse approximation in low-pass subimage. The verification step only requires the user's public key to check whether the new calculated fingerprint is consistent with the decryption result of the LSB. Experimental results show that the proposed approach detects attacks including spatial or wavelet coefficients replacement efficiently, whereas the modification area is clearly indicated.","PeriodicalId":344868,"journal":{"name":"IEEE 37th Annual 2003 International Carnahan Conference onSecurity Technology, 2003. Proceedings.","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2003-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117002721","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
扫码关注我们
求助内容：
应助结果提醒方式：