A lightweight mechanism for dependable communication in untrusted networks

Proceedings of the International Conference on Dependable Systems and Networks

Volumn , Issue , 2007, Pages 430-439

  Rogers, Michael ^a   Bhatti, Saleem ^b  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; MESSAGE PASSING; NETWORK PROTOCOLS; WEB SERVICES;

DEPENDABLE COMMUNICATION SYSTEMS; LIGHTWEIGHT OPERATIONS; UNFORGEABLE ACKNOWLEDGEMENT (U-ACK); UNTRUSTED NETWORKS;

TELECOMMUNICATION NETWORKS;

EID: 36049016485     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2007.9     Document Type: Conference Paper

References (40)

1. R. Perlman. Network layer protocols with Byzantine robustness. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, August 1988.
2. P. W. Yau and C.J. Mitchell. 2HARP: A secure routing protocol to detect failed and selfish nodes in mobile ad hoc networks. In Proc. 5th World Wireless Congress, San Francisco, CA, USA, pages 1-6, 2004.
3. D. Quercia, M. Lad, S. Hailes, L. Capra and S. Bhatti. STRUDEL: Supporting trust in the dynamic establishment of peering coalitions. In Proc. 21stAnnual ACM Symposium on Applied Computing (SAC2006), Bourgogne University, Dijon, France, 23-27 April 2006.
4. T.W. Ngan, D.S. Wallach, and P. Druschel. Enforcing fair sharing of peer-to-peer resources. In F. Kaashoek and I. Stoica, editors, Proc. 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), Berkeley, CA, USA, February 2003, volume 2735 of Lecture Notes in Computer Science, pages 149-159. Springer, 2003.
5. M. Ham and G. Agha. ARA: A robust audit to prevent free-riding in P2P networks. In 5th IEEE International Conference on Peer-to-Peer Computing, Konstanz, Germany, August-September 2005.
6. S. Buchegger and J.Y. Le Boudec. A robust reputation system for P2P and mobile ad hoc networks. In 2nd Workshop on Economics of Peer-to-Peer Systems, Cambridge, MA, USA, June 2004.
7. L. Anderegg and S. Eidenbenz. Ad hoc VCG: A truthful and cost-efficient routing protocol for mobile ad hoc networks with selfish agents. In ACM Mobicom, 2003.
8. P. Druschel and A. Rowstron. PAST: A large-scale, persistent peer-to-peer storage utility. In 8th Workshop on Hot Topics in Operating Systems, Elmau, Germany, May 2001.
9. A. Adya, W.J. Bolosky, M. Castro, G. Cermak, R. Chaiken, J.R. Douceur, J. Howell, J.R. Lorch, M. Theimer, and R.P. Wattenhofer. FARSITE: Federated, available, and reliable storage for an incompletely trusted environment. In Proc. 5th USENTX Symposium on Operating Systems Design and Implementation, Boston, MA, USA, pages 1-14, December 2002.
10. M. Rogers and S. Bhatti. Cooperation in decentralised networks. In London Communications Symposium, London, UK, September 2005.
11. J.R. Douceur. The Sybil attack. In P. Druschel, F. Kaashoek, and A. Rowstron, editors, Proc. 1st International Workshop on Peer-to-Peer Systems (IPTPS '02), Cambridge, MA, USA, March 2002, volume 2429 of Lecture Notes in Computer Science, pages 251-260. Springer, 2002.
12. J.H. Saltzer, D.P. Reed, and D.D. Clark. End-to-end arguments in system design. ACM Transactions on Computer Systems, 2(4):277-288, November 1984.
13. X. Wang, D. Feng, X. Lai, and H. Yu. Collisions for hash functions MD4, MD5, HAVAL-128 and RIPEMD, 2004. Cryptology ePrint 2004/199, available from http://eprint.iacr.org/2004/199.pdf.
14. X. Wang, Y.L. Yin, and H. Yu. Finding collisions in the full SHA-1. In 25th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 2005.
15. C. Grothoff. An excess-based economic model for resource allocation in peer-to-peer networks. Wirtschaftsinformatik, 45(3):285-292, June 2003.
16. B. Cohen. Incentives build robustness in BitTorrent. In Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA, June 2003.
17. Y. Kulbak and D. Bickson. The eMule protocol specification. Technical report, School of Computer Science and Engineering, Hebrew University of Jerusalem, January 2005.
18. P. Gauthier, B. Bershad, and S.D. Gribble. Dealing with cheaters in anonymous peer-to-peer networks. Technical Report 04-01-03, University of Washington, January 2004.
19. D. Goldschlag, M. Reed, and P. Syverson. Onion routing for anonymous and private internet connections. Communications of the ACM, 42(2):39-41, February 1999.
20. The IETF Reliable Multicast Transport (RMT) Working Group. http://www.ietf.org/html.charters/rmt - charter.html
21. K. Birman, M. Hayden, O. Ozkasap, Z. Xiao, M. Budiu, and Y. Minsky. Bimodal multicast. ACM Transactions on Computer Systems, 17(2):41-88, May 1999.
22. K. Ostrowski, K. Birman, and A. Phanishayee. Quick-Silver scalable multicast. Technical Report TR2006-2063, Cornell University, April 2006.
23. S. Rafaeli and D. Hutchison. A survey of key management for secure group communication. ACM Computing Surveys, 35(3):309-329, September 2003.
24. R. Merkle. Protocols for public key cryptosystems. In IEEE Symposium on Security and Privacy, Oakland, CA, USA, April 1980.
25. Q. Sun and H. Garcia-Molina. SLIC: A selfish link-based incentive mechanism for unstructured peer-to-peer networks. In 24th International Conference on Distributed Computing Systems, 2004.
26. Y. Fu, J. Chase, B. Chun, S. Schwab, and A. Vahdat. SHARP: An architecture for secure resource peering. In 19th ACM Symposium on Operating Systems Principles, Bolton Landing, NY, USA, October 2003.
27. S. Kent and R. Atkinson. RFC 2401: Security architecture for the internet protocol, November 1998.
28. T. Dierks and C. Allen. RFC 2246: The TLS protocol, January 1999.
29. B. Awerbuch, D. Holmer, C. Nita-Rotaru, and H. Rubens. An on-demand secure routing protocol resilient to Byzantine failures. In Proc. ACM Workshop on Wireless Security (WiSe'02), Atlanta, GA, USA, pages 21-30, September 2002.
30. I. Avramopoulos, H. Kobayashi, R. Wang, and A. Krishnamurthy. Highly secure and efficient routing. In IEEE Infocom, Hong Kong, March 2004.
31. R. Gennaro and P. Rohatgi. How to sign digital streams. In B.S.J. Kaliski, editor, Proc. 17th Annual Cryptology Conference (CRYPTO '97), Santa Barbara, CA, USA, August 1997, volume 1294 of Lecture Notes in Computer Science, pages 180-197. Springer, 1997.
32. L. Lamport. Constructing digital signatures from a one-way function. Technical Report CSL-98, SRI International, Palo Alto, CA, USA, 1979.
33. R. Merkle. A digital signature based on a conventional encryption function. In C. Pomerance, editor, Proc. Conference on the Theory and Applications of Cryptographic Techniques (CRYPTO '87), Santa Barbara, CA, USA, August 1987, volume 293 of Lecture Notes in Computer Science. Springer, 1988.
34. R.J. Anderson, F. Bergadano, B. Crispo, J.H. Lee, C. Manifavas, and R.M. Needham. A new family of authentication protocols. Operating Systems Review, 32(4):9-20, October 1998.
35. R. Häuser, T. Przygienda, and G. Tsudik. Reducing the cost of security in link-state routing. In ISOC Symposium on Network and Distributed System Security, San Diego, CA, USA, February 1997.
36. S. Cheung. An efficient message authentication scheme for link state routing. In Proc. 13th Annual Computer Security Applications Conference (ACSAC '97), San Diego, CA, USA, pages 90-98, December 1997.
37. M.G. Zapata and N. Asokan. Securing ad hoc routing protocols. In Proc. ACM Workshop on Wireless Security (WiSe'02), Atlanta, GA, USA, pages 1-10, September 2002.
38. Y.C. Hu, D.B. Johnson, and A. Perrig. SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. In 4th IEEE Workshop on Mobile Computing Systems and Applications (WMCSA '02), June 2002.
39. A. Perrig, R. Canneti, J.D. Tygar, and D. Song. The TESLA broadcast authentication protocol. CryptoBytes, 5(2):2-13, 2002.
40. Y.C. Hu, A. Perrig, and D.B. Johnson. Ariadne: A secure on-demand routing protocol for ad hoc networks. In 8th International Conference on Mobile Computing and Networking (MobiCom), September 2002.