 |
 |
|
|
|
|
ITCSC
Visiting Lecture
-
Dr.
Radia Perlman
-
Sun
Fellow, Sun Microsystems, Inc.
|
|
Title
: |
Data: Making it be there when you want it and
go away when you want it gone |
|
Date: |
April
1, 2008 (Tuesday) |
|
Time: |
11:00a.m
- 12:00noon |
|
Venue: |
Rm.1009,
William M.W.Mong Engineering Bldg., CUHK |
|
Abstract:
|
In
order not to lose data, copies should be kept
in lots of locations. That makes it difficult
to really delete the data, since the backup
copies can be stolen or copied. The obvious
solution is to encrypt the data, and then discard
the keys of data that is to be destroyed. However,
reliably keeping, then reliably destroying all
copies of deleted keys has the same problem.
This talk describes a system that supports three
types of assured delete; expiration time known
at file creation, on-demand deletion of individual
files, and custom keys for classes of data.
It is easy and inexpensive to manage and involves
only trivial performance overhead over a traditional
encrypted file system.
|
|
|
Title
: |
Routing in large networks despite Byzantine
failures |
|
Date: |
April
3, 2008 (Thursday) |
|
Time: |
11:00a.m
- 12:00noon |
|
Venue: |
Rm.1009,
William M.W.Mong Engineering Bldg., CUHK |
| Abstract:
|
Routing
resilient to Byzantine failures goes beyond
securing the routing protocol itself. It is
also essential to assure that packets get delivered.
Perlman's thesis (NPBR) showed how to do this
in a network small enough so that every router
could keep track of all flows, and that paths
are sufficiently short that a source can choose
a nonfaulty path We show how to provide the
same guarantees in a large hierarchical network.
This is done in a way that no node needs state
more than would be necessary to support its
portion of the hierarchy and the source only
needs to make a small number of choices to find
a path. This work not only works as a solution
for routing in the presence of Byzantine failures
of routers, but also works to assure no flow
gets starved even in the presence of DDOS attacks.
|
| |
|
|
Biography
of Dr. Radia Perlman:
Dr.
Radia Perlman is a Sun Fellow at Sun Microsystems,
working on network and security protocols. She
invented many of the basic algorithms that make
today's network infrastructure robust and scalable.
Her current research interests include assured
delete, making large networks robust against
Byzantine failures, and replacing bridges/switch
with technology which is upwardly compatible,
but more robust, flexible, and scalable. She
is author of "Interconnections: Bridges, Routers,
Switches, and Internetworking Protocols", and
coauthor of "Network Security: Private Communication
in a Public World", which are widely used both
as textbooks in universities and for engineers
to learn the field. She holds over 90 patents,
a PhD in computer science from MIT, and an honorary
doctorate from KTH, the Royal Institute of Technology,
Sweden. She recently was given a lifetime achievement
award by Usenix, and named SVIPLA (Silicon Valley
Intellectual Property Law Association) Inventor
of the year.
|
|
|
|
|