Advertisement

Safe and Private Data Sharing with Turtle: Friends Team-Up and Beat the System

  • Bogdan C. Popescu
  • Bruno Crispo
  • Andrew S. Tanenbaum
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3957)

Abstract

In this paper we describe Turtle, a peer-to-peer architecture for safe sharing of sensitive data. The truly revolutionary aspect of Turtle rests in its novel way of dealing with trust issues: while existing peer-to-peer architectures with similar aims attempt to build trust relationships on top of the basic, trust-agnostic, peer-to-peer overlay, Turtle takes the opposite approach, and builds its overlay on top of pre-existent trust relationships among its users. This allows both data sender and receiver anonymity, while also protecting each and every intermediate relay in the data query path. Furthermore, its unique trust model allows Turtle to withstand most of the denial of service attacks that plague other peer-to-peer data sharing networks.

Keywords

Data Item Relay Node Trust Relationship Response Packet Query Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Friendster Web Site, http://www.friendster.com
  2. 2.
    Castro, M., Druschel, P., Ganesh, A., Rowstron, A., Wallach, D.: Secure Routing for Structured Peer-to-Peer Overlay Networks. In: Proc. OSDI 2002 (December 2002)Google Scholar
  3. 3.
    Chaum, D.: Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms. Comm. of the ACM 24(2) (1981)Google Scholar
  4. 4.
    Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 46–66. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  5. 5.
    Dewar, J.A.: The Information Age and the Printing Press: Looking Backward to See Ahead, http://www.rand.org/publications/P/P8014/P8014.pdf
  6. 6.
    Douceur, J.: The Sybil Attack. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 251. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  7. 7.
    Freedman, M.J., Morris, R.: Tarzan: A peer-to-peer anonymizing network layer. In: Proc. of the 9th ACM Conf. on Computer and Communications Security (November 2002)Google Scholar
  8. 8.
    Hazel, S., Wiley, B.: Achord: A Variant of the Chord Lookup Service for Use in Censorship Resistant Peer-to-Peer Publishing Systems. In: Proc. of the IPTPS 2002 Workshop (March 2002)Google Scholar
  9. 9.
    Rubin, A.D., Waldman, M., Cranor, L.F.: Publius: A robust, tamper-evident, censorship-resistant, web publishing system. In: Proc. 9th USENIX Security Symposium, pp. 59–72 (August 2000)Google Scholar
  10. 10.
    Dingledine, R., Freedman, M.J., Molnar, D.: The Free Haven Project: Distributed Anonymous Storage Service. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 67–95. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Reed, M.G., Syverson, P.F., Goldschlag, D.M.: Anonymous connections and onion routing. IEEE J. on Selected Areas in Communications 16(4) (1998)Google Scholar
  12. 12.
    Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security 1(1), 66–92 (1998)CrossRefGoogle Scholar
  13. 13.
    Serjantov, A.: Anonymizing Censorship Resistant Systems. In: Druschel, P., Kaashoek, M.F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, p. 111. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  14. 14.
    Waldman, M., Mazieres, D.: Tangler: a censorship-resistant publishing system based on document entanglements. In: Proc. 8th ACM Conf. on Computer and Communications Security, pp. 126–135 (2001)Google Scholar
  15. 15.
    Watts, D.J.: Small Worlds, The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Bogdan C. Popescu
    • 1
  • Bruno Crispo
    • 1
  • Andrew S. Tanenbaum
    • 1
  1. 1.Department of Computer ScienceVrije UniversiteitAmsterdamThe Netherlands

Personalised recommendations