In this paper, we give the secure model of certificate-based signature (CBS) and propose an efficient CBS scheme. The proposed scheme is shown to be existentially unforgeable against adaptive chosen message and identity attacks under the discrete logarithm assumption in the random oracle model. Compared with the schemes in RSA 2004 and in EuroPKI 2007, no pairing computation and the special MapToPoint hash function is needed in all phase, and hence,our scheme is more efficient.
{"title":"Efficient Certificate-Based Signature Scheme","authors":"Yang Ming, Yumin Wang","doi":"10.1109/IAS.2009.62","DOIUrl":"https://doi.org/10.1109/IAS.2009.62","url":null,"abstract":"In this paper, we give the secure model of certificate-based signature (CBS) and propose an efficient CBS scheme. The proposed scheme is shown to be existentially unforgeable against adaptive chosen message and identity attacks under the discrete logarithm assumption in the random oracle model. Compared with the schemes in RSA 2004 and in EuroPKI 2007, no pairing computation and the special MapToPoint hash function is needed in all phase, and hence,our scheme is more efficient.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"16 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":"127742849","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 major challenge in video coding and transmission over mobile networks is that the wireless channel is error-prone and the channel resources are limited. In this work, we analyze the picture distortion caused by channel errors and the distortion propagation behavior in its subsequent frames along the motion prediction path. We propose a linear fitting approach algorithm to achieve a low complexity GOP-level transmission distortion modeling. It is a predictive modeling which allows the encoder to predict the transmission distortion before the whole GOP is compressed and transmitted. The simulation results demonstrate that the proposed modeling has low computational complexity and high accuracy. It can be used in allocating the limited channel resources optimally for mobile video applications.
{"title":"GOP-Level Transmission Distortion Modeling for Video Streaming over Mobile Networks","authors":"Yu Han, Aidong Men, Kan Chang, Ziyi Quan","doi":"10.1109/IAS.2009.107","DOIUrl":"https://doi.org/10.1109/IAS.2009.107","url":null,"abstract":"A major challenge in video coding and transmission over mobile networks is that the wireless channel is error-prone and the channel resources are limited. In this work, we analyze the picture distortion caused by channel errors and the distortion propagation behavior in its subsequent frames along the motion prediction path. We propose a linear fitting approach algorithm to achieve a low complexity GOP-level transmission distortion modeling. It is a predictive modeling which allows the encoder to predict the transmission distortion before the whole GOP is compressed and transmitted. The simulation results demonstrate that the proposed modeling has low computational complexity and high accuracy. It can be used in allocating the limited channel resources optimally for mobile video applications.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"55 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":"125457797","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 center-symmetric local binary pattern (CS-LBP) is an effective extension to local binary pattern (LBP) operator. However, it discards some important texture information because of the ignorance of the center pixel and is hard to choose a threshold for recognizing the flat area. A novel improved CS-LBP operator, named ICS-LBP, is proposed in this paper. The new operator classifies the local pattern based on the relativity of the center pixel and the center-symmetric pixels instead of the gray value differences between the center-symmetric pixels as CS-LBP, which can fully extract the texture information discarded by CS-LBP descriptor. Comparisons are given among the three methods and the experimental results show the performance improvement of the new descriptor.
{"title":"An Effective Texture Spectrum Descriptor","authors":"Xiaosheng Wu, Junding Sun","doi":"10.1109/IAS.2009.126","DOIUrl":"https://doi.org/10.1109/IAS.2009.126","url":null,"abstract":"The center-symmetric local binary pattern (CS-LBP) is an effective extension to local binary pattern (LBP) operator. However, it discards some important texture information because of the ignorance of the center pixel and is hard to choose a threshold for recognizing the flat area. A novel improved CS-LBP operator, named ICS-LBP, is proposed in this paper. The new operator classifies the local pattern based on the relativity of the center pixel and the center-symmetric pixels instead of the gray value differences between the center-symmetric pixels as CS-LBP, which can fully extract the texture information discarded by CS-LBP descriptor. Comparisons are given among the three methods and the experimental results show the performance improvement of the new descriptor.","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":"115870083","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 accordance with the characteristics and the special demands of electric power information system, this paper designs a support vector machines (SVM) risk assessment method based on group decision-marking. According to security technology indices of electric power information system, the method chooses the mode of expert scoring, based on the group decision-marking, to calculate integrated value of each index, which is as a training sample used to train SVM, and it forecasts risk level for the system. Finally, it verifies the correctness of the method by analyzing results of the examples of the electric power information system security assessment. The experiment shows that the method can not only forecast the current risk level of the electric power system with a high accuracy rate, but also reduce the influence of the subjective factors in some degree.
{"title":"A Support Vector Machines Security Assessment Method Based on Group Decision-Marking for Electric Power Information System","authors":"Xiaorong Cheng, Yan Wei, Xin Geng","doi":"10.1109/IAS.2009.234","DOIUrl":"https://doi.org/10.1109/IAS.2009.234","url":null,"abstract":"In accordance with the characteristics and the special demands of electric power information system, this paper designs a support vector machines (SVM) risk assessment method based on group decision-marking. According to security technology indices of electric power information system, the method chooses the mode of expert scoring, based on the group decision-marking, to calculate integrated value of each index, which is as a training sample used to train SVM, and it forecasts risk level for the system. Finally, it verifies the correctness of the method by analyzing results of the examples of the electric power information system security assessment. The experiment shows that the method can not only forecast the current risk level of the electric power system with a high accuracy rate, but also reduce the influence of the subjective factors in some degree.","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":"132228635","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 propose an agent_based distributed intrusion detection architecture, which detects DoS/DDoS attacks by comparing source IP addresses’ normal and current connection frequencies. First, we collect source IPs’ packet statistics to obtain their normal packet distribution. When current statistics suddenly increase, very often it is an attack. Experimental results show that this approach can effectively detect DoS/DDoS attacks.
{"title":"Detecting DoS and DDoS Attacks Using Chi-Square","authors":"Fang-Yie Leu, C. Pai","doi":"10.1109/IAS.2009.292","DOIUrl":"https://doi.org/10.1109/IAS.2009.292","url":null,"abstract":"In this paper, we propose an agent_based distributed intrusion detection architecture, which detects DoS/DDoS attacks by comparing source IP addresses’ normal and current connection frequencies. First, we collect source IPs’ packet statistics to obtain their normal packet distribution. When current statistics suddenly increase, very often it is an attack. Experimental results show that this approach can effectively detect DoS/DDoS attacks.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"4 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":"132539191","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 non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA algorithms, such as threshold crossing (TC) and maximum energy selection (MES), validate the analysis. Furthermore, the integration window and multipath delay spread in ultra-wideband channel are considered to obtain a referable bound.
{"title":"Cramer-Rao Lower Bound for Non-coherent TOA Estimation with Impulse Signal","authors":"Jie Liu, Xiaoji Liu, Lin Zheng","doi":"10.1109/IAS.2009.205","DOIUrl":"https://doi.org/10.1109/IAS.2009.205","url":null,"abstract":"The non-coherent time-of-arrival (TOA) estimations are applied in impulse location for its simplicity. However, the multipath propagation of the narrow pulse results in complicated performance analysis. By fitting the output envelope of energy detection into a exponential decay, we approximately deduce the closed-form Cramer-Rao low bound (CRLB) of TOA estimation. Simulations with non-coherent TOA algorithms, such as threshold crossing (TC) and maximum energy selection (MES), validate the analysis. Furthermore, the integration window and multipath delay spread in ultra-wideband channel are considered to obtain a referable bound.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"27 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":"134272116","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}
Source address authentication is very important to change current serious network security situation. In this article, we propose a new source address validation scheme based on IBS algorithm and study its security using SVO logic. We find that our scheme can successfully guarantees authenticity of IP packet’s information source.
{"title":"A New Source Address Validation Scheme Based on IBS","authors":"Ningning Lu, Huachun Zhou, Hongke Zhang","doi":"10.1109/IAS.2009.109","DOIUrl":"https://doi.org/10.1109/IAS.2009.109","url":null,"abstract":"Source address authentication is very important to change current serious network security situation. In this article, we propose a new source address validation scheme based on IBS algorithm and study its security using SVO logic. We find that our scheme can successfully guarantees authenticity of IP packet’s information source.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"54 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":"134294111","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}
{"title":"A Generalization of de Weger's Method","authors":"Chien-Yuan Chen, C. Hsueh, Yu-Feng Lin","doi":"10.1109/IAS.2009.153","DOIUrl":"https://doi.org/10.1109/IAS.2009.153","url":null,"abstract":"This paper generalizes de Weger's method if the ratio of two RSA primes frac{p}{q} is close to a simple fraction frac{b}{a}.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"238 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":"131482860","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}
Localization problems of the WSNs (wireless sensor networks)geostationary nodes are studied,and the localization algorithm (Fast and Rough Nodes Location Algorithm) based on the communication power mediation for geostationary nodes by receiving the localization information from anchor nodes is presented.The localization estimate of localized nodes is executed in lesser field for higher accuracy.The simulation results show that the algorithm has a small amount of communication, high positioning accuracy, balancing payloads, and is suitable for random deployment.
{"title":"Range-Free Fast and Rough Nodes Localization Algorithm in Wireless Sensor Networks","authors":"Wang Mei, Xiaochuan Sun, Zheng Hao","doi":"10.1109/IAS.2009.331","DOIUrl":"https://doi.org/10.1109/IAS.2009.331","url":null,"abstract":"Localization problems of the WSNs (wireless sensor networks)geostationary nodes are studied,and the localization algorithm (Fast and Rough Nodes Location Algorithm) based on the communication power mediation for geostationary nodes by receiving the localization information from anchor nodes is presented.The localization estimate of localized nodes is executed in lesser field for higher accuracy.The simulation results show that the algorithm has a small amount of communication, high positioning accuracy, balancing payloads, and is suitable for random deployment.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"2 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":"131839404","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 nonlocal image inpainting model is proposed by incorporating the nonlocal differential operators into the curvature-driven diffusion model. The new model differs from the original model in that pixels of similar structures rather than pixels in the neighborhood (the case for the original model) are utilized to estimate the lost pixels. This difference makes the new model performs very efficiently in inpainting images, especially textured images.
{"title":"Nonlocal Curvature-Driven Diffusion Model for Image Inpainting","authors":"Li Li, Han Yu","doi":"10.1109/IAS.2009.141","DOIUrl":"https://doi.org/10.1109/IAS.2009.141","url":null,"abstract":"A nonlocal image inpainting model is proposed by incorporating the nonlocal differential operators into the curvature-driven diffusion model. The new model differs from the original model in that pixels of similar structures rather than pixels in the neighborhood (the case for the original model) are utilized to estimate the lost pixels. This difference makes the new model performs very efficiently in inpainting images, especially textured images.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"2 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":"131135198","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
扫码关注我们
求助内容：
应助结果提醒方式：