1 A Collaboration Scheme for Making Peer-to-Peer Anonymous Routing Resilient Authors: X. Wang and J. Luo Source: 12th International Conference on Computer.

Slides:



Advertisements
Similar presentations
1 P2P Reputation Management Using Distributed Identities and Decentralized Recommendation Chains Authors: P. Dewan and P. Dasgupta Source: IEEE Transactions.
Advertisements

11 Efficient and Secure Certificateless Authentication and Key Agreement Protocol for Hybrid P2P Network Authors: Z. B. Xu and Z. W. Li Source: The 2nd.
Kerberos Assisted Authentication in Mobile Ad-hoc Networks Authors: Asad Amir Pirzada and Chris McDonald Sources: Proceedings of the 27th Australasian.
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Rumor Riding, IEEE ICNP2006, Jinsong Han & Yunhao Liu, HKUST, Nov 12 1 Rumor Riding Anonymizing Unstructured Peer- to-Peer System Jinsong Han and Yunhao.
Samsara: Honor Among Thieves in Peer-to-Peer Storage Landon P. Cox and Brian D. Noble University of Michigan.
Using Auxiliary Sensors for Pair-Wise Key Establishment in WSN Source: Lecture Notes in Computer Science (2010) Authors: Qi Dong and Donggang Liu Presenter:
1 Freeriders in P2P: Pricing Incentives Don Towsley UMass-Amherst collaborators: D. Figueiredo, J. Shapiro.
Cashmere: Resilient Anonymous Routing CS290F March 7, 2005.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
ODISSEA Mehdi Kharrazi Kulesh Shanmugasundaram Security Issues.
Small Worlds and the Security of Ubiquitous Computing From : IEEE CNF Author : Harald Vogt Presented by Chen Shih Yu.
Responder Anonymity and Anonymous Peer-to-Peer File Sharing. by Vincent Scarlata, Brian Levine and Clay Shields Presentation by Saravanan.
Peer-to-Peer Computing
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
SCALLOP A Scalable and Load-Balanced Peer- to-Peer Lookup Protocol for High- Performance Distributed System Jerry Chou, Tai-Yi Huang & Kuang-Li Huang Embedded.
Key Distribution and Route Selection in Wireless Sensor Networks Nathan Lewis, Noria Foukia Information Science.
Online Data Gathering for Maximizing Network Lifetime in Sensor Networks IEEE transactions on Mobile Computing Weifa Liang, YuZhen Liu.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Database k-Nearest Neighbors in Uncertain Graphs Lin Yincheng VLDB10.
OpenFlow-based load balancing for wireless mesh infrastructure Author(s): Fan Yang, Gondi, V., Hallstrom, J.O., Kuang-Ching Wang, Eidson, G. Consumer Communications.
People Fractions. Problem 1 of 20 Answer 1 = 10 Problem 2 of 20 Answer 2 = 5.
IPDPS 2007 Making Peer-to-Peer Anonymous Routing Resilient to Failures Yingwu Zhu Seattle University
Thesis Proposal Data Consistency in DHTs. Background Peer-to-peer systems have become increasingly popular Lots of P2P applications around us –File sharing,
P2PSIP diagnostics Song Haibin draft-zheng-p2psip-diagnose-02
Provable Unlinkability Against Traffic Analysis Amnon Ta-Shma Joint work with Ron Berman and Amos Fiat School of Computer Science, Tel-Aviv University.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
Resilient P2P Anonymous Routing by Using Redundancy Yingwu Zhu.
1 A secure model for controlling the hubs in P2P wireless network based on trust value Authors: Y. Liu, N. Xiong, K. Xu, J. H. Park, and C. Lin Source:
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
1 Proteomics: APPROACHES AND IMAGE ANALYSIS TOOLS FOR DRUG DISCOVERY Authors: Sophia R. HE, Edmond J. Breen and Sybille M. N. Hunt Source: ICME 2003, pp.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
A Peer-to-Peer Approach to Resource Discovery in Grid Environments (in HPDC’02, by U of Chicago) Gisik Kwon Nov. 18, 2002.
1 Bounding Virus Proliferation in P2P Networks with a Diverse-Parameter Trust Management Scheme Authors: C. Lin and R. C. Roberto Source: IEEE Communications.
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
SIGCOMM 2001 Lecture slides by Dr. Yingwu Zhu Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
1 A peer mutual authentication method on super peer based peer-to- peer network Authors: Byeong-Thaek Oh, Sang-Bong Lee, and Ho-Jin Park Source: IEEE International.
Partition and multi-path transmission-An encryption-free reputation sharing protocol in Gnutella-like peer-to-peer network Author: X. X. Ma, and Z. G.
Two-tier authentication for cluster and individual sets in mobile ad hoc networks Authors: Yuh-Ren Tsai and Shiuh-Jeng Wang Sources: Computer Networks,
1 A connection management protocol for promoting cooperation in Peer-to-Peer networks Authors: Murat Karakaya, Ibrahim Korpeoglu, and Ozgur Ulusoy Source:
1 Efficient User Authentication and Key Management for Peer-to- Peer Live Streaming Systems Authors: X. Liu, Y. Hao, C. Lin, and C. Du Source: Tsinghua.
1 Source: Journal of Chemical Information & Computer Sciences, 2003, vol.43, pp Authors: K. Kaczmarek, B. Walczak, S. de Jong, and B. G. M. Vandeginste.
Security in Wireless Ad Hoc Networks. 2 Outline  wireless ad hoc networks  security challenges  research directions  two selected topics – rational.
Computer Networking P2P. Why P2P? Scaling: system scales with number of clients, by definition Eliminate centralization: Eliminate single point.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
1 Biometric template selection and update: a case study in fingerprints Source:Pattern Recognition, Vol. 37, 2004, pp Authors: Umut Uludag, Arun.
Local Correlation-based Fingerprint Matching
1 Signature Protocol for Peer-to- peer Massively Multiplayer Online Games Speaker: Shu-Fen Chiou ( 邱淑芬 )
Key Establishment Scheme against Storage-Bounded Adversaries in Wireless Sensor Networks Authors: Shi-Chun Tsai, Wen-Guey Tzeng, and Kun-Yi Zhou Source:
A Reputation-Based Approach for Choosing Reliable Resources in Peer-to-Peer Networks E. Damiani S. De Capitani di Vimercati S. Paraboschi P. Samarati F.
Visual Cryptography for Gray-Level Images by Dithering Techniques
Fair Blind Signature Based Authentication for Super Peer P2P Network Authors: Xiaoliang Wang and Xingming Sun Source: 2009, Information Technology Journal,
1 Reversible and lossless data hiding in the integer wavelet transform domain (Review) Authors: S. Yousefi, H. R. Rabiee, E. Yousefi, and M. Ghanbari Speaker:
1 SepRep: A Novel Reputation Evaluation Model in Peer-to-Peer Networks Authors: Xiaowei Chen, Kaiyong Zhao, and Xiaowen Chu Source: Autonomic and Trusted.
Freenet: Anonymous Storage and Retrieval of Information
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
Efficient Pairwise Key Establishment Scheme Based on Random Pre-Distribution Keys in Wireless Sensor Networks Source: Lecture Notes in Computer Science,
CS 347Notes081 CS 347: Parallel and Distributed Data Management Notes 08: P2P Systems.
1 Block Truncation Coding Using Pattern Fitting Source: Pattern Recognition, vol.37, 2004, pp Authors: Bibhas Chandra Dhara, Bhabatosh Chanda.
Motivation - The Edge Lab Motivation Communication as a co-operative multi-party act: But interests diverge … Core question: how can we distribute control.
1 Constructing trusted virtual execution environment in P2P grids Authors: D. Zou, W. Zheng, J. Long, H. Jin, and X. Chen Source: Future Generation Computer.
Cooperative Spectrum-Aware Opportunistic Routing in Cognitive Radio Ad Hoc Networks Cuimei Cui* †, Hong Man †, Yiming Wang* *School of Electronics and.
1 Adaptive Data Hiding in Edge Areas of Images with Spatial LSB Domain Systems Source: IEEE Transactions on Information Forensics and Security, Vol. 3,
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications * CS587x Lecture Department of Computer Science Iowa State University *I. Stoica,
A New Security Trust Model for Peer-to-Peer E-commerce
Anonymous Wireless Authentication on a Portable Cellular Mobile System
Department of Computer Science University of York
Presentation transcript:

1 A Collaboration Scheme for Making Peer-to-Peer Anonymous Routing Resilient Authors: X. Wang and J. Luo Source: 12th International Conference on Computer Supported Cooperative Work in Design, pp , 2008 Speaker: Shu-Fen Chiou ( 邱淑芬 )

2 Motivation AB G D C E F initiator responder a.mp3

3 Approach Initiator anonymous protocol. Using Friendly Neighbor-based Incentive (FNI) improve the fragile path. Re-encryption mechanism for replacing failed relay nodes to improve routing resilience.

4 FNI mechanism AB G D C E F initiator responder :excellent neighbor 0:colsed friend

5 Increase its rating value Increasing answering power. Increasing the number of edges. Increasing the amount of capacity used to service neighbors ’ queries. Increasing the length of period for servicing neighbors ’ queries.

6 Onion routing AB G D C E F initiator responder a.mp3 Onion A-G Onion G-D Onion D-F

7 Failed node AB G D C E F initiator responder a.mp3 Onion A-G Onion G-D Onion D-F Onion G-B Re-encryption key K D-B

8 Security analysis N: number of nodes in the system. F: fraction of malicious nodes that collaborates each other. L: number of relay nodes on a path. The probability a node x is the initiator I is:

9 Experimental results

10 Comments Mutual anonymous Security consider Re-encryption mechanism Initial rating