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

2011 International Conference on Network Computing and Information Security最新文献

筛选
英文 中文
Public Watermark Detection Using Secure Multiparty Computation 基于安全多方计算的公共水印检测
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.177
Hong Wang, Shimin Wei
{"title":"Public Watermark Detection Using Secure Multiparty Computation","authors":"Hong Wang, Shimin Wei","doi":"10.1109/NCIS.2011.177","DOIUrl":"https://doi.org/10.1109/NCIS.2011.177","url":null,"abstract":"A public watermark detection scheme based on secure multiparty computation is proposed. It removes the expensive zero-knowledge interactive proofs and replaces the traditional trusted third party with a group of proxies. Then, the proposed scheme is robust against \"single point failure\", and efficient in terms of computation cost, the number of rounds and bandwidth required in the communications. Because of using integer comparison technique, the scheme achieves the provable security against sensitivity attacks without leaking any information about the secret watermark.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117112691","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
Performance Analysis of Distributed Opportunistic Incremental Decode-and-Forward Scheme in Cooperative Communication at Arbitrary SNR 任意信噪比下协作通信分布式机会增量译码转发方案的性能分析
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.192
Yalong Zhang, Yuanyuan Gao, Baofeng Yang, Chunming Shen
{"title":"Performance Analysis of Distributed Opportunistic Incremental Decode-and-Forward Scheme in Cooperative Communication at Arbitrary SNR","authors":"Yalong Zhang, Yuanyuan Gao, Baofeng Yang, Chunming Shen","doi":"10.1109/NCIS.2011.192","DOIUrl":"https://doi.org/10.1109/NCIS.2011.192","url":null,"abstract":"In this paper, the outage probability and spectral efficiency of distributed opportunistic incremental decode-and-forward (DOIDF) are investigated. We derive the closed-form expressions for the outage probability and spectral efficiency including direct link at arbitrary SNR (signal to noise ratio) regime over independence-non-identical (inid) fading channels. Computer simulation results show that spectral efficiency of DOIDF outperforms the opportunistic relay scheme.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115515431","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
TD-RECS Chaotic System Based Digital Image Encryption Algorithm Protecting from Shearing Attack 基于TD-RECS混沌系统的防止剪切攻击的数字图像加密算法
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.88
Qi-nan Liao
{"title":"TD-RECS Chaotic System Based Digital Image Encryption Algorithm Protecting from Shearing Attack","authors":"Qi-nan Liao","doi":"10.1109/NCIS.2011.88","DOIUrl":"https://doi.org/10.1109/NCIS.2011.88","url":null,"abstract":"In order to protect digital image's information and renew the image that is attacked by shearing, this paper presents a novel image encryption algorithm based on Tangent-Delay Ellipse Reflecting Cavity map System (TD-ERCS) chaos sequences. One of the TD-ERCS is used to shift the image's pixel position, another is used to alter the pixel value, so that the image will be scrambled and encrypted. While doing the decryption, a method, which is based on the neighboring pixels characteristic, is provided to recover the sheared image. Theoretical analysis and experimental results show that the algorithm has a large space of keys, a good encryption and decryption effects, a better security performance to statistical analysis and a strong ability against shearing.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132558395","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
Research on Privacy-Preserving Cloud Storage Framework Supporting Ciphertext Retrieval 支持密文检索的隐私保护云存储框架研究
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.27
Ruwei Huang, Xiaolin Gui, Si Yu, Wei Zhuang
{"title":"Research on Privacy-Preserving Cloud Storage Framework Supporting Ciphertext Retrieval","authors":"Ruwei Huang, Xiaolin Gui, Si Yu, Wei Zhuang","doi":"10.1109/NCIS.2011.27","DOIUrl":"https://doi.org/10.1109/NCIS.2011.27","url":null,"abstract":"Privacy security is a key issue for cloud storage. Encryption is a well established technology for protecting sensitive data. But it gives some new problems: how data owner and storage service provider to operate on encrypted data? How to reduce data owner's workload of data management and support data sharing at the same time? If they can't be easy to resolved, encryption will bring a lot of troubles to people. In this paper, we design a privacy-preserving cloud storage framework to solve those problems. We design an interaction protocol among participants, adopt key derivation algorithm to generate and manage keys, use the combination of symmetric and asymmetric encryption to hide the sensitive data of users, and apply Bloom filter to realize cipher text retrieval. A system based on the framework is realized. The paper analyzes the feasibility of the framework from the performance of Bloom filter, the running overhead of the system and the privacy security of the framework. Finally, we summarize our work and introduce the directions of future research.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132312370","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}
引用次数: 35
An ECDLP-Based Randomized Key RFID Authentication Protocol 一种基于ecdlp的RFID随机密钥认证协议
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.128
Xinglei Zhang, Linsen Li, Yue Wu, Q. Zhang
{"title":"An ECDLP-Based Randomized Key RFID Authentication Protocol","authors":"Xinglei Zhang, Linsen Li, Yue Wu, Q. Zhang","doi":"10.1109/NCIS.2011.128","DOIUrl":"https://doi.org/10.1109/NCIS.2011.128","url":null,"abstract":"With the expansion of RFID technology application in diverse fields, the security problems attract more and more attention. In the RFID Security authentication protocols used public-key cryptography, the authentication protocol based on the ECDLP (Elliptic Curve Discrete Logarithm Problem) can solve the clone and reply attacks very well, but there are more or less problems in resisting tracking attacks. In this paper, we present a 'Randomized Key' proposal based on ECDLP and improve EC-RAC (Elliptic Curve Based Randomized Access Control) protocol and Schnorr protocol respectively. Our security analysis shows that the proposed improved protocols can resist tracking attack effectively.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130737284","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}
引用次数: 35
The Expected Value Model of Multiobjective Programming Problems under Bifuzzy Environment 双模糊环境下多目标规划问题的期望值模型
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.121
Mingfa Zheng, Bingjie Li, Guangxing Kou
{"title":"The Expected Value Model of Multiobjective Programming Problems under Bifuzzy Environment","authors":"Mingfa Zheng, Bingjie Li, Guangxing Kou","doi":"10.1109/NCIS.2011.121","DOIUrl":"https://doi.org/10.1109/NCIS.2011.121","url":null,"abstract":"In this paper, we mainly concern the expected value model and its solution method of the multiobjective programming problem under bifuzzy environment. We first consider the expected value model to the problem, and investigated its convexity. Furthermore, to the proposed model, the concepts of non-inferior solution are defined. According to practical decision-making process, a solution method, called the method of main objective function, has been studied, whose results can facilitate us to design algorithms to the problem.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130630308","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
Virtual Machines Scheduling Algorithm Oriented Load Forecast 面向负载预测的虚拟机调度算法
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.31
Xiaojun Chen, Jing Zhang
{"title":"Virtual Machines Scheduling Algorithm Oriented Load Forecast","authors":"Xiaojun Chen, Jing Zhang","doi":"10.1109/NCIS.2011.31","DOIUrl":"https://doi.org/10.1109/NCIS.2011.31","url":null,"abstract":"A virtual machines scheduling algorithm oriented load forecast is presented in this paper to improve Credit algorithm, which solves the problem of the adjustment of time slices in virtual machines based on their loads in systems to satisfy the requirements of timeliness, accuracy and fairness. On the basis of shared CPU resources, we propose a progressive time slices adjustment methodology in virtual machines, and based on it, a virtual machines scheduling model based on the minimum deviation of satisfaction degree of resources requirements is designed to adapt to the change of the load forecast results, which has implemented the management of shared CPU resources with a higher efficiency. The results of experiments show that criteria F1 and smaller fu would enable the executive cycles of virtual machines approach to load forecast.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127512009","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
An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks 针对非结构化P2P网络中强流失的基于年龄的成员协议
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.137
Haowen Liu, Xiwen Liu, Wei Song, Weidong Wen
{"title":"An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks","authors":"Haowen Liu, Xiwen Liu, Wei Song, Weidong Wen","doi":"10.1109/NCIS.2011.137","DOIUrl":"https://doi.org/10.1109/NCIS.2011.137","url":null,"abstract":"Churn refers the continuous process of node arrival and departure in distributed peer-to-peer network. Enormous nodes joining the system concurrently will results in a flash crowd scenario for special nodes in the system, and enormous nodes crashing in a moment might come out a broken network. In fact, the joining and crashing always occur around some nodes at the same time, which will conduct strong dynamic environment and affect the detailed application over the overlay very much. In P2P networks under churn, We divide the new joining nodes into normal freshman, whitewasher and crowd attackers, and divide the departure nodes into normal dying nodes, outcast whitewasher and partition attackers. So the churn will be composed of tolerable normal lifespan behavior, the frightfully spiteful attack behavior or passive whitewashing behavior, which should be seriously noticed. In this paper, we present a novel protocol with positive communication policy among peers and conservative neighbor maintenance scheme under churn, to keep desirable properties such as a low network diameter and clustering. The protocol is resilient against different extend of churn and fit for P2P information dissemination and file sharing systems especially.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126370301","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}
引用次数: 13
Adaptive Site Selection and Task Scheduling for Grid Workflow 网格工作流的自适应站点选择和任务调度
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.75
Li Xi, H. Zhigang, Yan Chao-kun
{"title":"Adaptive Site Selection and Task Scheduling for Grid Workflow","authors":"Li Xi, H. Zhigang, Yan Chao-kun","doi":"10.1109/NCIS.2011.75","DOIUrl":"https://doi.org/10.1109/NCIS.2011.75","url":null,"abstract":"The availability and performance of Grid sites change dynamically, which makes it be a great challenge to design a good site selection and task scheduling mechanism for Grid workflows. A multi-stage Grid site evaluation and selection mechanism, involving site testing, time series based site performance prediction and adaptive selection, was proposed in this paper. In order to enhance reliability of workflow execution and potentially reduce execution time, an incremental task replication policy based on empirical CDF of queuing time of sites was introduced. The experiments done in Open Science Grid (OSG) proved that adaptive site selection and task scheduling proposed in this paper could control JRR and JSL in a reasonable range in a realistic Grid environment, and workflow execution performance could be greatly improved by initial site evaluation and task replication policies.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116129650","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
A New Kind of Ndv-hop Algorithm in Wireless Sensor Network 无线传感器网络中一种新的Ndv-hop算法
2011 International Conference on Network Computing and Information Security Pub Date : 2011-05-14 DOI: 10.1109/NCIS.2011.185
Qingling Lu, Mengliang Bai, Wei Zhang, Peng YanLi
{"title":"A New Kind of Ndv-hop Algorithm in Wireless Sensor Network","authors":"Qingling Lu, Mengliang Bai, Wei Zhang, Peng YanLi","doi":"10.1109/NCIS.2011.185","DOIUrl":"https://doi.org/10.1109/NCIS.2011.185","url":null,"abstract":"DV-Hop is a typical way for the range-free localization in wireless sensor network. Aiming at the enhanced positioning accuracy and coverage, a new kind of NDV-HOP positioning algorithm that all anchors' average intervals are involved in calculation and weight least square method is utilized is proposed in this paper. The result of the simulation shows its availability and better practicality.","PeriodicalId":215517,"journal":{"name":"2011 International Conference on Network Computing and Information Security","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124007291","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}
引用次数: 7
首页 上一页
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学术官方微信