Return-Path: william@bourbon.usc.edu
Delivery-Date: Wed May  2 14:58:56 2007
X-Spam-Checker-Version: SpamAssassin 3.1.3 (2006-06-01) on merlot.usc.edu
X-Spam-Level: 
X-Spam-Status: No, score=-3.3 required=5.0 tests=ALL_TRUSTED,AWL,BAYES_00,
	NO_REAL_NAME autolearn=ham version=3.1.3
Received: from bourbon.usc.edu (bourbon.usc.edu [128.125.9.75])
	by merlot.usc.edu (8.13.5/8.13.5) with ESMTP id l42Lwp91006443;
	Wed, 2 May 2007 14:58:51 -0700
Received: from bourbon.usc.edu (localhost.localdomain [127.0.0.1])
	by bourbon.usc.edu (8.13.5/8.13.5) with ESMTP id l42LvxMn027944;
	Wed, 2 May 2007 14:57:59 -0700
Message-Id: <200705022157.l42LvxMn027944@bourbon.usc.edu>
To: cs558l@merlot.usc.edu, cs551@merlot.usc.edu, cs530@merlot.usc.edu
Subject: FWD: "Securing Peer-to-peer Systems" - CS Colloquium Talk - 3:30pm May 3
Date: Wed, 02 May 2007 14:57:59 -0700
From: william@bourbon.usc.edu

Hi,

Just forwarding information about a CS Colloquium talk with a
topic that may be of interest to some of you.
--
Bill Cheng // bill.cheng@usc.edu <URL:http://merlot.usc.edu/william/usc/>



  -------- Original Message --------
  Subject: [colloq_org_stu] USC CS Colloquium Talk Reminder: May3
  Date: Wed, 02 May 2007 14:00:02 -0700
  From: Sumit Rangwala <srangwal@enl.usc.edu>
  To: CS Colloquia Student Organizers <colloq_org_stu@enl.usc.edu>
  
  Securing Peer-to-peer Systems
  
  Prof. Yongdae Kim
  University of Minnesota
  
  May 3, 2007
  3:30 - 4:50 pm
  SSL 150
  
  Host: Prof. Ramesh Govindan
  
  Abstract:
  The emergence of peer-to-peer (P2P) systems and applications signifies
  a revolutionary paradigm shift in building large-scale distributed
  systems over the Internet. This talk focuses on cooperative
  peer-to-peer systems, in which peer nodes are more close-knit, forming
  a "community of common interest" with shared goals and mutual
  benefits. Since the value and utility of a cooperative P2P system lie
  in the service it offers to its users, ensuring its correct and
  efficient operation despite the existence of potentially untrustworthy
  nodes is of utmost importance. Several infrastructure-level,
  currently-deployed cooperative P2P systems are vulnerable to various
  attacks by participating nodes that can impede the service provided by
  the system. Other systems are vulnerable to misuse or abuse of the
  services by a few peers.
  
  To prevent these attacks, we have developed two core mechanisms that
  can be used to build trustworthy, accountable and secure cooperative
  P2P systems. In the first part of the talk, I present a secure overlay
  routing mechanism, called Myrmic, that guarantees efficient and robust
  delivery of message even when significant fraction (say 30%) of nodes
  are compromised. Our experimental and simulation results confirm
  efficiency and robustness of Myrmic. The second part of the talk
  introduces how to "emulate" central entity on P2P systems, which is
  robust against collaboration attacks. Such central entity can be used
  for enforcing security policy as in traditional client-server systems.
  We also show how to enforce quota (or guarantee fairness) in a P2P
  file archiving system using this emulated central entities.
  
  Bio:
  Prof. Yongdae Kim has been working on various projects in data
  and communication security. During his PhD study, he designed group
  key agreement protocols, TGDH and STR protocol, which are integrated
  with Secure Spread. He received NSF career award on storage security
  and McKnight Land-Grant Professorship Award from University of
  Minnesota in 2005. His research interests include security issues for
  distributed systems such as P2P systems, storage systems, sensor and
  ad hoc networks.
  
  
  -------------------------------------------------------------------
  Schedule for upcoming seminar available at http://enl.usc.edu/colloq
  _______________________________________________
  colloq_org_stu mailing list
  colloq_org_stu@enl.usc.edu
  http://enl.usc.edu/mailman/listinfo/colloq_org_stu