From bram at gawth.com Tue Apr 1 23:24:02 2003 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Privaria Message-ID: This looks interesting - http://eepatents.com/privaria/ -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From levine at vinecorp.com Fri Apr 4 12:46:02 2003 From: levine at vinecorp.com (James D. Levine) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] [Silicon Valley] PeerPunks meeting Tuesday 4/8 7:45 in Mountain View Message-ID: I am pushing the start time back to 7:45 this meeting because of a schedule conflict. PeerPunks has a web page now- please visit and consider joining the announce-only mailing list (very low volume). http://www.bitbin.org/p2punks It also has a new name, "p2punks". See you there! James -- Where: Dana Street Roasting Company 744 W Dana St, Mountain View,CA 94041 Phone: (650) 390-9638 This is just 1/2 block off Castro St. When: 7:45 pm onward ----- From douwen at yahoo.com Sun Apr 6 05:54:02 2003 From: douwen at yahoo.com (Dou Wen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] logs data wanted Message-ID: <20030406125346.79988.qmail@web40603.mail.yahoo.com> hi,all is there any one have logs data of any current p2p file-sharing applications(e.g , kazaa ,edonkey, gnutella etc), i need them in my research to get some more insight of the pattern about the users. regards dw __________________________________________________ Do you Yahoo!? Yahoo! Tax Center - File online, calculators, forms, and more http://tax.yahoo.com From samarati at dti.unimi.it Sun Apr 6 06:26:02 2003 From: samarati at dti.unimi.it (Pierangela Samarati) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] SUMMER SCHOOL ON INFORMATION SECURITY Message-ID: ---------- Forwarded message ---------- Date: Sat, 5 Apr 2003 18:19:09 -0500 (EST) From: Yvo Desmedt FREE (for US university students) SUMMER SCHOOL ON INFORMATION SECURITY with world-renowned speakers http://www.sait.fsu.edu/summer2003 May 15-23, 2003 Florida State University, Tallahassee, Florida, USA Preliminary Announcement For other formats of this document: see: http://www.sait.fsu.edu/summer2003 GENERAL INFORMATION The SAIT (Security and Assurance in Information Security) group at Florida State University (Department of Computer Science) is organizing a Summer School, May 15-23, 2003 with the following preliminary schedule: INTRODUCTORY COURSE: May 15-16, 2003, with speakers: -) Mike Burmester -) Yvo Desmedt on an introduction to cryptography (perfect secrecy, computational number theory, RSA, El Gamal, key distribution, secret sharing, digital signature, zero-knowledge) and computer security (access control, computer viruses, physical security, trusted operating systems, data base security, network aspect). MAIN COURSE: May 19-23, 2003, with principal speakers and topics: -) Alfred Menezes: on elliptic curves in cryptography and its applications. -) Bart Preneel: on block ciphers, hash functions, stream ciphers. -) Jean-Jacques Quisquater: on all aspects of smart card security and the GQ protocol. -) Pierangela Samarati: on access control and data base security. -) Moti Yung: on topics such as e-voting, broadcast encryption with/without tracing, and covert channels. Other speakers include: Mike Burmester, Yvo Desmedt, David Samyde and Alec Yasinsac. REGISTRATION INFORMATION The cost for registration is: Introductory | Main | Both course | course | --------------------------------------------------------- a | | | 1 | US student | Free | Free | Free | Foreign student | $70 | $175 | $250 | Academia/Government | $120 | $300 | $420 | Industry | $300 | $700 | $1,000 --------------------------------------------------------- a) Students registered at a US university during the Academic Year 2002-2003 or 2003-2004, or Summer 2003 receive a free registration, funded by NSF DUE-0243117: "Cyber Training and Education at Florida State University." Evidence of registration will be required. On-line registration will be available soon at: http://www.sait.fsu.edu/summer2003 Free registrations only includes teaching material. Other registrations also include lunch. US students who want to attend must register for the Summer School even though the registration is free. Travel stipends for US students may become available (see http://www.sait.fsu.edu/summer2003). FOR US CITIZENS US citizens interested in studying Information Security at Florida State University with a Scholarship (funded by NSF DUE-0243117) starting Fall 2003 can consult http://www.sait.fsu.edu/nsf/cyber.htm FURTHER INFORMATION Other information (such as selection of hotels, schedule) will be available on the Summer School web pageas soon as possible. For more information contact: Randolph Langley langley@cs.fsu.edu Tel. +1 (850) 644-7182 FAX. +1 (850) 644-0058 206 Love Building Florida State University Tallahassee, FL 32306-4530 USA The detailed program will be posted on the web page soon. For enquiries about it in the meanwhile, please contact: Prof. Yvo Desmedt desmedt@cs.fsu.edu Tel. +1 (850) 644-9298 FAX. +1 (850) 644-0058 206 Love Building Florida State University Tallahassee, FL 32306-4530 USA About this document The organizers of the Summer School are: Yvo Desmedt, Mike Burmester and Alec Yasinsac. ------------------------------------------------------------------------------- This document was prepared by Yvo Desmedt. From mfreed at cs.nyu.edu Sun Apr 6 06:32:02 2003 From: mfreed at cs.nyu.edu (Michael J. Freedman) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] logs data wanted In-Reply-To: <20030406125346.79988.qmail@web40603.mail.yahoo.com> Message-ID: You might want to try Steve Gribble at UWash... --mike On Sun, 6 Apr 2003, Dou Wen wrote: > Date: Sun, 6 Apr 2003 05:53:46 -0700 (PDT) > From: Dou Wen > Reply-To: p2p-hackers@zgp.org > To: p2p-hackers@zgp.org > Subject: [p2p-hackers] logs data wanted > > hi,all > is there any one have logs data of any current p2p > file-sharing applications(e.g , kazaa ,edonkey, > gnutella etc), i need them in my research to get some > more insight of the pattern about the users. > > regards > dw > > > __________________________________________________ > Do you Yahoo!? > Yahoo! Tax Center - File online, calculators, forms, and more > http://tax.yahoo.com > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > ----- "Not all those who wander are lost." www.michaelfreedman.org From David_Marwood at prn.com Mon Apr 7 09:25:02 2003 From: David_Marwood at prn.com (David Marwood) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] logs data wanted Message-ID: <93F1336E37BAD211B06F0090273F7732061DB90F@mail.prn.com> I'll second the recommendation of Steve Gribble on this topic and refer you to a paper he co-authored. "An Analysis of Internet Content Delivery Systems" appearing at OSDI '02, http://www.cs.washington.edu/research/networking/websys/pubs/osdi_2002/osdi. pdf Regards, Dave Marwood > Date: Sun, 6 Apr 2003 05:53:46 -0700 (PDT) > From: Dou Wen > Reply-To: p2p-hackers@zgp.org > To: p2p-hackers@zgp.org > Subject: [p2p-hackers] logs data wanted > > hi,all > is there any one have logs data of any current p2p > file-sharing applications(e.g , kazaa ,edonkey, > gnutella etc), i need them in my research to get some > more insight of the pattern about the users. > > regards > dw > From levine at vinecorp.com Tue Apr 8 12:45:02 2003 From: levine at vinecorp.com (James D. Levine) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] [Silicon Valley] PeerPunks meeting TONIGHT 4/8 7:45 in Mountain View Message-ID: Don't forget the different time tonight...see you there... -- PeerPunks has a web page now- please visit and consider joining the announce-only mailing list (very low volume). http://www.bitbin.org/p2punks It also has a new name, "p2punks". -- Where: Dana Street Roasting Company 744 W Dana St, Mountain View,CA 94041 Phone: (650) 390-9638 This is just 1/2 block off Castro St. When: 7:45 pm onward ----- From bram at gawth.com Tue Apr 8 14:47:02 2003 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] p2p-hackers meeting Message-ID: This month's p2p-hackers meeting is coming up on sunday when: sunday, april 13th, 3pm where: sony metreon, san francisco, food court area I'll be able to talk about the big BitTorrent deployment of the RedHat ISOs last week. Other topics will probably include Codeville and distributed trust metrics. -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From seth.johnson at RealMeasures.dyndns.org Wed Apr 9 02:03:02 2003 From: seth.johnson at RealMeasures.dyndns.org (Seth Johnson) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] CFP: NY Fair Use Meeting, Sunday April 13, 2003 Message-ID: <3E93DFFD.C67A0C40@RealMeasures.dyndns.org> (For all of you in the New York area this Sunday. -- Seth) New Yorkers for Fair Use Call for Participation ----------------------------------------------- New Yorkers for Fair Use will meet this Sunday, 13 April 2003 at 6:00 pm, at the Gyro Place and Bagel and Pizza Joint across the street from Cooper Union, at Astor Place, that is, Eighth Street/St Marks and Third Avenue. The Lexington Avenue subway line has a stop at Astor Place. The Gyro Place is about one half block east of the stop. Look in the back for us. The struggle for information freedom continues. Volunteers are needed! Today special interests grossly abuse copyright law in large scale attacks on private ownership of computers, and on free private, tribal, business, and public use of the Net. The effective defense of these fundamental rights of all human beings requires the ongoing and disciplined work of dedicated individuals. The special interests have money and lobbyists, but they are no match for serious, coordinated organizing and action. And all their money and all their lobbyists cannot elect one member of Congress or one Senator, if we build a movement that clearly communicates what the stakes are to the voters and the public, the true stakeholders in these policy decisions. This meeting will be an opportunity to find out more about us, to see what we are doing and to volunteer to help in the struggle. We are recruiting volunteers to conduct outreach tactics on the street, by phone, via online and offline press and other forums, to write as issues commentators, and to take up administrative and promotional production roles. We encourage other groups to mobilize just as we are, and we will provide support and training to help hit the ground running. New Yorkers for Fair Use has had a number of successes in recent months: - We played an important role in mobilizing the large number of public comments (6,138 to date) which the FCC has received in response to its proposal to allow Hollywood to set the rules for how digital television recording devices may function (the "broadcast flag" proposal). This campaign included several months of street and phone outreach and a successful online press outreach the weekend of Thanksgiving break prior to the final week of the public comments period -- resulting in thousands of comments being submitted in the final five days. http://www.nyfairuse.org/action/fcc.flag - Joining with NYLXS, we stood up at a crucial meeting among major old world infotainment industry representatives which had been called at the Department of Commerce for the purposes of addressing how to accomplish digital restrictions management. We declared in no uncertain terms that the public were the stakeholders in this matter, and that government-mandated universal content control would be an act of theft from the public on an unprecedented scale. This action, coming only a couple of weeks after Microsoft announced their Palladium project, effectively prevented the establishment of a precedent for government-mandated content control which the meeting had threatened to create. http://newsforge.com/newsforge/02/07/18/0155208.shtml - We helped rally constituencies to oppose the W3C's proposal to allow web standards to be patented and to allow the imposition of royalties for their use. http://lists.w3.org/Archives/Public/www-patentpolicy-comment - We have initiated a boycott to stop Palladium and TCPA before software is released that uses these systems to allow others to control what we can do on our own computers. http://www.nyfairuse.org/action/palladium These continuing successes are the direct result of the efforts of skilled volunteers who have taken up key roles in the fight. We recognize that we are taking on formidable forces, and we intend to expand the strength of the movement. We need volunteers to take up roles in the movement, to build our strength, to defend what we now hold, and to attack on many fronts. Come on down this Sunday and join us! Seth Johnson Corresponding Secretary New Yorkers for Fair Use -- DRM is Theft! We are the Stakeholders! New Yorkers for Fair Use http://www.nyfairuse.org [CC] Counter-copyright: http://cyber.law.harvard.edu/cc/cc.html I reserve no rights restricting copying, modification or distribution of this incidentally recorded communication. Original authorship should be attributed reasonably, but only so far as such an expectation might hold for usual practice in ordinary social discourse to which one holds no claim of exclusive rights. From decapita at sansone.crema.unimi.it Sat Apr 12 08:08:02 2003 From: decapita at sansone.crema.unimi.it (Sabrina De Capitani di Vimercati) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] CFP: 2nd Workshop on Privacy in the Electronic Society (WPES 2003) Message-ID: [Apologies if you receive multiple copies of this message] CALL FOR PAPERS 2ND WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY Washington, DC, USA - October 30, 2003 Sponsored by ACM SIGSAC Held in association with 10th ACM CCS 2003 http://seclab.dti.unimi.it/wpes2003 ---------------------------------------------------------------------- Privacy issues have been the subject of public debates and the need for privacy-aware policies, regulations, and techniques has been widely recognized. Goal of this workshop is to discuss the problems of privacy in the global interconnected societies and possible solutions to it. The 2003 Workshop is the second in what we hope will be a yearly forum for papers on all the different aspects of privacy in today's electronic society. The first workshop in the series was held in Washington, on 21 November 2002, in conjunction with the 9th ACM CCS conference. The success of this first workshop and the increased interest of the community in privacy issues, is the main reason for repeating the event. The workshop seeks submissions from academia and industry presenting novel research on all theoretical and practical aspects of electronic privacy, as well as experimental studies of fielded systems. We encourage submissions from other communities such as law and business that present these communities' perspectives on technological issues. Topics of interest include, but are not limited to: - anonymity, pseudonymity, unlinkability - business model with privacy requirements - data protection from correlation and leakage attacks - electronic communication privacy - information dissemination control - privacy-aware access control - privacy in the digital business - privacy enhancing technologies - privacy policies and human rights - privacy and anonymity in Web transactions - privacy threats - privacy and confidentiality management - privacy in the electronic records - privacy in health care and public administration - public records and personal privacy - privacy and virtual identity - personally identifiable information - privacy policy enforcement - privacy and data mining - relationships between privacy and security - user profiling - wireless privacy PAPER SUBMISSIONS Submitted papers must not substantially overlap papers that have been published or that are simultaneously submitted to a journal or a conference with proceedings. Papers should be at most 15 pages excluding the bibliography and well-marked appendices (using 11-point font and reasonable margins on letter-size paper), and at most 20 pages total. Committee members are not required to read the appendices, and so the paper should be intelligible without them. Papers should have a cover page with the title, authors, abstract and contact information. To submit a paper, send to wpes@dti.unimi.it a plain ASCII text email containing the title and abstract of your paper, the authors' names, email and postal addresses, phone and fax numbers, and identification of the contact author. To the same message, attach your submission (as a MIME attachment) in PDF or portable postscript format. Do NOT send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). Papers must be received by the deadline of JUNE 10, 2003. Accepted papers will be presented at the workshop and published by the ACM in a conference proceedings. PANEL PROPOSALS Proposals should be no longer than 5 pages in length, should include possible panelists and an indication of which panelists have confirmed participation. Send to wpes@dti.unimi.it a plain ASCII text email containing the title of your panel and contact information. To the same message, attach your proposal (as a MIME attachment) in ASCII, PDF, or portable postscript format. Do NOT send files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). Panel proposals must be received by the deadline of JUNE 10, 2003. GENERAL CHAIR Sushil Jajodia George Mason University, USA email: jajodia@ise.gmu.edu PROGRAM CHAIRS Pierangela Samarati Paul Syverson University of Milan Naval Research Laboratory email: samarati@dti.unimi.it url: www.syverson.org PANEL CHAIR PUBLICITY CHAIR Michael Waidner Sabrina De Capitani di Vimercati IBM Zurich, Switzerland University of Milan email: wmi@zurich.ibm.com email: decapita@dti.unimi.it IMPORTANT DATES Paper Submission due: June 10, 2003 Panel Submission due: June 10, 2003 Acceptance notification: August 1, 2003 Final papers due: September 1, 2003 PROGRAM COMMITTEE Ernesto Damiani, University of Milan, Italy George Danezis, University of Cambridge, UK Sabrina De Capitani di Vimercati, University of Milan, Italy Roger Dingledine, The Free Haven Project, USA Philippe Golle, Stanford University, USA Marit Hansen, Independent Centre for Privacy Protection Schleswig-Holstein, Germany David Martin, University of Massachusetts, USA Birgit Pfitzmann, IBM Zurich Research Lab, Switzerland Marc Rennhard, ETH Zurich, Switzerland Avi Rubin, Johns Hopkins University, USA Adam Shostack, Canada Michael Waidner, IBM Zurich Research Lab, Switzerland Chenxi Wang, Carnegie Mellon University, USA Marc Wilikens, Joint Research Center, Italy Marianne Winslett, U. of Illinois Urbana-Champaign, USA Rebecca Wright, Stevens Institute of Technology, USA From bram at gawth.com Sun Apr 13 14:21:02 2003 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] meeting today Message-ID: well, I'm off to the meeting. I'll probably be there around 3:15, at the metreon. See y'all there. -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From lalis at ics.forth.gr Sun Apr 20 11:01:03 2003 From: lalis at ics.forth.gr (spyros lalis) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] GLOBAL and PEER-TO-PEER Computing Workshop - CFP Message-ID: <3EA2E0C8.75B84BE4@ics.forth.gr> Please accept our apologies, if you have received multiple copies --------------------------------------------------------------------- CALL FOR PARTICIPATION Third International Scientific Workshop on GLOBAL and PEER-TO-PEER Computing (http://www.lri.fr/~fci/GP2PC) Toshi Center Hotel, Room 601 Tokyo, Japan, May 13-14, 2003 organized at the IEEE/ACM International Symposium on Cluster Computing and the Grid 2003 IEEE/ACM CCGRID 2003 In cooperation with the IEEE Task Force on Cluster Computing (TFCC) --------------------------------------------------------------------- PROGRAM We are pleased to present a rich program with high quality papers on a variety of key issues of global and Peer-to-Peer computing, such as Overlay networks and Lookup mechanisms, P2P cluster formation, communication & control, Protocols, Group operations, Replication, etc. This program aims to provide the attendance with the state-of-the-art and significant research results in Global and Peer-to-Peer computing. Tuesday, May 13, room 601 Session 1 (10:45 - 12:45): Overlay and Lookup A Tree Model for Structured Peer-to-Peer Protcols H.C. Hsiao and C.T. King (NationalTsing-Hua University, Hsinchu) DKS(N,K,f): A Family of Low Communication, Scalable and Fault-Tolerant Infrastructures for P2P Applications L. O. Alima, S. El-Ansary, P. Brand,and S. Haridi (Royal Institute of Technology) Criticality-based Analysis and Design of Unstructured Peer-to-Peer Networks as "Complex Systems" F. Banaei-Kashani and C. Shahabi (University of Southern California) Peer-to-Peer Keyword Search Using Keyword Relationship K. Nakauchi, Y. Ishikawa, H. Morikawa, and T. Aoyama (University of Tokyo) Session 2 (2:00 - 3:30) : P2P Cluster Formation, Communication & Control Clustering Hosts in P2P and Global Computing Platforms A. Agrawal and H. Casanova (UCSD) Evaluation of the inter-cluster data transfer on Grid environment S. Ogura, S. Matsuoka, and H.Nakada (Tokyo Institute of Technology) XtremWeb & Condor: sharing resources between Internet connected Condor pools, O. Lodygensky, G. Fedak, F. Cappello, V. Neri (University of Paris South), M. Livny, and D.Thain (University of Wisconsin) Session 3 (4:00 - 6:00): Protocols for P2P systems Supporting Peer-to-Peer Computing with FlexiNet T. F. T. Fuhrmann (University of Karlsruhe) A Transport Layer Abstraction for Peer-to-Peer Networks R. A. Ferreira, C. Grothoff, and P. Ruth (Purdue University) P2P-RPC: Programming Scientific Applications on Peer-to-Peer Systems with Remote Procedure Call S. Djilali (University of Paris-Sud) Secure Communication in Distributed System Using Identity Based Encryption T. Stading (IBM) Wednesday, May 14, room 601 Session 4 (10:45 - 12:45): Group operations/replication Large Scale Dissemination using a Peer-to-Peer Network K. G. Zerfiridis and H. D. Karatza (Aristotle University of Thessaloniki) Towards a Framework for Collaborative Peer Groups V. Sunderam and J. Pascoe, R. Loader (Emory University) RelayCast: A Middleware for Application-level Multicast Services N. Mimura, K. Nakauchi, H. Morikawa, and T. Aoyama (The University of Tokyo) Improving Performance via Computational Replication on a Large-Scale Computational Grid Y. Li and M. Mascagni (Dept. of Computer Science, School of Computational Science and Information Technology, Florida State University) IMPORTANT CONFERENCE LINKS Conference site: http://www.ccgrid.org/ccgrid2003 Local info: http://ccgrid2003.apgrid.org/local_info.html Accomodation: http://ccgrid2003.apgrid.org/accomodation.html Registration: http://ccgrid2003.apgrid.org/registration.html WORKSHOP CHAIRS (and contact for workshop info) Franck Cappello, Spyros Lalis, CNRS, Universite Paris-Sud University of Thessaly and ICS-FORTH France, Greece, fci@lri.lri.fr lalis@ics.forth.gr --------------------------------------------------------------------- From seth.johnson at RealMeasures.dyndns.org Tue Apr 22 05:58:02 2003 From: seth.johnson at RealMeasures.dyndns.org (Seth Johnson) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] NY Fair Use Meeting, 4/13/02 Message-ID: <3EA53C05.42CCB6AE@RealMeasures.dyndns.org> New Yorkers for Fair Use Meeting April 13, 2003, East Village Attendance: Jay Sulzberger Brett Wynkoop Seth Johnson Vagn Scott Leonid Gorkin Forest Marrs Lucas Gonze Dustin Perun Anonymous This meeting was a general call for action combined with briefings on recent successes and organizational method, combined with general input resulting in wide-ranging discussion. Seth called for volunteers for a Phone Bank tactic contacting the NY Fair Use volunteers database to contact their Congress people regarding current movements at the Federak legislative level, such as the FCC broadcast flag, to be conducted on Thursday, April 24th at 7:00 pm, via conference call. 6 Volunteers: Brett, Seth, Vagn, Lucas, Dustin, Anonymous Seth called for volunteers for a Street Outreach tactic seeking volunteers for the "Stop Palladium" campaign, to be conducted in front of the CompUSA at Fifth Avenue and 37th Street on Saturday, April 19th at 12:00 noon. 6 Volunteers: Brett, Jay, Seth, Vagn, Leonid, Anonymous General Discussion: 1. Meeting began with a description of recent activities. Jay recounted developments over the last nine months, with others contributing to the narrative. Topics included the July 17 2002 Commerce Department tactic, the FCC Broadcast Flag action, the mobilization to stop patented W3C standards, the "Stop Palladium" campaign, and more. 2. Forest invited the group to meet at the Three Jewels Cafe, 211 East 5th St. near the 3rd Ave end (212 475 6650). There is free net access there if you have a wireless card. 3. Seth presented a summary of organizing principles. Vagn's notes: "Show those who are concerned something in motion." "Ask people to take on roles." "Set their expectations." "Build an army" to take on the content cartels, and politicise our area. "We can come and train you." 4. Brett mentioned students at Swarthmore who expressed interest. Talk to colleges' admins about these issues. Also members of Congress, all but two voted for DMCA. It was noted that MCs had never heard the other side of these issues. Noted that a goal is repeal of the DMCA. Noted that the ARRL board takes the "How does the broadcast flag and the DMCA affect me personally" line. 5. General Discussion of "Stop Palladium" Campaign Don't buy Palladiated products Do outreach in front of CompUSA stores. Discussion of sound bites against Palladium: - Don't let others take control of your computer - Who decides who you trust? - Should you get to choose, or should the choice be forced upon you? "I can't program, I don't have control of my computer now!" People are returning things to stores that say "not MS approved" during install. Discussion about the difficulty of getting the issue across to people. Concerns raised: TCPA just a chip for encryption Palladium not a compelling issue - Break Once, Run Everywhere/Anywhere (BORE/A) will work - Possible winners: Lexmark case DVD region encoding (Canada to US a felony) Non-MS games on Xbox (Play a game, go to jail). Palladium is invisible to most people. Seth said that there's a difference between private interest issues served by encryption and exclusive rights policy, which is about public interest. He told how Congress handed their responsibility over to industry stakeholders around 1910, letting them hash out copyright policy and hand the results back to Congress to ratify, and that this procedure has left us with a lot of the misunderstandings that are causing so much trouble now. Jay emphasized that we should not allow the copyright misunderstanding to cloud the issue that people really have ownership rights to their computers. Seth said we are targeting Palladium for a specific reason. It will be demonstrated next month and if it deploys it will be a major fait accompli for a very wrong view of exclusive rights. Jay said we can win on Palladium and we should continue the fight -- people will say either 'we don't want it at all' or that they know they are trusting MS. He said we want guarantees that you can always load your own keys into the hardware. he said this is a fight for private ownership of computers, for free speech, and for individual rights. Seth said that the whole process of organizing is a process of identifying issues, constituencies, and calling to action. Jay was inspiring motion on Palladium. Seth said that in organizing to build strength, the tactical purpose is not to change the minds of the average man on the street, but to recruit those who are looking for a way to make a difference. Show them something in motion and they will take up roles in the fight. 6. Jay said the Broadcast Flag would probably pass without continuing action. He said next would be to speak with Congress people and the Library of Congress. 7. Brett mentioned that on May 16-18, he would be at a Ham convention in Dayton OH. Will have a booth and will continue organizing hams to join the fight. -- New Yorkers for Fair Use http://www.nyfairuse.org [CC] Counter-copyright: http://cyber.law.harvard.edu/cc/cc.html I reserve no rights restricting copying, modification or distribution of this incidentally recorded communication. Original authorship should be attributed reasonably, but only so far as such an expectation might hold for usual practice in ordinary social discourse to which one holds no claim of exclusive rights. From cefn.hoile at bt.com Fri Apr 25 03:29:02 2003 From: cefn.hoile at bt.com (cefn.hoile@bt.com) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Developers Wanted Message-ID: <21DA6754A9238B48B92F39637EF307FD1C19A0@i2km41-ukdy.nat.bt.com> A vacancy within our research and development team at BTexact in the UK (http://www.btexact.com ) is now available. Please take a look at the following page to find out more about the post, and how to apply. http://www.cefn.com/cefn/index.php?DTCJob Regards, Cefn http://www.cefn.com -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20030425/9de9de45/attachment.html From darkelf at arabia.com Fri Apr 25 10:38:02 2003 From: darkelf at arabia.com (Oscar Cisneros) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] BIG P2P NEWS Message-ID: <5af101c30b51$12ddd410$14c9a8c0@mail2world.com> Judge rules in favor of Napster follow-ons By Russ Britt In a case that could turn the tide on online piracy, a Los Angeles judge ruled Friday in favor of online file-sharing services Grokster and Morpheus, saying the two companies are not liable for online piracy by users of their service. The follow-on services to Napster -- which was forced to give up sharing of music files -- were sued by several major entertainment companies who sought to take the firms to trial. But U.S. District Court Judge Stephen Wilson ruled in favor of the two firms. A third online file sharing service, Kazaa, is not affected by the ruling. http://cbs.marketwatch.com/news/newsfinder/pulseone.asp?dateid=37736.547 9050926-804079495&doctype=806&siteid=mktw&selCount=20&value=grokster&pro perty=word & -Oscar http://emote.net -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20030425/ec514cb7/attachment.htm From tutschku at informatik.uni-wuerzburg.de Fri Apr 25 10:41:02 2003 From: tutschku at informatik.uni-wuerzburg.de (Kurt Tutschku) Date: Sat Dec 9 22:12:20 2006 Subject: AW: [p2p-hackers] BIG P2P NEWS In-Reply-To: <5af101c30b51$12ddd410$14c9a8c0@mail2world.com> Message-ID: <001a01c30b51$bd287e70$b46abb84@musa> ;-) -----Urspr?ngliche Nachricht----- Von: p2p-hackers-admin@zgp.org [mailto:p2p-hackers-admin@zgp.org] Im Auftrag von Oscar Cisneros Gesendet: Freitag, 25. April 2003 19:36 An: p2p-hackers@zgp.org Betreff: [p2p-hackers] BIG P2P NEWS Judge rules in favor of Napster follow-ons By Russ Britt In a case that could turn the tide on online piracy, a Los Angeles judge ruled Friday in favor of online file-sharing services Grokster and Morpheus, saying the two companies are not liable for online piracy by users of their service. The follow-on services to Napster -- which was forced to give up sharing of music files -- were sued by several major entertainment companies who sought to take the firms to trial. But U.S. District Court Judge Stephen Wilson ruled in favor of the two firms. A third online file sharing service, Kazaa, is not affected by the ruling. http://cbs.marketwatch.com/news/newsfinder/pulseone.asp?dateid=37736.547 9050926-804079495 &doctype=806&siteid=mktw&selCount=20&value=grokster&property=word& -Oscar http://emote.net -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20030425/107878cf/attachment.html From adam.lydick at verizon.net Sat Apr 26 15:53:02 2003 From: adam.lydick at verizon.net (Adam Lydick) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] bitzi openbits dumps? Message-ID: <1051350344.2979.4.camel@lorien> It seems that the openbits dumps are still unavailable (the message on the download page says since Feb). Anyone have a mirror of the sample rdf or know when it might be coming back up? On a related note. The message on the download site seems to suggest that I email the providers if I'm curious about when they will be restored. However, my cursory look over their site seemed to only show the forums as a contact point. Can someone correct my foolishness with some better contact info? Thanks, Adam From gojomo at usa.net Sat Apr 26 16:58:02 2003 From: gojomo at usa.net (Gordon Mohr) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] bitzi openbits dumps? References: <1051350344.2979.4.camel@lorien> Message-ID: <010201c30c4f$95e2bc00$0a0a000a@golden> Hi! If you actually try the old download links, you'll see that they work. (We just neglected to remove the "temporarily unavailable" notice... I've corrected the oversight.) The on-site forums are a good way to contact us... or the general contact email address info@bitzi.com (mentioned on the "Company Info" page that is linked from the bottom of every page)... or our direct email addresses (linked from the "Team" page). Sorry for any confusion. - Gordon ____________________ Gordon Mohr Bitzi CTO . . . describe and discover files of every kind. _ http://bitzi.com _ . . . Bitzi knows bits -- because you teach it! ----- Original Message ----- From: "Adam Lydick" To: Sent: Saturday, April 26, 2003 2:45 AM Subject: [p2p-hackers] bitzi openbits dumps? > It seems that the openbits dumps are still unavailable (the message on > the download page says since Feb). Anyone have a mirror of the sample > rdf or know when it might be coming back up? > > On a related note. The message on the download site seems to suggest > that I email the providers if I'm curious about when they will be > restored. However, my cursory look over their site seemed to only show > the forums as a contact point. Can someone correct my foolishness with > some better contact info? > > Thanks, > > Adam > > > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > From adam.lydick at verizon.net Sun Apr 27 00:36:02 2003 From: adam.lydick at verizon.net (Adam Lydick) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] bitzi openbits dumps? In-Reply-To: <010201c30c4f$95e2bc00$0a0a000a@golden> References: <1051350344.2979.4.camel@lorien> <010201c30c4f$95e2bc00$0a0a000a@golden> Message-ID: <1051381724.2979.32.camel@lorien> Odd, it works now. I couldn't resolve preview.openbits.org earlier today (which was the real problem). Maybe my ISPs DNS server was being funky. Thanks for the quick (and helpful) response. For the curious: I'm taking a look at value distributions for different fields (word frequency for free-text fields, seeing what fields are enumerable, ...). I was originally using data I gathered from gnutella with a crawler I hacked up, but I think using bitzi data will make my life easier and give me a better sampling. It isn't as complete as a raw crawl could be, but I suspect it covers a wider range of "publishable" [eg: interesting] files then I can easily get on my own. Adam On Sat, 2003-04-26 at 16:57, Gordon Mohr wrote: > Hi! If you actually try the old download links, you'll see that they work. [snip] > > ----- Original Message ----- > From: "Adam Lydick" > To: > Sent: Saturday, April 26, 2003 2:45 AM > Subject: [p2p-hackers] bitzi openbits dumps? > > > > It seems that the openbits dumps are still unavailable (the message on > > the download page says since Feb). Anyone have a mirror of the sample > > rdf or know when it might be coming back up? > > [snip] > > > > Thanks, > > > > Adam From ml at bitzi.com Sun Apr 27 08:55:03 2003 From: ml at bitzi.com (Mike Linksvayer) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] bitzi openbits dumps? In-Reply-To: <1051350344.2979.4.camel@lorien> References: <1051350344.2979.4.camel@lorien> Message-ID: <20030426232522.GA21862@or.pair.com> On Sat, Apr 26, 2003 at 02:45:39AM -0700, Adam Lydick wrote: > It seems that the openbits dumps are still unavailable (the message on > the download page says since Feb). Anyone have a mirror of the sample > rdf or know when it might be coming back up? Very (1.5 years) old full dump and samples are at . We do plan another full dump, and more regular full dumps, all in the fullness of time. There may be slight format changes to correspond with the format of individual tickets (i.e., file records) and perhaps a Creative Commons license option. When I get an adequate chunk of spare time. :( > On a related note. The message on the download site seems to suggest > that I email the providers if I'm curious about when they will be > restored. However, my cursory look over their site seemed to only show > the forums as a contact point. Can someone correct my foolishness with > some better contact info? Posting here worked. :) Or info@bitzi.com. Mike From adam.lydick at verizon.net Sun Apr 27 19:44:01 2003 From: adam.lydick at verizon.net (Adam Lydick) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] best practices for UDP and MTU Message-ID: <1051450584.25576.7.camel@lorien> This might be slightly off topic, but I suspect that a lot of people have had to answer this question already. What is the best way to choose max packet size for a UDP packet? I know that overlarge UDP packets will get fragmented on the IP level, so IP MTU shouldn't be an issue. However, UDP packets can be thrown away as needed, and I seem to remember that overlarge UDP packets can get thrown away silently instead of being fragmented. Is this accurate? Or am I just misremembering things? One could do some sort of handshaking to experimentally determine the max path MTU on a per-host basis, but this isn't acceptable when you want to send one-off queries to a large list of nodes. Thanks, Adam From coderman at mindspring.com Sun Apr 27 21:09:02 2003 From: coderman at mindspring.com (coderman) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] best practices for UDP and MTU In-Reply-To: <1051450584.25576.7.camel@lorien> References: <1051450584.25576.7.camel@lorien> Message-ID: <3EACA9FA.10005@mindspring.com> Adam Lydick wrote: > This might be slightly off topic, but I suspect that a lot of people > have had to answer this question already. > > What is the best way to choose max packet size for a UDP packet? > > I know that overlarge UDP packets will get fragmented on the IP level, > so IP MTU shouldn't be an issue. However, UDP packets can be thrown away > as needed, and I seem to remember that overlarge UDP packets can get > thrown away silently instead of being fragmented. If you care about windoze NAT's (you will need to test specific versions) you should limit packets to < 1450 bytes or so (small enough to stay within a single ethernet frame / PDU with UDP/IP packet headers and any VLAN or tunnel headers included). Other NAT's and routers dont like to reassemble UDP/IP fragments if they are loaded / picky. From pfh at mail.csse.monash.edu.au Mon Apr 28 01:05:01 2003 From: pfh at mail.csse.monash.edu.au (Paul Harrison) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] best practices for UDP and MTU In-Reply-To: <1051450584.25576.7.camel@lorien> Message-ID: On Sun, 27 Apr 2003, Adam Lydick wrote: > This might be slightly off topic, but I suspect that a lot of people > have had to answer this question already. > > What is the best way to choose max packet size for a UDP packet? > > I know that overlarge UDP packets will get fragmented on the IP level, > so IP MTU shouldn't be an issue. However, UDP packets can be thrown away > as needed, and I seem to remember that overlarge UDP packets can get > thrown away silently instead of being fragmented. > Any UDP packet can be discarded, but i've never heard of all UDP packets over a certain size being dropped. Of course, a single fragment being dropped in transit will prevent the entire UDP packet being reassembled, so large packets are more fragile. For example, suppose you send a packet of 60,000 bytes, path-mtu 1500, and the network is congested with 5% packet loss, then you've only got a 13% of the packets getting through. Optimal size would be a the path-MTU (minus packet headers etc) i guess, or an estimate thereof. re UDP over NAT... this way lies madness. Generally the router will expect a reply within a certain timelimit (maybe a minute) then reject replies after that, so a computer behind NAT should only ever be a client, and may be unreliable. Paul Email: pfh@csse.monash.edu.au one ring, no rulers, thecircle.org.au From bram at gawth.com Tue Apr 29 05:45:02 2003 From: bram at gawth.com (Bram Cohen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Developers Wanted In-Reply-To: <21DA6754A9238B48B92F39637EF307FD1C19A0@i2km41-ukdy.nat.bt.com> Message-ID: cefn.hoile@bt.com wrote: > A vacancy within our research and development team at BTexact in the UK > (http://www.btexact.com ) is now available. > > Please take a look at the following page to find out more about the post, > and how to apply. > > http://www.cefn.com/cefn/index.php?DTCJob I suspect that requiring an advanced degree excludes most of the people on this list (myself included). -Bram Cohen "Markets can remain irrational longer than you can remain solvent" -- John Maynard Keynes From badapple at netnitco.net Tue Apr 29 06:03:01 2003 From: badapple at netnitco.net (Fred Grott) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Developers Wanted References: Message-ID: <3EAE7741.2010101@netnitco.net> I have a side question to this.. it is slightly off topic so I apologize in advance for asking.. What is good source of notes or book on the mathematical analysis of Neural networks? Its been awhile, 10 years, since I have touched the subject.. Some of the references I can get from my copies of Penrose's books on some of the subject..but woudl liek to find more.. Bram Cohen wrote: >cefn.hoile@bt.com wrote: > > > >>A vacancy within our research and development team at BTexact in the UK >>(http://www.btexact.com ) is now available. >> >>Please take a look at the following page to find out more about the post, >>and how to apply. >> >>http://www.cefn.com/cefn/index.php?DTCJob >> >> > >I suspect that requiring an advanced degree excludes most of the people on >this list (myself included). > >-Bram Cohen > >"Markets can remain irrational longer than you can remain solvent" > -- John Maynard Keynes > >_______________________________________________ >p2p-hackers mailing list >p2p-hackers@zgp.org >http://zgp.org/mailman/listinfo/p2p-hackers > > > -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20030429/bd6e6716/attachment.htm From bert at web2peer.com Tue Apr 29 09:52:02 2003 From: bert at web2peer.com (bert@web2peer.com) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Neural Nets/SVM's Message-ID: <20030429095118.19887.h003.c001.wm@mail.web2peer.com.criticalpath.net> On Tue, 29 Apr 2003 07:59:45 -0500, Fred Grott wrote: >I have a side question to this.. >it is slightly off topic so I apologize in advance for asking.. >What is good source of notes or book on the mathematical analysis of Neural >networks? >Its been awhile, 10 years, since I have touched the subject.. >Some of the references I can get from my ?copies of Penrose's books >on some of the subject..but woudl liek to find more.. Neural nets are a largely outdated technology (and Penrose's books are pretty much useless speculation, IMO :-). You should look into Support Vector Machines, which effectively encompass neural nets and most other discriminative classifiers, and are based on a solid mathematical/statistical foundation. Though I can't recommend the book because I haven't read it, a popular introductory text is the following: AN INTRODUCTION TO SUPPORT VECTOR MACHINES (and other kernel-based learning methods) N. Cristianini and J. Shawe-Taylor Cambridge University Press, 2000 ISBN: 0 521 78019 5 http://www.support-vector.net Any recent proceedings of ICML will provide lots of papers with multiple references to other works on SVM's. It's been quite the hot topic in recent years. From sameh at sics.se Wed Apr 30 09:25:03 2003 From: sameh at sics.se (Sameh El-Ansary) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Overnet References: <20030430102907.2666.72651.Mailman@capsicum.zgp.org> Message-ID: <025901c30f34$fcca0580$bd410ac1@ad.sics.se> Hi there, Q1: Overnet say they are using a DHT. I could not find more info from their website. Anybody knows if they are using a particular one or any details about their implementation? Q2: Anybody compiled a list of DHT-based systems which are not only in research papers but have been implemented and have a considerable user base? Regards, ==================================== Sameh El-Ansary Researcher, Distributed Systems Lab. Swedish Institute of Computer Science(SICS) Box 1263, SE-164 29 Kista, Sweden Phone : +46 8 633 1583 Mobile: +46 73 0452197 Fax : +46 8 751 7230 http://www.sics.se/~sameh From mfreed at cs.nyu.edu Wed Apr 30 09:32:02 2003 From: mfreed at cs.nyu.edu (Michael J. Freedman) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Overnet In-Reply-To: <025901c30f34$fcca0580$bd410ac1@ad.sics.se> Message-ID: On Wed, 30 Apr 2003, Sameh El-Ansary wrote: > Date: Wed, 30 Apr 2003 18:24:34 +0200 > From: Sameh El-Ansary > Reply-To: p2p-hackers@zgp.org > To: p2p-hackers@zgp.org > Subject: [p2p-hackers] Overnet > > Hi there, > > Q1: Overnet say they are using a DHT. I could not find more info from their > website. Anybody knows if they are using a particular one or any details > about their implementation? Overnet is using their own implementation of the Kademlia DHT: http://kademlia.scs.cs.nyu.edu/ I do not know if the details of their implementation are public. > Q2: Anybody compiled a list of DHT-based systems which are not only in > research papers but have been implemented and have a considerable user > base? I do not know of any academic DHTs which are widely used other than Overnet/Kademlia. --mike ----- "Not all those who wander are lost." www.michaelfreedman.org From nieder at mail.ru Wed Apr 30 11:58:02 2003 From: nieder at mail.ru (Ricardo Niederberger Cabral) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Overnet In-Reply-To: References: <025901c30f34$fcca0580$bd410ac1@ad.sics.se> Message-ID: <20030430155716.64ac3118.nieder@mail.ru> On Wed, 30 Apr 2003 12:31:27 -0400 (EDT) "Michael J. Freedman" wrote: > > Q2: Anybody compiled a list of DHT-based systems which are not only in > > research papers but have been implemented and have a considerable user > > base? > I do not know of any academic DHTs which are widely used other than > Overnet/Kademlia. Also check the "Circle" [1]. It's not widely used, but definitely works. [1] http://www.thecircle.org.au/ Best regards, -- rnc From david.hansen at physik.fu-berlin.de Wed Apr 30 12:10:02 2003 From: david.hansen at physik.fu-berlin.de (David Hansen) Date: Sat Dec 9 22:12:20 2006 Subject: [p2p-hackers] Re: Overnet In-Reply-To: References: <025901c30f34$fcca0580$bd410ac1@ad.sics.se> Message-ID: <20030430190925.GA1016@robotron.ath.cx> On Wed, Apr 30 at 18:31+0200 Michael J. Freedman wrote: > On Wed, 30 Apr 2003, Sameh El-Ansary wrote: > > Q1: Overnet say they are using a DHT. I could not find more info > > from their website. Anybody knows if they are using a particular > > one or any details about their implementation? > > Overnet is using their own implementation of the Kademlia DHT: > > http://kademlia.scs.cs.nyu.edu/ > > I do not know if the details of their implementation are public. > Theres a free implementation of the Overnet Protocoll: http://www.nongnu.org/mldonkey/ But the documentation is quite short: http://savannah.nongnu.org/cgi-bin/viewcvs/mldonkey/mldonkey/docs/overnet.txt?rev=1.1&content-type=text/vnd.viewcvs-markup David -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 189 bytes Desc: not available Url : http://zgp.org/pipermail/p2p-hackers/attachments/20030430/5321e753/attachment.pgp