Self-destructing Instant Messages by Employing KAD DHT Network

Privacy protection is becoming more and more important due to the ubiquitous access to information. Distributed Hash Tables (DHTs) are widely used by peer-to-peer networks with more than one million concurrently active users. This paper proposes and designs a web based self-Destructing Instant Messenger (DIM) on eMule KAD DHT network in China without any involvement of users and trusted systems, thus protecting the privacy of instant messages. Comprehensive experiments are performed to evaluate the features of eMule KAD DHT network and analyze the impacts of the features on the DIM. Experimental results reveal that the lifespan of data objects in the eMule KAD network in China is much shorter than that defined by the KAD protocol, and the pattern of eMule peers in China has a significant impact on the behavior of DIM. Furthermore, an approach of prstoring subkeys is designed to eliminate the overhead involved in the distribution and retrieving of subkeys, thus optimizing the performance of DIM.

[1]  Richard J. Lipton,et al.  A Revocable Backup System , 1996, USENIX Security Symposium.

[2]  Stefan Saroiu,et al.  A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .

[3]  Taoufik En-Najjary,et al.  Long Term Study of Peer Behavior in the kad DHT , 2009, IEEE/ACM Transactions on Networking.

[4]  Yuhui Deng,et al.  Ant colony optimization inspired resource discovery in P2P Grid systems , 2009, The Journal of Supercomputing.

[5]  Amit A. Levy,et al.  Vanish: Increasing Data Privacy with Self-Destructing Data , 2009, USENIX Security Symposium.

[6]  Tung-Shou Chen,et al.  Reversible privacy preserving data mining: a combination of difference expansion and privacy preserving , 2013, The Journal of Supercomputing.

[7]  Edith Cohen,et al.  Search and replication in unstructured peer-to-peer networks , 2002, ICS '02.

[8]  Krishna P. Gummadi,et al.  Measurement, modeling, and analysis of a peer-to-peer file-sharing workload , 2003, SOSP '03.

[9]  David Mazières,et al.  Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.

[10]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

[11]  Tadayoshi Kohno,et al.  Privacy-Preserving Location Tracking of Lost or Stolen Devices: Cryptographic Techniques and Replacing Trusted Third Parties with DHTs , 2008, USENIX Security Symposium.

[12]  John A. Hoxmeier,et al.  System Response Time and User Satisfaction: An Experimental Study of Browser-based Applications , 2000 .

[13]  Radu Sion,et al.  TrustedDB: A Trusted Hardware-Based Database with Privacy and Data Confidentiality , 2011, IEEE Transactions on Knowledge and Data Engineering.

[14]  Mark Handley,et al.  A scalable content-addressable network , 2001, SIGCOMM '01.

[15]  Daniel Stutzbach,et al.  Improving Lookup Performance Over a Widely-Deployed DHT , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Byung-Gon Chun,et al.  TaintDroid: an information flow tracking system for real-time privacy monitoring on smartphones , 2014, Commun. ACM.

[17]  John Kubiatowicz,et al.  Handling churn in a DHT , 2004 .

[18]  Peter Druschel,et al.  Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .

[19]  Ben Y. Zhao,et al.  Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.

[20]  Brighten Godfrey,et al.  OpenDHT: a public DHT service and its uses , 2005, SIGCOMM '05.

[21]  Adi Shamir,et al.  How to share a secret , 1979, CACM.

[22]  N. Cao,et al.  Privacy-preserving multi-keyword ranked search over encrypted cloud data , 2011, 2011 Proceedings IEEE INFOCOM.

[23]  Antony I. T. Rowstron,et al.  Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.

[24]  Ant Colony Optimization Inspired Resource Discovery in P 2 P Grid Systems , 2013 .

[25]  Thomas E. Anderson,et al.  Profiling a million user dht , 2007, IMC '07.

[26]  Scott Shenker,et al.  Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.

[27]  Robert Tappan Morris,et al.  Designing a DHT for Low Latency and High Throughput , 2004, NSDI.

[28]  Cong Wang,et al.  Privacy-Preserving Public Auditing for Data Storage Security in Cloud Computing , 2010, 2010 Proceedings IEEE INFOCOM.