A branch hash function as a method of message synchronization in anonymous P2P conversations

Abstract Currently existing solutions rarely protect message integrity, authenticity and user anonymity without burdening the user with details of key management. To address this problem, we present Aldeon-a protocol for anonymous group conversations in a peer-to-peer system. The efficiency of Aldeon is based on a novel tree synchronization algorithm, which is proposed and discussed in this paper. By using this algorithm, a significant reduction in the number of exchanged messages is achieved. In the paper, the formal definition of the proposed hash branch function and the proof of its efficiency are presented.

[1]  Zhen Xiao,et al.  Understanding Instant Messaging Traffic Characteristics , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[2]  Miguel Castro,et al.  SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.

[3]  Kenneth G. Paterson,et al.  Deniable Authenticated Key Establishment for Internet Protocols , 2003, Security Protocols Workshop.

[4]  Saleh Almanei.  Secure Instant Messaging : the Jabber protocol , 2003 .

[5]  Hermann Kopetz,et al.  Dependability: Basic Concepts and Terminology , 1992 .

[6]  Elaine Shi,et al.  EnCore: private, context-based communication for mobile social apps , 2014, MobiSys.

[7]  W. Keith Edwards,et al.  A Brief Introduction to Usable Security , 2008, IEEE Internet Computing.

[8]  Janardan Misra,et al.  Increasing Anonymity in Bitcoin , 2014, Financial Cryptography Workshops.

[9]  Baocang Wang,et al.  Group key agreement for secure group communication in dynamic peer systems , 2012, J. Parallel Distributed Comput..

[10]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[11]  Rainer Böhme,et al.  Towards Risk Scoring of Bitcoin Transactions , 2014, Financial Cryptography Workshops.

[12]  Hannes Federrath,et al.  Web MIXes: A System for Anonymous and Unobservable Internet Access , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[13]  Rüdiger Schollmeier,et al.  A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications , 2001, Proceedings First International Conference on Peer-to-Peer Computing.

[14]  Aviv Zohar,et al.  Accelerating Bitcoin's Transaction Processing. Fast Money Grows on Trees, Not Chains , 2013, IACR Cryptol. ePrint Arch..

[15]  D. Dikranjan.  Recent advances in minimal topological groups , 1998 .

[16]  Tim Weninger,et al.  An exploration of submissions and discussions in social news: mining collective intelligence of Reddit , 2014, Social Network Analysis and Mining.

[17]  Ernesto Damiani,et al.  P2P-based collaborative spam detection and filtering , 2004 .

[18]  Márk Jelasity,et al.  PeerSim: A scalable P2P simulator , 2009, 2009 IEEE Ninth International Conference on Peer-to-Peer Computing.

[19]  Nancy A. Lynch,et al.  Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services , 2002, SIGA.

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

[21]  Zhenyu Wu,et al.  Secure instant messaging in enterprise-like networks , 2012, Comput. Networks.

[22]  Detlef Schoder,et al.  Peer-to-peer prospects , 2003, CACM.

[23]  Trisha Dowerah Baruah,et al.  Effectiveness of Social Media as a tool of communication and its potential for technology enabled connections: A micro-level study , 2012 .

[24]  Lars Völker,et al.  Can internet users protect themselves? Challenges and techniques of automated protection of HTTP communication , 2011, Comput. Commun..

[25]  William J. Rose.  Poland — Past and Present , 1946 .

[26]  Robert Tappan Morris,et al.  Security Considerations for Peer-to-Peer Distributed Hash Tables , 2002, IPTPS.

[27]  Andrei Serjantov,et al.  Anonymizing Censorship Resistant Systems , 2002, IPTPS.

[28]  Sheila Frankel,et al.  The AES-CBC Cipher Algorithm and Its Use with IPsec , 2003, RFC.

[29]  K. Miller.  Organizational Communication: Approaches and Processes , 2002 .

[30]  Paul C. van Oorschot,et al.  A Protocol for Secure Public Instant Messaging , 2006, Financial Cryptography.

[31]  Nirwan Ansari,et al.  Survey of security services on group communications , 2010, IET Inf. Secur..

[32]  Andrew W. Moore,et al.  Internet traffic classification using bayesian analysis techniques , 2005, SIGMETRICS '05.

[33]  Raouf Boutaba,et al.  Cloud computing: state-of-the-art and research challenges , 2010, Journal of Internet Services and Applications.