Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
2016 | 26 | 2 | 479-493
Tytuł artykułu

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

Treść / Zawartość
Warianty tytułu
Języki publikacji
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.
Słowa kluczowe
Opis fizyczny
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Institute of Computing Science, Poznań University of Technology, ul. Piotrowo 2, 61-131 Poznań, Poland
  • Aditya, P., Erdélyi, V., Lentz, M., Shi, E., Bhattacharjee, B. and Druschel, P. (2014). Encore: Private, context-based communication for mobile social apps, Proceedings of the 12th Annual International Conference on Mobile Systems, Applications, and Services, Bretton Woods, NH, USA, pp. 135-148.
  • Baruah, T. (2012). Effectiveness of social media as a tool of communication and its potential for technology enabled connections: A micro-level study, International Journal of Scientific and Research Publications 2(5): 1-10.
  • Berthold, O., Federrath, H. and Kpsell, S. (2001). Web mixes: A system for anonymous and unobservable internet access, International Workshop on Designing Privacy Enhancing Technologies: Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, pp. 115-129.
  • Boyd, C., Mao, W. and Paterson, K.G. (2005). Deniable authenticated key establishment for internet protocols, in B. Christianson et al. (Eds.), Security Protocols, Springer, Berlin/Heidelberg, pp. 255-271.
  • Dabek, F., Li, J., Sit, E., Robertson, J., Kaashoek, M. and Morris, R. (2004). Designing a DHT for low latency and high throughput, Proceedings of the 1st USENIX Symposium on Networked Systems Design and Implementation (NSDI'04), San Francisco, CA, USA, p. 7.
  • Damiani, E., De Capitani di Vimercati, S., Paraboschi, S. and Samarati, P. (2004). P2P-based collaborative spam detection and filtering, 4th International Conference on Peer-to-Peer Computing (P2P 2004), Zurich, Switzerland, pp. 176-183.
  • Dikranjan, D. (1998). Recent advances in minimal topological groups, Topology and its Applications 85(1): 53-91.
  • ENISA (2012). Algorithms, key sizes and parameters report-2013 recommendations, Technical report, European Union Agency for Network and Information Security Agency, Heraklion.
  • Frankel, S., Glenn, R. and Kelly, S. (2003). The AES-CBC cipher algorithm and its use with IPSEC, RFC 3602, Network Working Group,
  • Gilbert, S. and Lynch, N. (2002). Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services, SIGACT News 33(2): 51-59.
  • Laprie, J.C., Avizienis, A. and Kopetz, H. (Eds.) (1992). Dependability: Basic Concepts and Terminology, Springer-Verlag New York, Secaucus, NJ.
  • Lv, X., Li, H. and Wang, B. (2012). Group key agreement for secure group communication in dynamic peer systems, Journal of Parallel and Distributed Computing 72(10): 1195-1200.
  • Mannan, M. and van Oorschot, P. (2006). A protocol for secure public instant messaging, 10th International Conference on Financial Cryptography and Data Security, Anguilla, British West Indies, pp. 20-35.
  • Miller, K. (2014). Organizational Communication: Approaches and Processes, Cengage Learning, Boston, MA.
  • Montresor, A. and Jelasity, M. (2009). PeerSim: A scalable P2P simulator, IEEE 9th International Conference on Peer-toPeer Computing, P2P'09, Seattle, WA, USA, pp. 99-100.
  • Moore, A. and Zuev, D. (2005). Internet traffic classification using Bayesian analysis techniques, Proceedings of the International Conference on Measurements and Modeling of Computer Systems, SIGMETRICS 2005, Banff, Alberta, Canada, pp. 50-60.
  • Mooser, M., Boohme, R. and Breuker, D. (2014). Towards risk scoring of Bitcoin transactions, Financial Cryptography and Data Security FC 2014 Workshops, Bridgetown, Barbados, pp. 16-32.
  • Nakamoto, S. (2008). Bitcoin: A peer-to-peer electronic cash system,
  • Payne, B. and Edwards, W. (2008). A brief introduction to usable security, IEEE Internet Computing 12(3): 13-21.
  • Rivest, R. L., Shamir, A. and Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM 21(2): 120-126.
  • Rowstron, A., Kermarrec, A., Castro, M. and Druschel, P. (2001). SCRIBE: The design of a large-scale event notification infrastructure, Proceedings of the 3rd International COST264 Workshop on Networked Group Communication, NGC'01, London, UK, pp. 30-43.
  • Sakarindr, P. and Ansari, N. (2010). Survey of security services on group communications, IET Information Security 4(4): 258-272.
  • Saxena, A., Misra, J. and Dhar, A. (2014). Increasing anonymity in Bitcoin, in N. Christin and R. Safav-Naini (Eds.), Financial Cryptography and Data Security, Springer, Berlin/Heidelberg, pp. 122-139.
  • Schoder, D. and Fischbach, K. (2003). Peer-to-peer prospects, Communications of the ACM 46(2): 27-29.
  • Schollmeier, R. (2001). A definition of peer-to-peer networking for the classification of peer-to-peer architectures and applications, Proceedings of the 1st International Conference on Peer-to-Peer Computing, P2P'01, Linköping, Sweden, pp. 101-102.
  • SDCDev (2014). Shadowcoin secure messaging: A P2P encrypted instant messaging system,
  • Serjantov, A. (2002). Anonymizing censorship resistant systems, in P. Druschel et al. (Eds.), Peer-to-Peer Systems, Lecture Notes in Computer Science, Vol. 2429, Springer, Berlin/Heidelberg, pp. 111-120.
  • Sit, E. and Morris, R. (2002). Security considerations for peer-to-peer distributed hash tables, Revised Papers from the 1st International Workshop on Peer-to-Peer Systems, IPTPS'01, Cambridge, MA, USA, pp. 261-269.
  • Sompolinsky, Y. and Zohar, A. (2013). Accelerating Bitcoin's transaction processing. Fast money grows on trees, not chains, IACR Cryptology ePrint Archive 2013: 881.
  • Völker, L., Noe, M., Waldhorst, O.P., Werle, C. and Sorge, C. (2011). Can internet users protect themselves? Challenges and techniques of automated protection of http communication, Computer Communications 34(3): 457-467.
  • Warren, J. (2012). Bitmessage: A peer-to-peer message authentication and delivery system,
  • Weninger, T. (2014). An exploration of submissions and discussions in social news: Mining collective intelligence of Reddit, Social Network Analysis and Mining 4(1): 1-19.
  • Xiao, Z., Guo, L. and Tracey, J. M. (2007). Understanding instant messaging traffic characteristics, 27th IEEE International Conference on Distributed Computing Systems (ICDCS 2007), Toronto, Ontario, Canada, p. 51.
  • Xie, M. and Wang, H. (2012). Secure instant messaging in enterprise-like networks, Computer Networks 56(1): 448-461.
  • Zhang, Q., Cheng, L. and Boutaba, R. (2010). Cloud computing: State-of-the-art and research challenges, Journal of Internet Services and Applications 1(1): 7-18.
Typ dokumentu
Identyfikator YADDA
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.