Against well-known vertical Sobel operator adopted by most License Plate Detection (LPD) algorithms, this paper presents a robust and real-time method to enhance both edge density and intensity of license plates under various outdoor environments. The proposed method applies HL subband feature of 2D Discrete Wavelet Transform (DWT) twice to significantly highlight the vertical edges of license plates and suppress the surrounding background noise. Then, license plates can easily be extracted and located by the orthogonal projection histogram analysis with local recursive Otsu segmentation and morphological closing operator. Experimental results show LPD system based on the proposed 2-level 2D Haar DWT is better than that based on conventional vertical Sobel operator or 1-level 2D Haar DWT in terms of the detection rate.
{"title":"2-Level-Wavelet-Based License Plate Edge Detection","authors":"Ming-Kan Wu, J. Wei, Hao-Chung Shih, Chian C. Ho","doi":"10.1109/IAS.2009.295","DOIUrl":"https://doi.org/10.1109/IAS.2009.295","url":null,"abstract":"Against well-known vertical Sobel operator adopted by most License Plate Detection (LPD) algorithms, this paper presents a robust and real-time method to enhance both edge density and intensity of license plates under various outdoor environments. The proposed method applies HL subband feature of 2D Discrete Wavelet Transform (DWT) twice to significantly highlight the vertical edges of license plates and suppress the surrounding background noise. Then, license plates can easily be extracted and located by the orthogonal projection histogram analysis with local recursive Otsu segmentation and morphological closing operator. Experimental results show LPD system based on the proposed 2-level 2D Haar DWT is better than that based on conventional vertical Sobel operator or 1-level 2D Haar DWT in terms of the detection rate.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127864870","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}
Almost all of United Nations member countries now operating government web sites--called e-government. Its implementation is based on information technology which is now as important as tanks, ships, and aircraft in any nation’s defense. So nowadays, with the fast development of information technology, e-government security is considered one of the crucial factors for achieving an advanced stage of e-government. As the number of e-government services introduced to the user increases, a higher level of e-government security is required. This article aims to formulate the key factors for security management. Firstly introduce the concept of e-government and information security, presents a review of ICT management in the public sector, information security management and e-government in recent literature by focusing on issues and trends. The paper then for successful e-government security management analysis the key factors. Put forward a managerial conceptual framework followed. Finally, the corresponding countermeasures for e-government management are proposed.
{"title":"E-government Security Management: Key Factors and Countermeasure","authors":"Jin-fu Wang","doi":"10.1109/IAS.2009.146","DOIUrl":"https://doi.org/10.1109/IAS.2009.146","url":null,"abstract":"Almost all of United Nations member countries now operating government web sites--called e-government. Its implementation is based on information technology which is now as important as tanks, ships, and aircraft in any nation’s defense. So nowadays, with the fast development of information technology, e-government security is considered one of the crucial factors for achieving an advanced stage of e-government. As the number of e-government services introduced to the user increases, a higher level of e-government security is required. This article aims to formulate the key factors for security management. Firstly introduce the concept of e-government and information security, presents a review of ICT management in the public sector, information security management and e-government in recent literature by focusing on issues and trends. The paper then for successful e-government security management analysis the key factors. Put forward a managerial conceptual framework followed. Finally, the corresponding countermeasures for e-government management are proposed.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121660259","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}
Curvelet transform is one of the recently developed multiscale transform, which can well deal with the singularity of line and provides optimally sparse representation of images with edges. But now the image denoising based on curvelet transform is almost used the Monte Carlo threshold, it is not used the feature of images’ curvelet coefficients effectively, so the best result can not be reached. Meanwhile, the wavelet transform codes homogeneous areas better than the curvelet transform. In this paper a joint multiscale algorithm with auto-adapted Monte Carlo threshold is proposed. This algorithm is implemented by combining the wavelet transform and the fast discrete curvelet transform, in which the auto-adapted Monte Carlo threshold is used. Experimental results show that this method eliminate white Gaussian noise effectively, improves Peak Signal to Noise Ratio (PSNR) and realizes the balance between protecting image details and wiping off noise better.
{"title":"A Joint Multiscale Algorithm with Auto-adapted Threshold for Image Denoising","authors":"Jin He, Yinpei Sun, Ying Luo, Qun Zhang","doi":"10.1109/IAS.2009.157","DOIUrl":"https://doi.org/10.1109/IAS.2009.157","url":null,"abstract":"Curvelet transform is one of the recently developed multiscale transform, which can well deal with the singularity of line and provides optimally sparse representation of images with edges. But now the image denoising based on curvelet transform is almost used the Monte Carlo threshold, it is not used the feature of images’ curvelet coefficients effectively, so the best result can not be reached. Meanwhile, the wavelet transform codes homogeneous areas better than the curvelet transform. In this paper a joint multiscale algorithm with auto-adapted Monte Carlo threshold is proposed. This algorithm is implemented by combining the wavelet transform and the fast discrete curvelet transform, in which the auto-adapted Monte Carlo threshold is used. Experimental results show that this method eliminate white Gaussian noise effectively, improves Peak Signal to Noise Ratio (PSNR) and realizes the balance between protecting image details and wiping off noise better.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121141916","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}
Controller Area Network (CAN) is the leading serial bus system for embedded control. More than two billion CAN nodes have been sold since the protocol's development in the early 1980s. CAN is a mainstream network and was internationally standardized (ISO 11898–1) in 1993. This paper describes an approach to implementing security services on top of a higher level Controller Area Network (CAN) protocol, in particular, CANopen. Since the CAN network is an open, unsecured network, every node has access to all data on the bus. A system which produces and consumes sensitive data is not well suited for this environment. Therefore, a general-purpose security solution is needed which will allow secure nodes access to the basic security services such as authentication, integrity, and confidentiality.
{"title":"Security Threats and Countermeasures for Intra-vehicle Networks","authors":"David Wampler, Huirong Fu, Ye Zhu","doi":"10.1109/IAS.2009.350","DOIUrl":"https://doi.org/10.1109/IAS.2009.350","url":null,"abstract":"Controller Area Network (CAN) is the leading serial bus system for embedded control. More than two billion CAN nodes have been sold since the protocol's development in the early 1980s. CAN is a mainstream network and was internationally standardized (ISO 11898–1) in 1993. This paper describes an approach to implementing security services on top of a higher level Controller Area Network (CAN) protocol, in particular, CANopen. Since the CAN network is an open, unsecured network, every node has access to all data on the bus. A system which produces and consumes sensitive data is not well suited for this environment. Therefore, a general-purpose security solution is needed which will allow secure nodes access to the basic security services such as authentication, integrity, and confidentiality.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126064720","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 : 2009-09-11DOI: 10.1109/ICCSIT.2009.5234980
Xu An Wang, Xiaoyuan Yang
The concept of proxy re-cryptography comes from the work of Blaze,Bleumer, and Strauss in 1998cite{Blaze:98}. The goal of proxy re-encryption is to securely enable the re-encryption of ciphertexts from one key to another, without relying on trusted parties. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE to CBE, IBE to CBE, CBE to IBE and IBE to IBEcite{Matsuo:07}. Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working groupcite{P1363.3:08}. One feature of their schemes is that they are all based on BB1 identity based encryptioncite{BB04a}. We reconsider the problem of constructing proxy re-encryption based onSK identity based encryption. Surprisingly, if we consider the help of PKG, then it is easy to construct proxy re-encryption based on SK identity based encryption. Interestingly , our proxy re-encryption scheme even can achieve CCA2 secure, which makes it is unique.
代理重新加密的概念来自Blaze、Bleumer和Strauss在1998年的工作cite{Blaze:98}。代理重新加密的目标是在不依赖于受信任方的情况下，安全地启用从一个密钥到另一个密钥的密文重新加密。2007年，Matsuo提出了四种代理再加密方案的概念:CBE to CBE、IBE to CBE、CBE to IBE和IBE to IBE cite{Matsuo:07}。目前，ieee 1363.3工作组cite{P1363.3:08}正在对CBE到IBE和IBE到IBE代理再加密方案进行标准化。他们的方案的一个特点是他们都是基于BB1身份加密cite{BB04a}。在基于sk身份的加密基础上，重新考虑了构建代理重加密的问题。令人惊讶的是，如果我们考虑到PKG的帮助，那么基于SK身份的加密很容易构建代理重加密。有趣的是，我们的代理重加密方案甚至可以实现CCA2安全，这使得它具有独特性。
{"title":"Proxy Re-encryption Scheme Based on SK Identity Based Encryption","authors":"Xu An Wang, Xiaoyuan Yang","doi":"10.1109/ICCSIT.2009.5234980","DOIUrl":"https://doi.org/10.1109/ICCSIT.2009.5234980","url":null,"abstract":"The concept of proxy re-cryptography comes from the work of Blaze,Bleumer, and Strauss in 1998cite{Blaze:98}. The goal of proxy re-encryption is to securely enable the re-encryption of ciphertexts from one key to another, without relying on trusted parties. In 2007, Matsuo proposed the concept of four types of proxy re-encryption schemes: CBE to CBE, IBE to CBE, CBE to IBE and IBE to IBEcite{Matsuo:07}. Now CBE to IBE and IBE to IBE proxy re-encryption schemes are being standardized by IEEEP1363.3 working groupcite{P1363.3:08}. One feature of their schemes is that they are all based on BB1 identity based encryptioncite{BB04a}. We reconsider the problem of constructing proxy re-encryption based onSK identity based encryption. Surprisingly, if we consider the help of PKG, then it is easy to construct proxy re-encryption based on SK identity based encryption. Interestingly , our proxy re-encryption scheme even can achieve CCA2 secure, which makes it is unique.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124272831","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 novel MDC algorithm based on Discrete Cosine Transform (DCT) and the Set Partition in Hierarchical Trees (SPIHT) is proposed in this paper. Different from the commonly used DCT algorithm, all the transformed coefficients are reshaped into the wavelet decomposition structure to facilitate the use of the SPIHT algorithm. Then the direction-based information is used to form the three different channels. By using different bit rates to encode the information from three different orientations, i.e., vertical, horizontal and diagonal directions, the redundancy is introduced into the three channels. Every channel contains the hybrid information from three different directions. Experimental results show the advantages of this novel algorithm and the theoretical analysis has also been studied.
{"title":"A Novel Multiple Description Coding Frame Based on Reordered DCT Coefficients and SPIHT Algorithm","authors":"Lin-Lin Tang, Zhe-ming Lu, Faxin Yu","doi":"10.1109/IAS.2009.56","DOIUrl":"https://doi.org/10.1109/IAS.2009.56","url":null,"abstract":"A novel MDC algorithm based on Discrete Cosine Transform (DCT) and the Set Partition in Hierarchical Trees (SPIHT) is proposed in this paper. Different from the commonly used DCT algorithm, all the transformed coefficients are reshaped into the wavelet decomposition structure to facilitate the use of the SPIHT algorithm. Then the direction-based information is used to form the three different channels. By using different bit rates to encode the information from three different orientations, i.e., vertical, horizontal and diagonal directions, the redundancy is introduced into the three channels. Every channel contains the hybrid information from three different directions. Experimental results show the advantages of this novel algorithm and the theoretical analysis has also been studied.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"9 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":"115426470","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 video information camouflage processing method based on the pulse amplitude modulation was studied aim at the electromagnetic characteristic of computer video information. Camouflage information modulation function was proposed, the matching vision relation between character information and background color was determined, and the image fusion processing algorithm of camouflage modulation information and useful information was confirmed. Finally, the correctness and effectiveness of theoretical analysis was validated through simulation and experiments.
{"title":"Research on Video Information Camouflage Processing Algorithm Based on Pulse Amplitude Modulation","authors":"Y. Qiu, Jin Tian, Liuyu Qian","doi":"10.1109/IAS.2009.308","DOIUrl":"https://doi.org/10.1109/IAS.2009.308","url":null,"abstract":"In this paper, the video information camouflage processing method based on the pulse amplitude modulation was studied aim at the electromagnetic characteristic of computer video information. Camouflage information modulation function was proposed, the matching vision relation between character information and background color was determined, and the image fusion processing algorithm of camouflage modulation information and useful information was confirmed. Finally, the correctness and effectiveness of theoretical analysis was validated through simulation and experiments.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"3 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":"117158098","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}
Deadlock occurs randomly and is difficult to detect, it always has a negative impact on the effective execution of operating system. This paper uses the principle of adjacency matrix, path matrix and strongly-connected component of simple directed graph in graph theory, gives a model of detecting deadlock by exploring strongly-connected component from resource allocation graph. The experiment shows that it can detect resources and processes involved in deadlock effectively by this detection method. The paper provides a new idea for the research of operating system algorithms, and a new way for auxiliary teaching and practical engineering.
{"title":"Deadlock Detection Based on Resource Allocation Graph","authors":"Qinqin Ni, Weizhen Sun, Sen Ma","doi":"10.1109/IAS.2009.64","DOIUrl":"https://doi.org/10.1109/IAS.2009.64","url":null,"abstract":"Deadlock occurs randomly and is difficult to detect, it always has a negative impact on the effective execution of operating system. This paper uses the principle of adjacency matrix, path matrix and strongly-connected component of simple directed graph in graph theory, gives a model of detecting deadlock by exploring strongly-connected component from resource allocation graph. The experiment shows that it can detect resources and processes involved in deadlock effectively by this detection method. The paper provides a new idea for the research of operating system algorithms, and a new way for auxiliary teaching and practical engineering.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"72 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":"117191529","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}
Group key management is a difficult task in implementing large and dynamic secure multicast. In this paper, a new scheme is proposed in the basis of in-depth analysis of the requirements of the secure multicast and group key management. The scheme is based on the multicast group security architecture and multicast security group key management architecture proposed by IETF. This scheme constructs group key based on pairings and distributes the group key using HSAH function polynomial, and manages group key making use of the dynamic layering GCKS. The scheme is better in security, lower in computation cost and communication cost. The analysis comparison proves that the scheme has strong scalability and efficiency.
{"title":"A Dynamic Layering Scheme of Multicast Key Management","authors":"Fan Yang, Xiaoping Li, Qingkuan Dong, Yanming Liu","doi":"10.1109/IAS.2009.344","DOIUrl":"https://doi.org/10.1109/IAS.2009.344","url":null,"abstract":"Group key management is a difficult task in implementing large and dynamic secure multicast. In this paper, a new scheme is proposed in the basis of in-depth analysis of the requirements of the secure multicast and group key management. The scheme is based on the multicast group security architecture and multicast security group key management architecture proposed by IETF. This scheme constructs group key based on pairings and distributes the group key using HSAH function polynomial, and manages group key making use of the dynamic layering GCKS. The scheme is better in security, lower in computation cost and communication cost. The analysis comparison proves that the scheme has strong scalability and efficiency.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"56 8","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120809133","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 propose a high quality and imperceptible reversible data hiding method in this paper. We divide the cover image into 5 by 5 blocks with non-overlapping boundaries, shrink them, and generate back to 5 by 5 blocks by interpolation technique. If the absolute value of the difference between the interpolation value and the original gray level is less than a threshold in the middle of the four 3 by 3 overlapping blocks of each 5 by 5 block. We may embed one bit of the secret data in this position. We apply PRNG to shuffle the hidden data before embedding. Simply follow the embedding steps to extract the embedded data where the location is embedded then shuffle back the order to find the hidden data. The experiment results demonstrate our method is quite imperceptible with high quality and can obtain the original cover image after extracting all hidden secret data.
{"title":"A High Quality Reversible Data Hiding Method Using Interpolation Technique","authors":"C. Yang, Chun-Hao Hsu","doi":"10.1109/IAS.2009.79","DOIUrl":"https://doi.org/10.1109/IAS.2009.79","url":null,"abstract":"We propose a high quality and imperceptible reversible data hiding method in this paper. We divide the cover image into 5 by 5 blocks with non-overlapping boundaries, shrink them, and generate back to 5 by 5 blocks by interpolation technique. If the absolute value of the difference between the interpolation value and the original gray level is less than a threshold in the middle of the four 3 by 3 overlapping blocks of each 5 by 5 block. We may embed one bit of the secret data in this position. We apply PRNG to shuffle the hidden data before embedding. Simply follow the embedding steps to extract the embedded data where the location is embedded then shuffle back the order to find the hidden data. The experiment results demonstrate our method is quite imperceptible with high quality and can obtain the original cover image after extracting all hidden secret data.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"31 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":"127238563","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
扫码关注我们
求助内容：
应助结果提醒方式：