<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 3.2//EN">
<HTML>
<HEAD>
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=iso-8859-1">
<META NAME="Generator" CONTENT="MS Exchange Server version 5.5.2655.35">
<TITLE>Fighting Spam may be easier than you think</TITLE>
</HEAD>
<BODY>
<P><FONT SIZE=2>o email eh longo mais achei que o material vai interessar...A plaestra ja passou mas en consegui o material.</FONT>
</P>
<P><FONT SIZE=2>abracos,</FONT>
</P>
<P><FONT SIZE=2>Reinaldo</FONT>
</P>
<BR>
<P><FONT SIZE=2>============</FONT>
</P>
<P><FONT SIZE=2>For those of you who are in the Boston area, the following</FONT>
<BR><FONT SIZE=2>presentation might be of interest, given recent discussions about</FONT>
<BR><FONT SIZE=2>methods of compating SPAM. It is hosted by the MIT Laboratory for</FONT>
<BR><FONT SIZE=2>Computer Science's Applied Security Reading Group.</FONT>
</P>
<P> <FONT SIZE=2>- Ted</FONT>
</P>
<BR>
<P><FONT SIZE=2>ASRG TALK - in NE43-941 at 400 p.m. this THURS</FONT>
</P>
<P><FONT SIZE=2>Open to the Public</FONT>
</P>
<P><FONT SIZE=2>Date: THURSDAY, DEC 12th</FONT>
<BR><FONT SIZE=2>Time: 4:00 p.m. - 5:00 p.m.</FONT>
<BR><FONT SIZE=2>Place: NE43-941, 200 Tech Square</FONT>
<BR><FONT SIZE=2>Speaker: Cynthia Dwork, Microsoft Research, Silicon Valley Campus</FONT>
<BR><FONT SIZE=2>Title: Fighting Spam May Be Easier Than You Think</FONT>
</P>
<P><FONT SIZE=2>Abstract:</FONT>
</P>
<P><FONT SIZE=2>In CRYPTO'92 Dwork and Naor proposed the following simple technique</FONT>
<BR><FONT SIZE=2>for combating spam:</FONT>
</P>
<P><FONT SIZE=2> If I don't know you, and you want your e-mail to appear in my</FONT>
<BR><FONT SIZE=2> inbox, then you must attach to your message an easily verified</FONT>
<BR><FONT SIZE=2> "proof of computational effort", just for me and just for this</FONT>
<BR><FONT SIZE=2> message.</FONT>
</P>
<P><FONT SIZE=2>If the proof of effort requires, say, 10 seconds to compute, then the</FONT>
<BR><FONT SIZE=2>economics of sending spam are radically altered, as a single machine</FONT>
<BR><FONT SIZE=2>can send only 8,000 messages per day.</FONT>
</P>
<P><FONT SIZE=2>The recent proliferation of spam has lead to a renewed interest in</FONT>
<BR><FONT SIZE=2>these ideas. This talk surveys recent work on both the choice of</FONT>
<BR><FONT SIZE=2>functions that can be used to yield easily verifiable proofs of</FONT>
<BR><FONT SIZE=2>computational effort, and architectures for implementing the proof of</FONT>
<BR><FONT SIZE=2>effort approach. Filtering and/or forcing senders to pay in other</FONT>
<BR><FONT SIZE=2>currencies, such as human attention and money, will be covered as time</FONT>
<BR><FONT SIZE=2>permits.</FONT>
</P>
<P><FONT FACE="Arial" SIZE=2 COLOR="#000000"></FONT><FONT FACE="Arial" SIZE=2 COLOR="#000000"></FONT><FONT FACE="Arial" SIZE=2 COLOR="#000000"></FONT>
</BODY>
</HTML>