2010 Ninth IEEE International Symposium on Network Computing and Applications最新文献_第5页

PwdIP-Hash: A Lightweight Solution to Phishing and Pharming Attacks PwdIP-Hash:针对网络钓鱼和钓鱼攻击的轻量级解决方案

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.35

B. Aslam, Lei Wu, C. Zou

{"title":"PwdIP-Hash: A Lightweight Solution to Phishing and Pharming Attacks","authors":"B. Aslam, Lei Wu, C. Zou","doi":"10.1109/NCA.2010.35","DOIUrl":"https://doi.org/10.1109/NCA.2010.35","url":null,"abstract":"We present a novel lightweight password-based solution that safeguards users from Phishing and Pharming attacks. The proposed authentication relies on a hashed password, which is the hash value of the user-typed password and the authentication server’s IP address. The solution rests on the fact that the server connected by a client using TCP connection cannot lie about its IP address. If a user is unknowingly directed to a malicious server (by a Phishing or a Pharming attack), the password obtained by the malicious server will be the hashed-password (tied to the malicious server’s IP address) and will not be usable by the attacker at the real server thus defeating Phishing/Pharming attack. The proposed solution does not increase the number of exchanged authentication messages, nor does it need hardware tokens as required by some previously proposed solutions. The solution is also safe against denial-of-service attacks since no state is maintained on server side during the authentication process. We have prototyped our design both as a web browser’s plug-in and as a standalone application. A comprehensive user study was conducted. The results show that around 95% of users think the proposed solution is easy to use and manage. Further, around 79% of users have shown willingness to use the application to protect their passwords.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129906548","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

On the Integrity of Network Coding-Based Anonymous P2P File Sharing Networks 基于网络编码的匿名P2P文件共享网络完整性研究

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.34

Paolo Gasti, A. Merlo, G. Ciaccio, G. Chiola

{"title":"On the Integrity of Network Coding-Based Anonymous P2P File Sharing Networks","authors":"Paolo Gasti, A. Merlo, G. Ciaccio, G. Chiola","doi":"10.1109/NCA.2010.34","DOIUrl":"https://doi.org/10.1109/NCA.2010.34","url":null,"abstract":"Network coding is a class of routing algorithms offering increased throughput and improved robustness to random failures. With traditional routing, intermediate nodes in the network may only forward unmodified packets. With network coding, instead, intermediate nodes are allowed to forward linear combinations of received packets. Original data can be reconstructed after collecting sufficiently many linear combinations. Current file sharing systems offer either low overhead and high bandwidth with no privacy, or acceptable privacy at very low speed. Thanks to network coding, a general-purpose P2P network can obtain a privacy/performance tradeoff that may be considered reasonable in most real-world scenarios. In this paper we present an integrity strategy for network coding-based P2P anonymous systems, specifically designed to preserve the anonymity of peers. Our approach is significantly easier to implement than current solutions when anonymity is required. We implement the cryptographic algorithms on which our method is based and provide performance figures. We also define verification strategies which use batching for improved performances together with an efficiency analysis.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129196547","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

Cost-Based Optimization of Buffer Size in M/G/1/N Systems under Different Service-Time Distributions 不同服务时间分布下M/G/1/N系统缓冲区大小基于成本的优化

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.11

Derek Doran, L. Lipsky, Stephen Thompson

引用次数: 7

Colocation as a Service: Strategic and Operational Services for Cloud Colocation 托管即服务:云托管的战略和运营服务

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-15 DOI: 10.1109/NCA.2010.17

Vatche Isahagian, Raymond Sweha, Jorge Londoño, Azer Bestavros

{"title":"Colocation as a Service: Strategic and Operational Services for Cloud Colocation","authors":"Vatche Isahagian, Raymond Sweha, Jorge Londoño, Azer Bestavros","doi":"10.1109/NCA.2010.17","DOIUrl":"https://doi.org/10.1109/NCA.2010.17","url":null,"abstract":"By colocating with other tenants of an Infrastructure as a Service (IaaS) offering, IaaS users could reap significant cost savings by judiciously sharing their use of the fixed-size instances offered by IaaS providers. This paper presents the blueprints of a Colocation as a Service (CaaS) framework. CaaS strategic services identify coalitions of self-interested users that would benefit from colocation on shared instances. CaaS operational services provide the information necessary for, and carry out the reconfigurations mandated by strategic services. CaaS could be incorporated into an IaaS offering by providers; it could be implemented as a value-added proposition by IaaS resellers; or it could be directly leveraged in a peer-to-peer fashion by IaaS users. To establish the practicality of such offerings, this paper presents XCS – a prototype implementation of CaaS on top of the Xen hypervisor. XCS makes specific choices with respect to the various elements of the CaaS framework: it implements strategic services based on a game-theoretic formulation of colocation; it features novel concurrent migration heuristics which are shown to be efficient; and it offers monitoring and accounting services at both the hypervisor and VM layers. Extensive experimental results obtained by running PlanetLab trace-driven workloads on the XCS prototype confirm the premise of CaaS – by demonstrating the efficiency and scalability of XCS, and by quantifying the potential cost savings accrued through the use of XCS.","PeriodicalId":276374,"journal":{"name":"2010 Ninth IEEE International Symposium on Network Computing and Applications","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114904866","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}

引用次数: 15

ASE: Authenticated Statement Exchange ASE:经过验证的语句交换

2010 Ninth IEEE International Symposium on Network Computing and Applications Pub Date : 2010-07-01 DOI: 10.1109/NCA.2010.27

Benjamin Fuller, R. Khazan, Joseph A. Cooley, G. Pickard, Daniil M. Utin

引用次数: 1