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}
A fragile watermarking algorithm used in accurate tamper authentication of image content is proposed. The algorithm can distinguish tampered pixel points accurately and tolerate transmission error of individual authentication information bits which take place in image transmission. This algorithm produces authentication information by expanding more pixels within four-left, right, up and down directions around the pixel, then the problem that single tampered pixel point can’t be located accurately which cause by some algorithms based on image uncertainty by combining surrounding pixels to locate embedded watermarking bits. Authentication information is embedded after encryption to resolve security vulnerability problem appears in most pixel-level authentic algorithm.
{"title":"An Accurate Image Juggling Authentication Algorithm","authors":"Jianquan Xie, Qing Xie, Chunhua Yang","doi":"10.1109/IAS.2009.274","DOIUrl":"https://doi.org/10.1109/IAS.2009.274","url":null,"abstract":"A fragile watermarking algorithm used in accurate tamper authentication of image content is proposed. The algorithm can distinguish tampered pixel points accurately and tolerate transmission error of individual authentication information bits which take place in image transmission. This algorithm produces authentication information by expanding more pixels within four-left, right, up and down directions around the pixel, then the problem that single tampered pixel point can’t be located accurately which cause by some algorithms based on image uncertainty by combining surrounding pixels to locate embedded watermarking bits. Authentication information is embedded after encryption to resolve security vulnerability problem appears in most pixel-level authentic algorithm.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"51 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":"125256280","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}
This study not only applies Multi-Criteria Decision Making with Incomplete Linguistic model (InlinPreRa) and uses horizontal, vertical and oblique pairwise comparison algorithms to construct but also expansion group decision making model. When the decision maker is carrying out the pairwise comparison, the following problems can be avoided: time pressure, lack of complete information, the decision maker is lack of this professional knowledge, or the information provided is unreal and thus it is difficult to obtain information.
本研究运用inlinpreera多准则决策模型(Multi-Criteria Decision Making with Incomplete Linguistic model, inlinpreera)，并运用水平、垂直和倾斜的两两比较算法构建和扩展群体决策模型。当决策者进行两两比较时，可以避免以下问题:时间紧迫，信息不完整，决策者缺乏该专业知识，或者提供的信息不真实，难以获得信息。
{"title":"An Approach to Group Decision Making Based on Incomplete Linguistic Preference Relations","authors":"Tien-Chin Wang, S. Peng, S. Hsu, Jui-Fang Chang","doi":"10.1109/IAS.2009.204","DOIUrl":"https://doi.org/10.1109/IAS.2009.204","url":null,"abstract":"This study not only applies Multi-Criteria Decision Making with Incomplete Linguistic model (InlinPreRa) and uses horizontal, vertical and oblique pairwise comparison algorithms to construct but also expansion group decision making model. When the decision maker is carrying out the pairwise comparison, the following problems can be avoided: time pressure, lack of complete information, the decision maker is lack of this professional knowledge, or the information provided is unreal and thus it is difficult to obtain information.","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":"131596428","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}
Providing anonymous routing in mobile ad hoc networks (MANET) has been a hot issue for the purpose of security and privacy concerns. But there are very few have been done about providing a valid method to detect malicious node and providing a trustworthy protection over whole network. In this paper, we introduce a localized trust management which can primarily remove malicious nodes, and propose an efficient anonymous routing protocol by node that participates in the protocol encrypts entire message with trust key and says Hello to its ancestor within expiration time. It makes malicious node can be detected and isolated from the network. In this way, a anonymous and secure route path can be established in a hostile environment. Meanwhile, it is able to efficiently against the Denial-of-Service (DoS) attack.
{"title":"An Efficient Anonymous Routing Protocol for Mobile Ad Hoc Networks","authors":"Xiaoqing Li, Hui Li, Jianfeng Ma, Weidong Zhang","doi":"10.1109/IAS.2009.267","DOIUrl":"https://doi.org/10.1109/IAS.2009.267","url":null,"abstract":"Providing anonymous routing in mobile ad hoc networks (MANET) has been a hot issue for the purpose of security and privacy concerns. But there are very few have been done about providing a valid method to detect malicious node and providing a trustworthy protection over whole network. In this paper, we introduce a localized trust management which can primarily remove malicious nodes, and propose an efficient anonymous routing protocol by node that participates in the protocol encrypts entire message with trust key and says Hello to its ancestor within expiration time. It makes malicious node can be detected and isolated from the network. In this way, a anonymous and secure route path can be established in a hostile environment. Meanwhile, it is able to efficiently against the Denial-of-Service (DoS) attack.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"164 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":"131462345","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 a new variational model for image denoising, which contains two regularizing term. One regularizing term is BV norm, another is formulated in terms of summation in curvelet domain. Solving this new variational model results in an iterative algorithm, which combines naturally Curvelet shrinkage with nonlinear anisotropic diffusion equations. Numerical examples show that the proposed method has good performances for image denoising.
{"title":"A Variational Model Combining Curvelet Shrinkage and Nonlinear Anisotropic Diffusion for Image Denoising","authors":"Weibin Zhang, Wenjuan Zhang","doi":"10.1109/IAS.2009.155","DOIUrl":"https://doi.org/10.1109/IAS.2009.155","url":null,"abstract":"In this paper, we propose a new variational model for image denoising, which contains two regularizing term. One regularizing term is BV norm, another is formulated in terms of summation in curvelet domain. Solving this new variational model results in an iterative algorithm, which combines naturally Curvelet shrinkage with nonlinear anisotropic diffusion equations. Numerical examples show that the proposed method has good performances for image denoising.","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":"132563875","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 a common friend discovery algorithm considering the privacy of users and the authenticity of friend relationships. The privacy means users’ other friends’ information does not be leaked except their common friends. The authenticity signifies anyone can not successfully claim he is a friend of someone unless he really is. It has many applications such as playing games by friends, finding talking-topics by strangers, finding introducer of job interview, finding matchmaker of someone you desire to know, etc. We consider its security and matching probability. We also implement the algorithm in two mobile phones to prove that it is workable.
{"title":"Common Friends Discovery with Privacy and Authenticity","authors":"Shin-Yan Chiou, Shih-Ying Chang, Hung-Min Sun","doi":"10.1109/IAS.2009.208","DOIUrl":"https://doi.org/10.1109/IAS.2009.208","url":null,"abstract":"In this paper, we propose a common friend discovery algorithm considering the privacy of users and the authenticity of friend relationships. The privacy means users’ other friends’ information does not be leaked except their common friends. The authenticity signifies anyone can not successfully claim he is a friend of someone unless he really is. It has many applications such as playing games by friends, finding talking-topics by strangers, finding introducer of job interview, finding matchmaker of someone you desire to know, etc. We consider its security and matching probability. We also implement the algorithm in two mobile phones to prove that it is workable.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"107 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":"132339722","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}
Trust management is an important issue in wireless sensor networks (WSNs). In this paper, we introduce the concept of trust and design a distributed event- triggered trust management model for WSNs. It combines cryptography, statistics, economics, data analysis and the other related fields. In this way, we can immediately identify and isolate the malice node, thereby creating a secure and reliable wireless sensor networks that can avoid some common attacks and ensure the security of the applications. And, we give the communication process and the computation model as well as how each trust management module works. So it is no longer a simple calculation model or a simple frame structure, and it has realistic feasibility and operability.
{"title":"Distributed Event-Triggered Trust Management for Wireless Sensor Networks","authors":"Sibo Liu, Liaojun Pang, Qingqi Pei, Hua Ma, Q. Peng","doi":"10.1109/IAS.2009.69","DOIUrl":"https://doi.org/10.1109/IAS.2009.69","url":null,"abstract":"Trust management is an important issue in wireless sensor networks (WSNs). In this paper, we introduce the concept of trust and design a distributed event- triggered trust management model for WSNs. It combines cryptography, statistics, economics, data analysis and the other related fields. In this way, we can immediately identify and isolate the malice node, thereby creating a secure and reliable wireless sensor networks that can avoid some common attacks and ensure the security of the applications. And, we give the communication process and the computation model as well as how each trust management module works. So it is no longer a simple calculation model or a simple frame structure, and it has realistic feasibility and operability.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"62 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":"132444532","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}
According to the character of the typical serial information leakage and the feature in the information leakage problem that multiple points (zone) converge and couple toward one point (zone), several key concepts, such as the emission zone, transmission zone and receiving zone, are defined in this paper. Based on the idea of electromagnetic topology, a completely new construction method of system topological graph is proposed. Then, this method is applied to analyze a simplified serial information leakage system, the generalized transmission coupling model is also established. What’s more, the modeling process of field-to-field coupling is discussed emphatically. Therefore a solid foundation is laid for the electromagnetic topology analysis of serial information leakage.
{"title":"Generalized Analysis Model of Information Security of Computer System Based on Electromagnetic Topology","authors":"Jin Tian, Y. Qiu, Ankun Lin","doi":"10.1109/IAS.2009.306","DOIUrl":"https://doi.org/10.1109/IAS.2009.306","url":null,"abstract":"According to the character of the typical serial information leakage and the feature in the information leakage problem that multiple points (zone) converge and couple toward one point (zone), several key concepts, such as the emission zone, transmission zone and receiving zone, are defined in this paper. Based on the idea of electromagnetic topology, a completely new construction method of system topological graph is proposed. Then, this method is applied to analyze a simplified serial information leakage system, the generalized transmission coupling model is also established. What’s more, the modeling process of field-to-field coupling is discussed emphatically. Therefore a solid foundation is laid for the electromagnetic topology analysis of serial information leakage.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"313 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":"133224380","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}
System-level design methods can provide a systematic and effective way of evaluating various design options, thus shortening the product development time. This paper relaxes the HC algorithm by considering the K best candidates in each clustering iteration to alleviate the possibility of being trapped in local minimum during hardware/software (HW/SW) partition. We also present an architecture mapping algorithm together with the defined sensitivity measure to further reduce the hardware requirement. Simulation results show that the complexity of exploration time can be greatly reduced with only little performance loss as compared to the exhaustive search. The proposed algorithm can thus provide a good compromise between exploration time and accuracy.
{"title":"Hardware/Software Codesign of Resource Constrained Real-Time Systems","authors":"Chia-Cheng Lo, Jung-Guan Luo, Ming-Der Shieh","doi":"10.1109/IAS.2009.19","DOIUrl":"https://doi.org/10.1109/IAS.2009.19","url":null,"abstract":"System-level design methods can provide a systematic and effective way of evaluating various design options, thus shortening the product development time. This paper relaxes the HC algorithm by considering the K best candidates in each clustering iteration to alleviate the possibility of being trapped in local minimum during hardware/software (HW/SW) partition. We also present an architecture mapping algorithm together with the defined sensitivity measure to further reduce the hardware requirement. Simulation results show that the complexity of exploration time can be greatly reduced with only little performance loss as compared to the exhaustive search. The proposed algorithm can thus provide a good compromise between exploration time and accuracy.","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":"121669423","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}
Rapid increase of information resources speeds the development of network storage. And security of network storage satisfies the demands of privacy and safety of the information. Data encryption and personal identity authentication which are based on cryptography can protect the storage against non-authorized access, while they are ineffective for malicious authorized users and inherent attacks. Also heavy performances affect the control of storage. This paper demonstrates an efficient intrusion detection system model for network-attached storage based on system calls and improves the Process Homeostasis to realize the implementation. The experimental results demonstrate high detection rate and low false detection rate. The total performance is about 3% additions when the detection system is running normally.
{"title":"An Intrusion Detection System for Network Storage Based on System Calls","authors":"Li-zhong Geng, Hui-bo Jia","doi":"10.1109/IAS.2009.100","DOIUrl":"https://doi.org/10.1109/IAS.2009.100","url":null,"abstract":"Rapid increase of information resources speeds the development of network storage. And security of network storage satisfies the demands of privacy and safety of the information. Data encryption and personal identity authentication which are based on cryptography can protect the storage against non-authorized access, while they are ineffective for malicious authorized users and inherent attacks. Also heavy performances affect the control of storage. This paper demonstrates an efficient intrusion detection system model for network-attached storage based on system calls and improves the Process Homeostasis to realize the implementation. The experimental results demonstrate high detection rate and low false detection rate. The total performance is about 3% additions when the detection system is running normally.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"15 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":"116603087","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
扫码关注我们
求助内容：
应助结果提醒方式：