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

2011 World Congress on Internet Security (WorldCIS-2011)最新文献

筛选
英文 中文
Encryption algorithm using Programmable Cellular Automata 使用可编程元胞自动机的加密算法
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749858
P. Anghelescu
{"title":"Encryption algorithm using Programmable Cellular Automata","authors":"P. Anghelescu","doi":"10.1109/WORLDCIS17046.2011.5749858","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749858","url":null,"abstract":"In this paper is developed a high-performance encryption system that works according with the Programmable Cellular Automata (PCA) theory. The essence of the theoretical and practical efforts which are done in this new field is represented by the idea that bio-inspired based cryptosystems are capable to have similar performances regarding the classic methods based on computational techniques. The proposed encryption and decryption modules are identically and the cryptosystem is featured by its large key space and high speed due to cellular automata's parallel information processing. The PCA block cipher has been implemented in software using C# programming language and is used, as a dynamic library, in order to assure the encryption of medical data sent over the internet.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123142331","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
Secure application access to IMS via 4G GAA architecture 通过4G GAA架构对IMS进行安全的应用程序访问
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749848
Cristina-Elena Vintila
{"title":"Secure application access to IMS via 4G GAA architecture","authors":"Cristina-Elena Vintila","doi":"10.1109/WORLDCIS17046.2011.5749848","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749848","url":null,"abstract":"The entire telecommunications and services world has focused its attention on the newest 3GPP architecture, 4G. Proposing high speed data transfer, all flat-IP network for the core systems and stronger authentication and AAA methods, this architecture seems to be the answer for the mobile networks of the future. Another architecture described by 3GPP as well, but based on IETF standards is the IMS architecture. This is focused on mobile services, mainly VoIP, but also presence, push-to-talk, location and multimedia and broadcast services. The IMS core network has its own security mechanisms, which are constantly tested and improved. Looking in the perspective, the user equipment, specially the one found in roaming has to do a lot of signaling in order to authenticate to both networks and use the services available for it in a secure manner. From the provider's point of view, the issue is even more complicated, because it has to secure its network, securely interoperate with other networks, be able to obtain granular charging information and also provide lawful interception capabilities for the government institutions. This paper reviews the authentication security architecture available in 3GPP for providing secure access to application services, with emphasis on the interaction of 4G and IMS components, being the first step in a larger 4G-IMS interaction study with regards to security.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124528398","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
Secure service-oriented architecture for mobile transactions 用于移动事务的安全面向服务的体系结构
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749898
Feng Zhang, S. Muftic, Gernot Schmoelzer
{"title":"Secure service-oriented architecture for mobile transactions","authors":"Feng Zhang, S. Muftic, Gernot Schmoelzer","doi":"10.1109/WORLDCIS17046.2011.5749898","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749898","url":null,"abstract":"The paper describes secure service-oriented architecture for mobile transactions. The architecture comprises components, protocols, applications and interfaces and it provides various security services to various mobile applications: registration, certification, authentication, and authorization of users, secure messaging at an application-level (end-to-end security), protection of data in databases, and security services for protection of its own components. The architecture is modular, integrated, extendible and scalable. The paper describes design of the architecture, the status of its current implementation, and future research and development plans.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124168532","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}
引用次数: 3
A new and efficient approach to protect AES against differential power analysis 一种新的、有效的保护AES免受差分功率分析的方法
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749883
M. Masoumi, Soheil Mohammadi
{"title":"A new and efficient approach to protect AES against differential power analysis","authors":"M. Masoumi, Soheil Mohammadi","doi":"10.1109/WORLDCIS17046.2011.5749883","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749883","url":null,"abstract":"Developed by Paul Kocher, Joshua Jaffe, and Benjamin Jun in 1999, Differential Power Analysis (DPA) represents a unique and powerful cryptanalysis technique. Insight into the encryption and decryption behavior of a cryptographic device can be determined by examining its electrical power signature. This paper describes a novel approach for implementation of the AES algorithm which provides a significantly improved strength against differential power analysis with a minimal additional hardware overhead. Our method is based on randomization in composite field arithmetic which entails an area penalty of only 7% while does not decrease the working frequency, does not alter the algorithm and keeps perfect compatibility with the published standard. The efficiency of the proposed technique was verified by practical results obtained from real implementation on a Xilinx Spartan-II FPGA.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126151912","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
DDoS attacks traffic and Flash Crowds traffic simulation with a hardware test center platform DDoS攻击流量和Flash crowd流量模拟用硬件测试中心平台
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749874
Jie Wang, R. Phan, J. Whitley, D. Parish
{"title":"DDoS attacks traffic and Flash Crowds traffic simulation with a hardware test center platform","authors":"Jie Wang, R. Phan, J. Whitley, D. Parish","doi":"10.1109/WORLDCIS17046.2011.5749874","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749874","url":null,"abstract":"DDoS attacks are one of the top security problems affecting networks and disrupting services to legitimate users. The first vital step in dealing with this problem is the network's ability to detect such attacks. To that end, it is important that an intrusion detection mechanism be able to differentiate between real DDoS traffic and Flash Crowds traffic, the latter of which constitutes sudden bursts of legitimate network activity. To train and analyze detection mechanisms, researchers typically simulate the DDoS traffic in the testbed; while for Flash Crowds, most researchers replay the web server captures obtained from third parties. This paper proposes the design of a special testbed-based simulation method with Spirent Test Center hardware platform, to simulate both DDoS traffic and Flash Crowds traffic. We give empirical results, including the simulation of four kinds of DDoS traffic including UDP Flooding attack, ICMP Flooding attack, TCP SYN Flooding attack and App-DDoS attack.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121723750","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}
引用次数: 12
A graphical password authentication system 图形密码认证系统
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749855
Ahmad Almulhem
{"title":"A graphical password authentication system","authors":"Ahmad Almulhem","doi":"10.1109/WORLDCIS17046.2011.5749855","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749855","url":null,"abstract":"Graphical passwords provide a promising alternative to traditional alphanumeric passwords. They are attractive since people usually remember pictures better than words. In this extended abstract, we propose a simple graphical password authentication system. We describe its operation with some examples, and highlight important aspects of the system.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"120 3-4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132812053","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}
引用次数: 43
Toward protecting the integrity of relational databases 保护关系数据库的完整性
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749863
I. Kamel, K. Kamel
{"title":"Toward protecting the integrity of relational databases","authors":"I. Kamel, K. Kamel","doi":"10.1109/WORLDCIS17046.2011.5749863","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749863","url":null,"abstract":"Relational databases are widely used in wide spectrum of commercial applications e.g., payroll, inventory, students grades, etc. Relational tables usually contain critical information. Unauthorized changes to databases can have serious consequences and may result in significant losses for the organization. This paper proposes a viable solution for protecting the integrity of the data stored in relational databases using fragile watermarking. Prior techniques for watermarking relational tables use secure hash to create a watermark that is stored in the least significant bits of some of the attributes. These techniques introduce distortions to the watermarked values and thus cannot be applied to all attributes. The proposed technique watermarks relational tables by reordering tuples relative to each other according to a secrete value. The proposed watermark does not affect the values of the attributes neither the size of the data.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123396753","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
Hardware implementation of arithmetic for elliptic curve cryptosystems over GF(2m) GF(2m)上椭圆曲线密码系统算法的硬件实现
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749886
M. Amara, Amar Siad
{"title":"Hardware implementation of arithmetic for elliptic curve cryptosystems over GF(2m)","authors":"M. Amara, Amar Siad","doi":"10.1109/WORLDCIS17046.2011.5749886","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749886","url":null,"abstract":"The Elliptic Curve Cryptography covers all relevant asymmetric cryptographic primitives like digital signatures and key agreement algorithms. In the present work, we develop a design of elliptic curve operations over binary Fields GF(2m). The function used for this purpose is the scalar multiplication kP which is the core operation of ECCs. Where k is an integer and P is a point on an elliptic curve. The EC Point multiplication processor defined in affine coordinates is achieved by using a dedicated Galois Field arithmetic implemented on FPGA using VHDL language.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124250090","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}
引用次数: 8
A novel network platform for secure and efficient malware collection based on reconfigurable hardware logic 一种基于可重构硬件逻辑的安全高效恶意软件采集网络平台
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749873
Sascha Mühlbach, A. Koch
{"title":"A novel network platform for secure and efficient malware collection based on reconfigurable hardware logic","authors":"Sascha Mühlbach, A. Koch","doi":"10.1109/WORLDCIS17046.2011.5749873","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749873","url":null,"abstract":"With the growing diversity of malware, researchers must be able to quickly collect many representative samples for study. This can be done, e.g., by using honeypots. As an alternative to software-based honeypots, we propose a singlechip honeypot appliance that is entirely hardware-based and thus significantly more resilient against compromising attacks. Additionally, it can easily keep up with network speeds of 10+ Gb/s and emulate thousands of vulnerable hosts. As base technology, we employ reconfigurable hardware devices whose functionality is not fixed by the manufacturing process. We present improvements to the platform, aiming to simplify management and updates. To this end, we introduce the domain-specific language VEDL, which can be used to describe the honeypot behavior in a highlevel manner by security experts not proficient in hardware design.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127131612","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
Self-organizing feature maps for User-to-Root and Remote-to-Local network intrusion detection on the KDD Cup 1999 dataset KDD Cup 1999数据集上用户到根和远程到本地网络入侵检测的自组织特征映射
2011 World Congress on Internet Security (WorldCIS-2011) Pub Date : 2011-04-15 DOI: 10.1109/WORLDCIS17046.2011.5749879
Ryan Wilson, C. Obimbo
{"title":"Self-organizing feature maps for User-to-Root and Remote-to-Local network intrusion detection on the KDD Cup 1999 dataset","authors":"Ryan Wilson, C. Obimbo","doi":"10.1109/WORLDCIS17046.2011.5749879","DOIUrl":"https://doi.org/10.1109/WORLDCIS17046.2011.5749879","url":null,"abstract":"The problem of network intrusion detection is one that is ever-changing, ever-evolving, and is always in need of improvement. Society-at-large relies on computer networks everyday for tasks ranging from online banking to e-commerce, social networking, news, gambling, and just about anything else. As such, society demands that these networks remain secure. In order to maintain security the systems used to protect these networks, which are vital to the 21st century world, must be constantly updated. The task of creating a system for the 21st century fell upon several groups for the ACM 1999 KDD Cup Competition. The competition produced a winning entry, but something was lacking: The winning team's results for two of the intrusion types, User-to-Root and Remote-to-Local, were subpar at best. The winning team produced a 13.8% and 8.4% detection rate for these types respectively, compared to over 90% for each of the Denial of Service and Probing intrusion types. This research aimed to rectify this shortcoming. By implementing an unsupervised learning system, this research has produced a system that correctly detects 62.8% of User-to-Root attacks within the same dataset, with minimal false positives, while maintaining the high detection rates of Denial of Service and Probing attacks.","PeriodicalId":204568,"journal":{"name":"2011 World Congress on Internet Security (WorldCIS-2011)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114790685","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}
引用次数: 12
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信