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

2012 Seventh Asia Joint Conference on Information Security最新文献

筛选
英文 中文
Survey on Cloud Data Integrity Proof Techniques 云数据完整性证明技术综述
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.22
S. G. Worku, Z. Ting, Zhiguang Qin
{"title":"Survey on Cloud Data Integrity Proof Techniques","authors":"S. G. Worku, Z. Ting, Zhiguang Qin","doi":"10.1109/AsiaJCIS.2012.22","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.22","url":null,"abstract":"Proof of Retrievability (POR) and Provable Data Possession (PDP) systems these days are the most active area of research for data integrity check, which is outsourced to cloud service providers. In this work we surveyed data integrity proving schemes by reviewing different schemes in the area along with their efficiency and security considerations. The objective of this survey is to offer a state-of-the-art knowledge for new researchers, who are interested in this specific area, i.e., it helps in understanding the research work carried out for the last few years.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131057174","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
An Analysis of Security Patch Lifecycle Using Google Trend Tool 利用Google趋势工具分析安全补丁的生命周期
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.12
Chien-Ting Kuo, He-Ming Ruan, Shih-Jen Chen, C. Lei
{"title":"An Analysis of Security Patch Lifecycle Using Google Trend Tool","authors":"Chien-Ting Kuo, He-Ming Ruan, Shih-Jen Chen, C. Lei","doi":"10.1109/AsiaJCIS.2012.12","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.12","url":null,"abstract":"Information security audit has become more and more important nowadays. Among the audited items, the status of security patch could be the most important part. In this paper, we proposed a security patch lifecycle to assess the information security risk with the help of vulnerability databases. A case study using the Google Trend is also given to demonstrate that the proposed security patch lifecycle is both useful and practical.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"890 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123256438","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}
引用次数: 5
Analysis of an eHealth Care System with Smart Card Based Authentication 基于智能卡认证的电子医疗保健系统分析
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.17
Kuo-Hui Yeh, N. Lo, Tzong-Chen Wu, T. Yang, H. Liaw
{"title":"Analysis of an eHealth Care System with Smart Card Based Authentication","authors":"Kuo-Hui Yeh, N. Lo, Tzong-Chen Wu, T. Yang, H. Liaw","doi":"10.1109/AsiaJCIS.2012.17","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.17","url":null,"abstract":"In recent years, smart card based authentication has been massively adopted in the electronic health care and medical treatment services in which the user and administrator can agree a robust session key based on human-memorable passwords with the hospital server. In this paper, we investigate the robustness of an eHealth care system with smart card based authentication mechanisms. This research is from International Journal of Innovative Computing, Information and Control in 2011, and its out-standing contribution and rigorous analysis make itself one of the most promising techniques in the research area of secure eHealth care services. However, it still exist spaces for security enhancement, therefore, we present the analysis of this research and de-liver contributions in the design of the secure eHealth care application development.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124829632","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}
引用次数: 11
Geographical Visualization of Malware Download for Anomaly Detection 恶意软件下载的地理可视化异常检测
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.20
Naoki Hiroguchi, Khamphao Sisaat, Hiroaki Kikuchi, S. Kittitornkun
{"title":"Geographical Visualization of Malware Download for Anomaly Detection","authors":"Naoki Hiroguchi, Khamphao Sisaat, Hiroaki Kikuchi, S. Kittitornkun","doi":"10.1109/AsiaJCIS.2012.20","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.20","url":null,"abstract":"We study a linkage between attacks in cyberspace and incidents in our real world. For example, the Internet had been closed down in Egypt for preventing protests against President Hosni Mubarak. Meanwhile, for more than two weeks we have observed that no port-scan packet were sent from Egypt to Japan. This motivates us for this study to find any incident between botnet attacks which were involved many vulnerable servers and the real events occurred in the world. For this purpose, we developed the virtualization system on Google Earth service for plotting source IP addresses of botnet communications. We investigated the actual malware downloading events observed by more than 70 distributed honey pots in the Japanese backbone network. In order to automate the detection process, we study some anomaly detection schemes base on the entropy of honey pot activities. Our analysis shows some evidences that botnet attacks are involved in our real world.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"2008 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125584942","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
An Efficient Lossless Data Hiding Scheme on VQ Index Coding 一种高效的VQ索引编码无损数据隐藏方案
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.8
Chin-Feng Lee, Ming-Chi Shih, Cheng-Ta Huang
{"title":"An Efficient Lossless Data Hiding Scheme on VQ Index Coding","authors":"Chin-Feng Lee, Ming-Chi Shih, Cheng-Ta Huang","doi":"10.1109/AsiaJCIS.2012.8","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.8","url":null,"abstract":"Loss less data hiding can extract the embedded secret data and restore the cover media to its original status. Wang et al. in 2010 proposed a loss less data hiding method to embed secret message on VQ indices but their scheme has the encoded bit stream over-expanded. This paper improves their embedding approach by employing the index clusters with localization to enhance the similarity of adjacent indices and to improve the compressing code strem arrangement for effectively reducing the bit rates of final code stream.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122872651","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
Reversible Data Hiding for JPEG Based on EMD 基于EMD的JPEG可逆数据隐藏
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.7
W. Kuo, S. Kuo
{"title":"Reversible Data Hiding for JPEG Based on EMD","authors":"W. Kuo, S. Kuo","doi":"10.1109/AsiaJCIS.2012.7","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.7","url":null,"abstract":"To save communication bandwidth, data compression method usually is used when the stego-image transmits. To defend data security, the data hiding technology is used in the data communication. However, it seems that there is no relationship between data compression and data hiding. Actually, they are closely related. Until now, many data hiding schemes had been proposed in literatures. Unfortunately, the stego-image size will be increased after the secret data is hidden. In order to overcome this disadvantage, a reversible data hiding for JEPG based on EMD will be proposed in this paper. According to the experimental results, we can prove that our proposed scheme still keeps high embedding capacity, security and good compression ratio.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134090871","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
Proposal of a Secure WEP Operation against Existing Key Recovery Attacks and its Evaluation 针对现有密钥恢复攻击的安全WEP操作建议及其评估
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.11
Tsubasa Tsukaune, Yosuke Todo, M. Morii
{"title":"Proposal of a Secure WEP Operation against Existing Key Recovery Attacks and its Evaluation","authors":"Tsubasa Tsukaune, Yosuke Todo, M. Morii","doi":"10.1109/AsiaJCIS.2012.11","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.11","url":null,"abstract":"WEP is a security protocol in a wireless LAN network. However its vulnerability has been pointed out, and many key recovery attacks against WEP were proposed by using it. Some attacks can retrieve a WEP key easily by observing about 20,000 packets. In order to avoid such attack, we have to update the WEP key whenever the number of communicated packets exceeds a certain threshold. For immunizing against key recovery attacks, it is the best way to update the key every 10,000 packets. However 10,000 packets are very few, so it is not realistic. In this paper, we propose a secure WEP operation against key recovery attacks. The proposed method requires for attackers at least 100,000 packets to recover the WEP key. Furthermore we theoretically evaluate our technique to operate a secure WEP communication.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131272396","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}
引用次数: 11
Fast-Refreshing Tree-Based Group Key Agreement for Mobile Ad Hoc Networks 基于快速刷新树的移动自组网组密钥协议
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.16
Chung-Wei Chen, Shiuh-Jeng Wang, Yuh-Ren Tsai, Hsing-Chung Chen
{"title":"Fast-Refreshing Tree-Based Group Key Agreement for Mobile Ad Hoc Networks","authors":"Chung-Wei Chen, Shiuh-Jeng Wang, Yuh-Ren Tsai, Hsing-Chung Chen","doi":"10.1109/AsiaJCIS.2012.16","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.16","url":null,"abstract":"With the proliferation of group-oriented applications in mobile ad hoc networks (MANETs), users need suitable group key agreements to secure communication between group members. Because of users' mobility, group members join their group or leave frequently in MANETs. Due to each MANET has a unique, specific purpose, there typically is no central management mechanism. The utilization of resource, such as bandwidth, is limited. Furthermore, a user's wireless device is usually equipped only with limited battery power. Consequently, power consumption also affects the life period of a MANET. Due to these challenges, MANETs require a group key agreement which can generate and refresh a group key quickly and efficiently. In this paper, we propose a Fast-reacting Tree-based Group key agreement for MANETs, FTG-M, which supports efficient message transmission and low communication overhead in order to refresh group keys quickly. In addition, we utilize a new idea, a virtual tree, to reduce communication overhead. We compare the performance of FTG-M with other schemes, so as to show the reduction of communication and computation overhead.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125871745","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}
引用次数: 1
Strong Tamper-Localization, Visual Secret Sharing Scheme Based on Exploiting Modification Direction 基于修改方向开发的强篡改定位可视化秘密共享方案
2012 Seventh Asia Joint Conference on Information Security Pub Date : 2012-08-09 DOI: 10.1109/AsiaJCIS.2012.9
Chinchen Chang, Ngoc-Tu Huynh, Chia-Chun Lin
{"title":"Strong Tamper-Localization, Visual Secret Sharing Scheme Based on Exploiting Modification Direction","authors":"Chinchen Chang, Ngoc-Tu Huynh, Chia-Chun Lin","doi":"10.1109/AsiaJCIS.2012.9","DOIUrl":"https://doi.org/10.1109/AsiaJCIS.2012.9","url":null,"abstract":"Recently, protecting information that is shared or transmitted over the Internet has become a critical issue. Several ways to transfer secret data have been proposed, including visual secret sharing (VSS), which is an efficient technique because the secret data are kept by a group of participants, rather than one person, so that they cannot be lost. In this paper, we proposed a new, visual, secret-sharing method with high quality shadows by smartly employing a steganography method, called Exploiting Modification Direction (EMD), during share construction. In addition, the scheme can detect if any tampering has occurred on the shadow. Our experimental results show that the scheme is efficient and secure.","PeriodicalId":130870,"journal":{"name":"2012 Seventh Asia Joint Conference on Information Security","volume":"356 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121711395","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}
引用次数: 2
首页 上一页
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学术官方微信