From decapita at dti.unimi.it Sat Jun 5 10:02:04 2004 From: decapita at dti.unimi.it (Sabrina De Capitani di Vimercati) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] REMINDER - WPES 2004: Deadline extension (June 17) Message-ID: [Apologies if you receive multiple copies of this message] CALL FOR PAPERS 3rd WORKSHOP ON PRIVACY IN THE ELECTRONIC SOCIETY Washington, DC, USA - October 28, 2004 Sponsored by ACM SIGSAC Held in association with 11th ACM CCS 2004 http://seclab.dti.unimi.it/wpes2004 ************************************************************************ Due to several requests the deadline is extended to June 17, 2004 (firm) ************************************************************************ 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 2004 Workshop is the third 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 two workshops in the series were held in Washington, in conjunction with the 9th ACM CCS conference and with the 10th ACM CCS conference, respectively. The success of the first two editions of the 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. Authors are invited to submit their contributions electronically through the web site http://seclab.dti.unimi.it/wpes2004/submissions.html. Submission must be in the form of a ps (Postscript), or pdf (Adobe) file. Do NOT submit files formatted for word processing packages (e.g., Microsoft Word or WordPerfect files). Papers must be received by the deadline of June 11, 2004 in order to be considered. Notification of acceptance or rejection will be sent to authors by August 2, 2004. Authors of accepted papers must guarantee that their paper will be presented at the workshop. Accepted papers will be published by the ACM in a conference proceedings. GENERAL CHAIR Vijay Atluri Rutgers University, USA email: atluri@andromeda.rutgers.edu PROGRAM CHAIRS Sabrina De Capitani di Vimercati Paul Syverson University of Milan Naval Research Laboratory email: samarati@dti.unimi.it url: www.syverson.org IMPORTANT DATES Paper Submission due: June 17, 2004 (NEW) Acceptance notification: August 2, 2004 Final papers due: August 30, 2004 PROGRAM COMMITTEE JC Cannon, Microsoft, USA Lorrie Cranor, Carnegie Mellon University, USA Ernesto Damiani, University of Milan, Italy George Danezis, University of Cambridge, UK Roger Dingledine, The Free Haven Project, USA Wenliang Du, Syracuse University, USA Philippe Golle, Palo Alto Research Center, USA Mike Gurski, Information & Privacy Commission/Ontario, Canada Susan Landau, Sun Microsystems Laboratories, USA Andreas Pfitzmann, Dresden University of Technology, Germany Andrew Patrick, National Research Council, Ottawa, Canada Marc Rennhard, ETH Zurich, Switzerland Pierangela Samarati, University of Milan, Italy Matthias Schunter, IBM Zurich Research Laboratory, Switzerland Tomas Sander, Hewlet Packard, USA Marianne Winslett, U. of Illinois Urbana-Champaign, USA From stephenn at sussex.ac.uk Sat Jun 5 20:48:09 2004 From: stephenn at sussex.ac.uk (Stephen Naicken) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella Simulator Message-ID: <40C23189.7090509@sussex.ac.uk> Hello, I am looking for a gnutella network simulator with some degree of extensibility. I have come across neurogrid, but I am having trouble getting the CVS code. Does the neurogrid stable build support gnutella and are there any other simulators? Thank you. Stephen. From sam at neurogrid.com Wed Jun 9 16:37:44 2004 From: sam at neurogrid.com (Sam Joseph) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella Simulator In-Reply-To: <40C23189.7090509@sussex.ac.uk> References: <40C23189.7090509@sussex.ac.uk> Message-ID: <40C73CD8.9020802@neurogrid.com> Hi Stephen, I run the NeuroGrid project - please mail me directly with more details about the difficulty you are having accessing CVS. Sourceforge is making anonymous access very low priority recently - however I could give you an account to get round that. The NeuroGrid simulator does support Gnutella, and indeed there are many other simulators. Please see the following article for a review of some of the different systems: http://p2pjournal.com/issues/November03.pdf - the first article "An Extendible Open Source P2P Simulator" CHEERS> SAM Stephen Naicken wrote: > Hello, > > I am looking for a gnutella network simulator with some degree of > extensibility. I have come across neurogrid, but I am having trouble > getting the CVS code. Does the neurogrid stable build support > gnutella and are there any other simulators? > > Thank you. > > Stephen. > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > > From mgp at ucla.edu Sat Jun 12 01:29:30 2004 From: mgp at ucla.edu (Michael Parker) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Flooding networks with garbage hashes? Message-ID: <40CA5C7A.5020307@ucla.edu> Hello :) It seems that for any serverless DHT p2p system that supports keyword-based searching, a critical problem would be malicious nodes just generating random hashes, presenting them as hashes of genuine keywords to the network, and forcing the closest nodes to these hashes to maintain useless references (since they don't know the hashes are arbitrary). Does anyone know if this is an issue with p2p systems that support this model in practice (e.g., eMule over Kademlia), and if not, how do they defend against it? Thanks, Michael Parker From bryan.turner at pobox.com Mon Jun 14 16:27:08 2004 From: bryan.turner at pobox.com (Bryan Turner) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Flooding networks with garbage hashes? In-Reply-To: <40CA5C7A.5020307@ucla.edu> Message-ID: Michael, Yes, this issue exists in today's networks. Kademlia-based protocols use an age-out (24 hours in the academic papers on Kademlia). Thus a node is restricted to owning an amount of keys equal to it's bandwidth over a 24 hour period. Not including packet overheads, this would equate to approximately 14 billion keys over a cable connection (256Kbps upstream). --Bryan bryan.turner@pobox.com -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Michael Parker Sent: Friday, June 11, 2004 9:30 PM To: p2p-hackers@zgp.org Subject: [p2p-hackers] Flooding networks with garbage hashes? Hello :) It seems that for any serverless DHT p2p system that supports keyword-based searching, a critical problem would be malicious nodes just generating random hashes, presenting them as hashes of genuine keywords to the network, and forcing the closest nodes to these hashes to maintain useless references (since they don't know the hashes are arbitrary). Does anyone know if this is an issue with p2p systems that support this model in practice (e.g., eMule over Kademlia), and if not, how do they defend against it? Thanks, Michael Parker From gbildson at limepeer.com Mon Jun 14 16:44:42 2004 From: gbildson at limepeer.com (Greg Bildson) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Flooding networks with garbage hashes? In-Reply-To: Message-ID: You might want to use a negative feedback list. We have something like this where we pass around alternate locations and downloaders pass an NALT list which contains a list of alternate locations that didn't work. If an upload source (in this case) receives 2 negative feedbacks on an alternate location, it will stop publishing it. Of course, this is a little more efficient when the source itself holds the index since a downloader would be connecting anyways. Thanks -greg -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Bryan Turner Sent: Monday, June 14, 2004 12:27 PM To: Peer-to-peer development. Subject: RE: [p2p-hackers] Flooding networks with garbage hashes? Michael, Yes, this issue exists in today's networks. Kademlia-based protocols use an age-out (24 hours in the academic papers on Kademlia). Thus a node is restricted to owning an amount of keys equal to it's bandwidth over a 24 hour period. Not including packet overheads, this would equate to approximately 14 billion keys over a cable connection (256Kbps upstream). --Bryan bryan.turner@pobox.com -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Michael Parker Sent: Friday, June 11, 2004 9:30 PM To: p2p-hackers@zgp.org Subject: [p2p-hackers] Flooding networks with garbage hashes? Hello :) It seems that for any serverless DHT p2p system that supports keyword-based searching, a critical problem would be malicious nodes just generating random hashes, presenting them as hashes of genuine keywords to the network, and forcing the closest nodes to these hashes to maintain useless references (since they don't know the hashes are arbitrary). Does anyone know if this is an issue with p2p systems that support this model in practice (e.g., eMule over Kademlia), and if not, how do they defend against it? Thanks, Michael Parker _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From bkn3 at columbia.edu Wed Jun 16 18:13:41 2004 From: bkn3 at columbia.edu (Brad Neuberg) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] P2P Sockets JavaOne Presentation Message-ID: <6.1.0.6.2.20040616110131.0b790ea8@pop.mail.yahoo.com> Hi folks. I just wanted to invite anyone who may be at JavaOne in a few weeks to drop by our P2P Sockets presentation. Here is some info on what P2P Sockets is and what the presentation will be about. What is P2P Sockets? --------------------------------- P2P Sockets makes it easy to write peer-to-peer applications based on JXTA. P2P Sockets allows programmers to gain much of the power of JXTA, such as NAT and firewall traversal, without being exposed to its complexity. It does this through ports of popular software projects, such as a web server and web services stack, to work on the JXTA peer-to-peer network. This includes a web server (Jetty) that can receive requests and serve content over the peer-to-peer network; a servlet and JSP engine (Jetty and Jasper) that allows existing servlets and JSPs to serve P2P clients; an XML-RPC client and server (Apache XML-RPC) for accessing and exposing P2P XML-RPC endpoints; an HTTP/1.1 client (Apache Commons HTTP-Client) that can access P2P web servers; a gateway (Smart Cache) to make it possible for existing browsers to access P2P web sites; and a WikiWiki (JSPWiki) that can be used to host WikiWikis on your local machine that other peers can access and edit through the P2P network. P2P Sockets also introduces implementations of java.net.Socket and java.net.ServerSocket that can work on the JXTA network as well as a simple, light-weight, distributed, human-friendly, and non-secure DNS system. The web page for P2P Sockets is at http://p2psockets.jxta.org What will the presentation be about? ----------------------------------------------------- Topic: Intriguing and Unexpected: New and Cool ID: TS-1176 Speakers: Brad Neuberg Senior Software Engineer, Rojo Developer, Paper Airplane Abstract: Would you like to use your existing JavaTM 2 Platform, Enterprise Edition (J2EETM) skills to create peer-to-peer programs? Want to experiment with network applications that work seamlessly out of the box, without having to maintain or set up web or DNS servers? Are you interested in open-source and free technologies? The P2P Sockets Project easily integrates disparate machines and protocols, and imbues programmers with JXTATM peer-to-peer technologies without having to abandon their J2EE platform knowledge. P2P Sockets is an open-source web service stack ported to run on the JXTA P2P network. Every P2P Sockets node runs a web server that can expose peer functionality using industry standard technologies, such as servlets, JavaServer PagesTM (JSPTM), and XML-RPC. P2P Sockets includes a light-weight, distributed domain name system in which peers work together to resolve site names, seamlessly creating ad hoc networks without setting up capital and time intensive web or DNS servers. P2P Sockets also bundles powerful deployment technologies which can significantly lower costs and free system administrators from tedious configuration. Peers automatically discover their network environment and configure themselves appropriately. This presentation is given by one of the originators of the P2P Sockets Project. By the end of this talk, developers will be ready to create affordable standards-compliant P2P applications using their existing J2EE platform skill-sets; be given several working P2P Sockets applications and taken through their complete development lifecycle, from architecture and design, to implementation, and finally to deployment; be shown the JXTA Profiler, which eases deployment and maintenance by automatically discovering a peer's network conditions, such as whether it is behind a Network Address Translator (NAT) device, and configuring and connecting to the P2P network without user or administrator intervention; and be educated on when it is appropriate or inappropriate to use P2P Sockets for a given problem. Attendees are expected to know Java sockets and server sockets; servlets, JSP technology, and XML-RPC technologies; basic peer-to-peer concepts and issues, such as problems with Network Address Translator (NAT) devices; and have basic familiarity with JXTA technology. The presentation is already online and can be viewed in OpenOffice format at http://p2psockets.jxta.org/source/browse/p2psockets/www/docs/tutorials/1176neuberg.sxi?rev=1.2. If you have any feedback before the presentation that would be great; I'll try to incorporate it. I hope to see people there! Say hi if you make it. Hope all is well, Brad Neuberg bkn3@columbia.edu -------------- next part -------------- An HTML attachment was scrubbed... URL: http://zgp.org/pipermail/p2p-hackers/attachments/20040616/f9ee009c/attachment.html From j.salter at eim.surrey.ac.uk Thu Jun 17 14:54:12 2004 From: j.salter at eim.surrey.ac.uk (James Salter) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Chord routing failure Message-ID: <3201.131.227.68.240.1087484052.squirrel@131.227.68.240> Hi everybody, I'm looking for some help with explaining some experimental results I've been puzzling over recently: How would increasing the size of a Chord ring e.g. from 2^10 to 2^12 nodes impact the probability that a lookup could be routed successfully, ignoring the use of successor lists? I'm assuming that each node in the ring has an equal probability of being targeted by the lookup. On one hand, increasing the size of the ring means in the average case a lookup will pass through more nodes. Assuming each node has the same probability of failure, the probability of the lookup encountering a failed node in the path is increased. Then again, I think that more lookups would be resolved in less than the average path length and more would be resolved in greater than the average path length. Do these average out? Increasing the size of the ring also increases the number of finger table entries and therefore potentially the number of choices of path the lookup can take towards its target, suggesting the probability of a lookup being unable to proceed when it encountered a failed node is decreased. Do these factors cancel each other out? Would the probability that a lookup (meaning any lookup, not just average-case lookups) fails therefore be the same no matter the size of the ring, if we assume each node in the ring has the same probability of failure? Or would the probability of lookup failure increase/decrease as the size of the Chord ring increases? My experimental results seem to suggest the probability of lookup routing failure is independent of the size of the Chord ring. Any help with this puzzle would be greatly appreciated! Thanks James Salter From ian at locut.us Fri Jun 18 12:47:49 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Addressing the RNF problem Message-ID: <40D2E475.2090402@locut.us> I have noticed that it takes my node several days before it stops getting a huge number of RNFs - and I suspect the reason is that most nodes in seednodes.ref are heavily backed-off, so the node has to wait until it stumbles on some nodes which aren't. Possible solutions: Assimilation requests don't need to respect MRIs, and a node is encouraged to assimilate if it is getting RNFs. Pre-filter the nodes in the seednodes.ref list such that only those with reasonable MRIs get in. Thoughts? Ian. From eugen at leitl.org Fri Jun 18 16:12:35 2004 From: eugen at leitl.org (Eugen Leitl) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Declan talks to Zennstrom about Skype Message-ID: <20040618161235.GE12847@leitl.org> http://gizmodo-cnet.com.com/2008-7352_3-5112783.html Skype's VoIP ambitions By Declan McCullagh Staff Writer, CNET News.com http://news.com.com/2008-7352-5112783.html Story last modified December 2, 2003, 1:30 PM PST Niklas Zennstrom may be Sweden's most famous serial entrepreneur. The 37-year-old Stockholm resident co-authored the legendary software used in the Kazaa file-sharing network. After he and his partners sold the rights to Kazaa last year, Zennstrom turned his attention to Joltid, which sells a caching technology to help network providers deal with the growing amount of peer-to-peer traffic. Now Zennstrom and Kazaa co-creator Janus Friis have launched their most ambitious effort so far: Skype, a start-up that hopes to convince people to use voice over Internet Protocol (VoIP) technology instead of the traditional phone system. CNET News.com recently spoke to Zennstrom, Skype's chief executive, in Stockholm about VoIP, privacy, security, and the lessons he's learned from his other start-ups. Q: What's different about Skype? Lots of instant-messaging clients already offer voice communications. A: We don't see them as competitors. We see our competitors as being Deutsche Telecom, British Telecom, AT&T and Verizon. We think there's going to be a migration from circuit-switched telephony services to Internet telephony. This is a second kind of driver for broadband. P2P file sharing has been driving broadband adoption. I've been meeting a lot of Internet operators in Europe and they say users aren't getting broadband to check their e-mail. Broadband penetration in Europe is around 10 percent to 12 percent. The U.K. is only around 4 percent. It has a long way to go to reach dial-up. One way to do that is to make it more useful. Are you hoping to sign distribution deals with Internet providers? Absolutely. We're speaking to a few broadband operators right now. They're quite interested in offering Skype to their users. Will Skype continue to be free? Now it's free--it's free in the beta phase. When we launch it'll continue to be free. We think it's very, very important that people can use it for free and for the momentum to grow. We want people to spread it around. We have to be very good in up-selling users to premium services like voice mail and conference calling. That's what people are asking for. One of the great things about P2P for this product is that we don't have any incremental cost for a new user. There's no marketing because we don't run marketing campaigns. It's being spread virally by users. We don't have any operational costs because they make calls peer-to-peer. It doesn't cost us any more. You permit mirror sites? Yes. We're encouraging people to spread this to each other. Then we have an established base of users. If we can encourage a few percent of people to get premium services, that's an advantage to us. What we're saying is that telephony is just an application. You can use this software application that does all the call setup and routing, which traditionally has been done by big company switches. Telephony is software. It's not big software in a centralized system. It's software that people run on their laptops at home. What we're saying is that telephony is just an application. How do you keep track of who's logged in and able to receive voice calls? We have a distributed database on the P2P network that keeps track of your IP address, firewall condition, and so on. We've taken (Kazaa's) FastTrack concept of supernodes and taken it one step further. Are there any privacy implications to this public database approach? There would be a privacy consideration if you and I are talking to each other and it's being proxied through John. That's why calls are being end-to-end encrypted. I can check my e-mail from anywhere in the world and senders don't know where I am. I can answer my cell phone from any GSM country and callers don't know where I am. But when I connect to Skype to receive phone calls, my IP address becomes public, which tends to reveal details about my physical location. The way for me to find your IP address would be when I set up a phone call to you, I see your IP address if it's a direct connection. If you're using a proxy server, I won't. Let's say I'm trying to track someone--in a divorce case, I want to prove that a spouse is in Stockholm when he or she is supposed to be in New York City. If I monitor the public Skype database over time, I can roughly follow their movements secretly. It's not an "anonymized" system. For some people it could be labeled as a privacy issue. That has never been any design goal. Your advice for divorcees? I would recommend that you set up all your Internet connections through a proxy server. How many downloads have you had? We've had 1.6 million downloads. That's not 1.6 million people. I think there are around 900,000 registered users. People are downloading multiple versions? This is the same ratio that you see at Download.com (Download.com is owned by CNET Networks, publisher of News.com). There are usually about twice as many downloads as users. People are either downloading multiple versions or initiating the download again. Compare that to Free World Dialup. It's growing considerably faster than that. When will you have a gateway to the telephone network? We're working on it...It's something that's going to be much later on. When? The interesting thing is that in the feedback we get from users this is not the highest priority. They're more interested in conference calling and voice mail. People are much more comfortable with using the Internet for communications. People are being much more mature with the Internet. They say, "This is my primary way to communicate. The people that I'm calling I'm encouraging them to get on Skype." People are quite happy with that. If you had to set a date? Next year. How much have you received in seed funding? We haven't disclosed how much we raised. But it's the normal seed funding. We haven't raised tens of millions. Are you funding any of this yourself? No. Just hard labor and things like that. We had the Draper family--Bill Draper--as investors from the beginning. You said Skype is different from IM voice clients. How about P2P voice clients, such as PGPfone, which is encrypted, free, open source, and has been available for years? When we're talking about peer to peer it's much more today. It's a self-organizing network that can adapt itself to different firewall configurations and network address translation boxes. You cannot set up a direct connection in most cases. The problem is that there are a lot of different configurations. Some routers allow outgoing connections but not incoming. Some others allow UDP (User Datagram Protocol) connections. Others allow TCP (Transmission Control Protocol). Most existing Internet telephony applications don't work that well in consumer environments. How does Skype get around that? We're setting up hot standby connections. We set up four, maybe five standby paths. When both parties are behind NATs (Network Address Translation), they can't actually set up a connection between each other. It's being synchronized. It works sometimes. Sometimes? It only works sometimes. It depends on the routers. What lessons have you learned from your experience with Kazaa and FastTrack? It's quite amazing that when you do something that catches on over the Internet you get people all over the world to use it. Several lessons. One thing is that the whole viral effect--when you do something that works virally you can get a lot of people using it. It's quite amazing that when you do something that catches on over the Internet you get people all over the world to use it. You should not try to do things that are artificially viral like an "Invite a friend to use this service" feature. Those don't really work. We've had that feature on Skype but it doesn't really bring in the users. The product has to be fundamentally viral in itself. How many supernodes share the Skype database? It grows. There are a few hundred clients per supernode. How do you become one? You have to qualify to be a supernode. You have to have enough memory, bandwidth, and a good uptime. Then you're connected to supernodes. If they feel that they're getting too much load they tell the other clients around them, "Can you help me out?" It's a distributed process which is not centrally run. What happens if someone sets up a malicious supernode with false "phone number" data? First of all, the data is populated by the users themselves. What we do in Skype is have all users' identities protected in a public key infrastructure. In order to avoid malicious supernodes or people saying, "I am Nicholas," they have to do a challenge response saying that the keys are correct. What you want to avoid is identity theft. What happens if someone creates and distributes, say, Skype Lite, which recognizes user IDs "minted" by someone else? That's so much fun. On Slashdot, people are saying, "I'm not going to touch this," saying they don't want the advertisements (on Skype) and will wait for Skype Lite. But there are no advertisements. OK, say someone makes a hacked version. You and I wouldn't be able to set up calls with each other. We'd both need the hacked version. Are you afraid of intruders targeting your server that signs user ID keys? The signing server is like Fort Knox. Where's it located? I won't tell you. That's kind of a sensitive part of (the company). It's very, very secure. Will we ever see a Skype telephone? We have a phone that plugs into the USB port that's working now. How about an 802.11 Wi-Fi phone running Skype? That's a natural step to take later on. On cell phones too? The cellular phone is a relatively closed platform. I have a Nokia phone with Java but it doesn't give you access to the IP stack. (For competitive reasons) they're going to make sure that the telephone is very, very closed--though 802.11 phones are eventually going to be affordable in the next year or so. Where do you hope to make money from Skype users? This is software. Our business model is to sell value-added services. It doesn't matter what client you're going to use--whether it's a Windows client or a PDA client or an embedded client. Any plans for Macintosh or 'nix versions? That's one of the things we have on our wish list. We don't have any release date planned. Are you targeting business users as well as individuals? We're starting with individuals. We're doing this bottom up. It's grassroots for businesses too. It's being used by business clients already but not through the IT departments. News.com ran an article a few months ago talking about how the FBI wants to force VoIP providers to make their networks subject to wiretaps. If it gets adopted, what would this proposal mean for you? The landscape is changing. In the old world you had issues like lawful interception of telephone calls. In Sweden the police can get a court order and wiretap a telephone call if the crime would lead to six years in jail or something like that. And if the Swedish police came to you? We cannot do anything because we don't have access to the data stream. The old way of thinking was easy. You'd go to the local telephone company and they'd get a wiretap. That's not a problem because the telephone service owns the infrastructure, provides the service, and operates in one country. The Internet is a bit different. What you would have to do is to go to the Internet service provider. Assume the police can get a court order and conduct the tap. But the Skype conversation is encrypted and they only can hear gibberish. I'm just trying to say in general what the issues are. I don't have a solution. In general it's not as clear cut as it was in old POTS (plain old telephone service) days. My point is that it's not as easy as it was before. Have you been contacted by any law enforcement or national security agency? No. What if we got contacted by the Chinese government, or the U.S. government, or North Korea, or the Swedish? If you're operating something that's only available in one country it's an easy clear-cut case. But if it's available worldwide, that's different. Even Phil Zimmermann, inventor of PGP (Pretty Good Privacy), has said he's concerned about terrorists using his software to plot crimes. He concluded, though, that the benefits outweigh the negatives. How about you? The Internet is great. There's a lot of bad things happening on it but it's still great. If you were a sophisticated criminal and you really wanted to hide away, then you should probably not use something that is a commercially closed source system such as Skype. I don't think this is an issue. If the FBI or Europol came to you and said, "We order you to include a secret backdoor for unencrypted wiretapping in the next version of Skype," what would you do? I don't have the answer to that. Obviously we would work with authorities in whatever jurisdiction we would be subject to. Sure, we would sit down and talk to them. But we would not just say here's the backdoor and just bluntly do it. Currently Skype is not subject to telecommunications regulation, therefore we do not have any legal obligation to provide any means for interception. This is software that's not any different from e-mail or chat. -- Eugen* Leitl leitl ______________________________________________________________ ICBM: 48.07078, 11.61144 http://www.leitl.org 8B29F6BE: 099D 78BA 2FD3 B014 B08A 7779 75B0 2443 8B29 F6BE http://moleculardevices.org http://nanomachines.net -------------- next part -------------- A non-text attachment was scrubbed... Name: not available Type: application/pgp-signature Size: 198 bytes Desc: not available Url : http://zgp.org/pipermail/p2p-hackers/attachments/20040618/a5c9d430/attachment.pgp From nazareno at dsc.ufcg.edu.br Fri Jun 18 21:07:43 2004 From: nazareno at dsc.ufcg.edu.br (Nazareno Andrade) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Hacks in bittorrent Message-ID: <40D3599F.4090009@dsc.ufcg.edu.br> Hi there. I've come across a quote from Brian Cohen (bittorrent's author) saying that lots of users have been trying to hack their clients to send wrong information to the trackers regarding upload bandwidth, in spite of the fact that doing that is useless. However, in a quick search, I could find no available hacks for doing that. I'm wondering about the popularity of such hacks, and the effect they have on measurement studies of bittorrent based on the trackers. Would anybody have thoughts on that? cheers, -- Nazareno. ======================================== Nazareno Andrade LSD - DSC/UFCG Campina Grande - Brazil http://lsd.dsc.ufcg.edu.br/~nazareno/ OurGrid project http://www.ourgrid.org ======================================== From ian at locut.us Sat Jun 19 07:28:53 2004 From: ian at locut.us (Ian Clarke) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Addressing the RNF problem In-Reply-To: <40D2E475.2090402@locut.us> References: <40D2E475.2090402@locut.us> Message-ID: <40D3EB35.2040503@locut.us> Doh, just realised that this went to the wrong mailing list - it was intended for Freenet-devl. Sorry to anyone that was confused by this, Ian. Ian Clarke wrote: > I have noticed that it takes my node several days before it stops > getting a huge number of RNFs - and I suspect the reason is that most > nodes in seednodes.ref are heavily backed-off, so the node has to wait > until it stumbles on some nodes which aren't. > > Possible solutions: > > Assimilation requests don't need to respect MRIs, and a node is > encouraged to assimilate if it is getting RNFs. > > Pre-filter the nodes in the seednodes.ref list such that only those with > reasonable MRIs get in. From Yves.Roudier at eurecom.fr Mon Jun 21 17:25:26 2004 From: Yves.Roudier at eurecom.fr (Yves.Roudier@eurecom.fr) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] ESORICS 2004 - Call for Participation Message-ID: <200406211725.i5LHPQrp029404@zinnia.eurecom.fr> [Apologies for multiple copies of this announcement] CALL FOR PARTICIPATION ESORICS 2004 9th European Symposium on Research in Computer Security Sponsored by SAP and @sec Institut Eurecom, Sophia Antipolis, French Riviera, France September 13-15, 2004 http://esorics04.eurecom.fr ESORICS 2004 will be collocated with RAID 2004 ============================================================================== IMPORTANT NOTICE: special hotel rates have been negotiated, but the deadline for some hotels is June 30. Please check the hotel information at: http://esorics04.eurecom.fr/Hotels.htm ============================================================================== ******************************************* EARLY REGISTRATION DEADLINE: July 20, 2004 ******************************************* Since 1990, ESORICS has been confirmed as the European research event in computer security, attracting audience from both the academic and industrial communities. The symposium has established itself as one of the premiere, international gatherings on Information Assurance. This year's three days program will feature a single technical track with 27 full papers selected from almost 170 submissions. PRELIMINARY PROGRAM ------------------- Monday, September 13th ====================== 09:15 - 09:30 opening remarks 09:30 - 10:30 invited talk 10:30 - 11:00 coffee break 11:00 - 12:30 Access control -------------- Incorporating Dynamic Constraints in the Flexible Authorization Framework Shiping Chen, Duminda Wijesekera, Sushil Jajodia Access-Condition-Table-driven Access Control for XML Database Naizhen Qi, Michiharu Kudo An Algebra for Composing Enterprise Privacy Policies Michael Backes, Markus Duermuth, Rainer Steinwandt 12:30 - 14:00 lunch 14:00 - 15:30 Cryptographic protocols ----------------------- Deriving, attacking and defending the GDOI protocol Catherine Meadows, Dusko Pavlovic Better Privacy for Trusted Computing Platforms Jan Camenisch A Cryptographically Sound Dolev-Yao Style Security Proof of the Otway-Rees Protocol Michael Backes 15:30 - 16:00 coffee break 16:00 - 17:30 Anonymity and information hiding -------------------------------- A Formalization of Anonymity and Onion Routing Sjouke Mauw, Jan Verschuren, Erik de Vink Breaking Cauchy Model-based JPEG Steganography with First Order Statistics Rainer Böhme, Andreas Westfeld Comparison between two practical mix designs Claudia Diaz, Len Sassaman, Evelyne Dewitte Tuesday, September 14th ======================= 09:00 - 10:30 Distributed data protection --------------------------- Signature Bouquets: Immutability for Aggregated/Condensed Signatures Einar Mykletun, Maithili Narasimha, Gene Tsudik Towards a theory of data entanglement James Aspnes, Joan Feigenbaum, Aleksandr Yampolskiy, Sheng Zhong Portable and Flexible Document Access Control Mechanisms Mikhail Atallah, Marina Bykova 10:30 - 11:00 coffee break 11:00 - 12:30 Information flow and security properties ---------------------------------------- Possibilistic Information Flow Control in the Presence of Encrypted Communication Dieter Hutter, Axel Schairer Information flow control revisited: Noninfluence = Noninterference + Nonleakage David von Oheimb Security Property Based Administrative Controls Jon A. Solworth, Robert H. Sloan 12:30 - 14:00 lunch 14:00 - 15:30 Authentication and trust management ----------------------------------- A Vector Model of Trust for Developing Trustworthy Systems Indrajit Ray, Sudip Chakraborty Parameterized Authentication Michael J. Covington, Mustaque Ahamad, Irfan Essa, H. Venkateswaran Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks Bulent Yener, Seyit A. Camtepe 15:30 - 16:00 coffee break 16:00 - 17:30 Cryptography ------------ IPv6 Opportunistic Encryption Claude Castelluccia, Gabriel Montenegro, Julien Laganier, Christoph Neumann On the role of key schedules in attacks on iterated ciphers Lars R. Knudsen, John E. Mathiassen A Public-Key Encryption Scheme with Pseudo-Random Ciphertexts Bodo Moller Wednesday, September 15th ========================= 09:00 - 10:30 Operating systems and architecture ---------------------------------- A Host Intrusion Prevention System for Windows Operating Systems Roberto Battistoni, Emanuele Gabrielli, Luigi Vincenzo Mancini Re-establishing Trust in Compromised Systems: Recovering from Rootkits that Trojan the System Call Table Julian Grizzard, John Levine, Henry Owen ARCHERR: Runtime Environment Driven Program Safety Ramkumar Chinchani, Anusha Iyer, Bharat Jayaraman, Shambhu Upadhyaya 10:30 - 11:00 coffee break 11:00 - 12:30 Intrusion detection ------------------- Sets, Bags, and Rock and Roll Analyzing Large Data Sets of Network Data John McHugh Redundancy and diversity in security Bev Littlewood, Lorenzo Strigini Discover Novel Attack Strategies from INFOSEC Alerts Xinzhou Qin, Wenke Lee ORGANIZING COMMITTEE -------------------- General Chair Refik Molva Institut Eurecom email: Refik.Molva@eurecom.fr Program Chairs Peter Ryan Pierangela Samarati University of Newcastle upon Tyne University of Milan email: Peter.Ryan@newcastle.ac.uk email: samarati@dti.unimi.it Publication Chair Publicity Chair Dieter Gollmann Yves Roudier TU Hamburg-Harburg Institut Eurecom email: diego@tuhh.de email: roudier@eurecom.fr Sponsoring Chair Marc Dacier Institut Eurecom email: dacier@eurecom.fr PROGRAM COMMITTEE ----------------- Vijay Atluri, Rutgers University, USA Joachim Biskup, Universitaet Dortmund, Germany Jan Camenisch, IBM Research, Switzerland David Chadwick, University of Salford, UK Ernesto Damiani, University of Milan, Italy Sabrina De Capitani di Vimercati, University of Milan, Italy Yves Deswarte, LAAS-CNRS, France Alberto Escudero-Pascual, Royal Institute of Technology, Sweden Simon Foley, University College Cork, Ireland Dieter Gollmann, TU Hamburg-Harburg, Germany Joshua D. Guttman, MITRE, USA Sushil Jajodia, George Mason University, USA Sokratis K. Katsikas, University of the Aegean, Greece Peng Liu, Pennsylvania State University, USA Javier Lopez, University of Malaga, Spain Roy Maxion, Carnegie Mellon University, USA Patrick McDaniel, AT&T Labs-Research, USA John McHugh, CERT/CC, USA Catherine A. Meadows, Naval Research Lab, USA Refik Molva, Institut Eurecom, France Peng Ning, NC State University, USA LouAnna Notargiacomo, The MITRE Corporation, USA Eiji Okamoto, University of Tsukuba, Japan Stefano Paraboschi, University of Bergamo, Italy Andreas Pfitzmann, TU Dresden, Germany Jean-Jacques Quisquater, Microelectronic laboratory, Belgium Steve Schneider, University of London, UK Christoph Schuba, Sun Microsystems, Inc., USA Michael Steiner, IBM T.J. Watson Research Laboratory, USA Paul Syverson, Naval Research Laboratory, USA Moti Yung, Columbia University, USA VENUE / TRAVEL -------------- ESORICS 2004 will be held on the French Riviera coast, about 20 km West of Nice and 15 km Northeast of Cannes. The conference will take place at Institut Eurecom / CICA, in the Sophia Antipolis science park, which can easily be reached thanks to the nearby Nice international airport. For more information, refer to: http://esorics04.eurecom.fr/visitor_information.html IMPORTANT DATES --------------- Special rates for hotels: see http://esorics04.eurecom.fr/Hotels.htm Early registration before: July 20, 2004 (see http://esorics04.eurecom.fr/register.html) From Yves.Roudier at eurecom.fr Mon Jun 21 17:25:52 2004 From: Yves.Roudier at eurecom.fr (Yves.Roudier@eurecom.fr) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] RAID 2004 - Call for Participation Message-ID: <200406211725.i5LHPqQh029497@zinnia.eurecom.fr> [Apologies for multiple copies of this announcement] CALL FOR PARTICIPATION RAID 2004 "Intrusion Detection and Society" Seventh International Symposium on Recent Advances in Intrusion Detection Sponsored by SAP and France Telecom Institut Eurecom, Sophia-Antipolis, French Riviera, France September 15-17, 2004 http://raid04.eurecom.fr RAID 2004 will be collocated with ESORICS 2004 ============================================================================== IMPORTANT NOTICE: special hotel rates have been negotiated, but the deadline for some hotels is June 30. Please check the hotel information at: http://raid04.eurecom.fr/Hotels.htm ============================================================================== ******************************************* EARLY REGISTRATION DEADLINE: July 20, 2004 ******************************************* The RAID symposium brings together leading researchers and practitioners from academia, government, and industry to discuss intrusion detection technologies and issues from research and commercial perspectives. This year's program features a single technical track with 14 full papers and 2 practical experience reports selected from almost 120 submissions. It also includes invited speakers, a poster session as well as an abstracts' session. The abstracts' session offers attendees the opportunity to present preliminary research results or summaries of work published elsewhere. Poster presentations of similar research results are also possible on Wednesday evening. Abstract submissions from people not presenting posters are also welcome. Submissions to either poster or abstract session should be sent to . For details see http://raid04.eurecom.fr/ . PRELIMINARY PROGRAM ------------------- Wednesday, September 15th ========================= 09.00 Registration opens 12.30 Lunch 14.00 - 14.15 Welcome 14.15 - 15.15 Invited Talk Bruce Schneier, Counterpane Internet Security, CA, USA 15.15 - 15.45 Coffee break 15.45 - 16.45 Modelling process behaviour - Chair: Alfonso Valdes, (SRI International, USA) Automatic Extraction of Accurate Application-Specific Sandboxing Policy, Lap-chung Lam and Tzi-cker Chiueh, Rether Networks Inc., Centereach N.Y., USA Context Sensitive Anomaly Monitoring of Process Control Flow to Detect Mimicry Attacks and Impossible Paths, Haizhi Xu, Wenliang Du, and Steve J. Chapin, Systems Assurance Institute, Syracuse University, USA 16.45 - 17.00 Break 17.00 - 18.00 Abstract session 18.00 - Poster session Thursday, September 16th ======================== 09.00 - 10.30 Detecting Worms and Viruses - Chair: John McHugh (CMU/SEI CERT, USA) HoneyStat: Local Worm Detection Using Honeypots, David Dagon, Xinzhou Qin, Guofei Gu, Julian Grizzard, John Levine, Wenke Lee, and Henry Owen, Georgia Institute of Technology, USA Fast Detection of Scanning Worm Infections, Jaeyeon Jung (1), Stuart E. Schechter (2), and Arthur W. Berger (1), (1) MIT CSAIL, USA (2) Harvard DEAS, USA. Detecting Unknown Massive Mailing Viruses Using Proactive Methods Ruiqi Hu and Aloysius K. Mok, Dept of Computer Sciences, University of Texas at Austin, USA 10.30 - 11.00 Coffee break 11.00 - 12.30 Attack and Alert Analysis - Chair: Diego Zamboni (IBM Research, Switzerland) Using Adaptive Alert Classification to Reduce False Positives in Intrusion Detection, Tadeusz Pietraszek, IBM Zürich Research Laboratory, Switzerland. Attack Analysis and Detection for Ad Hoc Routing Protocols Yi-an Huang, Wenke Lee, College of Computing, Georgia Institute of Technology, USA. On the Design and Use of Internet Sinks for Network Abuse Monitoring Vinod Yegneswaran (1), Paul Barford (1), Dave Plonka (2), (1) Dept of Computer Science, University of Wisconsin, Madison, USA, (2) Dept of Information Technology, University of Wisconsin, Madison, USA 12.30 - 14.00 Lunch 14.00 - 15.00 Invited Talk: TBD 15.00 - 15.30 Coffee break 15.30 - 16.30 Practical Experience - Chair: Hakan Kvarnstrom (TeliaSonera R&D, Sweden) Monitoring IDS Background Noise Using EWMA Control Charts and Alert Information Jouni Viinikka and Herve Debar, France Telecom R&D, Caen, France Experience with a Commercial Deception System, Brian Hernacki, Jeremy Bennett, Thomas Lofgren, Symantec Corporation, Redwood City, USA 16.30 - 17.30 Poster session Friday, September 17th ====================== 09.00 - 10.30 Anomaly Detection - Chair: Christopher Kruegel, (Technical University of Vienna, Austria) Anomalous Payload-based Network Intrusion Detection Ke Wang Salvatore J. Stolfo, Computer Science Dept, Columbia University, USA Anomaly Detection Using Layered Networks Based on Eigen Co-occurrence Matrix Mizuki Oka (1), Yoshihiro Oyama (2,3), Hirotake Abe (1), and Kazuhiko Kato (1,3), (1) University of Tsukuba, Japan, (2) University of Tokyo, Japan, (3) Japan Science and Technology Cooperation, Japan Seurat: A Pointillist Approach to Anomaly Detection Yinglian Xie (1), Hyang-Ah Kim (1), David R. O'Hallaron (1,2) Michael K. Reiter (1,2), and Hui Zhang (1,2), (1) Dept of Computer Science, Carnegie-Mellon University, USA (2) Dept of Electrical and Computer Engineering, Carnegie-Mellon University, USA 10.30 - 11.00 Coffee Break 11.00 - 12.30 Formal Analysis for Intrusion Detection - Chair: Wenke Lee (Georgia Tech, USA) Detection of Interactive Stepping Stones with Maximum Delay Bound: Algorithms and Confidence Bounds Avrim Blum, Dawn Song, Shobha Venkataraman Carnegie Mellon University, USA. Formal Reasoning about Intrusion Detection Systems Tao Song (1), Calvin Ko (2), Jim Alves-Foss (3), Cui Zhang (4), and Karl Levitt (1), (1) Computer Security Laboratory, University of California, Davis, USA, (2) NAI LAbs, Network Associates Inc., Santa Clara, CA, USA, (3) Center for Secure and Dependable Systems, University of Idaho, USA (4) Computer Science Dept, California State University, Sacramento, USA. RheoStat : Real-time Risk Management Ashish Gehani and Gershon Kedem, Dept of Computer Science, Duke University, USA 12.30 - 12.45 Concluding remarks 12.45 - 14.00 Lunch ORGANIZING COMMITTEE -------------------- General Chair: Refik Molva Program Chairs: Erland Jonsson Alfonso Valdes Publication Chair: Magnus Almgren Publicity Chair: Yves Roudier Sponsor Chair: Marc Dacier PROGRAM COMMITTEE ----------------- Tatsuya Baba (NTT Data, Japan) Lee Badger (DARPA, USA) Sungdeok Cha (KAIST, Korea) Steven Cheung (SRI International, USA) Herve Debar (France Telecom R&D, France) Simone Fischer-Hubner (Karlstad University, Sweden) Steven Furnell (University of Plymouth, UK) Bill Hutchinson (Edith Cowan University, Australia) Dogan Kesdogan (RWTH Aachen, Germany) Chris Kruegel (Technical University of Vienna, Austria) Hakan Kvarnstrom (TeliaSonera R&D, Sweden) Wenke Lee (Georgia Tech, USA) Douglas Maughan (DHS HSARPA, USA) Roy Maxion (Carnegie Mellon University, USA) John McHugh (CMU/SEI CERT, USA) Ludovic Me (Supelec, France) George Mohay (Queensland University of Technology, Australia) Vern Paxson (ICSI and LBNL, USA) Giovanni Vigna (UCSB, USA) Andreas Wespi (IBM Research, Switzerland) Felix Wu (UC Davis, USA) Diego Zamboni (IBM Research, Switzerland) STEERING COMMITTEE ------------------ Chair: Marc Dacier (Eurecom, France) Herve Debar (France Telecom R&D, France) Deborah Frincke (University of Idaho, USA) Huang Ming-Yuh (The Boeing Company, USA) Wenke Lee (Georgia Institute of Technology, USA) Ludovic Me (Supelec, France) S. Felix Wu (UC Davis, USA) Andreas Wespi (IBM Research, Switzerland) Giovanni Vigna (UCSB, USA) VENUE / TRAVEL -------------- RAID 2004 will be held on the French Riviera coast, about 20 km West of Nice and 15 km Northeast of Cannes. The conference will take place at Institut Eurecom / CICA, in the Sophia Antipolis science park, which can easily be reached thanks to the nearby Nice international airport. For more information, refer to: http://raid04.eurecom.fr/visitor_information.html IMPORTANT DATES --------------- Deadlines for special rates for hotels : see http://raid04.eurecom.fr/Hotels.htm Deadline for early registration : July 20, 2004 Deadline for abstract/poster submission : August 30, 2004 (contact: Marc Dacier ) RAID conference dates : September 15-17, 2004 From aloeser at cs.tu-berlin.de Tue Jun 22 16:04:23 2004 From: aloeser at cs.tu-berlin.de (Alexander =?iso-8859-1?Q?L=F6ser?=) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data References: <40D2E475.2090402@locut.us> Message-ID: <40D85887.FA3DC4E5@cs.tu-berlin.de> Hi, does anybody know where to get crawling data from the gnutella/limwire network including for each IP adress the queries and the stored content for a certain time intervall? I found many research papers, presentations and reports but no real data to prove the results, or to experiment with own query routing algorithms. Cheers Alex -- ___________________________________________________________ Alexander L?ser Technische Universitaet Berlin Fakultaet IV - CIS hp: http://cis.cs.tu-berlin.de/~aloeser/ office: +49- 30-314-25551 fax : +49- 30-314-21601 ___________________________________________________________ From gbildson at limepeer.com Tue Jun 22 17:03:15 2004 From: gbildson at limepeer.com (Greg Bildson) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data In-Reply-To: <40D85887.FA3DC4E5@cs.tu-berlin.de> Message-ID: There is no such source. We don't do queries for content as part of the crawl. Nor do we really want to give out IP information in that detail. Sorry. Thanks -greg -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Alexander L?ser Sent: Tuesday, June 22, 2004 12:04 PM To: Peer-to-peer development. Subject: [p2p-hackers] Gnutella/Limewire Crawling Data Hi, does anybody know where to get crawling data from the gnutella/limwire network including for each IP adress the queries and the stored content for a certain time intervall? I found many research papers, presentations and reports but no real data to prove the results, or to experiment with own query routing algorithms. Cheers Alex -- ___________________________________________________________ Alexander L?ser Technische Universitaet Berlin Fakultaet IV - CIS hp: http://cis.cs.tu-berlin.de/~aloeser/ office: +49- 30-314-25551 fax : +49- 30-314-21601 ___________________________________________________________ _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From list-p2phack at ruffledpenguin.org Wed Jun 23 05:48:46 2004 From: list-p2phack at ruffledpenguin.org (Adam Lydick) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data In-Reply-To: <40D85887.FA3DC4E5@cs.tu-berlin.de> References: <40D2E475.2090402@locut.us> <40D85887.FA3DC4E5@cs.tu-berlin.de> Message-ID: <1087969726.15197.10.camel@lothlorien> You can implement your own crawler fairly easily (at least, it was easy 3 years ago). I did the following logging for some research while I was still working on my BS: * hacked up a mutella client to do some logging * log ip/query pairs to a file * log seen "IPs" to a named pipe * had a slave process on the other end of the pipe that would attempt to retrieve the file index from each client that was seen. (many clients had this enabled at the time) Another effective technique would be to log popular queries for a while to learn a set of "interesting" keywords and reissue them to collect query results. -- Adam On Tue, 2004-06-22 at 09:04, Alexander L?ser wrote: > Hi, > does anybody know where to get crawling data from the gnutella/limwire > network including for each IP adress the queries and the stored content for > a certain time intervall? > > I found many research papers, presentations and reports but no real data to > prove the results, or to experiment with own query routing algorithms. > > Cheers Alex From fis at wiwi.hu-berlin.de Wed Jun 23 06:20:12 2004 From: fis at wiwi.hu-berlin.de (fis@wiwi.hu-berlin.de) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data In-Reply-To: References: <40D85887.FA3DC4E5@cs.tu-berlin.de> Message-ID: <16601.8476.437602.740883@gargle.gargle.HOWL> (of course ip addresses or other identity tokens could be securely pseudonymized and still serve the same research purposes, except for geographical issues. -matthias) Greg Bildson writes: > From: "Greg Bildson" > Date: Tue, 22 Jun 2004 13:03:15 -0400 > Subject: RE: [p2p-hackers] Gnutella/Limewire Crawling Data > > There is no such source. We don't do queries for content as part of the > crawl. > > Nor do we really want to give out IP information in that detail. Sorry. > > Thanks > -greg > > -----Original Message----- > From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On > Behalf Of Alexander L?ser > Sent: Tuesday, June 22, 2004 12:04 PM > To: Peer-to-peer development. > Subject: [p2p-hackers] Gnutella/Limewire Crawling Data > > > Hi, > does anybody know where to get crawling data from the gnutella/limwire > network including for each IP adress the queries and the stored content for > a certain time intervall? > > I found many research papers, presentations and reports but no real data to > prove the results, or to experiment with own query routing algorithms. > > Cheers Alex > > -- > ___________________________________________________________ > > Alexander L?ser > Technische Universitaet Berlin Fakultaet IV - CIS > hp: http://cis.cs.tu-berlin.de/~aloeser/ > office: +49- 30-314-25551 > fax : +49- 30-314-21601 > ___________________________________________________________ From em at em.no-ip.com Thu Jun 24 02:46:21 2004 From: em at em.no-ip.com (Enzo Michelangeli) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Estimating the user base of Kademlia networks Message-ID: <010801c45995$750864a0$0200a8c0@em.noip.com> I wonder if anybody has produced estimates of how many users, on average, are online on the three existing file-exchange networks based on Kademlia: Overnet (Overnet, mldonkey and cDonkey), eMuleKAD (eMule and, soon, aMule) and RevConnect. If I'm not mistaken, a rough estimate should be obtainable from the number N(i) of peers found to have the first i bits of the node ID equal to a given sequence; I'd say that the number of online nodes should be about 2^i * N(i), with an estimation error of 2^i * sqrt(N(i)) (this follows from simple probabilistic considerations and a Bayesian approach). In Kademlia, N(i) is the number of entries in the i-th k-bucket, at least when i is large enough to make N(i) < k, so the estimation should require little effort. Thoughts? Enzo From gbildson at limepeer.com Thu Jun 24 14:41:51 2004 From: gbildson at limepeer.com (Greg Bildson) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Estimating the user base of Kademlia networks In-Reply-To: <010801c45995$750864a0$0200a8c0@em.noip.com> Message-ID: I've heard a couple times that the keyword publishing and lookup is too much of a burden and these tools don't work that well. Anyone know how true that is? Are special algorithms used to reduce the transient effects on load and bandwidth? Thanks -greg -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org]On Behalf Of Enzo Michelangeli Sent: Wednesday, June 23, 2004 10:46 PM To: Peer-to-peer development. Subject: [p2p-hackers] Estimating the user base of Kademlia networks I wonder if anybody has produced estimates of how many users, on average, are online on the three existing file-exchange networks based on Kademlia: Overnet (Overnet, mldonkey and cDonkey), eMuleKAD (eMule and, soon, aMule) and RevConnect. If I'm not mistaken, a rough estimate should be obtainable from the number N(i) of peers found to have the first i bits of the node ID equal to a given sequence; I'd say that the number of online nodes should be about 2^i * N(i), with an estimation error of 2^i * sqrt(N(i)) (this follows from simple probabilistic considerations and a Bayesian approach). In Kademlia, N(i) is the number of entries in the i-th k-bucket, at least when i is large enough to make N(i) < k, so the estimation should require little effort. Thoughts? Enzo _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From vab at cryptnet.net Thu Jun 24 13:24:56 2004 From: vab at cryptnet.net (V. Alex Brennen) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] The Fifth HOPE in NYC Message-ID: <40DAD628.8020807@cryptnet.net> At The Fifth HOPE a talk will be given on how to break anonymity networks. Some commonly used p2p code such as Tor and the remailers will be covered. I cannot attend the conference. Is anyone on the list going who could report back? I'm interested to hear if anything other than what's already been widely published is covered in this talk. I'm working on a p2p anonymity project. Thanks, - VAB The Fifth HOPE, NYC July 9-11th, 2004 http://www.the-fifth-hope.org/ How To Break Anonymity Networks Nick Mathewson Today's anonymous communication software (such as Mixmaster, Mixminion, Nymservers, JAP, Tor, Anonymizer, etc.) allows people to communicate while concealing their identities from each other and from external attackers. But no deployed system is strong enough to protect every pattern of user behavior against a sufficiently resourceful adversary, and many of them fall to far simpler attacks. In this talk, Nick will discuss working attacks against today's anonymity networks, drawing from past technical and social attacks on deployed networks and from recent academic research in traffic analysis, stylometry, and mix-net design. He will present defenses to these attacks when such defenses are known to exist. Saturday 2300 Area "B" From list-p2phack at ruffledpenguin.org Fri Jun 25 05:27:25 2004 From: list-p2phack at ruffledpenguin.org (Adam Lydick) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data In-Reply-To: <1087969726.15197.10.camel@lothlorien> References: <40D2E475.2090402@locut.us> <40D85887.FA3DC4E5@cs.tu-berlin.de> <1087969726.15197.10.camel@lothlorien> Message-ID: <1088141245.15197.56.camel@lothlorien> At Alexander's request, I got motivated to dig up the data, scrub it, and make it generally available. Enjoy! (I've removed all IP address information and mapped them to incremental identifiers to protect the privacy of the folks I crawled) http://ruffledpenguin.org/projects/gnutella_crawl/ I'll see about putting up my data collection scripts (or modernized versions of them). I'd like to do some more recent crawls and gather some more interesting statistics. (especially WRT network structure in the various networks) * The query data is isolated (I just logged everything I saw slip through my node) from any identifiers. It is a flat text file like: cyberage wow worship phish junta disc david bowie pristinesounds billiards * The content data looks like: 283255 732 joe dee messina im alright mp3 283256 732 electric slide mp3 283257 732 lonestar im already there mp3 283258 732 brooks and dunn boot scootin boogie mp3 283259 732 a dance the electric slide original version mp3 283260 732 david lee murphy dust on the bottle mp3 283261 732 creed my sacrifice mp3 283262 732 tv or movie themes isaac hayes shaft mp3 283263 732 no doubt rock steady 03 hey baby mp3 283264 732 no doubt hey baby mp3 mp3 The format is * Peer connection uptime is unscrubbed, but just contains: -- Adam On Tue, 2004-06-22 at 22:48, Adam Lydick wrote: > You can implement your own crawler fairly easily (at least, it was easy > 3 years ago). I did the following logging for some research while I was > still working on my BS: > > * hacked up a mutella client to do some logging > * log ip/query pairs to a file > * log seen "IPs" to a named pipe > * had a slave process on the other end of the pipe that would attempt to > retrieve the file index from each client that was seen. (many clients > had this enabled at the time) > > Another effective technique would be to log popular queries for a while > to learn a set of "interesting" keywords and reissue them to collect > query results. > > -- Adam > > On Tue, 2004-06-22 at 09:04, Alexander L?ser wrote: > > Hi, > > does anybody know where to get crawling data from the gnutella/limwire > > network including for each IP adress the queries and the stored content for > > a certain time intervall? > > > > I found many research papers, presentations and reports but no real data to > > prove the results, or to experiment with own query routing algorithms. > > > > Cheers Alex > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From agthorr at barsoom.org Fri Jun 25 05:38:25 2004 From: agthorr at barsoom.org (Agthorr) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data In-Reply-To: <1088141245.15197.56.camel@lothlorien> References: <40D2E475.2090402@locut.us> <40D85887.FA3DC4E5@cs.tu-berlin.de> <1087969726.15197.10.camel@lothlorien> <1088141245.15197.56.camel@lothlorien> Message-ID: <20040625053825.GA20341@barsoom.org> Hello, FWIW, I'm sitting on a mountain (12+GB) of Gnutella crawl data, and I have a paper submitted to a conference with analysis of the topological structure. I hope to get a tech report version online within a few weeks that anyone interested can look at. On Thu, Jun 24, 2004 at 10:27:25PM -0700, Adam Lydick wrote: > At Alexander's request, I got motivated to dig up the data, scrub it, > and make it generally available. Enjoy! (I've removed all IP address > information and mapped them to incremental identifiers to protect the > privacy of the folks I crawled) -- Daniel Stutzbach Computer Science Ph.D Student http://www.barsoom.org/~agthorr University of Oregon From aloeser at cs.tu-berlin.de Fri Jun 25 07:51:02 2004 From: aloeser at cs.tu-berlin.de (Alexander =?iso-8859-1?Q?L=F6ser?=) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Gnutella/Limewire Crawling Data References: <40D2E475.2090402@locut.us> <40D85887.FA3DC4E5@cs.tu-berlin.de> <1087969726.15197.10.camel@lothlorien> <1088141245.15197.56.camel@lothlorien> Message-ID: <40DBD966.5556FF1D@cs.tu-berlin.de> Adam, a BIG thank you for providing the data. It's a good start to prove new algorithms for enhancing query routing in file sharing networks. Great work. Alex Adam Lydick wrote: > At Alexander's request, I got motivated to dig up the data, scrub it, > and make it generally available. Enjoy! (I've removed all IP address > information and mapped them to incremental identifiers to protect the > privacy of the folks I crawled) > > http://ruffledpenguin.org/projects/gnutella_crawl/ > > I'll see about putting up my data collection scripts (or modernized > versions of them). I'd like to do some more recent crawls and gather > some more interesting statistics. (especially WRT network structure in > the various networks) > > * The query data is isolated (I just logged everything I saw slip > through my node) from any identifiers. It is a flat text file like: > > cyberage > wow worship > phish junta disc david bowie > pristinesounds > billiards > > * The content data looks like: > > 283255 732 joe dee messina im alright mp3 > 283256 732 electric slide mp3 > 283257 732 lonestar im already there mp3 > 283258 732 brooks and dunn boot scootin boogie mp3 > 283259 732 a dance the electric slide original version mp3 > 283260 732 david lee murphy dust on the bottle mp3 > 283261 732 creed my sacrifice mp3 > 283262 732 tv or movie themes isaac hayes shaft mp3 > 283263 732 no doubt rock steady 03 hey baby mp3 > 283264 732 no doubt hey baby mp3 mp3 > > The format is > * Peer connection uptime is unscrubbed, but just contains: > > > -- Adam > > On Tue, 2004-06-22 at 22:48, Adam Lydick wrote: > > You can implement your own crawler fairly easily (at least, it was easy > > 3 years ago). I did the following logging for some research while I was > > still working on my BS: > > > > * hacked up a mutella client to do some logging > > * log ip/query pairs to a file > > * log seen "IPs" to a named pipe > > * had a slave process on the other end of the pipe that would attempt to > > retrieve the file index from each client that was seen. (many clients > > had this enabled at the time) > > > > Another effective technique would be to log popular queries for a while > > to learn a set of "interesting" keywords and reissue them to collect > > query results. > > > > -- Adam > > > > On Tue, 2004-06-22 at 09:04, Alexander L?ser wrote: > > > Hi, > > > does anybody know where to get crawling data from the gnutella/limwire > > > network including for each IP adress the queries and the stored content for > > > a certain time intervall? > > > > > > I found many research papers, presentations and reports but no real data to > > > prove the results, or to experiment with own query routing algorithms. > > > > > > Cheers Alex > > > > _______________________________________________ > > p2p-hackers mailing list > > p2p-hackers@zgp.org > > http://zgp.org/mailman/listinfo/p2p-hackers > > _______________________________________________ > > Here is a web page listing P2P Conferences: > > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > > > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences -- ___________________________________________________________ M.Sc. Alexander L?ser Technische Universitaet Berlin Fakultaet IV - CIS hp: http://cis.cs.tu-berlin.de/~aloeser/ office: +49- 30-314-25551 fax : +49- 30-314-21601 ___________________________________________________________ From 17975 at lci.upf.tche.br Fri Jun 25 18:30:49 2004 From: 17975 at lci.upf.tche.br (alexandre) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] guide for starting in jxta - c Message-ID: <001001c45ae2$8a129980$2b73a8c0@upf.tche.br> i need a guide for newbies to beginning programming in jxta-c. thanks From lgonze at panix.com Mon Jun 28 15:15:15 2004 From: lgonze at panix.com (Lucas Gonze) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] musical collaborative filtering dataset Message-ID: I recently packaged up a version of the Webjay.org database for a researcher interested in collaborative filtering of music. I'm writing here to offer a copy to any interested researcher or programmer. The data is a large collection of song URLs categorized by playlist and playlist author. Song URLs are often shared between users, and more popular songs occur in more playlists. There are 76,308 playlist entries in all. Note that the data is anonymized -- all IDs and URLs are in the form of MD5 hashes. The data is a bzipped mysql dump at http://webjay.org/public/public_song_dump.tar.bz2. It is a single table with this definition: public_song_dump ( playlist_id char(32), user_id char(32), song_id char(32), edit_date datetime ); Use playlist_id to group songs into playlists. Use user_id to map songs and playlists to humans. Use song_id to find connections between playlists. Use edit_date to map changes over time. What could you do with this information? You can track the spread of songs from one playlist to another, since successive additions will be ordered by date; I imagine there are characteristic patterns. You might develop methods to infer how appealing a song is, because a more-appealing song should not only be more widespread, it should spread faster. You could study what proportion of songs are hits. You could study which users have the most influence in creating hits, and ask what characteristics influencers have. You could take advantage of the fact that the data is commonly available to compare algorithms from different researchers, in a way similar to the NIST face image dataset. The data is licensed under the Creative Commons Attribution-ShareAlike License. More data may be available on request. It may also be possible to gain direct access to the un-anonymized live data for the purpose of developing real world services. - Lucas Gonze From aloeser at cs.tu-berlin.de Mon Jun 28 16:30:27 2004 From: aloeser at cs.tu-berlin.de (Alexander =?iso-8859-1?Q?L=F6ser?=) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] musical collaborative filtering dataset References: Message-ID: <40E047A3.DE14B364@cs.tu-berlin.de> Hi Lucas, this is an interesting data set. Do you have also information about users and its queries for a playlist or a particular song available? Alex -- ___________________________________________________________ Alexander L?ser Technische Universitaet Berlin Fakultaet IV - CIS hp: http://cis.cs.tu-berlin.de/~aloeser/ office: +49- 30-314-25551 fax : +49- 30-314-21601 ___________________________________________________________ From lgonze at panix.com Mon Jun 28 16:48:46 2004 From: lgonze at panix.com (Lucas Gonze) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] musical collaborative filtering dataset In-Reply-To: <40E047A3.DE14B364@cs.tu-berlin.de> References: <40E047A3.DE14B364@cs.tu-berlin.de> Message-ID: Hi Alex, There isn't a search facility, so I don't have query information. The problem with queries is that they depend on external information brought in by a user from sources like magazines, so they usually relate to exactly the kind of major label music that we don't index. However I can use the referrer log to look at hits coming from search engines, which are obviously query based. - Lucas On Mon, 28 Jun 2004, Alexander [iso-8859-1] L?ser wrote: > Hi Lucas, > this is an interesting data set. Do you have also information about > users and its queries for a playlist or a particular song available? > > Alex > > -- > ___________________________________________________________ > > Alexander L?ser > Technische Universitaet Berlin Fakultaet IV - CIS > hp: http://cis.cs.tu-berlin.de/~aloeser/ > office: +49- 30-314-25551 > fax : +49- 30-314-21601 > ___________________________________________________________ > > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From nazareno at dsc.ufcg.edu.br Mon Jun 28 19:57:02 2004 From: nazareno at dsc.ufcg.edu.br (Nazareno Andrade) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] musical collaborative filtering dataset In-Reply-To: References: Message-ID: <40E0780E.6080302@dsc.ufcg.edu.br> Hi Lucas. Very interesting data! Thanks for making it available! Has anyone made a study along the lines you suggest in your email already? I'm aware of a study of popularity of songs in KazaA over time, and I'd like to see if the patterns are indeed similar. cheers, Nazareno Lucas Gonze wrote: > I recently packaged up a version of the Webjay.org database for a > researcher interested in collaborative filtering of music. I'm writing > here to offer a copy to any interested researcher or programmer. > > The data is a large collection of song URLs categorized by playlist and > playlist author. Song URLs are often shared between users, and more > popular songs occur in more playlists. There are 76,308 playlist entries > in all. Note that the data is anonymized -- all IDs and URLs are in the > form of MD5 hashes. > > The data is a bzipped mysql dump at > http://webjay.org/public/public_song_dump.tar.bz2. It is a single table > with this definition: > > public_song_dump ( > playlist_id char(32), > user_id char(32), > song_id char(32), > edit_date datetime > ); > > Use playlist_id to group songs into playlists. > Use user_id to map songs and playlists to humans. > Use song_id to find connections between playlists. > Use edit_date to map changes over time. > > What could you do with this information? You can track the spread of > songs from one playlist to another, since successive additions will be > ordered by date; I imagine there are characteristic patterns. You might > develop methods to infer how appealing a song is, because a more-appealing > song should not only be more widespread, it should spread faster. You > could study what proportion of songs are hits. You could study which > users have the most influence in creating hits, and ask what > characteristics influencers have. You could take advantage of the fact > that the data is commonly available to compare algorithms from different > researchers, in a way similar to the NIST face image dataset. > > The data is licensed under the Creative Commons Attribution-ShareAlike > License. More data may be available on request. It may also be possible > to gain direct access to the un-anonymized live data for the purpose of > developing real world services. > > - Lucas Gonze > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > -- Nazareno. ======================================== Nazareno Andrade LSD - DSC/UFCG Campina Grande - Brazil http://lsd.dsc.ufcg.edu.br/~nazareno/ OurGrid project http://www.ourgrid.org ======================================== From lgonze at panix.com Mon Jun 28 21:35:52 2004 From: lgonze at panix.com (Lucas Gonze) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] musical collaborative filtering dataset In-Reply-To: <40E0780E.6080302@dsc.ufcg.edu.br> References: <40E0780E.6080302@dsc.ufcg.edu.br> Message-ID: On Mon, 28 Jun 2004, Nazareno Andrade wrote: > Hi Lucas. > > Very interesting data! Thanks for making it available! I'm glad I finally got it done. :) > Has anyone made a study along the lines you suggest in your email > already? I'm aware of a study of popularity of songs in KazaA over time, > and I'd like to see if the patterns are indeed similar. Not that I know of. Hypertext playlists are (amazingly!) a new thing, and their existence boosts the amount of data by orders of magnitude. - Lucas > > cheers, > > Nazareno > > Lucas Gonze wrote: > > I recently packaged up a version of the Webjay.org database for a > > researcher interested in collaborative filtering of music. I'm writing > > here to offer a copy to any interested researcher or programmer. > > > > The data is a large collection of song URLs categorized by playlist and > > playlist author. Song URLs are often shared between users, and more > > popular songs occur in more playlists. There are 76,308 playlist entries > > in all. Note that the data is anonymized -- all IDs and URLs are in the > > form of MD5 hashes. > > > > The data is a bzipped mysql dump at > > http://webjay.org/public/public_song_dump.tar.bz2. It is a single table > > with this definition: > > > > public_song_dump ( > > playlist_id char(32), > > user_id char(32), > > song_id char(32), > > edit_date datetime > > ); > > > > Use playlist_id to group songs into playlists. > > Use user_id to map songs and playlists to humans. > > Use song_id to find connections between playlists. > > Use edit_date to map changes over time. > > > > What could you do with this information? You can track the spread of > > songs from one playlist to another, since successive additions will be > > ordered by date; I imagine there are characteristic patterns. You might > > develop methods to infer how appealing a song is, because a more-appealing > > song should not only be more widespread, it should spread faster. You > > could study what proportion of songs are hits. You could study which > > users have the most influence in creating hits, and ask what > > characteristics influencers have. You could take advantage of the fact > > that the data is commonly available to compare algorithms from different > > researchers, in a way similar to the NIST face image dataset. > > > > The data is licensed under the Creative Commons Attribution-ShareAlike > > License. More data may be available on request. It may also be possible > > to gain direct access to the un-anonymized live data for the purpose of > > developing real world services. > > > > - Lucas Gonze > > > > _______________________________________________ > > p2p-hackers mailing list > > p2p-hackers@zgp.org > > http://zgp.org/mailman/listinfo/p2p-hackers > > _______________________________________________ > > Here is a web page listing P2P Conferences: > > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > > > > > -- > > Nazareno. > > ======================================== > Nazareno Andrade > LSD - DSC/UFCG > Campina Grande - Brazil > http://lsd.dsc.ufcg.edu.br/~nazareno/ > > OurGrid project > http://www.ourgrid.org > ======================================== > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From stephennaicken at gmail.com Mon Jun 28 23:32:38 2004 From: stephennaicken at gmail.com (Stephen Naicken) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Eigentrust Implementation Message-ID: Hello, I am currently attempting to implement Eigentrust (without the CAN and score managers) into Limewire. I have been surprised at the lack of code for Eigentrust and other P2P reputations systems such as P2PRep. Why is code for such system not available or am I looking in the wrong places? It would certainly be of great help to me, even if it is just bits and pieces of code. Thanks Stephen From lassantos at inf.ufrgs.br Mon Jun 28 23:52:11 2004 From: lassantos at inf.ufrgs.br (Lucas Alberto) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Usind P2P as a Distributed File Storage? Message-ID: <1088466731.11458.23.camel@moe.inf.ufrgs.br> Hi all! Does someone knows a project that create a Distributed File Storage in a P2P system, with write permission? The system should create a distributed file system in read/write mode. tanks, Lucas From wesley at felter.org Tue Jun 29 00:38:43 2004 From: wesley at felter.org (Wes Felter) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Usind P2P as a Distributed File Storage? In-Reply-To: <1088466731.11458.23.camel@moe.inf.ufrgs.br> References: <1088466731.11458.23.camel@moe.inf.ufrgs.br> Message-ID: On Jun 28, 2004, at 6:52 PM, Lucas Alberto wrote: > Hi all! > Does someone knows a project that create a Distributed File Storage in > a > P2P system, with write permission? The system should create a > distributed file system in read/write mode. http://oceanstore.cs.berkeley.edu/ Wes Felter - wesley@felter.org - http://felter.org/wesley/ From clausen at gnu.org Tue Jun 29 02:07:18 2004 From: clausen at gnu.org (Andrew Clausen) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Eigentrust Implementation In-Reply-To: References: Message-ID: <20040629020716.GB16242@gnu.org> On Tue, Jun 29, 2004 at 12:32:38AM +0100, Stephen Naicken wrote: > I am currently attempting to implement Eigentrust (without the CAN and > score managers) into Limewire. I have been surprised at the lack of > code for Eigentrust and other P2P reputations systems such as P2PRep. Me too. > Why is code for such system not available or am I looking in the wrong > places? It would certainly be of great help to me, even if it is just > bits and pieces of code. Over-protective academics? Patents? I don't know. EigenTrust is really just PageRank. So, it probably uses (infringes) the PageRank patent - but the patent is written rather narrowly (it talks about "documents", IIRC), so perhaps not. (I'm not a lawyer). Also, there is some prior art from a 50's psychometricka (sp?) article. My library doesn't have a copy... anyone read it? Here's some very ugly python code to compute PageRank. You might find my thesis helpful for understanding this... there is a lot of misinformation about PageRank that confuses things. Url: http://members.optusnet.com.au/clausen/reputation/rep-cost-attack.pdf from Numeric import * from Matrix import * import LinearAlgebra import UserArray def real(z): if type(z) == type(complex(z)): return z.real return z def approx_eq(z, z_): return abs(z - z_) < 0.000001 def onesmatrix(n): return Matrix(ones(n)) def PR_matrix(d, s, A): n = s.shape[1] assert(A.shape == (n, n)) return d * transpose(s) * onesmatrix(n) + (1 - d) * A # computes the fixed-point of an ergodic and stochastic linear transformation. # (i.e. the fixed point of a transition matrix of an ergodic markov chain) def fixedpoint(A): [values, vectors] = LinearAlgebra.eigenvectors(A) abs_values = map(abs, values) # Perron-Frobenius theorem: assert(approx_eq(values[argmax(abs_values)], 1)) vector = vectors[argmax(abs_values)] if type(vector[0]) == type(complex(vector[0])): vector = UserArray.array(map(real, vector)) return vector / sum(vector) # d = search vs click probability # s = initial votes distribution (nx1 vector) # A = recommendation/hyperlink matrix (nxn matrix) def calc_pagerank(d, s, A): return fixedpoint(PRMatrix(d, s, transpose(A))) def test(): d = 0.5 s = Matrix([0.5, 0, 0.5]) A = Matrix("1, 0, 0; 0, 1, 0; 0.5, 0.5, 0") print calc_pagerank(d, s, A) Cheers, Andrew From ls011g7939 at blueyonder.co.uk Wed Jun 30 13:14:55 2004 From: ls011g7939 at blueyonder.co.uk (David Ashe) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Peerlets Message-ID: <002101c45ea4$3c511210$6401a8c0@bombaymix> Hi All, Does anyone know if there is such a specification on peerlets, and if not could we throw around some ideas as to how they should function? BTW,I did do a search (After i thought of this) and find of relevance proem (http://wearables.cs.uoregon.edu/proem/index.html) but have not received a reply from the contact there (to get a password to the source/docs). Roughly, my idea is that for each 'network command' we would have a class which has methods for both incoming/outgoing messages. This would have access to a 'kernel' which would be able to access all of the other connections, and information such as number of connected peers, etc. this would allow us to call commands within commands as well. I came across this pattern when i was developing my own p2p system. Feel free to bite my head off! Thanks, David Ashe From dcarboni at crs4.it Wed Jun 30 15:48:24 2004 From: dcarboni at crs4.it (Davide Carboni) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Peerlets In-Reply-To: <002101c45ea4$3c511210$6401a8c0@bombaymix> References: <002101c45ea4$3c511210$6401a8c0@bombaymix> Message-ID: <40E2E0C8.7070002@crs4.it> David Ashe wrote: > >I came across this pattern when i was developing my own p2p system. > >Feel free to bite my head off! > >Thanks, >David Ashe > > > I've been working on a in-house p2p project called uNET (say micro-net) that never reached final users. In this project the p2p protocol was divided into core and extensions. The core was focused on routing, relaying, connection management, and so forth. The extensions was focused on specific applications such as file sharing, chat, and whatever. The extensions were called netlets and we developed a Java framework with an abstract class Netlet which declared two methods processRequest() and processResponse(). It was up to subclasses to implement such methods. Any netlets was registered with a 64bit unique ID and that ID was part of the message header. So, I came across this pattern too. :) -- Davide Carboni, Information and Communication Technologies CRS4, Center for Advanced Studies, Research and Development in Sardinia http://www.crs4.it - Tel.: +39 070 9250 303 - Fax: +39 070 9250 216 -- The Web Around the Corner - GPSWeb http://www.crs4.it:8000/gpsweb From lgonze at panix.com Wed Jun 30 16:07:19 2004 From: lgonze at panix.com (Lucas Gonze) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Peerlets In-Reply-To: <002101c45ea4$3c511210$6401a8c0@bombaymix> Message-ID: <90574918-CAAF-11D8-9FB6-000393455590@panix.com> This is the same architecture used in my long-defunct WorldOS project. It was great for extensibility and a pleasure to program with. - Lucas On Wednesday, Jun 30, 2004, at 09:14 America/New_York, David Ashe wrote: > Hi All, > > Does anyone know if there is such a specification on peerlets, and if > not > could we throw around some ideas as to how they should function? > > BTW,I did do a search (After i thought of this) and find of relevance > proem > (http://wearables.cs.uoregon.edu/proem/index.html) but have not > received a > reply from the contact there (to get a password to the source/docs). > > > Roughly, my idea is that for each 'network command' we would have a > class > which has methods for both incoming/outgoing messages. This would have > access to a 'kernel' which would be able to access all of the other > connections, and information such as number of connected peers, etc. > this > would allow us to call commands within commands as well. > > I came across this pattern when i was developing my own p2p system. > > Feel free to bite my head off! > > Thanks, > David Ashe > > _______________________________________________ > p2p-hackers mailing list > p2p-hackers@zgp.org > http://zgp.org/mailman/listinfo/p2p-hackers > _______________________________________________ > Here is a web page listing P2P Conferences: > http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences > From cefn.hoile at bt.com Wed Jun 30 17:41:13 2004 From: cefn.hoile at bt.com (cefn.hoile@bt.com) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Peerlets Message-ID: <21DA6754A9238B48B92F39637EF307FD02180893@i2km41-ukdy.domain1.systemhost.net> The sourceforge project diet-agents is based around the concept of a process which has a globally unique id and handles events (typically messages) passed from other processes within or outside the peer environment. The kernel handles the threading and buffering issues from process interaction in a way which helps to manage the resource load on the hosting environment. Diet 'agents' are single-threaded and lightweight, and are also able to relinquish their threads (similarly to daemon hosting on linux), and so we have been able to demonstrate 500,000 addressable processes on a single desktop-deployed peer. These may be a useful reference for a 'peerlet' implementation, if I understand you correctly. This abstraction has certainly been useful to us in writing experimental peer to peer applications. Cefn http://cefn.com DIET Agents Project Team http://diet-agents.sourceforge.net -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org] On Behalf Of David Ashe Sent: 30 June 2004 14:15 To: p2p-hackers@zgp.org Subject: [p2p-hackers] Peerlets Hi All, Does anyone know if there is such a specification on peerlets, and if not could we throw around some ideas as to how they should function? BTW,I did do a search (After i thought of this) and find of relevance proem (http://wearables.cs.uoregon.edu/proem/index.html) but have not received a reply from the contact there (to get a password to the source/docs). Roughly, my idea is that for each 'network command' we would have a class which has methods for both incoming/outgoing messages. This would have access to a 'kernel' which would be able to access all of the other connections, and information such as number of connected peers, etc. this would allow us to call commands within commands as well. I came across this pattern when i was developing my own p2p system. Feel free to bite my head off! Thanks, David Ashe _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences From cefn.hoile at bt.com Wed Jun 30 17:50:08 2004 From: cefn.hoile at bt.com (cefn.hoile@bt.com) Date: Sat Dec 9 22:12:42 2006 Subject: [p2p-hackers] Usind P2P as a Distributed File Storage? Message-ID: <21DA6754A9238B48B92F39637EF307FD02180894@i2km41-ukdy.domain1.systemhost.net> Ivy may be of interest as a read/write filesystem... http://www.pdos.lcs.mit.edu/ivy/ Cefn http://cefn.com -----Original Message----- From: p2p-hackers-bounces@zgp.org [mailto:p2p-hackers-bounces@zgp.org] On Behalf Of Lucas Alberto Sent: 29 June 2004 00:52 To: p2p-hackers@zgp.org Subject: [p2p-hackers] Usind P2P as a Distributed File Storage? Hi all! Does someone knows a project that create a Distributed File Storage in a P2P system, with write permission? The system should create a distributed file system in read/write mode. tanks, Lucas _______________________________________________ p2p-hackers mailing list p2p-hackers@zgp.org http://zgp.org/mailman/listinfo/p2p-hackers _______________________________________________ Here is a web page listing P2P Conferences: http://www.neurogrid.net/twiki/bin/view/Main/PeerToPeerConferences