发布求助
文献互助 智能选刊 最新文献

2009 Third International Conference on Network and System Security最新文献

筛选
英文 中文
DeWorm: A Simple Protocol to Detect Wormhole Attacks in Wireless Ad Hoc Networks 在无线自组织网络中检测虫洞攻击的简单协议
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.85
T. Hayajneh, P. Krishnamurthy, D. Tipper
{"title":"DeWorm: A Simple Protocol to Detect Wormhole Attacks in Wireless Ad Hoc Networks","authors":"T. Hayajneh, P. Krishnamurthy, D. Tipper","doi":"10.1109/NSS.2009.85","DOIUrl":"https://doi.org/10.1109/NSS.2009.85","url":null,"abstract":"The wormhole attack is considered to be a serious security attack in multihop ad hoc and sensor networks. We propose ``DeWorm'', a simple protocol to effectively detect wormhole attacks without the need for special hardware and/or strict location or synchronization requirements. DeWorm makes use of discrepancies in routing information between neighbors to detect wormholes. A simulation based analysis of DeWorm for a variety of scenarios shows that the proposed protocol can detect wormhole attacks with a high detection rate, a low false positive rate and low overhead. Further, in comparison to other wormhole detection protocols, the proposed protocol is simple, localized, and capable of detecting a variety of types of wormhole attacks including physical layer wormholes.","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":"131724420","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}
引用次数: 51
A Hierarchical Model for Cross-Domain Communication of Health Care Units 卫生保健单位跨领域沟通的层次模型
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.84
D. Geneiatakis, C. Lambrinoudakis, S. Gritzalis
{"title":"A Hierarchical Model for Cross-Domain Communication of Health Care Units","authors":"D. Geneiatakis, C. Lambrinoudakis, S. Gritzalis","doi":"10.1109/NSS.2009.84","DOIUrl":"https://doi.org/10.1109/NSS.2009.84","url":null,"abstract":"Common practice for healthcare organizations is to maintain locally their own files, thus causing a geographic distribution of healthcare records. On the other hand, healthcare personnel treating a patient needs access to previous diagnosis and treatment data, maintained by various institutions in many different locations. Currently, the lack of a reliable authentication and authorization framework is considered a major obstacle for interchanging Electronic Healthcare Records (EHRs). This paper proposes a hierarchical model for controlling access to EHRs and protecting the privacy of subjects of care and healthcare personnel, while facilitating the exchange of information among healthcare information systems.","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":"126788716","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}
引用次数: 0
A Comparison Between Rule Based and Association Rule Mining Algorithms 基于规则和关联规则挖掘算法的比较
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.81
Mohammed M. Mazid, A. Ali, K. Tickle
{"title":"A Comparison Between Rule Based and Association Rule Mining Algorithms","authors":"Mohammed M. Mazid, A. Ali, K. Tickle","doi":"10.1109/NSS.2009.81","DOIUrl":"https://doi.org/10.1109/NSS.2009.81","url":null,"abstract":"Recently association rule mining algorithms are using to solve data mining problem in a popular manner. Rule based mining can be performed through either supervised learning or unsupervised learning techniques. Among the wide range of available approaches, it is always challenging to select the optimum algorithm for rule based mining task. The aim of this research is to compare the performance between the rule based classification and association rule mining algorithm based on their rule based classification performance and computational complexity. We consider PART (Partial Decision Tree) of classification algorithm and Apriori of association rule mining to compare their performance. DARPA (Defense Advanced Research Projects Agency) data is a well-known intrusion detection problem is also used to measure the performance of these two algorithms. In this comparison the training rules are compared with the predefined test sets. In terms of accuracy and computational complexity we observe Apriori is a better choice for rule based mining task.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"50 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":"126352728","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}
引用次数: 22
Error Correction of Noisy Block Cipher Using Cipher and Plaintext Characteristics 基于密文和明文特性的噪声分组密码纠错
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.42
Nabil M. K. Mirza, Ziad Osman, R. Zantout, Mohamed El-Sayed
{"title":"Error Correction of Noisy Block Cipher Using Cipher and Plaintext Characteristics","authors":"Nabil M. K. Mirza, Ziad Osman, R. Zantout, Mohamed El-Sayed","doi":"10.1109/NSS.2009.42","DOIUrl":"https://doi.org/10.1109/NSS.2009.42","url":null,"abstract":"Contemporary proven cryptographic algorithms, like the Advanced Encryption Standard (AES), are used in many secure data storage systems. Cipher data when written or read might be subject to noise. Classical error detection and correction methods are not suitable for encrypted data. In this paper, error detection and correction is performed at the receiver end, without any changes to the encryption algorithm. One of the properties of encrypted information is that all encrypted blocks have a minimum hamming distance from each other. This property is exploited to obtain the exact correct block. When error correction based on the encrypted data cannot be performed, natural language properties of plaintext data are used to eliminate noise. The plaintext blocks surrounding the noisy plaintext block are used to generate possible candidates. In case a unique solution is not achieved, n-gram properties of the plaintext language are used to rank the possibilities and promote the best fit.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"50 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":"121683318","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}
引用次数: 4
Secure Authenticated Key Establishment Protocol for Ad Hoc Networks Ad Hoc网络安全认证密钥建立协议
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.61
A. Prakash, V. R. Uthariaraj
{"title":"Secure Authenticated Key Establishment Protocol for Ad Hoc Networks","authors":"A. Prakash, V. R. Uthariaraj","doi":"10.1109/NSS.2009.61","DOIUrl":"https://doi.org/10.1109/NSS.2009.61","url":null,"abstract":"Multicast communication in dynamic environments like ad hoc networks are potentially of critical concern. As group members move in and out of the group, in order to preserve confidentiality, it becomes imperative to use cryptographic keys with rekeying mechanism each time a user enters or leaves. Therefore, in dynamic environments rekeying introduces a significant computational and communication overhead. The contribution of this paper is mainly twofold: (1) Exploiting the orthogonal principle this paper proposes a provably secure n-way cryptosystem, namely, Multicrypt. (2) Using the proposed n-way cryptosystem, this paper also proposes a new secure authenticated key establishment (SAKE) protocol. The proposed SAKE decouples membership change and rekeying. SAKE has less join and leave latency, bandwidth, work per data and control packets by then reducing the communicational and computational overheads. SAKE does not require stateful members due to the use of multiple keys for encryption. Since it uses multiple keys, a compromise of one member does not compromise the group. Multicrypt is a provably secure n-way cryptosystem which uses keys per user and keys per sub-controller where is the number of users in the current membership view and is the number of sub-groups. It supports dynamic member addition and revocation in SAKE. Multicrypt is proved to be IND-CCA and IND-CCA2 secure.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"19 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":"124952034","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}
引用次数: 0
Speaker Verification Based on Different Vector Quantization Techniques with Gaussian Mixture Models 基于不同矢量量化技术的高斯混合模型说话人验证
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.19
S. Memon, M. Lech, N. Maddage
{"title":"Speaker Verification Based on Different Vector Quantization Techniques with Gaussian Mixture Models","authors":"S. Memon, M. Lech, N. Maddage","doi":"10.1109/NSS.2009.19","DOIUrl":"https://doi.org/10.1109/NSS.2009.19","url":null,"abstract":"The introduction of Gaussian Mixture Models (GMMs) in the field of speaker verification has led to very good results. This paper illustrates an evolution in state-of-the-art Speaker Verification by highlighting the contribution of recently established information theoretic based vector quantization technique. We explore the novel application of three different vector quantization algorithms, namely K-means, Linde-Buzo-Gray (LBG) and Information Theoretic Vector Quantization (ITVQ) for efficient speaker verification. The Expectation Maximization (EM) algorithm used by GMM requires a prohibitive amount of iterations to converge. In this paper, comparable alternatives to EM including K-means, LBG and ITVQ algorithm were tested. The GMM-ITVQ algorithm was found to be the most efficient alternative for the GMM-EM. It gives correct classification rates at a similar level to that of GMM-EM. Finally, representative performance benchmarks and system behaviour experiments on NIST SRE corpora are presented.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"40 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":"115150956","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}
引用次数: 22
Early Breast Cancer Identification: Which Way to Go? Microarray or Image Based Computer Aided Diagnosis! 早期乳腺癌鉴别:该走哪条路?微阵列或基于图像的计算机辅助诊断!
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.75
J. Nahar, K. Tickle, A. B. M. S. Ali, Yi-Ping Phoebe Chen
{"title":"Early Breast Cancer Identification: Which Way to Go? Microarray or Image Based Computer Aided Diagnosis!","authors":"J. Nahar, K. Tickle, A. B. M. S. Ali, Yi-Ping Phoebe Chen","doi":"10.1109/NSS.2009.75","DOIUrl":"https://doi.org/10.1109/NSS.2009.75","url":null,"abstract":"The goal of this research is to develop a computer aided diagnostic (CAD) system that can detect breast cancer in the early stage by using microarray and image data. We verified the performance of six well known classification algorithms with various performance matrices. Although we do not suggest a unique classifier algorithm for a CAD system, we do identify a number of algorithms whose performance is very promising. The algorithms performance was validated by 3 images dataset; two have been used for the first time in this experiment. Multidimensional image filtering is adopted for the final data extraction. The image data classification performance is compared with microarray data. Results suggest the most effective means of breast cancer identification in the early stage is a hybrid approach.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"64 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":"115211355","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}
引用次数: 6
Practical Implementations for Securing VoIP Enabled Mobile Devices 保护VoIP移动设备的实际实现
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.24
C. Yeun, Salman Mohammed Al-Marzouqi
{"title":"Practical Implementations for Securing VoIP Enabled Mobile Devices","authors":"C. Yeun, Salman Mohammed Al-Marzouqi","doi":"10.1109/NSS.2009.24","DOIUrl":"https://doi.org/10.1109/NSS.2009.24","url":null,"abstract":"Voice over Internet Protocol is the ability of transmitting Voice using the Internet protocol. This paper addresses an introduction to VoIP, threats of VoIP and studies previous works of secure VoIP. We also propose practical implementations for securing VoIP by using Java and Android. Finally we give security analysis of our implementation and analyze different protocols involved in making VoIP more secure by preventing from Man in the Middle attack by using a new MIKEY protocol.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"4 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":"123767995","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}
引用次数: 9
Hardware Trojan Horse Device Based on Unintended USB Channels 基于意外USB通道的硬件特洛伊木马设备
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.48
John Clark, Sylvain P. Leblanc, S. Knight
{"title":"Hardware Trojan Horse Device Based on Unintended USB Channels","authors":"John Clark, Sylvain P. Leblanc, S. Knight","doi":"10.1109/NSS.2009.48","DOIUrl":"https://doi.org/10.1109/NSS.2009.48","url":null,"abstract":"This paper discusses research activities that investigated the risk associated with USB devices. The research focused on identifying, characterizing and modelling unintended USB channels in contemporary computer systems. Such unintended channels can be used by a USB Hardware Trojan Horse device to create two way communications with a targeted network endpoint, thus violating the integrity and confidentiality of the data residing on the endpoint. The work was validated through the design and implementation of a proof of concept Hardware Trojan Horse device that uses two such unintended USB channels to successfully interact with a target network endpoint to compromise and exfiltrate data from it.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"10 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":"129333622","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}
引用次数: 17
A Self-Reflection Model for Autonomic Computing Systems Based on p-Calculus 基于p-微积分的自主计算系统自反射模型
2009 Third International Conference on Network and System Security Pub Date : 2009-10-19 DOI: 10.1109/NSS.2009.28
Huiqiang Wang, Hongwu Lv, Guangsheng Feng
{"title":"A Self-Reflection Model for Autonomic Computing Systems Based on p-Calculus","authors":"Huiqiang Wang, Hongwu Lv, Guangsheng Feng","doi":"10.1109/NSS.2009.28","DOIUrl":"https://doi.org/10.1109/NSS.2009.28","url":null,"abstract":"Autonomic computing has emerged as a paradigm for distributed computing systems to stem the tide of rapidly increasing complexity and evolution problem. In this paper, a two-layer self-reflection model for Autonomic Computing systems(ACs) based on π-calculus is proposed from a theoretical point of view, which integrates self-awareness and context–awareness into a single model and provides a formal, verifiable basis for the development and further studies of ACs. According to the hierarchical structure, it does not only reduce the latency time of self-awareness in local domain but also gives consideration to the overall objectives of the system. In addition, the model is checked by MWB.","PeriodicalId":136343,"journal":{"name":"2009 Third International Conference on Network and System Security","volume":"11 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":"126717940","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}
引用次数: 4
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书