Ke Li, Wanlei Zhou, Ping Li, Jing Hai, Jianwen Liu
{"title":"Distinguishing DDoS Attacks from Flash Crowds Using Probability Metrics","authors":"Ke Li, Wanlei Zhou, Ping Li, Jing Hai, Jianwen Liu","doi":"10.1109/NSS.2009.35","DOIUrl":"https://doi.org/10.1109/NSS.2009.35","url":null,"abstract":"Both Flash crowds and DDoS (Distributed Denial-of-Service) attacks have very similar properties in terms of internet traffic, however Flash crowds are legitimate flows and DDoS attacks are illegitimate flows, and DDoS attacks have been a serious threat to internet security and stability. In this paper we propose a set of novel methods using probability metrics to distinguish DDoS attacks from Flash crowds effectively, and our simulations show that the proposed methods work well. In particular, these mathods can not only distinguish DDoS attacks from Flash crowds clearly, but also can distinguish the anomaly flow being DDoS attacks flow or being Flash crowd flow from Normal network flow effectively. Furthermore, we show our proposed hybrid probability metrics can greatly reduce both false positive and false negative rates in detection.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114164027","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 Security Calculus of Concurrent Objects for Verifying Ad Hoc Network Protocols","authors":"Qin Li, Qingkai Zeng","doi":"10.1109/NSS.2009.12","DOIUrl":"https://doi.org/10.1109/NSS.2009.12","url":null,"abstract":"We present a calculus of concurrent objects for specification and security analysis of Ad Hoc security protocols. The communicating nodes and the network are modeled by objects, while the interactions between them are modeled by asynchronous method invocations. The internal state of an object is represented by a constant method which can be overridden. The approach is omplemented by a control flow analysis which can be used to automatically check properties such as security routing. The attacker model is integrated into the analysis as set values containing the knowledge of the attacker.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125801526","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":"Self-Protection Model Based on Intelligent Agent","authors":"Bing Sun, Ya-Ping Zhang, Ning Zhang","doi":"10.1109/NSS.2009.18","DOIUrl":"https://doi.org/10.1109/NSS.2009.18","url":null,"abstract":"In this paper, we propose a self-protection model based on distributed intelligent agents. The major feather of this model is that autonomic agents can manage themselves given high-level objectives from administers. System can detect attacks and compromise, and recovering from security incidents without human intervention. We describe the model and the existing prototype, as well as some design and implementation experiences. Meanwhile several topics including structure of agent, relationship among agents and the establishment of a trustworthy system are discussed. We are implementing this model on the Eclipse Platform using Java. According to the experiments, this model provides significant advantages in scalability, flexibility, fault tolerance, and resistance to compromise.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129336647","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":"An Evaluation of Secure Real-Time Transport Protocol (SRTP) Performance for VoIP","authors":"A. Alexander, A. Wijesinha, R. Karne","doi":"10.1109/NSS.2009.90","DOIUrl":"https://doi.org/10.1109/NSS.2009.90","url":null,"abstract":"The Secure Real-Time Transport Protocol (SRTP) is an Internet standards-track security profile for RTP used to provide confidentiality, integrity and replay protection for RTP traffic. We study the performance of SRTP when it is used to secure VoIP conversations. Experiments are conducted using snom and Twinkle softphones running on Windows and Linux platforms respectively and a bare PC softphone running with no operating system installed to provide a baseline. Pre-defined SRTP transforms based on AES counter mode encryption with a 128-bit key and HMAC-SHA-1 with a 32-bit authentication tag, as well as 192 and 256-bit AES keys and an 80-bit authentication tag are tested. Measurement of internal processing times for each operation in the SRTP protocol indicates that authentication processing is more expensive than encryption regardless of key or tag size. A comparison of jitter and delta (packet interarrival time) for secured and unsecured VoIP traffic reveals that the addition of SRTP protection to VoIP traffic over RTP has a negligible effect on voice quality. VoIP throughput with SRTP is about 2% more than with RTP alone since the insignificant increase in delay is offset by the small increase in packet size.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129984137","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 Novel Fuzzy Identity-Based Signature with Dynamic Threshold","authors":"Wei Chen, Li Zhu, Xiaomei Cao, Yang Geng","doi":"10.1109/NSS.2009.40","DOIUrl":"https://doi.org/10.1109/NSS.2009.40","url":null,"abstract":"The fuzzy identity-based signature allows a user with the private key for identity W to verify a signature signed by identity S if and only if W and S are within a certain distance judged by a threshold t. In previous fuzzy identity-based signature schemes, the threshold t is static and cannot be changed according to dynamic environment. This paper proposes a novel FISAT scheme(fuzzy identity-based signature with dynamic threshold), which is based on the bilinear maps and multi-sequence of Diffie-Hellman exponents assumption. The threshold in FISAT can be dynamically selected according to the importance of the message. Furthermore, FISAT only uses constant keys and ciphertext, which improves transmission performance.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"204 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127032169","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 Multi-agent Security Architecture","authors":"R. Sulaiman, D. Sharma, Wanli Ma, D. Tran","doi":"10.1109/NSS.2009.78","DOIUrl":"https://doi.org/10.1109/NSS.2009.78","url":null,"abstract":"This paper presents a multi-agent security architecture, which utilizes the agent characteristics to cater for security processes in online communications. The Multilayer Communication approach (MLC) [1] is used to determine the security processes, which uses cryptography protocols to secure data and communication channel. Agents are skilled to perform certain tasks. At the Sender’s host, agents interact with each other to secure a message to be sent to the Recipient, including encryption, digital signature, and hash code. A mobile agent is used to carry the encrypted messages as well as the agent’s code to the Recipient’s host. Our approach also provides mechanisms to verify the authenticity, confidentiality and the integrity of the code and data that arrived at the Recipient’s host. The message and the code are authenticated, the code is executed to perform tasks to recover the plaintext.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"125 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115986863","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":"Extended K-Anonymity Models Against Attribute Disclosure","authors":"Xiaoxun Sun, Hua Wang, Lili Sun","doi":"10.1109/NSS.2009.23","DOIUrl":"https://doi.org/10.1109/NSS.2009.23","url":null,"abstract":"p-sensitive k-anonymity model has been recently defined as a sophistication of k-anonymity. This new property requires that there be at least p distinct values for each sensitive attribute within the records sharing a combination of key attributes. However, as shown in this paper, it may not protect sensitive information in some way. In this paper, we empirically investigate two enhanced k-anonymity models. Instead of publishing original specific sensitive attributes, the new models publish the categories that the sensitive values belong to. We propose a top-down approach to implement two enhanced models and show in the comprehensive experimental evaluations that the two new introduced models are practical in terms of effectiveness and efficiency.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130642891","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":"Discovery of Exceptions: A Step towards Perfection","authors":"S. Ratnoo, K. K. Bharadwaj","doi":"10.1109/NSS.2009.32","DOIUrl":"https://doi.org/10.1109/NSS.2009.32","url":null,"abstract":"It is interesting to discover exceptions, as they dispute the existing knowledge and have elements of unexpectedness and surprise. As exceptions focus on a very small portion of data, discovering exceptions still remains a great challenge. A Censored Production Rule (CPR) is a special kind of knowledge structure that augments exceptions to their corresponding commonsense rules of high generality and support. This paper proposes discovery of decision rules in the form of Censored Production Rules by employing a genetic algorithm approach. Results confirm that the proposed discovery of decision rules in the form of CPRs is comprehensible and interesting. Using CPRs as underlying knowledge structure for rule mining provides an excellent mechanism for exception handling and approximate reasoning. Moreover, discovering exceptions through CPRs enhances the predictive accuracy of the classifier.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129608126","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":"Visualizing Global Patterns in Huge Digraphs","authors":"N. Patson","doi":"10.1109/NSS.2009.37","DOIUrl":"https://doi.org/10.1109/NSS.2009.37","url":null,"abstract":"Traditional methods for depicting directed graphs are inadequate when the number of vertices and edges are too large. Also underlying geographical coordinates are generally not considered. A new visualisation method is presented which transforms graphs into a 3D surface which can be shown as a contour map superimposed over a geographical region thereby preserving the underlying geographical details.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132707772","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}
Lily D. Li, Xinghuo Yu, Xiaodong Li, William W. Guo
{"title":"A Modified PSO Algorithm for Constrained Multi-objective Optimization","authors":"Lily D. Li, Xinghuo Yu, Xiaodong Li, William W. Guo","doi":"10.1109/NSS.2009.72","DOIUrl":"https://doi.org/10.1109/NSS.2009.72","url":null,"abstract":"This paper presents a modified PSO algorithm for solving constrained multi-objective optimization problems. Based on the constraint dominance concept, the proposed approach defines two sets of selection rules for determining the cognitive and social components of the PSO algorithm. The simulation results to the four constrained multi-objective optimization problems demonstrate the proposed approach is able to find Pareto-optimal solutions effectively.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114576341","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}