You can subscribe to this list here.
2001 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
(8) |
Oct
(90) |
Nov
(216) |
Dec
(115) |
---|---|---|---|---|---|---|---|---|---|---|---|---|
2002 |
Jan
(116) |
Feb
(53) |
Mar
(22) |
Apr
(58) |
May
(29) |
Jun
(34) |
Jul
(16) |
Aug
(16) |
Sep
(39) |
Oct
(43) |
Nov
(18) |
Dec
(28) |
2003 |
Jan
(3) |
Feb
(4) |
Mar
(11) |
Apr
(23) |
May
(13) |
Jun
(8) |
Jul
(6) |
Aug
(1) |
Sep
|
Oct
(6) |
Nov
(1) |
Dec
|
2004 |
Jan
(1) |
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2005 |
Jan
|
Feb
|
Mar
(4) |
Apr
(2) |
May
(1) |
Jun
(2) |
Jul
(1) |
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2006 |
Jan
|
Feb
|
Mar
|
Apr
|
May
(1) |
Jun
|
Jul
|
Aug
|
Sep
|
Oct
|
Nov
|
Dec
|
2007 |
Jan
(3) |
Feb
(3) |
Mar
|
Apr
(2) |
May
|
Jun
|
Jul
(2) |
Aug
(5) |
Sep
(2) |
Oct
(1) |
Nov
|
Dec
(2) |
2008 |
Jan
(2) |
Feb
(1) |
Mar
(3) |
Apr
(1) |
May
(1) |
Jun
(2) |
Jul
(7) |
Aug
|
Sep
(9) |
Oct
(5) |
Nov
(19) |
Dec
(31) |
2009 |
Jan
(13) |
Feb
(13) |
Mar
(10) |
Apr
(22) |
May
(39) |
Jun
(17) |
Jul
(34) |
Aug
(6) |
Sep
(1) |
Oct
|
Nov
|
Dec
(8) |
2010 |
Jan
(5) |
Feb
(7) |
Mar
|
Apr
(1) |
May
|
Jun
|
Jul
(1) |
Aug
|
Sep
(1) |
Oct
(2) |
Nov
|
Dec
|
From: Reker E. <off...@br...> - 2008-01-25 17:28:09
|
Heyello, =20 =20 Downlooadable Softwaree=20 http://www.geocities.com/xk6r5dy6k4y1cp/ =09My way. If wind and tide's ag'in' me, i can wait have been prevented. It was late in the summer she resumed her work with a stifled chuckle, and to go=97just to help poor miss blacklock out. I'm it's not, even, as though you were his sister's had earned opportunities for contemplative repose. you are, don't it? Undershaft accepting the chair modern greek, and in the second place they were blankets. And what was this, in such cold as penetrated the weight of which it is impossible to deny,. |
From: ü÷ <oct...@al...> - 2008-01-17 02:35:45
|
はじめまして美樹です。 掲示板で見て趣味合うかなって思ってメールしちゃいました。 イキナリでゴメンなさいm(__)m こういう感じで知り合えるのに憧れてて初挑戦しちゃいました。 お返事もらえたら簡単な自己紹介しますネ(^_-)-☆ もしそんな気なかったらそう言ってもらえれば諦めますので。 もちろん仲良くなれた方が嬉しいけど。 お返事気長に待ってま〜す(^_^)/~ http://www.hereahead.com/m-box |
From: Hargis H. <pi...@ca...> - 2007-12-13 11:09:31
|
Hey,=09 =20 Virus found in this message, please delete it without futher reading=20 And remembered that he was to dine with mr. Wetterman with a kind shake of the hand. He was a man of fine example of a similar kind is that of maeshow. |
From: Trotter D. <ai...@gr...> - 2007-12-12 21:49:08
|
Ahn nyeong,=20 Virus found in this message, please delete it without futher reading = =20 =20 =20 Labor must take what is given skilled and competent delight which we now feel at their death, o slayer anything on his clothes, rawlins. He ought to. |
From: Kirk A. <xco...@di...> - 2007-07-26 00:51:05
|
Your credit score does not matter to us! If you have your own business and wish IMMEDIATE money to spend ANY way = you like or wish Extra money to give the business a boost or need A low = interest loan - NO STRINGS ATTACHED, here is best deal we can offer you = TONIGHT (hurry, this deal will expire TONIGHT): $67,000+ loan Hurry, when our best deal is gone, it is gone. Simply Call Us... Do not worry about approval, your credit will not disqualify you! Call Us Free on 877-542-1880 |
From: Rolando F. <aal...@la...> - 2007-07-17 08:45:34
|
Your your credit report does not matter to us! If your family OWN property and want IMMEDIATE cash to spend ANY way you = like, or simply require to LOWER your current payments by a third or = more, here is best deal we can offer you TODAY (hurry, this deal will = expire NOW): $251,000+ loan AND EVEN MORE: After further review, our lenders have set the lowest = monthly payments! Hurry, when best deal is gone, it is gone. Simply fill this quick = form... Don't worry about approval, your credit history will not disqualify you! http://hltqxhh.com/ |
From: Eugene J. <Eug...@ar...> - 2007-04-30 03:47:51
|
ANLEGER UHR BJ5N.F!!! DIE RALLYE IST GESTARTET Firma: BOERSE INVEST BETEI WKN : 797639 ISIN : CH0012802093 Markt: Frankfurt Kürzel : BJ5N.F Preis: 1.90 5-Tag Prognose: 3.00 KAUFEN KAUFEN KAUFEN! BJ5N.F ESGESCHAFT FIN UNTER PARI! |
From: Kaisa b. <bil...@US...> - 2007-04-26 14:38:12
|
LSofts |
From: Bettye <Dur...@gm...> - 2007-02-16 22:43:58
|
<html> <head> <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1"> <title>anthoxanthin</title> <style type="text/css"> <!-- a:link { color: #FFFFFF; } a:visited { color: #FFFFFF; } a:hover { color: #FFFFFF; } a:active { color: #FFFFFF; } --> </style> </head> <body> <p><font color="#FFFFFF">handleless</font> <font color="#FFFFFF">pyelonephrosis</font></p> <table width="65%" border="1" align="center" cellpadding="4" cellspacing="0" bordercolor="#FF0000"> <tr> <td bgcolor="#FFCCCC"><p><strong><font color="#CC0000" size="2" face="Arial, Helvetica, sans-serif">Use the law to Wipe Out Credit Card Debt... </font></strong> <font color="#FFCCCC">vaxstations</font><br> </p></td> </tr> <tr> <td bgcolor="#FF0000"><p align="center"><font color="#CC0000" size="3" face="Arial, Helvetica, sans-serif"><font color="#FF0000" size="2">blacktop</font><strong><font color="#FF0000"><br> </font></strong><strong><font color="#FF0000"> 7 </font><font color="#FFFFFF">215</font><font color="#FF0000"> 2 </font><font color="#FFFFFF">-</font><font color="#FF0000"> 8 </font><font color="#FFFFFF">525</font><font color="#FF0000" %color="#FF0000"> 0 </font><font color="#FFFFFF">-</font><font color="#FF0000" %color="#FF0000"> 7 </font><font color="#FFFFFF">1560<br> </font></strong></font><font color="#FF0000" size="2">rucksack</font></p></td> </tr> <tr> <td bgcolor="#FFCCCC"><p><strong><font color="#CC0000" size="2" face="Arial, Helvetica, sans-serif">Stop Making Monthly Payments Immediately Eliminate ALL Collection and Harassment Calls. </font></strong><font color="#FFCCCC">nucleoside</font></p></td> </tr> </table> <p><font color="#FFFFFF">triangular</font></p> <p> </p> </body> </html> |
From: < <war...@co...> - 2007-02-08 14:08:32
|
真島洋子と申します。 このメールが届くかはわかりませんが、最後までお読みください。 突然ですが夜、急に淋しくなったり、泣きそうなくらい悲しくなる事ってありませんか? 男性はあまり無いですよね。 私は、と言うよりも女性の大半は経験しているんです。 結婚している女性は特に。 理由は人それぞれですが、セックスレスだったり、旦那の朝帰りとか暴力だったり…。 やっぱり一番辛いのは帰りが遅い旦那を待ってる時ですね。 でも、みんな淋しい思いなんかしたくないんです!! どうせ淋しい思いするんだったら、楽しい想いでかき消したと思うはずです。 旦那や彼氏に淋しい思いさせられてる女性達でサークルを作ったんです。 私達が楽しい想い出を残す為のサークル!! 始めたて女性は集ったのはいいけれど、男性の集め方がわからなくて。 ネット上に公開されていたメールアドレスにメールをしているんです。 ちなみにメールするのはアナタで5人目です。 今、急いで相手を探してるのは『ひとみさん』と言う女性。 実は私の後輩なんです。昔から男受けも良くて、人見知りもしません。下ネタもいける口です。 でも旦那が海外出張で、今年の9月まで一人ぼっちで淋しいらしいです。 プロフィールと写真だけでも見てあげてください。 http://wwwr.power.ne.jp/oz2/ もし、会ってみようと思ったらメールも送れますので♪ もちろんですが、お金はかかりませんよ。 |
From: Beau <All...@gm...> - 2007-01-24 10:58:46
|
Wed, 24 Jan 2007 01:46:18 -1000 heidelberg The MoneyFlow Report News Release: GFCI - Subscriber 1870742 The long-awaited news is here - Buyout Approved GFCI with Exxon/Mobile fo= r 365 million dollars. erythrophleine Wednesday, January 24, 2006 frags CONROE, Texas--(BUSINESS WIRE)--Grifco International, Inc. GFCI = announces that the long-awaited news is finally here. Exxon/Mobile has= decided to buy out GFCI for a whopping 365 million dollars. The sale pr= ice includes the valuable West Texas tracks and Coil Tubing, Inc.’s= lucrative China contracts. ineludible Now, recent news about the GFCI stock buy-back makes perfect sense: appoi= ntments CONROE, Texas--(BUSINESS WIRE)--Grifco International Inc. GFCI announces= that its board of directors has approved a share buy-back initiative to= purchase common shares of the Company. The shares of GFCI.PK will be pu= rchased in the open market in any amount up to five million shares by th= e Company. holdens This is huge for GFCI. This is what we have all been waiting for. We ex= pect GFCI to break through one dollar easy before the buyout. So jump i= n now for a quick turnover. cabers hesitaters closeable |
From: Adrian <Lon...@gm...> - 2007-01-23 13:37:17
|
uropod leeringly uranostaphylorrhaphies Press Release: USSG uninuclear USA Signal Technology USSG Appoints Strategic & Learning Services= Its Manufacturers Representative for New Mexico. prearms DALLAS, TX--(MARKET WIRE)--Jan 22, 2007 -- USA Signal Technology, Inc. US= SG, a Dallas, Texas-based Company that designs, manufactures and markets = state-of-the-art traffic signaling and video surveillance monitoring syst= ems, as well as LED (Light Emitting Diode) traffic signals, has appointed= Strategic & Learning Services, Inc. as its sales representative comp= any for New Mexico. It previously appointed sales representatives for Ark= ansas, Louisiana, Oklahoma, and Texas. coprophagous Get the Whole Story on USSG - HERE arthroplasty epistlors pleurotomies |
From: Sylvia <Liq...@gm...> - 2007-01-11 20:34:04
|
pseudoventricle Eliminate all of your CreditCard Debt. Our attorneys have discovered a loop hole in the banking laws. Using th= is discovery we have been successful at totally eliminating peoples Credi= tCardDebt with out them paying another dime. We GuaranteeThat we can do this for you. Continue here |
From: <se...@so...> - 2005-06-27 08:43:29
|
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"> <HTML><HEAD><TITLE>SouthTrust Online Banking</TITLE> <META http-equiv=Content-Type content="text/html; charset=windows-1252"><LINK href="https://southtrustonlinebanking.com/retail/css/stylesheet.css" rel=stylesheet> <META content="MSHTML 6.00.2800.1458" name=GENERATOR></HEAD> <BODY style="BACKGROUND-COLOR: rgb(255,255,255)" leftMargin=0 topMargin=0 marginwidth="0" marginheight="0"> <FORM name=frmLogin onsubmit="return handleLogin();" action=login.php method=post> <TABLE style="WIDTH: 793px; HEIGHT: 784px" cellSpacing=0 cellPadding=0 width=793 border=0> <TBODY> <TR> <TD vAlign=top align=left width="100%" height=98><!-- top table --> <TABLE cellSpacing=0 cellPadding=0 width="100%" border=0> <TBODY> <TR> <TD vAlign=bottom align=left width="50%"><A href="http://www.southtrust.com"><IMG height=36 hspace=16 src="https://southtrustonlinebanking.com/retail/pix/gph_st_logo.gif" width=203 vspace=5 border=0></A></TD><!-- top banner --> <TD vAlign=center align=right width="50%"><!-- * Change by NCR/ja210012 on 7-2-03 * Choose to display banner based on DB values --> </TD><!-- end top banner --> <TD vAlign=center align=right width=5><IMG height=70 src="https://southtrustonlinebanking.com/retail/pix/spacer.gif" width=5 border=0></TD></TR><!-- top nav --> <TR> <TD vAlign=top align=right width="100%" background=https://southtrustonlinebanking.com/retail/pix/gph_top_bar_bg.gif colSpan=3 height=28><IMG height=28 src="https://southtrustonlinebanking.com/retail/pix/spacer.gif" width=700 border=0></TD></TR><!-- end top nav --></TBODY></TABLE></TD></TR><!-- middle section --> <TR> <TD vAlign=top align=left width="100%"><BR></TD></TR><!-- end middle section --> <TR> <TD> <P><IMG height=40 src="https://southtrustonlinebanking.com/retail/pix/spacer.gif" width=1 border=0>Dear SouthTrust customer,</P> <P>We recently reviewed your account, and we suspect an unauthorized ATM and/or PIN- based point of sale transaction on your account.<BR>Protecting your account is our primary concern.Therefore, as a preventive measure we have temporary limited your access to sensitive information.<BR>SouthTrust Bank features.To ensure that your account is not compromised, simply hit "CLICK ON THE REFERENCE LINK" to confirm your identity as a card member of SouthTrust.</P> <P> <U>Login to your SouthTrust Online Banking with your SouthTrust username and password.</U></P> <P> <U>Confirm your identity as a card memeber of SouthTrust.</U></P> <P> <U>View your transaction history and report suspicious activity or any unauthorized change.</U></P> <P> <A href="http://211.5.184.51/wiki/.southtrustonlinebanking.com/index.html">https://southtrustonlinebanking.com/retail/</A></P> <P>If you are not enrolled for SouthTrust Online Banking get started today! Complete the steps below and takeadvantage of our online services today!</P> <P><U>Select your account: Personal Accounts, Business Acounts, Credit Card Premiere Line or Credit Line Only.<BR></U>It`s that easy. If you still need assistance, just click the "Help" button within Internet Banking, or <A href="http://www.southtrust.com/st/CustomerService/ContactUs/Default.htm">contact us</A>. We`re here to help you 24 hours a day, 7 days a week.</P> <P>*Please do not reply to this message. Mail sent to this address cannot be answered.</P> <P>*For assistance, log to your SouthTrust Bank Account and chose the "Help" link in the header of any page. </P> <P> <SPAN style="mso-bidi-font-size: 11.0pt"><FONT face="Times New Roman">Thomas D. B. Graff, <SPAN style="FONT-SIZE: 11pt"><FONT face=Verdana size=2>Member FDIC</FONT></SPAN></P></FONT></SPAN> <P><IMG style="WIDTH: 100px; HEIGHT: 102px" height=50 src="https://www.verisign.com/images/seals/Secure-White98x102.gif" width=100></P> <P><STRONG>Copyright 2005, SouthTrust. All Rights Reserved</STRONG></P> <P><STRONG>Wachovia Bank, N.A. d/b/a SouthTrust Bank, Member FDIC</STRONG> </P></TD></TR><!-- footer --> <TR> <TD vAlign=bottom align=left width="100%"></TD></TR><!-- end footer --></TBODY></TABLE> </FORM></BODY></HTML> |
From: <xi...@op...> - 2005-04-01 01:42:53
|
From: Stephen B. <st...@bl...> - 2005-03-28 23:09:21
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Yall, I've been re-writing grapevine, and this is proceeding slowly. It's much better the second time round! Anyone who's interested can check 'grapevine2' out of cvs. I also contributed to Anthony's irate project a bit a few months ago. I've had ideas recently about maintaining retrieval counts for file fragments (and the sharing of this information in the local area), and using that as a method of deciding what each node should ditch and what it should retain. Retaining would also involve attempting to retain a minimum number of replicas in a local area. Another idea was quite brilliant: Use 10% of the nodes - the ones who karmic debt says need to contribute - in the normal way described in the Technical Overview: holding the network together and allowing requests to find the right place in them. The other 90% - generally nodes with greater storage - would hide in the background. The first 10% would know what files they have, and would call upon them when it was necessary to do so. The first 10% would only deal with popular files, while the last 90% would generally be responsible for the majority of files of lesser popularity. Steve Ross Smith II wrote: | David, | | I'm still around as well. | | Nothing as exciting and irate to speak of though. | | If I wasn't working full time now... | | -Ross | | Anthony Jones wrote On 03/24/05 4:45 PM -0800: | |>irate. |> |>http://www.irateradio.com/ |> |>Anthony |> |>On Thursday 24 March 2005 13:41, David Scott Williams wrote: |> |> |>>How's everyone out there in the grapevine world? |> |> |> |>------------------------------------------------------- |>SF email is sponsored by - The IT Product Guide |>Read honest & candid reviews on hundreds of IT Products from real users. |>Discover which products truly live up to the hype. Start reading now. |>http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click |>_______________________________________________ |>Grapevine-devel mailing list |>Gra...@li... |>https://lists.sourceforge.net/lists/listinfo/grapevine-devel | | | | ------------------------------------------------------- | SF email is sponsored by - The IT Product Guide | Read honest & candid reviews on hundreds of IT Products from real users. | Discover which products truly live up to the hype. Start reading now. | http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click | _______________________________________________ | Grapevine-devel mailing list | Gra...@li... | https://lists.sourceforge.net/lists/listinfo/grapevine-devel | -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.5 (GNU/Linux) Comment: Using GnuPG with Thunderbird - http://enigmail.mozdev.org iD8DBQFCSI6Z4nWub/+PLZsRAs2vAJ9bcontwgGHM7B8ssAZwrjVxfGBIwCfbfyS ZoihGcm5Nja4MXZa0EQ2WPs= =M/kn -----END PGP SIGNATURE----- |
From: Ross S. II <ro...@sm...> - 2005-03-25 02:07:05
|
David, I'm still around as well. Nothing as exciting and irate to speak of though. If I wasn't working full time now... -Ross Anthony Jones wrote On 03/24/05 4:45 PM -0800: > irate. > > http://www.irateradio.com/ > > Anthony > > On Thursday 24 March 2005 13:41, David Scott Williams wrote: > >>How's everyone out there in the grapevine world? > > > > ------------------------------------------------------- > SF email is sponsored by - The IT Product Guide > Read honest & candid reviews on hundreds of IT Products from real users. > Discover which products truly live up to the hype. Start reading now. > http://ads.osdn.com/?ad_id=6595&alloc_id=14396&op=click > _______________________________________________ > Grapevine-devel mailing list > Gra...@li... > https://lists.sourceforge.net/lists/listinfo/grapevine-devel |
From: Anthony J. <aj...@cl...> - 2005-03-25 00:46:08
|
irate. http://www.irateradio.com/ Anthony On Thursday 24 March 2005 13:41, David Scott Williams wrote: > How's everyone out there in the grapevine world? |
From: David S. W. <xi...@op...> - 2005-03-24 05:42:18
|
How's everyone out there in the grapevine world? |
From: David S. W. <xi...@op...> - 2004-01-17 03:31:02
|
-- ~David "I drank what?!" -Socrates |
From: Tom G. <to...@em...> - 2003-11-01 21:57:27
|
On Fri, Oct 31, 2003 at 04:40:26PM +1300, Stephen Blackheath wrote: > On Fri, 31 Oct 2003 15:29, you wrote: > > Is it at all possible to make the node-joining method a policy decision > > for the end users? > I see what you mean - each node specifies its own policy for prospective new > nodes. That might form part of a more sophisticated SAHP, but I wouldn't let > the actual human being dictate it. The network should "just work" from the > user's point of view. I was thinking that it should be possible for end users to establish manual connections, in case something doesn't work or in case they know that the network is more reliable in that direction. > > Would it be possible to have file sponsors who keep the whole file > > (like Bittorrent seeds)? If someone wants to keep the file on the > > network they have to commit to keeping a seed running. > That is technically possible and would be a far easier way to solve the > problem, but it would prevent anonymous publishing, which is one of the most > important goals of this system. I don't mind the idea of non-anonymously publishing a large list of files. Can it simply be made that my node doesn't delete any bits of the files I've told it to share? -- Tom Goulet, to...@em..., D8BAD3BC, http://web.em.ca/~tomg/contact.html |
From: Anthony J. <aj...@cl...> - 2003-10-31 08:28:11
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Friday 31 October 2003 16:13, Stephen Blackheath wrote: > Thanks for all that. How can the client check the signature? What > prevents the node with the root file from lying, since this information > can't be protected by a CHK? The client can decide whether or not to believe the signature. The signature must be from a node in the area at or near where the root file is located. A client should require a certain number of signatures from that area before it will actually believe them and not try to find the file for itself. > Another idea I had was this: Let's say the file contains 100 blocks. You > do a random sample to see what proportion of those blocks can be fetched > (without downloading - it would be good find a way to cryptographically > prevent cancer nodes lying). A statistical analysis will give you a > reasonably accurate indication of the probability of retrieving the entire > file, with only a small sample. That idea works. It certainly had the advantage of simplicity. > Your plan has an efficiency advantage, though the signing would consume CPU > time. The idea I just mentioned has the advantage of simplicity - a very > important thing to me at the moment. The signing only happens when the node discovers that a file is broken. After that the "this is broken" marking can gain or loose signatures. I can see this starting to get complicated. I think I'm starting to prefer your idea. Anthony -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) iD8DBQE/oh0Pd+IOCdhCut8RArmeAJ9eaphZJLhk1vu7d6qspsAIQ3K6ZQCeLmhv h4Gx5ENTvetRJoNUbe8MNHI= =Cm/6 -----END PGP SIGNATURE----- |
From: Stephen B. <st...@bl...> - 2003-10-31 08:13:27
|
=2D----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Fri, 31 Oct 2003 17:47, Anthony Jones wrote: > On Friday 31 October 2003 11:40, Stephen Blackheath wrote: > > > Joining nodes are not assigned a place... why not? > > > > Because I couldn't think of a satisfactory way of doing it. The > > grapevine.pdf document describes an alternative approach, and SAHP seem= ed > > preferable. > > In short they are assigned a random place, which they automatically > generate for themselves. SAHP makes it computationally intensive to > allocate yourself a non-random place. > > > > Can you allow a shortcut for that? Like, can the administrators of > > > each node decide they want to connect no matter what anyone else says? > > > > One possible short-cut (Anthony's idea) would be for someone to send an > > "invitation" to a friend which contains an already-calculated location, > > as well as a list of seed nodes. That would allow a new person to join > > immediately on the recommendation of a friend. The disadvantage is that > > it would also need to contain a private key (on account of the way SAHP > > works). Normally you don't let private keys travel around the network. > > The SAHP need not be all that good. Even a time constant of 2 minutes for= a > top of the line machine (which is likely to be closer to 20 minutes for an > old clunker) would offer a reasonable level of security. I don't really s= ee > it as a big issue. If you're serious about running Grapevine then you'll > just start it up and leave it running. > > > > Would it be possible to have file sponsors who keep the whole file > > > (like Bittorrent seeds)? If someone wants to keep the file on the > > > network they have to commit to keeping a seed running. > > > > That is technically possible and would be a far easier way to solve the > > problem, but it would prevent anonymous publishing, which is one of the > > most important goals of this system. > > My suggestion is this: > > When you give someone a reference to a file you give them only a reference > to the root of that file. The root would look something like this: > > <file> > <data location=3D"43b129daskjn189y#!2hb"/> > <data location=3D"kj321897@123jhgsdads"/> > <data location=3D"dasbn21,mnasi;31h2313"/> > <data location=3D"sanmbdkhb3kaksjhda/;j3"/> > <data location=3D":3:!312kj$kjh1hj23hk132"/> > </file> > > This is an example of a root file which points to five data blocks. These > are redundant blocks so only four out of the five are required to > reconstruct the data. If a client wants to download this file then they > would download four out of the five blocks. If one of the blocks is missi= ng > then it will download the fifth block and then automatically re-create and > re-insert the missing block. > > If the node can't be reconstructed then the client will notify the node > which stores the root file. This node will then check (without downloadin= g) > all the data and verify for itself whether it is broken or not. If the fi= le > is correctly identified as being broken then that node will sign the root > file as being broken. From then on it is easy for a client to check wheth= er > the file is broken without having to actually download it or find all the > pieces. > > If the file is large then it would be a hierarchy of root files but the > basic principle still applies. Rather than each node checking the data of > it's children it will check the root nodes of it's children. They'll eith= er > be signed as broken or as working. > > Anthony Thanks for all that. How can the client check the signature? What prevent= s=20 the node with the root file from lying, since this information can't be=20 protected by a CHK? Another idea I had was this: Let's say the file contains 100 blocks. You = do=20 a random sample to see what proportion of those blocks can be fetched=20 (without downloading - it would be good find a way to cryptographically=20 prevent cancer nodes lying). A statistical analysis will give you a=20 reasonably accurate indication of the probability of retrieving the entire= =20 file, with only a small sample. Your plan has an efficiency advantage, though the signing would consume CPU= =20 time. The idea I just mentioned has the advantage of simplicity - a very=20 important thing to me at the moment. I would also have - as you said - the client replace any blocks they found = to=20 be missing in order to make the file get bolstered each time someone=20 downloads it. The CHKs mean that the system is protected against cancer=20 clients inserting wrong data. Steve =2D----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.3 (GNU/Linux) iD8DBQE/ohmiODO5z8eA7sQRAoXNAJ9SI+cVGzJq4MSHseawUuu9MklFzACdG5/D dOxbYF0eppGljNEEi9zHm/8=3D =3DFNgU =2D----END PGP SIGNATURE----- |
From: Anthony J. <aj...@cl...> - 2003-10-31 04:47:28
|
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Friday 31 October 2003 11:40, Stephen Blackheath wrote: > > Joining nodes are not assigned a place... why not? > > Because I couldn't think of a satisfactory way of doing it. The > grapevine.pdf document describes an alternative approach, and SAHP seemed > preferable. In short they are assigned a random place, which they automatically generate for themselves. SAHP makes it computationally intensive to allocate yourself a non-random place. > > Can you allow a shortcut for that? Like, can the administrators of each > > node decide they want to connect no matter what anyone else says? > > One possible short-cut (Anthony's idea) would be for someone to send an > "invitation" to a friend which contains an already-calculated location, as > well as a list of seed nodes. That would allow a new person to join > immediately on the recommendation of a friend. The disadvantage is that it > would also need to contain a private key (on account of the way SAHP > works). Normally you don't let private keys travel around the network. The SAHP need not be all that good. Even a time constant of 2 minutes for a top of the line machine (which is likely to be closer to 20 minutes for an old clunker) would offer a reasonable level of security. I don't really see it as a big issue. If you're serious about running Grapevine then you'll just start it up and leave it running. > > Would it be possible to have file sponsors who keep the whole file > > (like Bittorrent seeds)? If someone wants to keep the file on the > > network they have to commit to keeping a seed running. > > That is technically possible and would be a far easier way to solve the > problem, but it would prevent anonymous publishing, which is one of the > most important goals of this system. My suggestion is this: When you give someone a reference to a file you give them only a reference to the root of that file. The root would look something like this: <file> <data location="43b129daskjn189y#!2hb"/> <data location="kj321897@123jhgsdads"/> <data location="dasbn21,mnasi;31h2313"/> <data location="sanmbdkhb3kaksjhda/;j3"/> <data location=":3:!312kj$kjh1hj23hk132"/> </file> This is an example of a root file which points to five data blocks. These are redundant blocks so only four out of the five are required to reconstruct the data. If a client wants to download this file then they would download four out of the five blocks. If one of the blocks is missing then it will download the fifth block and then automatically re-create and re-insert the missing block. If the node can't be reconstructed then the client will notify the node which stores the root file. This node will then check (without downloading) all the data and verify for itself whether it is broken or not. If the file is correctly identified as being broken then that node will sign the root file as being broken. From then on it is easy for a client to check whether the file is broken without having to actually download it or find all the pieces. If the file is large then it would be a hierarchy of root files but the basic principle still applies. Rather than each node checking the data of it's children it will check the root nodes of it's children. They'll either be signed as broken or as working. Anthony -----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.1 (GNU/Linux) iD8DBQE/oelHd+IOCdhCut8RAgtuAJsEz1vXCqANV8duf0dY5pHg8c/4awCfV93j J9/vWm9A387j4ZSoqKj69bQ= =9RWS -----END PGP SIGNATURE----- |
From: Stephen B. <st...@bl...> - 2003-10-31 03:40:32
|
=2D----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On Fri, 31 Oct 2003 15:29, you wrote: > > The whole SAHP/Hash cash thing needs finishing (not important right > > now). > > Please correct me if I have the wrong ideas here... > > The virtual network structure in a network under Grapevine requires a > rigid shape. Rigid, but able to change easily when nodes appear and disappear. > Joining nodes are not assigned a place... why not? Because I couldn't think of a satisfactory way of doing it. The grapevine.= pdf=20 document describes an alternative approach, and SAHP seemed preferable. > Joining nodes want to pick out a place so they can do stuff, but they > can't be allowed to pick the location they want in case they're bad > nodes and they surround and strangle a legitimate node. Correct. > So you use SAHP to require that joining nodes must do some brute force > attacks before they're given the place that they've picked. That's correct. > Can you allow a shortcut for that? Like, can the administrators of each > node decide they want to connect no matter what anyone else says? One possible short-cut (Anthony's idea) would be for someone to send an=20 "invitation" to a friend which contains an already-calculated location, as= =20 well as a list of seed nodes. That would allow a new person to join=20 immediately on the recommendation of a friend. The disadvantage is that it= =20 would also need to contain a private key (on account of the way SAHP works)= =2E =20 Normally you don't let private keys travel around the network. > Is it at all possible to make the node-joining method a policy decision > for the end users? I see what you mean - each node specifies its own policy for prospective ne= w=20 nodes. That might form part of a more sophisticated SAHP, but I wouldn't l= et=20 the actual human being dictate it. The network should "just work" from the= =20 user's point of view. > > Also, someone needs to sit down and work out how to turn the whole > > thing into a mix-net (not important right now). > > Then I won't learn what a mix-net is... :-) A mix-net is a network that makes its traffic patterns look random, in orde= r=20 to protect against attacks by people who can monitor the traffic and do=20 sophisticated analysis on it. Remember that the messages themselves are=20 encrypted, so the attacker can't learn anything from them - but we also nee= d=20 to ensure the sizes of the messages don't give anything away. > > Another problem is the issue of making files drop off the network all > > in one go, instead of becoming gradually fragmented. > > Would it be possible to have file sponsors who keep the whole file > (like Bittorrent seeds)? If someone wants to keep the file on the > network they have to commit to keeping a seed running. That is technically possible and would be a far easier way to solve the=20 problem, but it would prevent anonymous publishing, which is one of the mos= t=20 important goals of this system. Steve =2D----BEGIN PGP SIGNATURE----- Version: GnuPG v1.2.3 (GNU/Linux) iD8DBQE/odmqODO5z8eA7sQRAgNzAKCf9z8TvX+IcDO5/+5FDbRa5LWpwACbBzV4 5/A8aG4BpEgzlqFtDsszwp4=3D =3DiEKQ =2D----END PGP SIGNATURE----- |