Slashdot Mirror


Finnish Firm Claims Fake P2P Hash Technology

An anonymous reader writes "As reported by The Inquirer, a Finnish company known as Viralg Oy claim to have developed software that can create a junk file with the same hash as a genuine p2p download. This, according to the company, can altogether stop the sharing of copywritten files by flooding p2p networks with corrupt/junk data, which then spreads through the network, causing less and less of the original file to be available. However, with the resolve of the p2p userbase, is this software really going to 'beat all Peer 2 Peer pirates at their own game,' or simply prove a minor annoyance?"

748 comments

  1. Just an annoyance by whoppers · · Score: 4, Insightful

    People will always creatively find a way around everything!

    1. Re:Just an annoyance by bherman · · Score: 5, Funny

      Except /. dupes!

      --
      Error: Sig not found.
    2. Re:Just an annoyance by Psiolent · · Score: 4, Funny

      Ah, yes. That ancient principle pontificated by Dr. Ian Malcolm: Life will find a way.

    3. Re:Just an annoyance by Anonymous Coward · · Score: 0

      People will always creatively find a way around everything!

      Yeah, they will simply find out who is sharing bogus material and kick those persons out. They are doing that already to stop fake sharers.

    4. Re:Just an annoyance by merlin_jim · · Score: 3, Interesting

      For instance, hash with two different algorithms. In theory it is possible to find a file that can hash to the same value in two different algorithms, but its a lot harder than finding a file that hashes to a specific value in one algorithm.

      --
      I am disrespectful to dirt! Can you see that I am serious?!
    5. Re:Just an annoyance by Anonymous Coward · · Score: 0

      The ultimate goal is similar to SPAM flooding. The point is: I still use email despite it.

      Much like I can easily distinguish SPAM by just looking at the from or subject header for email, methods will be generated to help spot such tampering in P2P.

      NOTE: I use email, but don't trust P2P. (read www.sans.org/top20/ for my trust issues)

    6. Re:Just an annoyance by Dutchmaan · · Score: 5, Funny

      Don't you mean..

      "Life... uhhhh.. will..uhh... find a way!"

    7. Re:Just an annoyance by jargoone · · Score: 2, Funny

      Yeah, something like appending "_THIS_IS_FOR_REAL_NOT_A_FAKE" to each of the filenames should work just fine.

    8. Re:Just an annoyance by Jeremiah+Cornelius · · Score: 1

      SHA-256
      Up the ante, with bigger numbers.

      --
      "Flyin' in just a sweet place,
      Never been known to fail..."
    9. Re:Just an annoyance by Anonymous Coward · · Score: 1, Funny

      Except /. dupes!

    10. Re:Just an annoyance by Anonymous Coward · · Score: 0

      And has the same number of bytes.

    11. Re:Just an annoyance by bman08 · · Score: 4, Interesting

      The magic of this system is that it also works in reverse: "Your honor, my client hates p2p filesharing. All those songs he downloaded, he thought they were phonies with duplicate hashes and deliberately shared them in order to poison the network."

    12. Re:Just an annoyance by Neoncow · · Score: 2, Interesting
      I believe there is a hashing algorithm called TigerTree. TigerTree computes a single hash based on 1024 byte blocks. As the file is downloaded, each block can be independantly verified.

      So if they try to pollute a network by giving corrupt data for a valid file, all the downloader needs to do is notice that a particular client keeps sending corrupt parts. And of course if they send some real bits nad some fake bits, the downloader will keep the real bits and discard the fake ones.

      Don't ask me how it works, but I know that Shareaza makes use of this hash.

      Link I ripped from the Shareaza wiki: Tree Hash EXchange format (THEX)

    13. Re:Just an annoyance by SetupWeasel · · Score: 1

      The name does not affect the hash, and that is the problem. If this is for real, you could click on a file that you know to be legit, but a program like emule will grab any file with the same hash. Emule downloads different parts from different sources, and you would only need a couple of bad bytes to ruin a file.

    14. Re:Just an annoyance by ePhil_One · · Score: 3, Insightful

      Any evidence that what they've really done is found a way to trick the P2P software into reporting whatever hash they want for a given file? The remote client can't really verify the hash until the complete file is downloaded, so you are clearly relying on the comprimised remote computer to computre this. So if they lie about the hash and stream /dev/random onto the network, what is the check?

      --
      You are in a maze of twisted little posts, all alike.
    15. Re:Just an annoyance by Anonymous Coward · · Score: 0

      all hail the power of usenet ! :)

      seriously, usenet is a far better place to download "stuff". with the development of better encoding schemes, the overhead of a binary attachment is only a few percent. see http://www.yenc.org/ (specs are public domain) and http://www.yenc32.com/ (gpl'd utilities). add miracle-like recovery schemes, such as http://parchive.sourceforge.net/ (listed as gpl'd on their project page) and usenet is far from being obsolete.... it's just most old-timers may have forgotten about it and newbies don't know it's there.

      plenty of usenet providers tout a "no downloads logged" policy... so download to your heart's content, fill up that hard drive.. just remember to wait for what you want to be posted, don't post requests for anything that may be 'questionable' as to legality... ;)

      plus, if there is something not kosher about a binary that's been posted (virus, trojan, not what it was claimed to be, corrupt, etc), replies to that fact follow pretty quickly after the original posting.

      while the idea of usenet being nothing but smut and spam are partially true, there are a lot of useful groups out there. even a bunch that fall into the useful AND legal category. :) :)

    16. Re:Just an annoyance by newend · · Score: 1

      I see two possible scenarios if this ACTUALLY WORKS.
      1. They could stop trying to d/l music all together
      2. They could attempt to d/l music that was released by the artist.

      What I think is more interesting is can/should the p2p makes attempt to filter out this fake conent?
      If I had software that was useable for both legit and illegal purposes, and someone attempted to make it more difficult to get worth while content, then I'd see that as attack on my product. I would attempt to make the service better by removing the fake content in order to keep people from going to other products.

    17. Re:Just an annoyance by Anonymous Coward · · Score: 0

      How about the rating system on the dloads.
      Screw the corrupt ones then.

    18. Re:Just an annoyance by Hannes+Eriksson · · Score: 1

      Actually, it's just double work. First you find all files matching the first hash, then filter out one matching the second. Finding a match for the hash function "1-bit sum of parity bits" and the hash function "1-bit sum of all bits" is much easier than finding a match for just about any drain bamaged two-bit hash function.

      --
      Geek rants since like... 2000 or something.
    19. Re:Just an annoyance by Jeremiah+Cornelius · · Score: 1
      Oh.

      That sucks.

      --
      "Flyin' in just a sweet place,
      Never been known to fail..."
    20. Re:Just an annoyance by ArbitraryConstant · · Score: 1

      I imagine it works with the MD5 and SHA1 vulnerabilities that have been found. If that's true the fix is trivial. The networks simply need to switch to a bigger/better/non-broken algorithm. There are many to choose from.

      --
      I rarely criticize things I don't care about.
    21. Re:Just an annoyance by merlin_jim · · Score: 4, Informative

      Actually we were both wrong; it is (2^keylength)^2 number of keys. However this number is equivalent to 2^(keylength*2), not 2^(keylength^2)

      Why would this not be "just double work"?

      First you find all files matching the first hash, then filter out one matching the second.

      And where exactly do you think the work is occuring? Computing the second hash. If you have one hash algorithm, you only have to match once. If you have two hash algorithms and you did it this way, you have to match enough with the first algorithm to find a match for the second algorithm. This isn't twice as much work, this is twice as much keyspace (with each bit increase in keyspace representing twice the work)

      --
      I am disrespectful to dirt! Can you see that I am serious?!
    22. Re:Just an annoyance by MighMoS · · Score: 1

      Except /. dupes! ...okay, is it old yet?

    23. Re:Just an annoyance by mancontr · · Score: 2, Informative

      The file isn't comprobed only when complete, every chunk is comprobed when received. (BT:1/2mb,ED2k:10mb)

    24. Re:Just an annoyance by mancontr · · Score: 3, Informative

      I meant: The file isn't verified only when complete, every chunk is verified when received. (BT:1/2mb,ED2k:10mb) Sorry, me fail english... (that's not umpossible...)

    25. Re:Just an annoyance by ePhil_One · · Score: 5, Funny

      Its a perfectly cromulent word...

      --
      You are in a maze of twisted little posts, all alike.
    26. Re:Just an annoyance by mrjb · · Score: 1

      Simple. Use 2 hashes, for example 1 SHA and 1 MD5. Now try to generate a junk file of the correct length that matches *both* hashes.

      --
      Visit http://ringbreak.dnd.utwente.nl/~mrjb/growingbettersoftware to download your free copy of the book
    27. Re:Just an annoyance by Hannes+Eriksson · · Score: 2, Informative

      Thank you for pointing out my mind slip.
      While I'm at it...

      With an 8-bit hash key, there are 256 possible keys. This means that 1/256 files will match the hash. With another hash function with 8-bit keys there are 1/256/256=1/65536=1/(256^2)=1/((2^8)^2) files matching the two keys. This keyspace is indeed the same size as that of a 16-bit key with the important difference that it is much easier to find matches if you can partition the search space.

      Picture yourself an unpainted 65536-piece square jigsaw puzzle (quite impossible for a human to do within a lifetime?).

      Now change your mental picture to a 65536-piece square jigsaw puzzle painted in 256 randomly ordered differently coloured vertical stripes. The solution for a column of the puzzle quickly degenerates into the work of solving an unpainted 256-piece 1-D puzzle (not so impossible, might take a couple of days). After doing 256 of those (might be a slight bit time-consuming, some years), the set of stripes represents another 256-piece puzzle (needing like another day to solve).

      This is not magic with large numbers, but the difference between brute force and the rest of the methods.

      For a 10MB file, there are 2^83886080 possible bit arrangements. 1/(2^32) of these (2^2621440) are collisions in a 32 bit key space. You wouldn't have to try them all to find enough collisions to find one which also makes a collision with another algorithm. Especially not if you know something about the algorithm.

      --
      Geek rants since like... 2000 or something.
    28. Re:Just an annoyance by Anonymous Coward · · Score: 0

      I see... That would be trouble for gnutella and others that swarm chunks of data from multiple sources. Possibly even DC++, at least for the public hubs. Single source P2P won't be affected as much then... Old fashioned methods like newsgroups, ftp, irc will probably be fine. DVDR and portable USB2 drives make snail mail and sneaker net ever so viable. I wouldn't consider this much more than an annoyance. Seems like the simple counter move is to change the hashing algorithm.

    29. Re:Just an annoyance by CmdrWass · · Score: 1

      Seems pretty simple to get around to me, this company is apparently targeting a specific hash algorithm (say md5), so all it'll take is two different hashing algorithms. If the data is not the same data, then even if the first hash algorithm results in a collision (same hash value), the second wouldn't. There's more than one hash algorithm out there ya know. :)

    30. Re:Just an annoyance by Anonymous Coward · · Score: 0

      Agreed.

      We've come up with a novel approach instead. IF you send us your full name, address, employer and net income and positive proof of what albums & movies you are sharing, we'll send you the CDs and DVDs free of charge (along with some minor paperwork).

      Regards,
      RIAA & MPAA

    31. Re:Just an annoyance by lee1026 · · Score: 1

      I don't think it is possible to fool a modern hash system.

    32. Re:Just an annoyance by pimpsoftcom · · Score: 1

      This is why you should always make sure you at least md5, sha1, and crc32 the file and base your system on more then one hash system. Yes these may be easy to crack, but if you throw in a random hash like sha256 and serpant you add n^(256^32^foo) layers of security.

      This is actually what I'm doing for one of the systems I'm working on. It is not that hard to check if a downloaded file meets checksums for 4 different hashes, and then delete it if the file fails verification from even one of them.

      Implement this and *bam*, you have a self cleaning p2p system and this so called company's stock goes through the floor.

      --
      - d
    33. Re:Just an annoyance by ShiroPengin · · Score: 2, Informative

      >Why would this not be "just double work"? It is squared work.

    34. Re:Just an annoyance by Mad+Marlin · · Score: 1

      Yes it does, but a simple solution exists: generate hashes for each block of some size, say 1MB, to limit your losses, combined with public "good hash" repositories (several illegal meanings besides IP violation there) to check against. Then the worst they could do is not send you the credits.

    35. Re:Just an annoyance by JohnQPublic · · Score: 1

      Have you read the MD5 vulnerability report? It's nothing like what's being reported here. There is, apparently, one known MD5 hash collision. Much of the follow-on hype has focused on the fact that you can create an infinite number of files that extend those two colliding files with identical data and get additional collisions, but that's the nature of any block-chaining cipher, including both MD5 and SHA-1. But unless you start with the two colliding files, you don't get the collision. And since the RIAA doesn't control the base file, this doesn't apply.

    36. Re:Just an annoyance by little_prince · · Score: 1

      Yup! To give work to this company, P2P s/w have to change their hashing techniques, rather have two hashes for same file. One computed the usual way and another like -

      consider one file as composition of many subfiles cat-ted together. based on initial file size compute the order in which you would be computing hashes of these considered subfiles. put together these hashes in some predetermined order (either the order in which you processed subfiles or the order in which these were present in original file) and compute the hash of these hashes. this is second level hash.

      each file in P2P network contains now 2 hashes. 2nd hash will aid to confirm the genuineness of P2P file.

      second level hashing can incorporate some more parameters to make it more fine for fine-ish friends of ours. ;)

    37. Re:Just an annoyance by Anonymous Coward · · Score: 0

      Please excuse my pericombobulations. I shall return... interfrastically.

  2. They have cracked strong hashes, huh? by Flywheels+of+Fire · · Score: 5, Informative
    This is not true. It might work on Kazaa but most other P2P networks use MD5 or better. Okay, they have found collisions but no one has found a way to generate file for a given key. So the claim by the finnish company is bogus.

    Or they have cracked even the strong hashes. In which case they are really cool. I know Mr. Torvalds is Finnish, but I doubt even he could come up with algorithms to do that.

    In their conceited press release, they have compared Spoofing vs DRP/a

    1. Re:They have cracked strong hashes, huh? by martok · · Score: 5, Insightful

      Indeed. In order for example to do this with
      BitTorrent, they would need to be able to
      generate colisions in sha1 hashes. The
      implications of which would go well beyond p2p.

    2. Re:They have cracked strong hashes, huh? by darkmeridian · · Score: 1

      Can they have a collision that is the same size as a desired file? Guess not. Haha.

      --
      A NYC lawyer blogs. http://www.chuangblog.com/
    3. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      What does it matter that Mr. Torvalds is Finnish? Seriously..

    4. Re:They have cracked strong hashes, huh? by Flywheels+of+Fire · · Score: 1

      If they did they should stop selling crappy software and buy the lottery :)

    5. Re:They have cracked strong hashes, huh? by BlacBaron · · Score: 2, Interesting

      Says the algorithms patented on their site so presumably we should all be able to go look at this little marvel.

      --
      Update Watch - Automatic software update notification
    6. Re:They have cracked strong hashes, huh? by CharonX · · Score: 5, Insightful

      And the best:
      You cracked SHA-1. Oh well, time to switch to SHA-256

      --
      +++ MELON MELON MELON +++ Out of Cheese Error +++ redo from start +++
    7. Re:They have cracked strong hashes, huh? by Sycraft-fu · · Score: 5, Insightful

      I'm sure that they just found some P2P client that has a weak hash and managed to make a generator for that. Then they are either morons that don't know there's more than one hash algorithm, or they do and are just pimping it to try and get money.

      Either way, I give it about a 0 chance they figured out how to quickly find collisions in a strong hash space. If they had, they'd be talking to the NSA, not the RIAA.

    8. Re:They have cracked strong hashes, huh? by athakur999 · · Score: 1

      How exactly does BitTorrent's hashing work? Is there a hash for each individual piece and then a hash for each completed file as a whole?

      If so, that'd be much harder to fake. If you have a file with 10 pieces, you'd have to a file which would match the hash of all 10 pieces AND match the entire file's hash.

      --
      "People that quote themselves in their signatures bother me" - athakur999
    9. Re:They have cracked strong hashes, huh? by boisepunk · · Score: 2, Interesting

      I see a really short reign of this new "technology" anyway. The hashes could only be for one specific file encoded by a specific encoder with the EXACT title/artist/album info which is not always consistent anyway. I see this as a futile effort.

      --
      main(0)
    10. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Huh.. I don't know quite alot about the subject, but if the average person could crack sha1 hashes, couldn't you make a complete replica of a file from its hash? That would be pretty cool.. *thinks of all unfinished torrents*

    11. Re:They have cracked strong hashes, huh? by MindStalker · · Score: 1

      Its possible that they are simply colliding small bits of the file. Such that when your downloading different chunks of the same file from multiple people some of these chunks can be scambled with junk data, thus destroying your file. Of course all these programs would need to do is implement a stronger hash.

    12. Re:They have cracked strong hashes, huh? by jdray · · Score: 3, Insightful
      ...or they do and are just pimping it to try and get money

      Safe money bets that horse.

      --
      The Spoon
      Updated 6/28/2011
    13. Re:They have cracked strong hashes, huh? by BlacBaron · · Score: 2, Informative

      Bittorrent uses a hash for segments of the file, usually segments are 256k, 512k or 1mb, but I think any power of 2 is valid. It then lists these in the .torrent file. The hash of the info section of the torrent file is used to uniquely identify each torrent on the tracker.

      --
      Update Watch - Automatic software update notification
    14. Re:They have cracked strong hashes, huh? by adavies42 · · Score: 1

      Forget hashes, you need to read up on compression. Hint: no algorithm can compress all files into fixed-length strings.

      --
      Media that can be recorded and distributed can be recorded and distributed.
      -kfg
    15. Re:They have cracked strong hashes, huh? by bad_outlook · · Score: 2, Funny

      From Mario Brothers:
      "Thank you Mario, but our princess is in another castle!"

      That's how it's always going to be, they make a move to block, the the general geek public will have another move after that one.

      Oh well, at least you made it past those damn spinning/flaming chains!

      bo

    16. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      No. Many files have identical hashes.

    17. Re:They have cracked strong hashes, huh? by drgonzo59 · · Score: 4, Insightful

      Agree, this is more like news for the marketing and general folk who don't know what hash is. From the news post the implication is that they can generate another file with the same hash as a given file. If they had indeed found a crack in all the hash algorithms (all SHAs and MDs) the news wouldn't be about P2P but about a major breakthrough in cryptography.

    18. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      And considering that the .torrent file contains hashes of every piece (usually a 32kb-1mb or so sized part) of the real file, this is even more impossible.

    19. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      No, they would need to find second pre-images for sha1 hashes, not just collisions. Regardless, their claims are still bullshit.

    20. Re:They have cracked strong hashes, huh? by garbletext · · Score: 5, Funny

      Yeah! easily! i'm working on a free program that turns a 1KB hash into a 4 GB DVD ISO, or anything else you want! it turns out we don't need to share files, just write the hash down on a piece of paper and you can transmit ANY size file with almost NO bandwidth! and if you hash the hash, it gets smaller and smaller until it's just a zero or a one!

      I'll make millions!

    21. Re:They have cracked strong hashes, huh? by NoMoreNicksLeft · · Score: 1

      Or do 2 different hashes. Even if they can break md5, can they find a file that generates the same md5 *AND* sha1 hash?

    22. Re:They have cracked strong hashes, huh? by LiquidCoooled · · Score: 3, Interesting

      There is a world of difference between a valid collision and an invalid one.

      The anti p2p software appears to find invalid collisions which mean the downloaded file is useless.
      Finding collisions where the movie/app/document remains valid will be MUCH more tricky.

      --
      liqbase :: faster than paper
    23. Re:They have cracked strong hashes, huh? by cpeikert · · Score: 1

      Number one, the article says nothing about hashing. The submitter just made that up.

      Number two, one need not find hash collisions in order to poison P2P networks. Just hack up a client that claims to have a file with a certain hash, but delivers chunks of random garbage to swarming peers. When the downloader hashes the entire file, one bad chunk is enough to cause a mismatch and the entire file is scrapped. It's a denial-of-service attack, it works, and it's being done.

      This attack can be countered using 'tree hashing,' but I don't know of any P2P protocols that use it. (BitTorrent works with hashes of individual chunks, which is good, but not great.)

    24. Re:They have cracked strong hashes, huh? by Trurl's+Machine · · Score: 4, Funny

      Either way, I give it about a 0 chance they figured out how to quickly find collisions in a strong hash space. If they had, they'd be talking to the NSA, not the RIAA.

      What makes you so sure that NSA pays better?

    25. Re:They have cracked strong hashes, huh? by Rattencremesuppe · · Score: 0, Flamebait
      Says the algorithms patented on their site so presumably we should all be able to go look at this little marvel.

      If they patented this algorithm, then it must be a bloody stupid and obvious one which already has lots of implementations and is in widespread use since more than 20 years.

    26. Re:They have cracked strong hashes, huh? by CoderJoe · · Score: 1

      BitTorrent has hashes for peices of the file. Like the parent says, they generally are powers of 2 in size. But, most clients split each piece into chunks and request different chunks from different peers. they then recombine the chunks into the piece and check the hash on the completed piece.

      For this sort of attack to affect most BitTorrent clients, the client would have to request all of the chunks for a piece from the same spoofed data source. Otherwise the piece hash wouldn't match, and the entire piece would be discarded and redownloaded. The only real effect would be slower downloads from more discards, since the chances of getting chunks of the same spoofed piece are pretty small.

    27. Re:They have cracked strong hashes, huh? by petermgreen · · Score: 1

      have you ever played mario on an emulator with savestate where you can keep hitting at it. trust me there is an end and with savestates and warp zones together its pretty easy to get there.

      --
      note: i'm known as plugwash most places but i screwd up registering that here somehow in the past and now can't register
    28. Re:They have cracked strong hashes, huh? by Feyr · · Score: 4, Funny

      they pay in life

      "hand this over, or we'll make sure you never see the sun ever again"

    29. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      I think what this technology does is upload bad partial chunks. The client can only verify a whole chunk so when it is completed and the hash doesn't match it has to be discarded. Further a client cannot easily tell who sent it the garbage because everybody who sent any piece of the chunk is suspect.

      Basically this wastes downloader's bandwidth as they have to keep redownloading chunks, with minimal cost to the uploader, since they only need to send a few bad bytes for the hash check to fail.

    30. Re:They have cracked strong hashes, huh? by Ayaress · · Score: 1

      Wouldn't it be possible for a p2p network to use two hashes at the same time? Even if they can reliably generate a junk file for one, or even both hashes, it would be much more compelx to generate one that matches both.

    31. Re:They have cracked strong hashes, huh? by Local+ID10T · · Score: 4, Funny

      Have you ever tried turning down a request from the NSA? Talk about an offer you cant refuse...

      --
      "You want to know how to help your kids? Leave them the fuck alone." -George Carlin
    32. Re:They have cracked strong hashes, huh? by LiquidCoooled · · Score: 1

      I found that using oDC with their TTH hashing that collisions occur.

      It was noticwed quite quickly, and the collision files were renamed "[Filename] not [collision].avi" just to stop people screwing up their downloads.

      I wish I could remember the name of the movie, but it was identical filesize and hash.

      --
      liqbase :: faster than paper
    33. Re:They have cracked strong hashes, huh? by terraformer · · Score: 1

      I think you have looked at this from the wrong perspective. Nothing on their site says they can generate a junk file that hashes to the genuine article. They are just saying that they can corrupt the stream. What they are likely doing is creating their own Kazaa, et al client that is claiming a particular hash so it gets into the list of available clients to download from for a particular file. They then stream packets of junk in place of good packets (P2P clients pull packets of files from different sources and reassemble locally). This is somewhat ingenious (given who we are speaking about) actually since they can charge the labels per song and per artist. Once a song is identified as britney spears, they can then claim a copy of it, stream out junk and the file when assembled contains a series of clicks and pops in spots that were downloaded from the service. The only way to combat this is to build blacklists of these junk bots and not connect to them.

      --
      Who are you? The new #2 Who is #1? You are #617565. I am not a number, I am a free man! Muhahaha.
    34. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      I know Mr. Torvalds is Finnish, but I doubt even he could come up with algorithms to do that.

      Why is there an assumption that anyone who could create (and later maintain) the Linux kernel is a genius. Linus is clearly a smart fellow, but his biggest gifts are in management and organization, not being some uber-programmer.

    35. Re:They have cracked strong hashes, huh? by Richard_at_work · · Score: 1

      So whats stopping a remote 'trouble' client reporting the correct hash, and deliberately sending duff data, resulting in either at best the client having to get it again, or at worst the client assembling a bad whole? Do the current BT clients drop the bad peer after so many bad segments to prevent this sort of thing or what?

    36. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Why the hell a Finnish company would be talking to RIAA or NSA? Bloody Fucking Americunts!!!!

    37. Re:They have cracked strong hashes, huh? by me+at+werk · · Score: 3, Insightful

      Wouldn't it not be the same size, though? "Wow, this Britney Spears MP3 is 5 times the size yet it has the same hash!"

      Sure, you can find a collision, but finding a collision which has a size close enough to the more popular real file is a lot more difficult, I'd think.

      --
      For context, click Parent.
    38. Re:They have cracked strong hashes, huh? by Bloater · · Score: 1

      If the file or file segment is bigger than the hash, then yes. A one byte hash can represent 256 different values. A two byte file can represent 256 times as many values. On average then, there are 256 two byte files for each hash value.

    39. Re:They have cracked strong hashes, huh? by SeventyBang · · Score: 1



      Talking the talk and walking the walk was covered by Shakespeare a long time ago:

      Henry IV, Part 1, Act 3, Scene 1

      Glendower: "I can call spirits from the vasty deep."
      Hotspur: "Why, so can I, or so can any man; But will they come when you do call for them?"


    40. Re:They have cracked strong hashes, huh? by mmkkbb · · Score: 1

      Hey buddy, many of us are old enough to have beat Super Mario Brothers without savestates. Pansy.

      --
      -mkb
    41. Re:They have cracked strong hashes, huh? by shotfeel · · Score: 1

      But that sounds like it could be a real PITA. From your explanation if sounds like only one chunk needs to come from a spoofed source.

      I don't know how this works, but say a given piece is broken into 10 chunks. You download all 10 chunks, put them together and the hash check fails (you don't know it but one of the chunks came from a spoofed source). There's no way (I'm assuming) to know which chunk is "bad" so you have to download all 10 again. And again the hash check fails because one or more chunks came from the spoofed source.

      So how many times do you have to download the "same" ten chunks to successfully get a given piece if even 10% of the sources are spoofed? What a way to congest the network and make successful downloads drop to a crawl.

      IMO it effectively turns BitTorrent's strength (downloading from several sources to increase download speed) against it. Am I not understanding something there?

    42. Re:They have cracked strong hashes, huh? by Tassach · · Score: 1
      Number two, one need not find hash collisions in order to poison P2P networks. Just hack up a client that claims to have a file with a certain hash, but delivers chunks of random garbage to swarming peers
      That attack can be easily defeated by having clients report bad chunks back to the tracker, or to each other. Every time EVILHOST sends me a corrupt chunk, I send the tracker a message informing them about that fact. This will let the tracker keep track of any host that is consistently sending out garbage. This way, when I get a list of peers who have the chunk I want, I can exclude any ones which have been spewing too much garbage. This will quickly blacklist any peer who's intentionally trying to poison the network.
      --
      Why is it that the proponents of "one nation under God" are so eager to get rid of "liberty and justice for all"?
    43. Re:They have cracked strong hashes, huh? by Nebu · · Score: 2, Interesting

      The hashes could only be for one specific file encoded by a specific encoder with the EXACT title/artist/album info which is not always consistent anyway. I see this as a futile effort.

      Who pirates individual songs these days? I see this as being a major annoyance for people who pirate games. DVD ISOs are typically 4GBs, usually released by only one or two groups (and so there probably won't be more than 2 versions of the file), and take several hours if not days to download. Worst yet, the games contain executable content, so assuming the ISO mounts via Daemon Tools, for example, if you're really unlucky, you might randomly have gotten code that reformats your harddrive.

    44. Re:They have cracked strong hashes, huh? by mboverload · · Score: 5, Informative

      Bittorrent clients ban IP's that send them a certain number of bad pieces.

    45. Re:They have cracked strong hashes, huh? by imsabbel · · Score: 1

      Well, nothing:
      The data is downloaded, indentified as fake and discarded.
      And yes, some clients drop peers with too much fake traffic.
      also think again: most people have much more down than upload. So you you cant really efficiently ddos the download pipe of all those cable/dsl users. They just download with 100 instead of 80 Kbyte/s and just drop the 20K. It wont be slower than without.

      --
      HI O WISE PRINCE. WHT TOOK U SO DAM LONG?
    46. Re:They have cracked strong hashes, huh? by CSMastermind · · Score: 1

      Actually if you use data verification you can block bad clients, "on the fly"

    47. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      The encryption for this is easy.

      Decryption is left as an excercise for the class.

      Thank you. Go away.

    48. Re:They have cracked strong hashes, huh? by MindStalker · · Score: 1

      What would be intesting would be given knowledge of the hash for each 1KB segment and the filetype, to generate an appropriate output for that filetype given lots of computing time. An mp3 for example the computer could crank through random generated mp3 valid data untill it matched one of a list of all the hashs in a file. Then slowly put it together, sure most of the music would be wrong, but a percent of it would be the original intented music. Could create some interesting random music given enough time for the computations (a long freaken time)

    49. Re:They have cracked strong hashes, huh? by Knetzar · · Score: 1

      As far as I can tell, when you combine (by that I mean append) two hashes, you end up with a hash that's at least as strong as the stronger original. Therefore you just developed a stronger hash.

    50. Re:They have cracked strong hashes, huh? by saynt · · Score: 1

      I hope they are doing this, since the fix seems trivially easy. Once the packet is downloaded, rehash it and compare to the published hash. If it doesn't match, requeue from a different host. Start logging the mismatches and you get a nice little blacklist for future reference.

    51. Re:They have cracked strong hashes, huh? by BlacBaron · · Score: 2, Informative

      Patent application is here...

      http://v3.espacenet.com/textdoc?DB=EPODOC&IDX=WO 20 05032111&F=0&QPN=WO2005032111

      I just skimmed over it, but it seemed to suggest their whole strategy revolved around having the "correct" original file with the right hash, then switching it for one with all the wrong data such that the client application didn't notice.

      They suggested keeping the beginning of the file the same so as not let users determine its dodgy straight away.

      As I said i've only skimmed this, but this to me says things like BitTorrent are inherently immune, possibly kazaa is not as I'm not sure if it has hashes of sections of a file.

      --
      Update Watch - Automatic software update notification
    52. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      But if you know the length and format of the file, the matches decrease significantly.

    53. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      noone here seems to get the point. they doesn't need to crack hash:
      -peer hello! I need file sha0:abcd:junk 1

      -faker I've got! I've got

      -peer ok send!
      -faker: cat /dev/urandom > peer

      -peer donwload ok!
      -peer cheking hash... du! retry!

      (loop as many times you like)

    54. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 2, Funny

      Oh, yes I have just recently. Never heard from them aga

    55. Re:They have cracked strong hashes, huh? by BlacBaron · · Score: 1

      Upon having a hash verification failure most clients will download from a single source. If that client gives them bad data several times they tend to ban it.

      --
      Update Watch - Automatic software update notification
    56. Re:They have cracked strong hashes, huh? by tryone · · Score: 5, Funny

      "hand this over, or we'll make sure you never see the sun ever again"

      Oh noes! The NSA are going to destroy the sun!

    57. Re:They have cracked strong hashes, huh? by CDarklock · · Score: 2, Insightful

      I've wondered this myself. Theoretically, if you MD5 a file *and* SHA1 a file, the complexity of matching both hashes is 288 bits. Basically, given a standard distribution, 1 out of every 2^128 files will match the MD5 of your file... and 1 out of every 2^160 of those will match the SHA1. (1/2^128)/2^160 = 1/2^288.

      I'd really like to know if this interpretation is flawed. Even when hash algorithms are broken, if you parallelise them, you can still get enough bits of security to work. It seems to me that you would have to MD5 the file, generate a collision, SHA1 the file, generate a collision, and then check to see if your MD5 still matches.

      --
      Microsoft cheerleader, blue flag waving, you got a problem with that?
    58. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      I, for one, welcome our new sunless overlords. Geeks everywhere rejoice! Never more afraid to venture from their mom's basement and brave the perils of the giant glowing orb of death in the sky.

    59. Re:They have cracked strong hashes, huh? by Supernoma · · Score: 1

      "if you're really unlucky, you might randomly have gotten code that reformats your harddrive."

      That just happens to fit neatly in the code and run without errors? I don't think so.

      --
      I'll Find You Peer, If It's The Last Thing I Do!!!!
    60. Re:They have cracked strong hashes, huh? by i23098 · · Score: 1

      I tottally agree :-)

      Besides, even if they could crack the hash of a file, they still have to beat the hash of the parts...

      At least in eMule a file is broken in pieces and each piece have an hash, and so has the full file. It's allmost impossible to find a collision on the parts that causes the full file to maintain the same hash.

    61. Re:They have cracked strong hashes, huh? by Jonny_eh · · Score: 1

      How will any recipient know that they receive a pad packet if that bad packet was designed to have the same hash as the originating packet? That's the whole idea of this news I believe.

    62. Re:They have cracked strong hashes, huh? by rbanffy · · Score: 1

      When they do it, P2P may well use a stronger hash or combine more attributes.

      If they generate a file that has the same SHA1, MD5 and file length, that will be impressive.

      Chances are that, after spending thousands of processor-years on the problem, they will have generated a bit-by-bit copy of the original file. :-)

      If you could generate a file based on that, could you claim copyright over it and share it freely?

    63. Re:They have cracked strong hashes, huh? by Zork+the+Almighty · · Score: 1

      Two 160 bit hashes are about as secure as one 160 bit hash. You get a bad return on those extra bits.

      --

      In Soviet America the banks rob you!
    64. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Haven't MacNealy and Schwartz beat them to it?! ;)

    65. Re:They have cracked strong hashes, huh? by furballphat · · Score: 1

      what's that? a joke?

    66. Re:They have cracked strong hashes, huh? by Nebu · · Score: 1

      My statement began with the condition "If you're really unlucky", and for you to say "I don't think so" implies that you don't think it's possible for randomly generated code to format your harddrive.

      But from a pure statistical point of view, the probability is obviously not zero.

    67. Re:They have cracked strong hashes, huh? by tyldis · · Score: 1

      And another point is that most of these protocols do a 'rollback' before they append. They verify not only that the hash of the source is correct, but also that the first few bits of the new peer corresponds with the last few of the previous peer. I can't see this doing more harm than fake releases with wrong hash.

    68. Re:They have cracked strong hashes, huh? by doublem · · Score: 1

      If money is the goal, the RIAA is the better bet.

      Every see the movie Sneakers? The object everyone is after is a chunk of hardware that cracks hashes. If these guys really did have something that could crack hashes so easily, SSL and just about every encryption scheme on the planet would be cracked wide open in the process.

      --
      "Live Free or Die." Don't like it? Then keep out of the USA
    69. Re:They have cracked strong hashes, huh? by CristianoMonteiro · · Score: 2, Informative

      well, if you know a way to generate a bogus packet with the same size and the same hash within a 2^256 bytes space (SHA1), please call NSA.

      As said in a previous post, there isn't enough matter in the universe to store 2^256 bytes of data and no computers in the known universe can calculate that amount of information in a reasonable time frame.

      --
      -------------------------------------------- Se você consegue ler aqui então fala português. Óbvio
    70. Re:They have cracked strong hashes, huh? by gremlins · · Score: 1

      I'll just use my CherryOS system to hack into their computers just like in that movie... Hackers.

      I wonder how strong their plexiglass computer is.

      --
      just because your a schizophrenic doesn't mean people arn't really out to get you
    71. Re:They have cracked strong hashes, huh? by Surt · · Score: 1

      So then you hack a client which blacklists the best hosts on the network by falsely reporting that they are spewing garbage, and you run this from a few different sites so the reports seem to the tracker to be coming from a variety of sources.

      --
      "Who is the Journal of Quantum Physics going to believe?" --Stephen Hawking
    72. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      If they're referring to Kazaa, it's old news... Music industry uses vulnerability in Kazaa Hash Calculations.

      If the filesize is below 300k, it hashes the entire file.
      For filesizes above, it hashes the first 300k, skips 300k, and continues hashing blocks of 300k then skipping ever increasing amounts.
      For a 3MB file (ok, 3000kb), it'll hash 1500k - do what the hell you like with the other 50%; you'll never know till you try to play it.

      Tellingly, ViralG's Testimonials page says The object was to stop piracy in the most popular P2P site Kazaa (Fasttrack)
      They don't appear to mention any other P2P software anywhere on the site.

    73. Re:They have cracked strong hashes, huh? by Sponge+Bath · · Score: 1
      Safe money bets that horse.

      Are you, by some chance, the dialog writer for Zero Wing?

    74. Re:They have cracked strong hashes, huh? by CDarklock · · Score: 1

      If you can't explain why, I must assume your response is ill-considered.

      The chance of two independent events coinciding is the same as the chance of one times the chance of the second. The major question is whether an MD5 and a SHA1 are in fact independent.

      --
      Microsoft cheerleader, blue flag waving, you got a problem with that?
    75. Re:They have cracked strong hashes, huh? by 91degrees · · Score: 2, Funny

      Doesn't the birthday paradox come into this? For bittorrent, store every single hash ever generated in an easily sortable pattern. If you get a collision, swap the two segments around.

      Okay, you'll need a lot of segments in a lot of torrent files to poison any of them, but we're talking several orders of magnitude smaller. We might only need a few trillion universes to store the data.

    76. Re:They have cracked strong hashes, huh? by shredluc · · Score: 1

      It's not about currency. It's about distance. Six feet downwards to be exact.

    77. Re:They have cracked strong hashes, huh? by Benm78 · · Score: 1

      Even if the algorithms would be independent, what would the benefit be over running higher-bit version of either algorithm?

      The only benefit I can think of is that if one of the methods proves to be fundamentally flawed, whereas the other would be fundamentally sound. This would be odd, since most strong hashing algorithmes rely on similar principles... however, only time will tell.

    78. Re:They have cracked strong hashes, huh? by cpt+kangarooski · · Score: 1

      Well, you'll make a 1 bit hash of millions, anyway. And it'll probably be 0. ;)

      --
      -- This and all my posts are in the public domain. I am a lawyer. I am not your lawyer, and this is not legal advice.
    79. Re:They have cracked strong hashes, huh? by Andrewkov · · Score: 1

      Even if they can crack the hash, this scheme is not entirly practical. They still have to download *every version* of a given file on the network, corrupt each one, then wait for others to begin downloading these corrupted files from them. For a record company with 10,000's of songs in it's library, this will be an impossible task.

    80. Re:They have cracked strong hashes, huh? by Fareq · · Score: 1

      True... but it would take millenia to actually build all of those files and then filter for length and right-formattedness.

    81. Re:They have cracked strong hashes, huh? by KalaNag · · Score: 2, Informative

      In fact, someone else already answered that. http://it.slashdot.org/comments.pl?sid=139986&cid= 11723871

    82. Re:They have cracked strong hashes, huh? by adavies42 · · Score: 1

      Um, no, it's simple CS.

      --
      Media that can be recorded and distributed can be recorded and distributed.
      -kfg
    83. Re:They have cracked strong hashes, huh? by orkysoft · · Score: 1

      Actually, a similar scam was run in The Netherlands not too long ago.

      Guy claims to have invented a compression technique that would be able to compress a movie into 1KB of data.

      Some Philips high-up manager invests millions of his own personal money in it (not the company's money, apparently he wanted it all for himself), and got zero in return. He let himself be scammed by his own greed.

      The "inventor" has since died, and the source or object code have either disappeared, or are stored in a safe or something.

      I say it's bullocks, since the compression ratio is just way too good to be true.

      --

      I suffer from attention surplus disorder.
    84. Re:They have cracked strong hashes, huh? by coopex · · Score: 1

      Well, it has been mankind's oldest wish...

      --
      The road to hell is paved with good intentions.
    85. Re:They have cracked strong hashes, huh? by Deliveranc3 · · Score: 1

      Ironically the file name extension (in windows counts are part of the hash) as does your computers ability to execute code.

      How long would it take a million monkeys at a million switches to produce a working peice of compiled code?

    86. Re:They have cracked strong hashes, huh? by Deliveranc3 · · Score: 1

      Hasing works on individual peices... You can determine the size but they are small and fairly constand (256k or 512k) Breaking one individual peice is all it takes to make the file unusable and wouldn't be too difficult fyi...

    87. Re:They have cracked strong hashes, huh? by ShadeOfBlue · · Score: 1

      Easy algorithm for this:
      Encryption: Computer generates script based on movie, includes all actor's name, stores it in a text file, and zips that.
      Decryption: Computer interpretes script and generates the movie based on stored voice and body models of the actors.

      Think about it, no longer would it be important how well the actor acted, but how good the computer was at interpreting the script. If it was open source, then the Academy Awards could open up a new category for the programmer who made the computer produce the most original interpretations. It's the future man!

    88. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      It's simple neuron-shifting, for christ's sake...

    89. Re:They have cracked strong hashes, huh? by Stiletto · · Score: 2, Funny


      Why the stereotype about NSA agents disappearing people? That kind of crap only happens in dictatorships. You can't do that in the USA because we are the land of the free! I know some NSA agents and they're great gu.f.a.,.adf,.ty....mrgATZ+++++

    90. Re:They have cracked strong hashes, huh? by redhog · · Score: 3, Informative

      Nah, you are both wrong. Two 160bit hashes are prolly somewhere in between as strong as a 320bit hash and a 160bit hash, depending on exactly how the hash-values distribute over the input space. If the hash where perfect, the distance between any two hash-values with one bit of difference would be the same. However, in reality, that would hardly be the case except for some hashes with a given data-to-hashsize-ratio. But taking two random hashfunctions would probably combine into one where many bits are redundant (not the same bits for all hash-values of course). Hm, hope that goes for enought of an explanation. Otherwize, go read up on coding theory at mathworld.wolfram.com or wikipedia. A search for "Hamming distance" might also be a good start :)

      --
      --The knowledge that you are an idiot, is what distinguishes you from one.
    91. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Not very long. One of the simplest programs that actually does anything (take a letter from stdin, capitalise it, put it to stdout) is only something like 24 bytes long in x86 machine code, AFAIK. One million monkeys will do that with just above 16 attempts each, provided no duplication of effort occurs.

    92. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      That would be analogous to the million monkeys typing until they produce shakespeare as a random event. (Wonder if that's also applicable to the US Govt., but I digress) You would simply be sifting through random data generated from a seed (random 160-bit string in the case of SHA1).

      The rules you program in to get the computer to make sense of your randomly generated mp3 would be the causal factor in creating the music. This kind of software already exists for determining what record companies push on us. But writing music through software, that is the really interesting part, not trying to undo what hashes do so well. The whole point of hash functions is to be a random uniform assignment, not a window back to the original data.

    93. Re:They have cracked strong hashes, huh? by rzebram · · Score: 1

      Gah, change metaphors, this problem would never occur with a Britney Spears MP3 because nobody has ever tried to download one.

    94. Re:They have cracked strong hashes, huh? by rbarreira · · Score: 1
      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    95. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      It would be more like .0001% of sources would be spoofed.

      Somehow I don't think the RIAA/MPAA is going to visit all the same private forum-based BT sites everyone else does. It may affect the huge "anything goes" torrent sites, but not the good ones.

    96. Re:They have cracked strong hashes, huh? by rc3105-Riley · · Score: 0

      those uber-compression algorithms have existed since the 1700's, no need to invent anything

      they just require more number crunching than the fastest supercomputers could provide in the lifetime of the universe

      *course, every once in a while a math geek pulls a rabit out of a hat and next thing you know the imposibble is $19.95 at radio shack

    97. Re:They have cracked strong hashes, huh? by brianosaurus · · Score: 1

      Or if they do that (and SHA-256, and whatever else...) just add a second hash to each packet.

      Surely there aren't packets A and B such that

      SHA1(A) == SHA1(B) AND MD5(A) == MD5(B)

      heh... are there?

      This is definitely an easily winnable arms race for our side.

      --
      blog
    98. Re:They have cracked strong hashes, huh? by me+at+werk · · Score: 1

      Oops, typo.

      s/MP3/MPG

      --
      For context, click Parent.
    99. Re:They have cracked strong hashes, huh? by Jondo · · Score: 1

      The NSA is the official communications security body of the US government.

      The Finnish company mentioned in the article is in Finland. I doubt they would have anything to worry about.

    100. Re:They have cracked strong hashes, huh? by MoriaOrc · · Score: 1

      Well, unless the hash has as many bits as the actual data, there will be multiple blocks of data that match the same hash. Adding more bits to the hash only makes those fewer and farther between. And a hash that is the same length as the data would sort of defeat the purpose of hashing :P

    101. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      True.

      The point, however, is that if they have indeed cracked strong hashes (highly unlikely) then the bittorrent client will get bad data, but it will hash as though it were good data. Therefore, the client won't ban the offending ip but will instead continue to spread the bad data.

      That's the potential problem.

    102. Re:They have cracked strong hashes, huh? by TCQuad · · Score: 1

      Okay, they have found collisions but no one has found a way to generate file for a given key.

      This may be extrodinarily naive, but isn't the MD5 hash simply something the program computes or obtains for any given file? If that's the case, then what would stop the **AA from simply "adjusting" the program so that the proper hashes are assigned to a bogus file? Broadcast that the hash is correct, but when the file's downloaded, it's broken. One broken piece per download (since most services use multiple fractions from multiple sources) would kill the file, force a redownload and thus make P2P completely unusuable.

    103. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Well MD5 collisions can now be made within a few hours on a regular notebook. So if they had enough time and computing power, they could just crank out random inputs that create the same hashes with legit files.

      SHA-1 is a bit more resistant even though it has been cracked.

    104. Re:They have cracked strong hashes, huh? by Jonboy+X · · Score: 1

      Wouldn't it not be the same size, though?

      Hell, I bet they can come up with a collision of the exact same size. Same content, too.

      --

      "In a 32-bit world, you're a 2-bit user. You've got your own newsgroup, alt.total.loser." -Weird Al
    105. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      No

    106. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      Randomly-generated but valid MP3 files would probably sound a little bit like randomly generated raw wave files, I imagine.

      Sure, they obey the file format rules but that doesn't mean they will obey any of the rules used in constructing music. And there's quite a few of those, it's a fair bit more complex than administrating a Linux box.

      So I suspect you'd get something that would sound like randomly-generated noise, or a broken sound card. Not interesting random music.

      If you want that, you'll need to start using a file format that describes music, not sound. MIDI would be a start, but randomly generated MIDI that doesn't abide by any of the rules that your brain accepts as "music" would still sound like crap. ABC might get you closer, but in all honesty you'd probably get closest with a format based on setting a key signature and then working in scale degrees. At least then you'd have a chance of producing tonal music, which is what you're more likely to recognise as sounding "musical" when combined with random rhythmic variances.

    107. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      I dunno. The FBI still seem to be able to get their hands on servers in the UK alright...

    108. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      It might work on Kazaa but most other P2P networks use MD5 or better.

      Kazaa uses MD5. It just uses it really really baddly. It not only combines MD5 with a faster and much weaker custom hash, but it does not hash entire files. Only portions!

      Morons.

    109. Re:They have cracked strong hashes, huh? by irc.goatse.cx+troll · · Score: 1

      You only have to polute whats popular, and you don't even need the full file to polute, just the hash.
      I once had a small app that would collide crc32 for you, you just fed it a .sfv and it would generate random files that would match within a few seconds. you then could fxp it to your favorite topsite and watch it spread, getting couriers credits nuked and ruining reputations (of the site, those transfering, and the release group, depending on how fast you fake their after a pre)

      (sorry if this posted twice, lynx is being odd)

      --
      Pain lasts, kid. Its how you know you're alive. Sometimes I think this growing up thing is just pain management-TheMaxx
    110. Re:They have cracked strong hashes, huh? by guorbatschow · · Score: 1

      lol... if so, we'd only have 2^1024 posibilities for a movies, which is a large number (~1,789*10^308) but would still be to small a number for the creativity of men isnt it?

    111. Re:They have cracked strong hashes, huh? by Anonymous Coward · · Score: 0

      No, just build a dysonsphere around it. [Schneier chapter 7]

    112. Re:They have cracked strong hashes, huh? by CristianoMonteiro · · Score: 1

      Modern P2P applications (eMule, BT...) divide the shared file in several small, fixed length pieces an generate a hash for every piece, as well as for the whole file.

      As soon as a piece arrive, its hash is checked, if the known hash doesnt match with the calculated one, the piece is discarded and, at least in BT, the peer that sent the bogus piece can be blacklisted.

      So, assuming that the claim that they broke MD5,SHA1, etc.. all at once (they claim "100% effectiveness!"), is bogus, I see no real world impact on current P2P technology.

      --
      -------------------------------------------- Se você consegue ler aqui então fala português. Óbvio
    113. Re:They have cracked strong hashes, huh? by CDarklock · · Score: 1

      This is not even remotely the same question.

      The cited post focuses on the question of generating multiple messages that have the same hash, but it does NOT take into account the question of that message being specific in meaning.

      This is the type of horror story I'd like to avoid. I can see Joe Dipstick setting himself up as a mirror site for something, adding nasty bits to it, and then altering the files to collide with the official hash on the official site. You download the project, you MD5, you SHA1, you compare, and everything looks kosher; you do the configure-make dance, and you fire it up to do its nasty deeds. This is the kind of thing that worries the hell out of big corporations, and I'd like to ensure that this is still not a realistic scenario.

      So we're not talking about "generate X messages that have the same hash under both SHA1 and MD5". We're talking about "generate X messages that have THIS hash under SHA1 and THAT hash under MD5". It's not "go out and run into a car", it's "go out and run into Brad Pitt's car". Add the second hash, and you're talking about "go run into Brad Pitt's car until you can bounce off and run into Sylvester Stallone's car, too". I don't think it's hard to see why this would have a vastly different probability than "run into one car, then bounce off and hit another".

      The birthday attack *relies* on the condition that what the hash IS doesn't matter, you simply want a hash collision. That sort of theoretical exercise is great for designing hash functions, but it just plain doesn't interact with the real world very well. What good does it do me to have two *random* messages with the same SHA1 and MD5? If I change them, they won't. It might prove that SHA1 and MD5 need to be replaced by a better hash algorithm, if only to make the math geeks happy, but it certainly doesn't prove that they're completely insecure and nobody should use them.

      --
      Microsoft cheerleader, blue flag waving, you got a problem with that?
    114. Re:They have cracked strong hashes, huh? by CDarklock · · Score: 2, Informative

      > Two 160bit hashes are prolly
      > somewhere in between as strong
      > as a 320bit hash and a 160bit
      > hash

      That's exactly what I'm saying. If the two hashes are completely independent -- zero bits of redundancy -- then you have a 320 bit hash. If they're completely redundant, you have a 160 bit hash. So the question is how independent MD5 and SHA1 are; if they're completely independent, then they combine to a 288 bit hash. If they're completely redundant, they combine to a 160 bit hash and you may as well just use SHA1.

      The birthday attack isn't really relevant to practical hashing, anyway. Hashes collide; that's why we use them. When you use 128 bits to represent two megs of data, there's going to be something else that has the same hash. The existence of multiple messages with the same hash is a natural, normal, and NECESSARY quality of a hash function.

      --
      Microsoft cheerleader, blue flag waving, you got a problem with that?
  3. Bite My Shiny Metal Ass by B3ryllium · · Score: 5, Funny

    Bah! Screw you guys. I'll just make my own P2P hash algorithm. With blackjack. And hookers. In fact, forget the P2p hash algorithm. And the blackjack.

    1. Re:Bite My Shiny Metal Ass by Anonymous Coward · · Score: 0

      You pervert! Say no to hookers, it's unnatural.

      Now, hookerbots are another thing entirely.

    2. Re:Bite My Shiny Metal Ass by Anonymous Coward · · Score: 0

      Shhh, drink your beer.

    3. Re:Bite My Shiny Metal Ass by Anonymous Coward · · Score: 0


      If hookers are unnatural, then humans are unnatural.

    4. Re:Bite My Shiny Metal Ass by Saeed+al-Sahaf · · Score: 2, Funny
      Bah! Screw you guys. I'll just make my own P2P hash algorithm. With blackjack. And hookers. In fact, forget the P2p hash algorithm. And the blackjack.

      Forget the p2p algorithm and the blackjack, I'll take the HASH!

      --
      "Who are in control, they are not in control of anything - they don't even control themselves!" - Glen Beck
    5. Re:Bite My Shiny Metal Ass by shotfeel · · Score: 1

      I'll just make my own P2P hash algorithm.

      Actually that might be kind of fun (OK, not as fun as the blackjack and hookers...)

      Create your own P2P hash algorithm then use the DMCA to sue anyone who tries to mess with it.

    6. Re:Bite My Shiny Metal Ass by FuzzyBad-Mofo · · Score: 1

      Eh, screw the whole thing.

      (the moon shall rise again!)

    7. Re:Bite My Shiny Metal Ass by orkysoft · · Score: 1

      So... one $300 hookerbot or 300 $1 hookerbots?

      --

      I suffer from attention surplus disorder.
    8. Re:Bite My Shiny Metal Ass by Anonymous Coward · · Score: 0

      Definitely the one $300 hookerbot. Far better quality: fluid head, full monocoque carbon fiber pelvis, and liquid metal boobies. You won't find such goods on $1 wattwhores.

      Besides, after six or seven of the $1 variety, don't you think hookerbot ennui would set in. You'd have titanium digits up your arse, your hands tied behind your back with an IDE cable (master/slave, of course), and you'd feel nothing.

      Fugeddaboutit.

  4. "Copyrighted" by As+Seen+On+TV · · Score: 5, Informative

    It's "copyrighted," not "copywritten." We're talking about rights, not writings.

    1. Re:"Copyrighted" by 0x461FAB0BD7D2 · · Score: 2, Funny
      The Finnish company can only stop people from using the copy command.

      They patented the following algorithm (and I know I'm going to get into so much trouble for this, but what the heck):
      chmod 777 /bin/copy
      rm /bin/copy
      Those intelligent bastards.
    2. Re:"Copyrighted" by Anonymous Coward · · Score: 1, Funny
      They patented the following algorithm (and I know I'm going to get into so much trouble for this, but what the heck):
      chmod 777 /bin/copy
      rm /bin/copy
      Those intelligent bastards.
      $ chmod 777 /bin/copy
      chmod: cannot access `/bin/copy': No such file or directory
      Oh fuck! They've got me already!
    3. Re:"Copyrighted" by 0x461FAB0BD7D2 · · Score: 1

      What's your IP? I want to add you to my PeerGuardian. I don't want you infecting me.

    4. Re:"Copyrighted" by Anonymous Coward · · Score: 0

      Have no fear, I h4xx0red your box and set you up with a new copy utility - it's called cp. I even set you up with a man page for it!

    5. Re:"Copyrighted" by tverbeek · · Score: 1
      It's "copyrighted," not "copywritten." We're talking about rights, not writings.

      I'm sorry, but these concepts of "rights" and "writing" are over the head of too many file-sharing enthusiasts.

      --
      http://alternatives.rzero.com/
    6. Re:"Copyrighted" by khrtt · · Score: 1
      Hmm... Let's try this...
      curly# chmod 777 /bin/copy
      /bin/copy: No such file or directory
      curly# rm /bin/copy
      /bin/copy: No such file or directory
      Something must be wrong...
    7. Re:"Copyrighted" by jc42 · · Score: 1

      Heh. Not only did they get the file name wrong, but there's the second, more clueless error. Removing a file from a directory requires write permission on the directory, not the file, since it's the directory that you're modifying (by zeroing the inode number of the file's directory entry).

      Of course, changing the permissions of /bin/cp to 777 would let you overwrite it with a copy of /bin/true, which would be even more damaging because it wouldn't produce an error message.

      But if you can change any of these permissions either you're a wheel or there's something much more seriously wrong with the system.

      --
      Those who do study history are doomed to stand helplessly by while everyone else repeats it.
    8. Re:"Copyrighted" by Anonymous Coward · · Score: 0

      Yeah, like Michael Robertson is your admin!

  5. Already done by stoanhart · · Score: 0, Redundant

    how will this be different from the flodding of fake files already on P2P networks like Kazaa. Sure, the hash will be the same, but what "JHoe Sixpack" looks at hashes?!

    1. Re:Already done by B3ryllium · · Score: 5, Informative

      By the time this is submitted, it will probably already be redundant (even though it's informative :)) - but the hashes are used for parallel download streams of the same file. So, if you saturate the network with the same hash, you can corrupt the data when the client automatically assumes it's the same file and tries to merge it with the other incoming data.

    2. Re:Already done by stoanhart · · Score: 1

      I see. So you could end up with a song that is a half-song, half-static type of thing?

    3. Re:Already done by rkcallaghan · · Score: 4, Informative

      how will this be different from the flodding of fake files already on P2P networks like Kazaa. Sure, the hash will be the same, but what "JHoe Sixpack" looks at hashes?!

      Joe Sixpack may not look at hashes, but his P2P software probably does. I know aMule uses the hash to match files that have had their names changed.

      ~Rebecca

    4. Re:Already done by Anonymous Coward · · Score: 0

      Ah, but the solution is trivially easy... set the number of sources from which you will attempt to download a given file at "1" so as to remove the possibility of merging a good file and a corrupt but "same hash" file altogether.

      This requires that both the uploader and downloader have good, fast pipes, but means that hash spoofing is worthless - either you'll get the good file or the corrupt file, but not both (resulting in another corrupt file).

    5. Re:Already done by northcat · · Score: 1

      (As the other poster said in his own words) The user doesn't have to check the hashes in p2p. The program does it automatically. That's how it recognizes and checks files.

    6. Re:Already done by Anonymous Coward · · Score: 1, Insightful

      > So you could end up with a song that is a half-song, half-static type of thing?

      I think that's called "Nine Inch Nails".

    7. Re:Already done by nother_nix_hacker · · Score: 1

      Completely taking the point out of a distributed network....

    8. Re:Already done by lantenon · · Score: 1

      So why wouldn't simply running a checksum on the pieces (in addition to the hash on the file) solve this problem? Isn't this what bittorrent does?

    9. Re:Already done by AdamPiotrZochowski · · Score: 1


      except amule, or ed2k network to be precise as it accounts for
      emule/amule/edonkey/kademelia/overnet/sharaza , all rely on md4
      hashes in cojunction with file sizes to identify uniqly files.

      Sure, md4 is not considered safe, but still not that easy to fake.
      In other words, NSA or super computers can do it, but it would
      be a high cost to do so for each britney song out there.

      Furthermore, ed2k networks use additional hashes for each
      file 'part'. I am not sure if these file parts are later built
      into TigerTree hashes or not, but obviously this is a hurdle.

      If anything this is mostly an attack on Kaazzaa which employs
      own hashing method dubbed : 'sig2dat'

      --
      /apz, Nuclear war can ruin your whole compile - Karl Lehenbauer

    10. Re:Already done by boron+boy · · Score: 1
      P2P software only checks the hash to make sure that you're downloading the same file from different sources, despite the filename. It is not used to verify that the file you are downloading is actually the file you want. The **AA can upload a file with the name "Britney Spears - Hit me one more time.mp3" with any filesize and hash they want. If they flood the network with enough bogus filenames P2P users wont be able to be able to find a legitimate (or is that illegitimate?) file to download without wasting lots of time (and bandwidth).

      The issue of hashes only comes into play once you have started to download a real copy of the file. If you were downloading a bogus copy from the start, a bogus file is what you'll get.

    11. Re:Already done by patio11 · · Score: 1

      Right, but the P2P software is only able to distinguish 234fd235 from 234634fe3, not Toxic -- Brittney $pears.mp3 (the real deal) from Toxic -- Britney Spears.mp3 (three minutes of white noise). Hashes don't protect the weak link in the chain, which is content discovery -- polluting the search space works just as effectively as polluting the bit stream if your protocol doesn't allow people to, for example, aggregate or filter content based on trustworthiness, etc.

  6. Minor annoyance by Anonymous Coward · · Score: 0

    Minor annoyance

  7. Preview/Trailer by fembots · · Score: 3, Interesting

    I guess there are two schools here.

    One believes this kind of fake files will only add burden to the internet, as users will just download one fake file after another until they got a hit.

    The other believes that such annoyance will put most people off, because the total time/cost it takes to acquire something is now higher than the actual product.

    I don't think MP3s will be affected because you can start playing the song if you've got the first bit. Can/will other file formats do that too?

    1. Re:Preview/Trailer by Audigy · · Score: 1

      mpg, definitely yes.
      avi, most no, unless you copy the previously downloaded chunk (assuming your p2p program downloads linearly instead of random chunks of the file) and open it in something like VirtualDub.

      --
      [an error occured while processing this directive]
    2. Re:Preview/Trailer by KarmaMB84 · · Score: 4, Funny

      I'm not downloading copyrighted music, I'm downloading junk to burden the p2p network with useless traffic. It just so happens I go a real file in the process!

    3. Re:Preview/Trailer by De+Lemming · · Score: 1

      I don't think MP3s will be affected because you can start playing the song if you've got the first bit.

      This (should they really have found a way to generate a file for a given hash) affects the inner workings of the P2P applications. Your first bit could be from a perfectly legitimate file, but then the program will find a second (fake) download source with the same hash, and start downloading from there too. End result: half of the file is ok, half of the file is garbage...

    4. Re:Preview/Trailer by John+Seminal · · Score: 2, Interesting
      One believes this kind of fake files will only add burden to the internet, as users will just download one fake file after another until they got a hit.

      The other believes that such annoyance will put most people off, because the total time/cost it takes to acquire something is now higher than the actual product.

      What will hurt P2P is how hard finding a good network is. Kaaza is filled with spyware, and half the stuff on there is not good. There are lawsuits all over the place, it is not worth it. Bit Torrent, which was nice, is also under attack by the RIAA. You get better files with Bit Torrent, less of the fakes, people sharing seem to check their files. But torrent websites are going down, at least the well known ones.

      What I think will be the next wave will be private P2P, by invitation only. It will be a group of friends sharing their music and files. It will be closed to outsiders, so the only people aware are friends.

      But even if there is a private P2P, with only a group of friends who know each other, will the RIAA be able to scan the internet, looking for their files? Will they go after friends sharing music the same way they would go after strangers sharing music?

      --

      Rosco: "If brains were gunpowder, Enos couldn't blow his nose."

    5. Re:Preview/Trailer by un1xl0ser · · Score: 1

      Lets say that you have 1024 pieces of data. You get 512 pieces from clients who actually have the real data, and the other 512 from bots with the collision data.

      You have crap now. You can't go and look through the file to determine what chunks are bad, because you don't know what data should be there.

      If they could generate collisions with the current hash system of any given P2P client, the only answer is to upgrade the type of hashing to something better.

      --
      v4sw6PU$hw6ln6pr4F$ck 4/6$ma3+6u7LNS$w2m4l7U$i2e4+7en6a2X h
    6. Re:Preview/Trailer by jr87 · · Score: 1

      already happening, a group of friends at my college all use WASTE to share stuff with eachother, it's private and invitation only, and we keep it relatively secure. Only a matter of time before people start catching on.

    7. Re:Preview/Trailer by tyldis · · Score: 1

      I've capped my DSL line to 1kbit and I'm downloading all I can from P2P networks just to keep slots busy. EAT THAT, CRIMINALS!

    8. Re:Preview/Trailer by khrtt · · Score: 1

      Private network means registered IPs, and secret keys, which makes it very difficult to hack from the outside. If you run BitTorrent, but only give the .torrent to your friends, you are safe, as long as none of your friends is a narc^H^H^H^HRIAA agent.

  8. Everytime a new copy protection scheme is released by lord_rob+the+only+on · · Score: 0

    it's only a matter of days before it is cracked... I don't see why this scheme could be an exception to this rule.

  9. Coral Cache by Anonymous Coward · · Score: 5, Informative

    I took the liberty of pre-caching the site on Coral before it went live - http://www.viralg.com.nyud.net:8090/index.html. I think Slashdot should really consider doing this as part of the proceedure...this site won't last a minute under the weight of our collective, nerdy asses.

    1. Re:Coral Cache by lpp · · Score: 2, Funny
      won't last a minute under the weight of our collective, nerdy asses


      What would?
    2. Re:Coral Cache by Talking+Goat · · Score: 2, Funny

      I'm trying to figure out why the guy on this website's banner is pointing (what looks like) a Gamecube controller at me. Is he going to ruin our P2P experience from a Nintendo? How 1337.

      --

      + G to tha Izzo, A to tha Tizee, Talking Giz-oat, Ya'll Bettah Feel Me... +
    3. Re:Coral Cache by Anonymous Coward · · Score: 0

      Uhm.. exactly why they linked it! :)

    4. Re:Coral Cache by hoborocks · · Score: 1

      this site won't last a minute under the weight of our collective, nerdy asses

      ....so? :-P

      --
      AccountKiller
    5. Re:Coral Cache by cloudmaster · · Score: 1

      I think he's saying "we're just playing with you - we don't have shit"...

    6. Re:Coral Cache by Anonymous Coward · · Score: 0

      It's not a Gamecube controller, but some freaky Photoshop creation. C'mon, four analog sticks? That makes about as much sense as their claims...

    7. Re:Coral Cache by WhiskerTheMad · · Score: 1

      ...this site won't last a minute under the weight of our collective, nerdy asses.

      Whoo... that brought up some ugly mental imagery for a minute there.

      --
      Love your country always, but respect your government only when it deserves it. -- Mark Twain
    8. Re:Coral Cache by rbarreira · · Score: 1

      Speak for yourself - my ass is not collective...

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    9. Re:Coral Cache by fbjon · · Score: 1

      Don't forget to add "pasty", to complete the image.

      --
      True confidence comes not from realising you are as good as your peers, but that your peers are as bad as you are.
    10. Re:Coral Cache by fcrick · · Score: 0, Flamebait

      Coral sucks. Stop posting Coral links. It works if you have a controlled environment, but for some reason people think its this smiley fuzzy idea that they should support even though it doesn't actually work.

      Fix the system. Get it working in the real world, and _then_ start posting links.

      --
      Your signatures belong to me.
    11. Re:Coral Cache by Anonymous Coward · · Score: 0

      I think Slashdot should really consider doing this as part of the proceedure...this site won't last a minute under the weight of our collective, nerdy asses.

      Uh, what about http://www.mirrordot.org/?

  10. Reply to this post... by Anonymous Coward · · Score: 0

    Reply to this post with all workarounds.

    1. Re:Reply to this post... by Anonymous Coward · · Score: 0

      Bittorrent.

    2. Re:Reply to this post... by Hogwash+McFly · · Score: 1

      Buying the music?

      I jest. I bes a scurvy dog like the rest of ye.

      --
      Mother, do you think they'll like this sig?
  11. Good for them? by mwkaufman · · Score: 1

    Are they hoping the RIAA is going to buy it off of them? I have a strange feeling that this won't be the end of file-sharing on the internet. :-p

  12. The question is.. by k98sven · · Score: 2, Interesting

    How big is that 'junk file'?

    1. Re:The question is.. by Anonymous Coward · · Score: 0

      Probably the same size as the original file. At least it would be if these people knew what they were doing.

    2. Re:The question is.. by Anonymous Coward · · Score: 0

      infinitely impossible ^ 2

  13. Possible? Yeah by robpoe · · Score: 5, Interesting

    I've always thought it would be extremely possible to create a file with the same MD5 hash.

    Now, what the company has to do is create a file of the SAME FILE SIZE, with the same MD5 hash that's a fake .. then I'll be impressed.

    --
    = Grow a brain...
  14. Doubt it by stealthmidget · · Score: 1, Insightful

    I highly doubt this would work - the object of a P2P network is to "peer-review" the files that get transferred. If you get a crappy copy of a file, most people delete it. Therefore, when one searches, the most popular results will most likely be the correct file and not the bad one.

    1. Re:Doubt it by Anonymous Coward · · Score: 0

      Yeah, you'd think that's what would happen, but the last time I tried to use kazaa (lite) it was obvious that this was not happening.

    2. Re:Doubt it by Anonymous Coward · · Score: 0

      I highly doubt this would work - the object of a P2P network is to "peer-review" the files that get transferred. If you get a crappy copy of a file, most people delete it. Therefore, when one searches, the most popular results will most likely be the correct file and not the bad one.

      The problem is when you click the msot popular file, the P2P app really searches for all peers with a file matching the specified hash. The idea here is that sure, you download legit data from maybe 4 peers, but 20 peers are feeding you garbage with the same hash. So even the popular copy will get corrupted with garbage.

    3. Re:Doubt it by B3ryllium · · Score: 1

      The intent of this technology, as I interpret it, is to induce the P2P software itself into willfully corrupting the downloaded files by merging the valid data (with Hash A) and the invalid data (with the identical Hash A). So, for P2P networks that rely on the hash to merge multiple downloads into the same file, this will be a serious issue.

      Also, I don't think the hashing algorithms on these networks are tied to the entire file; I think it only hashes parts of the files (for speed), so that means that there's a chance a bogus file of the same size could have the same hash.

    4. Re:Doubt it by Binestar · · Score: 1

      Also, I don't think the hashing algorithms on these networks are tied to the entire file; I think it only hashes parts of the files (for speed), so that means that there's a chance a bogus file of the same size could have the same hash.

      Actually, this makes sense. If the P2P programs are sidestepping and just hashing a small portion of the file then this is easy to implement. Find out which portion of the file they are hashing, get that portion of the file, put it into your bogus file at those exact points and pad your file to the proper size. Of course, then the fix is an easy one, patch the P2P client to hash the entire file =)

      --
      Do you Gentoo!?
    5. Re:Doubt it by B3ryllium · · Score: 1

      I felt a disturbance in the force, as though a million users cried out at once and then were suddenly silenced ... "Whyyyyyyyy does it take so long to share my files!?!?"

  15. Minor annoyance at first.... by dgatwood · · Score: 4, Interesting
    ...but if you can create a random junk file in a reasonable period of time, the mechanism can probably be extended easily enough to make it possible to add arbitrary junk to the end of a trojaned executable in a future version of the tool....

    --

    Check out my sci-fi/humor trilogy at PatriotsBooks.

    1. Re:Minor annoyance at first.... by Deliveranc3 · · Score: 1

      No... wrong. The chances of them finding a executable trojan which matches any hash is highly unlikely... It's far easier just to build into the wmv scripts... or some other evil hack.

      wma can execute code right?

  16. In other news... by Anonymous Coward · · Score: 1, Funny

    ...they also found a way to block said files from being dragged into the Trash Can and deleted!

  17. claims? by geoffspear · · Score: 5, Interesting
    I read the article and everything I could find by following links on their website, and found no reference to how their product supposedly works, or any claim having to do with identical hashes. Did the article submitter just make up the identical hash claim, or is there more information on this product available somewhere else?

    What hashing algorithm do they claim to have broken so completely? Sounds like BS to me.

    --
    Don't blame me; I'm never given mod points.
    1. Re:claims? by Qzukk · · Score: 1

      They don't outright state "all your hashes are belong to us" but the things they claim to be doing are more-or-less impossible unless they somehow subvert the hash process.

      I suspect that what they really do is look up the "right" hashes from the various hash-checking sites, then have clients that rather than actually calculate the hash from the junk file, simply tell everyone that the junk file hashes to the "right" hash, and nobody would know better until they downloaded it and it failed the local hash check (which would fit their definition of "success": someone wasted time downloading data and had to check afterwards).

      --
      If I have been able to see further than others, it is because I bought a pair of binoculars.
    2. Re:claims? by geoffspear · · Score: 1
      The things they claim seem, to me, to be completely separate from hashing (and, at the same time, are more-or-less impossible no matter what they're doing).

      They claim, or at least strongly imply, that their technology can protect a movie from being taped at a theater and then distributed over the internet. Are we to believe that one movie studio (remember, they also claim that BMG specifically benefited from their technology) can use their technology to locate every version of each of their movies being traded, download it, and create fake files to replace those versions? The "virtual algorithm" they'd need to just find all of the pirated works and make sure they're the IP of their client (wouldn't want to help the competition who's not paying for the technology) would be significantly more nontrivial than just cracking all of the prevalent hashes.

      Does anyone believe that some company you've never heard of before now has perfected quantum computing, and is using their quantum computers to sell DRM?

      My guess: Finland has weak fraud laws, and they're hoping some big media company is being run by morons.

      --
      Don't blame me; I'm never given mod points.
    3. Re:claims? by BalDown · · Score: 1

      and they're hoping some big media company is being run by morons.

      Sounds like a safe bet to me!

      --
      You wasted packets to get this lousy sig.
    4. Re:claims? by rbarreira · · Score: 1

      They claim to use "virtual algorithms". Nice eh?

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    5. Re:claims? by rbarreira · · Score: 1

      I suspect that what they really do is look up the "right" hashes from the various hash-checking sites, then have clients that rather than actually calculate the hash from the junk file, simply tell everyone that the junk file hashes to the "right" hash, and nobody would know better until they downloaded it

      That's the nice thing about bittorrent - each block of the file (and they're not very big) has it's own hash, so anyone trying to spread bullshit data gets blacklisted pretty fast...

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    6. Re:claims? by Anonymous Coward · · Score: 0

      UUHash. It's arbitrary to break.

      It's MD4 of PARTS of the file, 300kb chunks of the file with 300kb*N (Where N is the number of offsets so far).

      Change any of the data in the offsets, and the file is worthless...

    7. Re:claims? by SpecBear · · Score: 2, Informative
      Looks like a fraud/hoax/jok/whatever.
      • There's no text on the site. It's all images and flash animations. This immediately raises suspicions.
      • They claim that the technology has already been successfully used by BMG.
      • No Company info, phone number, or address, just a single email address
      • No details of how the tech works.
      • Claims 100% effectiveness.
      • Red alert phrase: "virtual algorithm"

      Anybody remember the name of that company that promised extremely high lossless compression rates on arbitrary files?
    8. Re:claims? by puhuri · · Score: 1

      You are probably right: domain contact has email address on domain hosting joke bulletin board...

  18. Allow me to be one the first to say... by Ann+Elk · · Score: 5, Insightful

    Bullshit. "Virtual Algorithms" my ass.

    1. Re:Allow me to be one the first to say... by bigberk · · Score: 5, Insightful
      Bullshit. "Virtual Algorithms" my ass.
      You called it. They can either do proper MD5/SHA1 collisions with unchanged filesize, or they can't. My guess is, they can't.
    2. Re:Allow me to be one the first to say... by Anonymous Coward · · Score: 0

      The best part is that is is patented! If someone could find the patent filling files...

    3. Re:Allow me to be one the first to say... by protohiro1 · · Score: 1

      I am getting the impression that they aren't generating a junk file with the same hash, but some how SPOOFING the hash. I have no idea how one would do this, but I suppose it would be feasible with a special client.

      --
      Sig removed because it was obnoxious
    4. Re:Allow me to be one the first to say... by WhitetailKitten · · Score: 1

      As opposed to REAL algorithms!

      I've got tons of virtual code around to run on my virtual computer and make virtual money and do virtual things with virtual lascivious women in my virtual life.

    5. Re:Allow me to be one the first to say... by TexasDex · · Score: 1
      From their (Coral-Cached) site: "Patented virtual Algoritm blocks out all illegal swapping of your data"

      Time to check the patent registry, and call them on it. I think they're just BSing.

      --
      The Cheese Stands Alone.
    6. Re:Allow me to be one the first to say... by Anonymous Coward · · Score: 0

      They can either do proper MD5/SHA1 collisions with unchanged filesize, or they can't. My guess is, they can't.

      They don't need to. How does a p2p client determine if the content is correct? By hashing the downloaded data and comparing the result with the given hash value.

      If the spoofing source announces that they have the same hash as the real source, you will download the fake, hash it, and then realize it is fake.

      So, they just made you waste your time & bandwidth. Add a lot of spoofing sources, and this can add up.

    7. Re:Allow me to be one the first to say... by bigberk · · Score: 1
      If the spoofing source announces that they have the same hash as the real source, you will download the fake, hash it, and then realize it is fake.
      Perhaps the biggest irony: if the media companies really have the kind of bandwidth required to flood P2P with fake data, this whole time they could have been making money by selling downloadable movies. But no, for the past five years they claimed that delivering video over the internet was not economically feasible.
    8. Re:Allow me to be one the first to say... by JediTrainer · · Score: 1

      They can either do proper MD5/SHA1 collisions with unchanged filesize, or they can't. My guess is, they can't.

      I would tend to agree. Imagine the panic it would cause. SSL Certificates and signatures in PDF documents would suddenly become worthless (until we find a better hash algorithm). I'm pretty sure this would cause quite a stir.

      --

      You can accomplish anything you set your mind to. The impossible just takes a little longer.
    9. Re:Allow me to be one the first to say... by Anonymous Coward · · Score: 0

      download the fake, hash it, and then realize it is fake.

      If someone sends you a data that does not match the hash they said it has then you immediately stick them on a banned list. They would need a huge number of spoofers to have any signifigant effect when each spoofer can only ever send you one fake block. The longer you use the system the bigger your banned list. Things just improve for you the longer you use the system.

  19. Secure Hashes vs. Fake Files by CharonX · · Score: 1

    Well, there have been reports that some hash algrorithms are prone to "collisons" i.e. it is possible to find, with some effort, files that produce the same hash value and having the same size despite having different content.
    The easy solution:
    Use a safer Hash function.

    --
    +++ MELON MELON MELON +++ Out of Cheese Error +++ redo from start +++
    1. Re:Secure Hashes vs. Fake Files by Capt'n+Hector · · Score: 2, Interesting
      Use a safer Hash function.

      Or even better, use more than one. If file_x is hashed 10 different ways, using 10 different algorithms, there's no way the file generated by this firm will behave the same way for ALL of them, perhaps not even for two.

      --
      Quid festinatio swallonis est aetherfuga inonusti?
      Africus aut Europaeus?
    2. Re:Secure Hashes vs. Fake Files by Anonymous Coward · · Score: 0

      _ALL_ hashing algorithms behave this way becaus it would be impossible to create a small hash value that is unique for every possible file for a certain size. Let's give an extreme example. We have any hash function giving out a one byte hash value. there is 256 distinct hash values. Try hashing a 100 byte large file, there are 8^100 such files. Hence, becaus of the pigeon hole rule, at least one of the hash values is generated by multiple files. It is very simple really, but often overlooked by people that don't think about it for very long. The values 1 byte and 100 bytes can be any number where the first value is less than the second.

    3. Re:Secure Hashes vs. Fake Files by Retric · · Score: 1

      A 10mb file that has 10 X 8192 bit hashes would still have a around 1000 files of the same size that would produce identical hashes.

      The only way to avoid having more than one file hash to the same value is for the hash to be equal in size or larger than the file you start with. Otherwise all your really doing is creating a Meta hash that is a composite of several functions.

      There is an advantage to using more than one hash function in that you may find out if one of them get's broken in time to change your system to use a new one. However, there is little value in using more than two reasonably strong Hash functions in your Meta hash, as doing so would eat up a lot of CPU time and Hash functions tend to last a while with out being broken and even if both functions are broken they still need to break though your Meta hash function.

    4. Re:Secure Hashes vs. Fake Files by Wavicle · · Score: 1

      I once had a job at a place whose business was software to control provisioning and billing of broadband services. I was brought in to salvage a project that had gone terribly awry. For reasons which were NOT MY FAULT, one table of the database was designed with immutable rows. Once a record was written, it could only be deleted or read, never altered.

      The problem was that at times they could never quite pin down, they would attempt to add a new entry to the database and things would fail unusually requiring the client software to be restarted and the whole transaction to be re-entered, at which time it would usually succeed.

      The problem turned out to be two fold: First the real problem was being hidden by exception handling code that silently masked the fact that something had gone wrong. Once I fixed this I found the real culprit: since the rows were immutable but required a primary key, the guy designing the database came up with an ingenious solution: make a hash of the values the primary key! (This sounds like a lot of work, but because of the O-R mapping layer in place, it was actually less code) Since one of those fields was a current timestamp, the insert succeeded when they tried to do the insert after a restart.

      He informed me, quite matter-of-factly, that I did not understand that hashes were unique, and therefore this was a quite reasonable thing to do. I tried and tried to explain to him that it simply was not possible to uniquely hash all combinations of n bits of information in a hash of size n-k (k > 1). But his expensive ITT (or was it Heald?) education seemed to trump any rational argument I posed.

      --
      Education is a better safeguard of liberty than a standing army.
      Edward Everett (1794 - 1865)
  20. For all the new 'copysafe' tech that comes out... by FortKnox · · Score: 3, Insightful

    ... it only takes most pirates (at most) a week to find a work around and everything is back to (pirating) normal.

    --
    Good quote, too many chars. Seriously, the slashdot 120 char limit sucks!
  21. OLD! by Anonymous Coward · · Score: 0

    This ain't new news. Some hash-algos have been compromised more or less - it just takes time to compute a file which has the same bitprint as any other file.. ..however if this same tech was used for illegal purposes, say faking a Linux distro .ISO..

    1. Re:OLD! by NetNifty · · Score: 1

      I doubt they'd be stupid enough to fake a linux distro ISO (at least not stupid enough to do it on a completely legitimate network like for example on a distro's official torrent tracker, and thats if this tech even works for bittorrent in the first place). The thing I'm worried about is them doing this on files which are now public domain in countries with shorter copyright terms than the US (US has how long copyright now, author's death + 75 years?). Compared to even the UK with it's 50 (and I'm sure there are countries with a lot shorter copyright term and a non-negliagable connected userbase) years copyright, there's a hell of a lot of material which is legal to download (without permission) inside the UK but not inside the US.

    2. Re:OLD! by Nom+du+Keyboard · · Score: 1
      If MS are the Borg, then the *AA are the ferengi

      And just which Rule of Acquision are we talking about here?

      --
      "It's the height of ridiculousness to say for those 9 lines you get hundreds of millions."
    3. Re:OLD! by NetNifty · · Score: 1

      Number ten - "Greed is eternal".

    4. Re:OLD! by Anonymous Coward · · Score: 0

      This ain't new news. Some hash-algos have been compromised more or less

      If you're referring to SHA and MD5, then it's less, not more.

      The "breaking" of these is limited to *one* person, being able to generate two files that hash to the same thing - not terribly useful in this area.

      Again. In order to be able to make a second file with the same hash, you *must* be able to control the content of the first file. In other words, you generate two files that have the same hash value. If you're not allowed to generate the first file (because it's already on the P2P networks, for example), then you can't generate the second one, either.

  22. Er.. by t_allardyce · · Score: 3, Interesting

    They might be able to fake one hash, but don't most P2P networks use a combination of different hashes? if not then it would be easy to implement - you can either go for more than one different type of hash like md5 and sha etc or add salt/pepper to a chunk and make any number of hashes where each additional hash makes it insanely harder to crack..

    --
    This comment does not represent the views or opinions of the user.
    1. Re:Er.. by OAB_X · · Score: 1

      G2 uses SHA-1 and TTH. eDonkey only uses MD4. BT trackers could filter it out after they notice that some clients are spewing only rejected bits.

      KaZaA is easy to target for this, gnutella may be as well, but some clients use SHA-1 and TTH too now. Providing collisions for both hashes is damn near impossible.

    2. Re:Er.. by Anonymous Coward · · Score: 0

      Your sig is missing 'divisions between branches and powers' and 'voting'

    3. Re:Er.. by ticktockticktock · · Score: 1
      G2 uses SHA-1 and TTH.

      The older gnutella ("gnutella 0.6" as far as I know) also uses SHA-1 and Tiger Tree hashing in modern gnutella clients such as LimeWire.

    4. Re:Er.. by evilviper · · Score: 1
      don't most P2P networks use a combination of different hashes? if not then it would be easy to implement

      No they don't.

      One big problem with multiple hashes is the performance. To compute a hash, you have to read the entire file, and do some math on the contents. If you have 3 hashes, you have to read your entire 4GB+ file from your hard drive 3 times over, each time you want to re-compute the hash. Hopefully you can imagine just how slow that would be...

      It would be better just to increase the key-length of one single hash, to make it practically invulnerable.
      --
      Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
    5. Re:Er.. by OAB_X · · Score: 1

      Some clients do, but it is not standard. I did mention that in my post, but it was tacked onto the end and somewhat disengenuous. I cant spell.

    6. Re:Er.. by ticktockticktock · · Score: 1

      Ah. Thanks for pointing that out. Somehow my eyes missed that you mentioned that in your post.

    7. Re:Er.. by t_allardyce · · Score: 1

      I think they do hashes on blocks not the whole file at once, it might still take time but you can use the blocks that have already been done.

      --
      This comment does not represent the views or opinions of the user.
    8. Re:Er.. by Anonymous Coward · · Score: 0

      My assumption on BT's hashing method is:

      Create a hash for each block in the file and create a hash for the entire file. For the hashes to be created BT needs to read the entire file once, a block at a time creating block hashes as it goes and continually calculating the file hash. I don't see why it couldn't generate more than one hash type from the data it's just read from disk.

      Having a complete file hash and individual block hashes would make hash collisions even harder since you'd need each block to hash to the block value using bogus data, then that bogus data has to collide with the entire file hash.... if anyone finds a way to do that I don't think P2P will be our biggest concern.

    9. Re:Er.. by evilviper · · Score: 1
      I think they do hashes on blocks not the whole file at once,

      That depends entirely on the P2P program in question. I know Gnutella just uses a normal SHA1 hash, and fairly sure that Kazaa is the same.

      Bittorrent has hashes for each chunk, but it's the exception.

      Anyhow, it really doesn't matter. Whether you do it per-chunk, or per-file, you still have to do 3X as many disk reads as you would with a single (longer/stronger) hash.
      --
      Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
    10. Re:Er.. by t_allardyce · · Score: 1

      i might be wrong but id hazard a guess that the time taken to compute a hash isnt linearly proportional to the file size - eg a 10mb file might take 10 minutes while 10 x 1mb files might take 5 minutes? actually i could be totally wrong and it could take even longer..

      --
      This comment does not represent the views or opinions of the user.
    11. Re:Er.. by evilviper · · Score: 1
      id hazard a guess that the time taken to compute a hash isnt linearly proportional to the file size - eg a 10mb file might take 10 minutes while 10 x 1mb files might take 5 minutes?

      I tested this:

      Files 0-9 are 1mb
      File 10 is 10mb

      $ time sha1 0 1 2 3 4 5 6 7 8 9 ...
      0.26s real 0.21s user 0.05s system

      $ time sha1 10 ...
      0.24s real 0.21s user 0.04s system

      It would seem that hashing several smaller individual files is noticably slower than one large file.

      --
      Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
    12. Re:Er.. by t_allardyce · · Score: 1

      interesting, but considering the average p2p file is a 3mb mp3 thats not too slow?

      --
      This comment does not represent the views or opinions of the user.
    13. Re:Er.. by evilviper · · Score: 1

      It's fine for a few 3MB files, but it's still a problem if you are downloading, say, 20 3MB files at a time... It gets to be a real hassle for 4GB files, which are quite common on P2P networks.

      My point is, a single hash with a much longer length would serve you much better than 3 different hashes...

      --
      Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
    14. Re:Er.. by t_allardyce · · Score: 1

      Ok but at to the mix that unless you're on a fast connection chances are your cpu will be hashing faster than even your broadband modem can deliver..

      --
      This comment does not represent the views or opinions of the user.
    15. Re:Er.. by evilviper · · Score: 1
      your cpu will be hashing faster than even your broadband modem can deliver..

      No, it's not CPU-bound, it's HDD I/O-bound. So take whatever you download bandwidth is, and that's the speed at which you'll be writing to disk. Then multiply it times 3, and that's the speed you'll have to read from disk. Add that all together and ask yourself if your hard drive can keep up with all that, as well as doing all your other general computer tasks at the same time...

      With that much I/O, your system is really going to start to drag. You're really in trouble if your system needs to swap at the same time... A RAID array would start looking very attractive at that point.
      --
      Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
    16. Re:Er.. by t_allardyce · · Score: 1

      And that is a perfect reason to do the hashes on blocks that can fit in ram before being put to disk...

      --
      This comment does not represent the views or opinions of the user.
  23. Add another hash by Fjornir · · Score: 2, Insightful
    *shrug* Then the p2p networks will respond by using two different hashing algorithms, and a collision will be that much harder to generate.

    Their site is down so I can't get any real details, but I think this is smoke and mirrors in any case.

    --
    I want a new world. I think this one is broken.
  24. Possible Solution by BlacBaron · · Score: 3, Insightful

    Use 2 (or more) different hashing algorithms on the file, and check the file size.

    I'm pretty sure that should reduce the collisions to some stupidly small value.

    --
    Update Watch - Automatic software update notification
  25. Read this... by Virtual+Karma · · Score: 2, Informative
    One of the big advantages of BitTorrent/Suprnova is the high level of integrity of both the content and the meta-data due to the working of its global components. We have shown that only 20 moderators combined with numerous other volunteers solve the fake-file problem on BitTorrent/Suprnova

    Read more here

  26. Link to the patent application by Zarhan · · Score: 4, Informative

    in pdf form

    Note the claims section and references - they keep talking about Napster and Kazaa - nothing about anything that use hashes.

    1. Re:Link to the patent application by realbadjuju · · Score: 1

      I can't seem to save a non-garbbled copy of the patent app. At least it's not TIFFs, damn USPTO... Help?

    2. Re:Link to the patent application by Zarhan · · Score: 1

      Works for me - both with IE6 + Acrobat 6 earlier at work and Firefox + Acrobat 5 (On Linux) at home.

    3. Re:Link to the patent application by Husgaard · · Score: 1
      Don't blame USPTO, they have not yet published the patent.

      Instead blame the European Patent Office (EPO) for publishing a garbled patent.

      And don't forget to blame them for yet another software patent which is illegal in Europe. And besides this patent is likely illegal anyway, as it is a method of disturbing the operations of computer systems (which is illegal).

      It would be nice if somebody could post at least the claims of this patent.

    4. Re:Link to the patent application by realbadjuju · · Score: 1

      I wasn't blaming the USPTO for anything other than using TIFFs as their document standard, which is annoying. And firefox/acrobat 6/safari/preview won't show a complete or non-garbbled pdf. I give up.

    5. Re:Link to the patent application by Anonymous Coward · · Score: 0

      You can't get a complete copy of a patent in PDF format from esp@cenet--it will only provide you a copy one page at a time (I believe this is both to reduce load on their servers as well as to retain some sort of monopoly on patent copies--most third-party services will charge you ~$5 for a copy).

      Also, remember this is only a published application, not a patent--there's no guarantee the patent will issue with the claims as written.

    6. Re:Link to the patent application by antime · · Score: 2, Interesting

      Thanks for the link. If you look at page four of the document, it explains that because the UUHash algorithm used by Kazaa hashes only a small part of the file it is feasible to change other parts and produce hash collisions through brute-force attacks. Then the attacker just pretends to be a normal node and feeds bad data into the network.
      The obvious way to counter this is to either fix Kazaa or switch to a network where the whole file is hashed.

    7. Re:Link to the patent application by Anonymous Coward · · Score: 0

      Napster has a weak hash as well. It used MD5, but only hashed the first few kilobytes of the file. So you could take the first part of a real file, and fill the rest of the space with garbage, and Napster would accept it.

    8. Re:Link to the patent application by Anonymous Coward · · Score: 0

      Reading that I guess they simply fake being the real file and send out bullshit data. Hrm, nothing special...not long before clients start banning people for seeding fake parts.

    9. Re:Link to the patent application by Anonymous Coward · · Score: 0

      This has been well know in the copywrite protection community for *years*. Ever download a pop song from Kazaa and get bands of static in it?

    10. Re:Link to the patent application by Anonymous Coward · · Score: 0

      I haven't read the pdf you linked to (this is /., after all). It sounds like you just said that they patented the concept of using hash collisions to muck up p2p programs. If that's the case, then anybody who does get a hash collision algorithm to work will have to license the patent from them to use it to mess up p2p.

      And who said software patents never did any good?

      (After reading further: correction, that's a preimage attack.)

    11. Re:Link to the patent application by Anonymous Coward · · Score: 0

      they keep talking about Napster and Kazaa - nothing about anything that use hashes.

      Kazaa does use hashes. Just not very well, as in, only the same parts of each file! Yes parts! They don't hash entire files, ever!

      I looked at the patent regarding this and the detail from the above link seems to be off slightly from the patent, but regardless, Kazaa's use of hashes is broken. They obviously have no appreciation or understanding of the value of employing a strong hash properly.

  27. would this be illegal? by Anonymous Coward · · Score: 0

    Wouldn't this work like a virus? "this would corrupt files" and be illegal? what if someone accidently puts a system file to be shared?, what about legally shared content? will it destroy that too?

  28. 0 Seeders by Anonymous Coward · · Score: 0

    Torrent networks are incredibly resilient to filtering out garbage data. Unless these companies can set up disparate network addresses all seeding the same file few people bothering with files that have low seed sources.

  29. Damn, sounds like snake-oil... by nweaver · · Score: 1

    If they are beating MD5 hashes, that is possibly probable but a BIG breakthrough....

    Other mechanisms (eg, hacking the clients) is problematic, and seeding the network with files with bogus hashes quickly gets weeded out, unless they are also seeding the network with a lot of other nodes which moderate up the bad hashes...

    --
    Test your net with Netalyzr
  30. Which Hash Key? by DaGoodBoy · · Score: 1

    So... if they polute MD5. then use SHA. Or any other hashing mechanism. This is not a slam dunk by any means.

    Hey RIAA, the cat is out of the bag, down the road, in a pub, laughing at your attempts to find him and stuff him back in the bag. Just suck it up and deal with the market reality and stop wishing you'd actually offered a real solution back in 1997. Bygones!

    DaGoodBoy

    --
    My God! It's full of Voids!
  31. whaa ... ? by Anonymous Coward · · Score: 0

    So, if they can calculate collissions for any hash algorithm shouldn't more people than file swappers be fearful? This is big news for, you know, computing in general.

    Does anyone know what algorithms this affects? If it's just one of them, then don't the p2p networks just need to pick a different/better one?

  32. Child porn solution? by Anonymous Coward · · Score: 0

    If this company can do what it says it does, it mayb e possible to use it against child porn. If you could corrupt all the child porn on a network, then it would make it impossible to share it.

  33. Truth or just a minefield announcement? by Paul+Neubauer · · Score: 1

    Q: How many mines does it take to make a minefield?

    A: None. All it takes is a press release.

    I have to wonder if this isn't just to take advantage of the folks who are light peer-to-peer users or are not using it at all and convince them it's not worth the bother. After all, a stronger hash, or perhaps even simply a different hash, would defeat this.

    --
    I don't subscribe to RMS's GNUtopian vision.
  34. Only The Whole File? by TheFlyingGoat · · Score: 5, Insightful

    Don't most P2P programs use MD5? I was also under the assumption that P2P programs do a checksum on each piece of the file they receive, and if it's inaccurate it automatically re-downloads that part of the file. I've had pieces of a bittorrent download fail due to corruption and the client has just downloaded that part again.

    Seems like this company's setup would only work in very specific circumstances, meaning it won't have much of an effect at all.

    --
    You have enemies? Good. That means you've stood up for something, sometime in your life. --Winston Churchill
    1. Re:Only The Whole File? by Anonymous Coward · · Score: 0

      Mod Up, this guy has hit the nail on the head.
      All other posts are worrying about how "strong" the hashes are. "Strength" is irrelevent in swarming P2P systems, unless this company has the bandwith to upload millions upon millions of completely fake downloads i think that this "technology" is a complete waste of time for the the Anti-P2P group. Chunks on BT can be downloaded again if they are fake/corrupt

    2. Re:Only The Whole File? by Dr.+Evil · · Score: 0, Troll

      But BT can't tell they're corrupt, they match the hash that BT uses to determine if hte file is corrupt.

      Also everyone downloading would be seeding the corrupt data. They don't need millions of fake uploads... they just need a few here and there, and before you know it everyone will be getting and sending chunks of bad files.

      It's a good short term blast on BT, changing the hash will fix it. BT is still vulnerable though because of tracker websites being trivial to take down, and anonymity being nonexistant.

      BT is an excellent legitimate distribution channel. It also makes watermarking impractical.

    3. Re:Only The Whole File? by CristianoMonteiro · · Score: 1

      You're assuming that their claims are valid: being able to generate a file that match the size and hash of another file, even though that a typical hash algorithm - SHA1 - relies on a space of 2^256 bytes, wich cannot be computed in a reasonable amount of time (read: less than a million years) or stored, even if you use all the computational power of the universe ?

      I don't believe them and will wait until they show a working implementation or return to their insignificancy.

      --
      -------------------------------------------- Se você consegue ler aqui então fala português. Óbvio
  35. Seems bogus to me by gtoomey · · Score: 5, Informative
    It takes 2^69 operations to find collisions with SHA1

    Unless they have lots of supercomputer time, seeding the occasional p2p file with bad data will be very expensive.

    1. Re:Seems bogus to me by Em+Adespoton · · Score: 1
      Actually, all they have to do is generate random files with random hashes, and make those match against one of the millions of legitimate files out there -- rename junk hash file to match found p2p file, and they're set. Still a lot of work, but nowhere near as much as it would take to find collisions with a single file.

      Then again, the article says nothing about hashed files; they're most likely doing what the RIAA already does, and just creating files that look similar to other files when no hash is applied.

    2. Re:Seems bogus to me by Anonymous Coward · · Score: 0

      Nerdly Bill and Ted: 2^69 dude!

    3. Re:Seems bogus to me by OhPlz · · Score: 1

      Why do you need to "find" a collision?

      If the blocks transferred are in a known size they could generate a block of random garbase that size and compute its hash. Store the block and the hash in a database. Repeat.

      At some point they would have enough different hash values with garbage data that they could start injecting them into file transfers.

      Now if the block size isn't fixed or there's more to the validity checking of the relevant p2p software than yea, they're probably full of it.

    4. Re:Seems bogus to me by pjrc · · Score: 5, Informative
      Remember that those 2^69 "operations" (each many CPU cycles) are for a SHA1 "collision" attack. A "preimage" attack that would be necessary to inject corrupt data into a p2p network using SHA1 (such as Bittorrent) is much harder and has not been discovered and published.

      Quoting from the linked page:

      Q: What is a collision attack and a preimage attack?
      A: A preimage attack would enable someone to find an input message that causes a hash function to produce a particular output. In contrast, a collision attack finds two messages with the same hash, but the attacker can't pick what the hash will be. The attacks announced at CRYPTO 2004 are collision attacks, not preimage attacks.

    5. Re:Seems bogus to me by HermanAB · · Score: 1

      They probably use a botnet to do the computations...

      --
      Oh well, what the hell...
    6. Re:Seems bogus to me by Anonymous Coward · · Score: 0

      Assuming 4 billion files in the network (hey, it happens to be the same size as a 32 bit int), your file would have a 2^32/2^138 (138=69*2) chance of a SHA-1 collision. Still well into the "not gonna happen (at least not with current tech)" space, and that's assuming a network with 4 billion files.

    7. Re:Seems bogus to me by imsabbel · · Score: 2, Informative

      haha.

      A sha hash is what? 256bit?
      so you get 32byte per block.
      Now how many pertubation can you get...
      Lets assume your p2p software uses block sizes of 4byte. For a complete database you would need 2^32*32Byte=128Gbyte.
      For a complete 8byte set you would need 2^64*32byte.
      All the storage space in the world wouldnt even be enough for a 128Byte block, and bittorrent uses a minimum of 32Kbyte, edonkey even has a hash over the total filelenght.
      For 32Kbyte, there isnt enough matter inthe universe to store enough information to get even a 1:10^50 chance of getting a hit.

      --
      HI O WISE PRINCE. WHT TOOK U SO DAM LONG?
    8. Re:Seems bogus to me by drigz · · Score: 1

      Yeah, currently.

      However, if this company has found a usably efficient way, then this is _very_ big news.

    9. Re:Seems bogus to me by zippthorne · · Score: 1

      Does 2^69 assume working in the dark with only the hash itself? If you have the original file, is it possible to modify it in some way that's "balanced" (produces zero net effect in the hash output) using fewer operations?

      --
      Can you be Even More Awesome?!
    10. Re:Seems bogus to me by Shanep · · Score: 1

      Remember that those 2^69 "operations" (each many CPU cycles) are for a SHA1 "collision" attack. A "preimage" attack that would be necessary to inject corrupt data into a p2p network using SHA1 (such as Bittorrent) is much harder and has not been discovered and published.

      Paul,

      A pre-image attack is NOT what is needed to inject corrupt data into a p2p network which uses SHA1. The calculation of the preimage (besides usually being impossible) buys you nothing. Why would you tackle this beast of a problem head-on when the pre-image can simply be downloaded!? Yes, that's right, the file itself (or portions depending on how the hashing is done), IS the pre-image. Having the pre-image buys you nothing in creating alternate data with the same SHA1 hash, because what is needed is the convienience of being able to craft both the good and bogus data.

      SHA1 is used in different ways. It can be used for authentication, whereby only the hash is compared and the pre-image is never stored. It can be used to authenticate a file where the file is seperated from the hash in such a way that both (mostly just the hash) cannot be altered. Or it can be used as a strong checksum for a file, in which case the hash is sent with the file or openly associated with the file, for the purpose of making sure data transfered correctly. With something like bittorrent, you're probably not going to be able to change the publically served hash in the torrent file along with that hash that the peers are aware of, so your only option is to find a collision.

      If you can control the creation of both good data and bogus data, then you can do this against SHA1 in a much reduced but still very difficult process, thanks to the new found weakness. But if all you control is the creation of bogus data, then you are at the mercy of the full strength of SHA1.

      Pre-image attacks have NOTHING to do with injecting bogus data into a hash protected P2P network. The pre-image is available to all. What you need do perform is a COLLISION attack.

      Pre-image attacks are used when the pre-image or data/file is unknown. This is not the case with P2P. The pre-image can simply be downloaded. Confirmed pre-image attacks can be IMPOSSIBLE, because there are an infinite number of possible pre-images of varying sizes which will provide a collision or otherwise more than one possible pre-images of the same size as the real pre-image. There is no way to know which equivalent pre-image is the real pre-image unless the full fixed data space is searched and only one pre-image is found (this would require a pre-image of the same size or smaller than the hash size). The only way to be sure that you have the correct pre-image size, would be to preview the real pre-image, in which case there would be no point at all.

      A hash algorithm takes an arbitrary number of input bits and generates a message digest of a fixed number of hash bits. Therefore, if your input data is larger than the hash data, then hashes have to be able to represent more than one input data set, because the hash is of a finite size.

      They also claim that they can encode files which can be broken later. This is more feasible, since this requires the reduced collision attack. Of course, how feasible and practical is this really? I highly doubt they can deliver on this given the amount of data the music and movie industry will want protected and the whole 2^69 thing. ; )

      This really sounds like snake oil to me.

      --
      War crimes, torture, lies, illegal spying... Would someone give Bush a blowjob, already, so he can be impeached?
    11. Re:Seems bogus to me by pjrc · · Score: 1
      Yes, the product is probably snake oil, at least against modern p2p protocols using strong hashes.

      But I still don't see how only a collision attack can be utilized? Maybe I missed something? Remember the quote "a collision attack finds two messages with the same hash, but the attacker can't pick what the hash will be".

      Quoting...

      With something like bittorrent, you're probably not going to be able to change the publically served hash in the torrent file along with that hash that the peers are aware of, so your only option is to find a collision.

      Since the hash is already known to the clients, what good will a collision attack do, where you discover two messages that happen to have the same hash, but you have no control over what that hash will be? Your chances are only 2^-160 (eg, zero) that it'll be the same hash that the client requires to accept your message instead of the original one.

      If the attacker could control the original file before the hashes are published, at least in theory, perhaps a collision could be used to create both the original and a matching duplicate. But the reality of p2p piracy is that all the files are encoded by the pirates using lossy compression, where even tiny changes the encoder or its settings produce vastly different binary output.

      I'm still trying to understand how a collision technique, where the attacker has on control over what the hash will be, can be useful for injecting bogus data into a bittorrent or a similar modern p2p network?

    12. Re:Seems bogus to me by cryptoguy · · Score: 1

      The producer of the mpg file could use a collision attack, since he controls both the mpg file and the bogus file. He could hash the mpg file (for example, md5), saving the internal state of the md5 engine at the last iteration. He could create a bogus file of the same size, generate its hash, and save that internal state also at the last iteration. Then, proceed with the published attack (adapted to use the two internal states that were saved) to find two blocks that could be appended to each file resulting in two files with the same md5 sum. At least, if I understand correctly that should be possible.

      Of course, that is no more than an inconvenience to p2p since the file could be truncated, or another byte appended etc resulting in a different hash value. It would be possible to flood the network with bogus files matching the original, but it would be trivial to create usable mpg files with unique hashes.

    13. Re:Seems bogus to me by Shanep · · Score: 1

      I agree with what you have said here.

      I'm still trying to understand how a collision technique, where the attacker has on control over what the hash will be, can be useful for injecting bogus data into a bittorrent or a similar modern p2p network?

      Ah, I didn't say the act of finding a collision would be useful. Since it is impractical. What I am saying, is that the only option is an impractical one. In other words, not really feasible.

      If you can exhaustively search for random data that gives the same hash, then that is useful because you can serve it as the original. But that if is a pretty huge if. ; )

      --
      War crimes, torture, lies, illegal spying... Would someone give Bush a blowjob, already, so he can be impeached?
  36. Web Design by rathehun · · Score: 1
    Well - i don't know too much about this, but take a look at their website.

    At first glance, it looks ok, neatly done. However, take a closer look. The text is a large IMAGE! OMG - if their technology is anything like their web-design skills, then we're safe.

    Also revealing is the line somewhere which says that after they released their software, the total PURCHASES DECREASED by some percentage!

    There is a lesson here, and I hope somebody at the **IA sees it soon.

    R.

    1. Re:Web Design by Psiolent · · Score: 1

      "Also revealing is the line somewhere which says that after they released their software, the total PURCHASES DECREASED by some percentage!

      I think what they were saying is that purchases across the entire market in Finland went down, whereas purchase for BMG Finland actually went up despite the broader downward trend.

    2. Re:Web Design by Supernoma · · Score: 1

      "There is a lesson here, and I hope somebody at the **IA sees it soon."

      I'd rather they didn't and it burned them real good.

      --
      I'll Find You Peer, If It's The Last Thing I Do!!!!
  37. Sharing by man_ls · · Score: 2, Interesting

    The time-vs-accuracy tradeoff is a big one. One client which I know some people who use, takes almost 48 hours to index a full hard drive of files to share, and hash them all.

    Anything less robust, you're liable to have collisions, such as these, apparently. Any more, and if you have a lot of files, there's a major time committment before you can actually begin to serve anything -- most people aren't willing to have their CPU pegged for 2 days straight while their P2P client hashes their 35,000 MP3s and 200 movies, or so.

    1. Re:Sharing by djfray · · Score: 1

      I'm pretty sure that an incredibly large portion of P2P users don't have the capacity for 35,000 MP3s and 200 movies. thats a lot of space. a hell of a lot. my guess would be between 700 GB and 1 TB

      --
      This sig is o Unfunny o Funny
    2. Re:Sharing by djfray · · Score: 1

      check this out. I was going to apologize for my mistake to this guy, I didnt realize he meant users serving as libraries, but he comes and harrasses me about my bad maths on AIM.

      --
      This sig is o Unfunny o Funny
    3. Re:Sharing by man_ls · · Score: 1

      uhh I guarentee you that wasn't me.

      Your maths were pretty accurate, he's got 748 GB of media.

    4. Re:Sharing by djfray · · Score: 1

      My apologies! stupid trollies. i'm kind of dazed and confused at the moment anyway, so please forgive me

      --
      This sig is o Unfunny o Funny
    5. Re:Sharing by imsabbel · · Score: 1

      what are you talking about?
      People dont just "whoa" find 100s of gigabyte of date to share...(and it would be useless if they dont have massive upstream capacity).
      People just add one file, than another, ect.
      ANd i dont know what YOU are using (or "some people you know"), but MD5 hashes with about 30MB/s with a Athlon xp2000. In the background on nice. So half a minute for a cd. Doesnt sound like a lot of "commitment" to me.

      (also, one shouldnt scan the whole HD. think about it)

      --
      HI O WISE PRINCE. WHT TOOK U SO DAM LONG?
    6. Re:Sharing by man_ls · · Score: 1

      It's not me :p although I wish it was, damn, I can't even hold a third of that collection in my storage space.

  38. Technically.... by slapout · · Score: 1

    Won't they need a copy of the orginal file off the p2p network in order to make a file with the same hash? Won't they in effect be downloading it off the p2p network and then be guilty of the same thing they're trying to stop?

    --
    Coder's Stone: The programming language quick ref for iPad
    1. Re:Technically.... by Anonymous Coward · · Score: 0

      No, because the guilty parties are sharing out the files. That's what the studios are trying to stop.

  39. How they get the MD5/AES hashes by DarkSkiez · · Score: 0, Flamebait

    They probably aren't actually making files with the same hashes, just modifying the clients, probably open source ones too, to report the md5 sums that they want to for each file, so if the client doesnt re-check the sums, it'll get corrupt files, if it does, it'll just have wasted bandwidth.

  40. How does p2p hashing work? by autopr0n · · Score: 1

    If you only had a hash for the whole file, you wouldn't be able to validate any of the individual chucks, so it must be that the chunks have their own hashes. So, the resulting files need to be the same size as the chunks in order to work. One way to fix this might be to have the inital vector determine not only the next hash, but also the order in which the bytes are hashed. That way, creating files with the same hash won't be able to use greedy algorithms to that can work backwards one chunk at a time.

    --
    autopr0n is like, down and stuff.
  41. Hash by PureCreditor · · Score: 2, Interesting

    isn't the whole point of a hash is that it's computationally-infeasible to create a file that that H(new file)=H(original).

    if this technology is true, it'll completely undermine the safety of today's unix passwords, which are stored in clear text of their hash.

    1. Re:Hash by ticktockticktock · · Score: 1

      But doesn't getting access to one's unix password require root or physical access on most modern linux distributions? I don't remember ever seeing any recent distribution that has a world-readable /etc/shadow file.

    2. Re:Hash by Anonymous Coward · · Score: 0

      Are you the Knoppix std tick tock?

    3. Re:Hash by ticktockticktock · · Score: 1

      No.

  42. By God by somethinghollow · · Score: 4, Insightful

    If I have one of these files and share the hell out of it, I better not be contacted by RIAA. If this spreads, not only will it make sharing difficult, it will make tracking legitimate (haha) piracy more difficult to detect. This (sort of) reminds me of a more high tech version of the time everyone started changing the name of their tracks to things like "Br1tn3y Sp34rs" to evade blocked searches.

    1. Re:By God by zCyl · · Score: 1

      If this spreads, not only will it make sharing difficult, it will make tracking legitimate (haha) piracy more difficult to detect.

      Heheh, brilliant. :) That means that if this is a legitimate technology, then someone could try to create copies of, say, the bible, that hash to the same as the latest Britney mp3. I'd love to watch that court case. :)

    2. Re:By God by Anonymous Coward · · Score: 0

      Except that the content companies would most likely hold the copyright for the fake file as well. Copryright law doesn't make any exceptions for the fact that the data you're sharing isn't useful, it only matters who created it.

      In short, you're still sharing information you don't have distribution rights to.

    3. Re:By God by Anonymous Coward · · Score: 0

      Hrm, that gives me an interesting idea. What if the *AAs had a "bounty" program that would give you a certain amount of money to (be the first to correctly) identify infringing tracks/shares/etc.? Enough people would probably sign up to cover a significant amount of the file sharing traffic for the copyright police.

  43. Now RIAA/MPAA can't proove anything... by Anonymous Coward · · Score: 0

    This is good news as I can generate fake files and let RIAA/MPAA try to sue untill they run out of money :D

  44. I am so proud to be a Finn today? by Anonymous Coward · · Score: 0

    The most leading civilization; the perfect way of responsible living for all; simply the only country with truly working democracy.. ..and now this..

    Maybe in the end it's not a bad turn of events..

    - a finn

  45. Anyone find any real information? by Daedalus_ · · Score: 1

    Both the Inquirer article and the company website are mighty short on details.

  46. what hash is it? by paltemalte · · Score: 1

    What hash is it that they have supposedly managed to write a fake-app for?

    --
    Sam has one liberty, which he sacrifices for one security. Can you tell me what Sam has now?
  47. Naah. by hummassa · · Score: 1

    The fact is: the p2p networks will route around this stuff. With packet hashes, banning of corrupt pieces, and then, in little time, thigs would be back at normal.

    --
    It's better to be the foot on the boot than the face on the pavement. ~~ tkx Kadin2048
  48. Re:Possible? Yeah by jacksonj04 · · Score: 1

    If this does prove to be a problem (which I sincerely doubt) what's to stop the P2P just double-hashing everything? if you can generate a file the same size which collides in MD5 *and* SHA1 then you deserve to be able to run P2P into the ground.

    --
    How many people can read hex if only you and dead people can read hex?
  49. Re:Possible? Yeah by Anonymous Coward · · Score: 0

    But how would you, the downloader, tell which one is real just by looking at the two files if they are relatively close to the same size?

    Same size seems to be a further annoyance, but not necessary to prevent mass confusion.

  50. My thought is... by huhwhatduck · · Score: 1

    That depending on the outcome of Grokster that these bastards - if they really can pull this kind of stunt (which I highly doubt) - will be the people on the fringe. It's like the discussion on rogue states. (i.e. What right does the US have to condemn other nations as "rogue" if it has been convicted by the ICC and subsequently vetoed UNSC resolutions requiring states to comply with international law) If right now the p2p users are the rogues, which is not my thought, then very soon the definition of "rogue" could very well turn on these folks. The RIAA is just preparing the soil for its own inevitable demise.

  51. durfy durfy by autopr0n · · Score: 2, Insightful

    Using multiple hashes is a hash algorithm itself. If someone found a general way to crack hashes, then they'd be able to crack this new 'super' hash just as easily. All you'd really be doing is creating a hash with more bits. Might as well use the "best" hashing algorithm and increase the width.

    --
    autopr0n is like, down and stuff.
    1. Re:durfy durfy by adamruck · · Score: 2, Insightful

      Partially true. If you take your strongest hash and just increase the number of bits of the result, assuming that someone can crack that hash, it will simply take longer to compute a collision. This would probably increase in a linear fashion.

      Howoever, If you use more than one algrithm, it becomes harder to find a collision that fits both systems AND has the correct file size. This would probably increase in a exponential fashion(read: impossible).

      --
      Selling software wont make you money, selling a service will.
    2. Re:durfy durfy by Capt'n+Hector · · Score: 1

      Ahhh, but you see there IS a logic to my (ignorant) madness: with 10 different hashes, you're bound to use a "best" one in there somewhere! But yeah, I hadn't thought of that... nevertheless I don't believe for a second that they could find a collision in a hash that involved, oh, I don't know... euler's phi-function, taking the GCD of the two, and some other stuff.

      --
      Quid festinatio swallonis est aetherfuga inonusti?
      Africus aut Europaeus?
    3. Re:durfy durfy by LanMan04 · · Score: 2, Insightful

      That's not true. First of all, there is no "general" way to crack hashes. That's like saying there is a "general" way to crack crypto algorithms. Sure, there are general cryptanalytic stratagies to reduce keyspace, or use some fancy-ass algrbra to knock NP-complete problems down to NP or something, but there's no "general" magic bullet.

      So, even if you manage to crack one specific hash algorithm completely (meaning you can produce files of arbitrary size and content that produce a desired hash), you still have to crack the others the file/message is hashed in. I would consider any message/file hashed under multiple algorithms much more secure than any single one. We're not talking hashes of hashes here, but of multiple, independent hashes of a single source file/message. And they must ALL match for the file to be considered genuine.

      Try producing a file that resolves to the same MD5, RIPEMD-160, SHA-1, and SHA-256 hashes as another given file. Damn near impossible.

      --
      With the first link, the chain is forged.
    4. Re:durfy durfy by Anonymous Coward · · Score: 0

      Actually thats not true, most of the hash hacks fall into two categories:

      1) Some way of reducing the search space.

      Imagine hacking hash A takes on average n operations, and hash B takes m operations, then you can expect hacking A and B to take nm operations. if you weaken A hugely to only take b operations, you are still looking at bm operations.

      2) Some specific transformation.

      In this case, it's highly unlikely that the transformation will support both hashes.

      The algorithm used in finance uses about 6 hashes, under the assumption that even if one or two are broken, the hash will remain secure.

    5. Re:durfy durfy by Dogun · · Score: 1

      I'd disagree with this statement.

      Say that these guys found an additional weakness in MD5 over the one we heard about recently.

      They have to tool with some data now to fool the hash algorithm. So they do, and BANG, congrats, two different files with same MD5 hash. There could be any number of files with this characteristic.

      But only a very small subset of those also share a (hash algorithm of choice) hash with the source file. Even if there are known weaknesses in THAT algorithm, it still remains a search problem with a reasonably nasty search space.

      At least, that's the hope.

    6. Re:durfy durfy by merlin_jim · · Score: 1

      All you'd really be doing is creating a hash with more bits. Might as well use the "best" hashing algorithm and increase the width.

      Actually, if the hashing algorithms are dissimilar you are exponentiating the keyspace.

      Note: I'm using very low hash sizes to make the math easier...

      If your hash is 8 bits long, then there will be a hash collision every 2^8 files.

      If you use two hashes that are 8 bits long, then there will be a collision for the first algorithm every 2^8 files, and a collision for the second every 2^8 files. If the hash algorithms are orthogonal in their operation, then only one out of every (2^8)^2 or 2^64 files will match both algorithms. So you've done the work of two 8 bit hashes (approximately the work of a 16 bit hash), with the security of a 64 bit hash.

      In reality, all hash algorithms are probably similar algorithmically. But the worst case scenario (assuming that the hash algorithms are not identical) is a doubling of the hashspace, no worse than you would get by doubling the hash length.

      --
      I am disrespectful to dirt! Can you see that I am serious?!
    7. Re:durfy durfy by lgw · · Score: 1

      Strange as it may seem (2^8)^2 = 2^16. 256*256=65536. Same work, same security. You're better off using the stronger hash at 16 bits, than mixing a weak and a strong 8 bit hash. OTOH, if you don't *know* which hash is better, mixing them gives you a better chance of being at least 8 bits strong (which might or might not be helpful).

      --
      Socialism: a lie told by totalitarians and believed by fools.
    8. Re:durfy durfy by merlin_jim · · Score: 1

      Lol as a former calculus teacher I am humbled.

      That, my friends, is why eighty hour work weeks are NEVER a good idea.

      Thanks for the correction.

      --
      I am disrespectful to dirt! Can you see that I am serious?!
    9. Re:durfy durfy by xtracto · · Score: 1

      Try producing a file that resolves to the same MD5, RIPEMD-160, SHA-1, and SHA-256 hashes as another given file. Damn near impossible.

      What about a genetic algorithm which produces several variations of a file, then makes each one of the hashes and selects the file which hashes are closer in byte distance (dont remember the exact term for that) to their corresponding hashes.

      Shure it will take some time but, it is a nice research project =o)

      --
      Ubuntu is an African word meaning 'I can't configure Debian'
    10. Re:durfy durfy by porkface · · Score: 1

      Yes, but if a P2P software uses the best hash and it's cracked, all they would need to do is deliver an update adding 1 other type of common hash and suddnely the company has to create thousands of similar files that are somehow completely different but match 2 hashes.

      So far the only collisions involve tweaking very few bits of the files.

    11. Re:durfy durfy by hibiki_r · · Score: 1

      Nope, on any quality hashing algorithm, a change in 1 byte in the original file will generate a vastly different result. This makes an 'almost perfect' individual be very, very different from a perfect individual. This makes Genetic algorithms completely unsuitable for the task: They are probably worse than just brute forcing through the entire population. Just try to MD5 2 files that only differ in 3 bytes from each other and see what I mean.

    12. Re:durfy durfy by Council · · Score: 1

      Everyone, first coming into crypo, thinks that it's easy to come up with secure algorithms like that which no pattern will ever be found in. The crypto world is littered with the skeletons of these systems.

      Real security comes from tested algorithms, not from piling on more obfuscation that you figure no one will be able to break. That having been said, simply combining two reasonably good hash algorithms, like MD5 and SHA-1, is very good. But the goodness only comes from the fact that it's using good algorithms -- not the GCD phi nonsense.

      --
      xkcd.com - a webcomic of mathematics, love, and language.
    13. Re:durfy durfy by Council · · Score: 1

      Not a great advertisment for your spellchecker (sig) -- why didn't it catch "shure"?

      I have a friend who spells so phonetically that the checker often fails to figure out what he's talking about.

      But yeah, are you joking about the advertising? Because that's kind of funny. Bad press for them.

      --
      xkcd.com - a webcomic of mathematics, love, and language.
    14. Re:durfy durfy by owlstead · · Score: 1

      True, but we are still pretty far away from a general way of cracking hashes. All the strong hash algo's are currently based on the same ideas. This means that if you crack one of them (MD5 for instance) then the other ones would probably easier to crack as well. Still, more bits probably means more difficult to crack in practice.

      Note that I would feel pretty safe with a SHA-256, 384 and 512, but I second the idea of Bruce Sneider that we need another government sponsored race for new ones (see practical cryptography by that writer and check his site).

      IF you are going to use a different hash, add a CRC at the end, and then do a complete one-way hash over that message. CRC's are pretty different from secure hashes afaik.

    15. Re:durfy durfy by Anonymous Coward · · Score: 0

      By definition, NP-complete problems are all in NP already. Not all NP-hard problems are. Reducing one to P would be quite interesting, though. Hell, reducing it to anything sub-exponential would be a pretty major breakthrough.

    16. Re:durfy durfy by Anonymous Coward · · Score: 0

      The problem with using wider versions of the same hash algorithm is that they're theoretically still vulnerable to the same attacks, just with a large key space. The idea behind using multiple hashes is that one hash algorithm may be breakable, but it's unlikely that significant breaks will be found in both algorithms at the same time. In TheRealWorld(TM), it takes a non-zero amount of time to replace all the vulnerable infrastructure, so non-overlapping breaks are good.

      Of course, if you found a general way to break hash algorithms, that would break both algorithms at the same time, but I'm pretty sure that's an impossible task without brute forcing (or at least near enough to it in practical terms), which would require an insane amount of computing/hardware resources. There are an infinite number of possible hash algorithms, and so you can never say with 100% certainty that your general technique would work for all them (basic undecidability result in compuer science).

    17. Re:durfy durfy by khrtt · · Score: 1

      Even if the files differ in exactly 1 bit -- the hash would be unrecognizably different. That follows directly from the definition of cryptographically-strong hash.

    18. Re:durfy durfy by danielrose · · Score: 1

      on an unrelated note, what happened to your site?

      --
      i hate pansy republicans
  52. p2p ignorance by Anonymous Coward · · Score: 0

    -- start ignorance

    I do not know much about how p2p algorithms work, but here is my view why this is important.

    When you serve up a file, it creates a hash of the file. It then looks for other files across the network with the same hash. So say you want bytes 200 to 300 of said file. It will go out and download it from another file with the same hash as the original. Problem if all that is checked is the hash then you can pollute the pool with corrupt files. So although two files have the same hash they might have different contents. I do not think this has anything to do with identifying a file from the end user's perspective (such as users looking at hash or file size), but the actual software-client perspective (such as the reliance of hashing to download a file).

    --- end ignorance

  53. Them people using that there interweb ain't stupid by Anonymous Coward · · Score: 0

    "which then spreads through the network"

    It's highly unlikely that it will spread since people don't keep empty files(Unless it's on DC to access big hubs).

    They are actually counting on people to not look at the 2gb movie they just downloaded and just share it long enough for someone else to download it?
    I alsow doubt that they will be able to infiltrate the varies methods of sharing files not all are as open as Kaaza and the likes. XdccBots for example on IRC. Here the Bot owner has the complete files thus can veryfy that they are what their titles claim.

  54. Hashes are cheap, use several by mihalis · · Score: 2, Insightful

    Let's just concede they can actually produce a junk file which has the same hash. I'll even skip over which hash - let's also say it's one of the useful ones.

    I'd be tempted to step up the credentials for a file, say one hash for the entire file, and another for the first 1kb, and so on. It should get significantly harder with each additional verification point.

    1. Re:Hashes are cheap, use several by Anonymous Coward · · Score: 0

      It should get significantly harder with each additional verification point.

      Only in an additive way, not a multiplicitve way, which is what you'd want (to increase complexity drastically). Remember, generating hashes becomes -easier- as the file or portion of the file you're hashing becomes smaller.

      Think of it this way: (small example, but scale it up)

      There are at most 65536 unique hashes for a 2 byte long file. There are at most 256 unique hashes for any 1 byte portion of it. This is regardless of the sophistication of your hashing algorithm. If you hash the entire file, then hash the first byte, then hash the next byte, you're really only creating a hash space of 65536 + 256 + 256 possibilities. That's still O(256^N).

  55. Agreed by John+Seminal · · Score: 5, Interesting
    I wonder why people who use P2P don't help each other out a little more. For example, you have someone with 200 files shared. They are downloading and sharing at the same time. Sometimes they download a bad file, and share it. It would make more sense to have a "unchecked" folder for downloads, then more it to the "checked" folder to share.

    What is neat, or not so neat depending on your point of view, are music files which deteriorate after a while. I don't know how they are made, but I have listened to music that sounds pretty good, but after the 10th playing it starts skipping. Or it could be those skips are not very noticable when first played, but once identified, they become annoying.

    --

    Rosco: "If brains were gunpowder, Enos couldn't blow his nose."

    1. Re:Agreed by metamatic · · Score: 2, Insightful
      I have listened to music that sounds pretty good, but after the 10th playing it starts skipping. Or it could be those skips are not very noticable when first played, but once identified, they become annoying.

      I suspect your hard drive is failing.

      --
      GCHQ Quantum Insert installed. If only our tongues were made of glass, how much more careful we would be when we speak
    2. Re:Agreed by XMyth · · Score: 1

      Umm...definately hard drive failure as another poster mentioned.

      Digital content doesn't fade.

      Or did I mis-read your post and you meant CDs or something (even then...the CD is scratched)...you did say music FILES.

    3. Re:Agreed by triso · · Score: 1
      What is neat, or not so neat depending on your point of view, are music files which deteriorate after a while.
      That would imply that the player is changing the music file, somehow. This can be avoided by denying writes to the file or placing it on a read-only filesystem, (CD-ROM or DVD.)
    4. Re:Agreed by CSMastermind · · Score: 3, Interesting

      http://www.newscientist.com/article.ns?id=dn4248

      Not definitly...I've seen that technology for games(see link) and I remember microsoft had suggested doing that for MP3s and some other things with DRM. I don't know if the it's been put into place yet or not.

    5. Re:Agreed by jsight · · Score: 1

      The HD failure theory is very doubtful. It's very unlikely a failing drive would start giving bad data, and even more unlikely that he would notice this by skips in music (but still have a usable computer without apps crashing constantly).

      More likely, it's just a perception thing. Ie, he hears the crackling once, and then knows it on every subsequent listening.

    6. Re:Agreed by UrgleHoth · · Score: 2, Funny

      What is neat, or not so neat depending on your point of view, are music files which deteriorate after a while. I don't know how they are made, but I have listened to music that sounds pretty good, but after the 10th playing it starts skipping.

      These are zoot files. Every once in a while, they skip a groove.

      --

      Dogma - "let's just say we'd like to avoid any empirical entanglements."
    7. Re:Agreed by Nebu · · Score: 3, Interesting

      Sometimes they download a bad file, and share it. It would make more sense to have a "unchecked" folder for downloads, then more it to the "checked" folder to share.

      The filesharing programs I use force you to share the directory you download into. Sure, I could name the download directory "unchecked", but few people bother to view the full paths as set by the sources from the people they download.

      What is neat, or not so neat depending on your point of view, are music files which deteriorate after a while. I don't know how they are made, but I have listened to music that sounds pretty good, but after the 10th playing it starts skipping.

      To tell you why this happens, we'd need to know about file formats and audio player. Assuming MP3, when you modify the ID3v2 data, the file gets completely rewritten since the ID3v2 tags are written at the head (and not the tail) of the file, for example. Depending on the player, the audio data might actually be getting decoded and re-encoded.

    8. Re:Agreed by Jeremiah+Cornelius · · Score: 2, Informative

      Shareaza has a "commenting" system for just this purpose.

      --
      "Flyin' in just a sweet place,
      Never been known to fail..."
    9. Re:Agreed by Jjeff1 · · Score: 2, Informative

      I've also heard MP3s that work fine on my PC, but skipped horribly on my car player. Different players handle corrupted or badly compressed files differently.

    10. Re:Agreed by myowntrueself · · Score: 0, Redundant

      "I don't know how they are made, but I have listened to music that sounds pretty good, but after the 10th playing it starts skipping."

      Or maybe you have a bad hard drive?

      --
      In the free world the media isn't government run; the government is media run.
    11. Re:Agreed by Have+Blue · · Score: 4, Insightful

      Because the vast, vast majority of P2P users are trying to get stuff for free, not create an alternative-media-distribution free-expression utopia. They're not going to do anything on anyone else's behalf because it does not directly benefit them or immediately help them get more free stuff faster.

    12. Re:Agreed by Anonymous Coward · · Score: 1, Insightful

      untrue

      2 examples.

      1. I had a HDD slowly die. It corrupted files randomly, in this case pictures, where by several files would be readable and the rest although being there (can copy has a file size etc) they did not open. Probably this was only a few bytes in the file that got messed.

      2. a hard drive that spins erratically can produce random wait times for certain things. if it was a really delicate fail, something like heat just a few degrees above a threshold, you could definaltly notice weird artifacts in the mp3s.

      I had some video files that would have little skips in them because of a bad codec. could be that as well.

    13. Re:Agreed by Anonymous Coward · · Score: 4, Funny

      What is neat, or not so neat depending on your point of view, are music files which deteriorate after a while. I don't know how they are made, but I have listened to music that sounds pretty good, but after the 10th playing it starts skipping.

      The files are perfectly normal -- you're simply realizing that most of the music out there is trash which simply repeats the same verses over and over again so much that it sounds like it's skipping. Add to that the endless remixes which ruin perfectly good songs, and I can see how you'd mistake that with repetitive skipping. Rest assured that a better choice in music will alleviate this problem.

    14. Re:Agreed by NeMon'ess · · Score: 1

      Doesn't that cut both ways? The MPAA could lie and say the real movie files are fake. But for the comment to show, they had to offer the real file for download. Now they can offer a fake file.

      Seems like the next step in P2P is to have users mark other users as "bad". Users trade lists as they download. The MPAA's machines get flagged as bad, and nobody downloads from them. When the MPAA starts changing IPs, the users mark narrowly defined ranges as bad.

    15. Re:Agreed by -brazil- · · Score: 1

      1. That's exactly the point. Random corruption in files also means random curruption in executables and even swap space, which means random crashes.

      2. Small delays would have no result as they are also caused by perfectly well-functioning HD hardware and eliminated by buffering. Large delays would result in noticeable skips, not "weird artifacts".

      --

      The illegal we do immediately. The unconstitutional takes a little longer.
      --Henry Kissinger

    16. Re:Agreed by Jeremiah+Cornelius · · Score: 1

      Yeah. Arms race of trust.

      --
      "Flyin' in just a sweet place,
      Never been known to fail..."
    17. Re:Agreed by Anonymous Coward · · Score: 0

      Maybe FAT32 isn't the best file system?

    18. Re:Agreed by khrtt · · Score: 1

      Hard drive failure results in "Disk error" messages; not EVER do bits in a file on a modern hard drive just flip on their own without a warning.

      Filesystem failures are a different story. Run checkdisk.

    19. Re:Agreed by ComputerizedYoga · · Score: 1

      random crashes maybe....

      if the drive is one that has that executables and swap space and so forth. Which isn't to say that it does, or that it should.

      All my data is on non-system disks (and in fact, not on a desktop system at all ... it's on my fileserver in the corner).

      I've got 2 hard drives (120 giggers) in my fileserver that have generated SMART errors in the past. Both of those drives have rendered individual, discrete files on them unrecoverable, without impacting the rest of the system, or even the rest of the filesystem, in any discernable way. Both are still functional, though I make it a point not to put anything important on them.

      Further, a friend of mine was storing a large amount of manga scan rar archives on a hard drive of his fileserver, and discovered that the drive was going bad when I was trying to extract the files and got checksum errors. Without causing any other problems, the disk was randomly losing bits.

      Almost nobody I know among my technically literate friends (with enough money to avoid doing so, that is) uses a single disk for their data storage needs, because everyone knows that the next time the OS dies or the partition table corrupts itself in a power outage or the windows install degrades to unusability, the quickest and cleanest way back up is usually wiping the system disk and starting over.

    20. Re:Agreed by metamatic · · Score: 1

      The early stages of hard drive failure are typically confined to certain areas of the disk. Unless he's installing software every day, he probably never writes executable code to those parts of the disk; the executable code on a Windows machine tends to be pretty static. Whereas if he's constantly shuffling around MP3s, porn, and the like, it's quite likely some multimedia files he downloads will end up across the sectors that are slowly failing.

      I say this because (a) it happened to me and (b) I've worked in data recovery and seen it happen to other people.

      --
      GCHQ Quantum Insert installed. If only our tongues were made of glass, how much more careful we would be when we speak
    21. Re:Agreed by acebone · · Score: 0

      Tragically, that's not funny - it's just spot on :(

      --
      Check out my PHP Url Validator
    22. Re:Agreed by Spectre_03 · · Score: 1

      So your saying that electromagnetics is flawless and our current engineering is as well? Well then why would we make things like checksums and the like? why would we put in the ability to verify the file if it was a given that it was known good once it was on the disk? Lastly how often have you seen that particular result? I question this because frankly given what your implying every conceivable possible data return from a failure is known as well and that M$ and or even the vast linux community has already programmed for such. Anything is possible, rule nothing out, especially with broad generalizations. Metal in a hard drive (or any other component for that matter) is no less prone to problems than another and "bit flipping" could as easily be cause by an errant spike in voltage to the read arm as it passes over a sector as it could from a minor corrosion pit forming inside the platter. (Since corrosion itself is an electric like process). I would have to agree with a post above that was put forward that most anything is possible, and someone that is in the field of data recovery would have seen (as I know I have) many more things that defy logic much more than a data fragment injecting a random artifact into an MP3 stream. Just my 2

    23. Re:Agreed by timeOday · · Score: 1
      The MPAA's machines get flagged as bad, and nobody downloads from them. When the MPAA starts changing IPs, the users mark narrowly defined ranges as bad.
      You don't do it by IP numbers, but instead with public/private key pairs.
    24. Re:Agreed by khrtt · · Score: 1

      He says his files "deteriorate" on the disk, i.e. the computer doesn't hang, he doesn't get disk error messages, but the same file reads differently, with more and more errors every time. Since there is ECC on the drive, it's hardly possible for disk errors to go undetected. Something outside of the drive is garbling the files.

      Since the file is already on the drive, a hardware problem (a flakey IDE cable, or a memory bit error) could cause the file to read differently every time, but it would not "deteriorate" with every read. So it must be that some software is writing over your files in between the reads. There have been virus payloads that would flip random bits in files like that. Or, you could have a corrupt filesystem.

    25. Re:Agreed by Zangief · · Score: 1

      Your idea is good, but a lot of P2P users out there are morons. They rename porno movies so you download them without knowing. And a lot of others annoyances, just because they can.

    26. Re:Agreed by danila · · Score: 1

      Check out the forums at Emule Project. You will find threads where people discuss their sharing strategies, tell how often they check the status of the uploads, etc. Emule provides the facility for users to keep track of sharing and SOME users use it. That's why some people create and share "LIST OF DUPES" files, that's why people add comment to their shared files, etc. Furthermore, even though there aren't checked/unchecked folders, people do rename their files so that the name reflects the contents better. So when you download SpiderMan 3.avi on ed2k, you can check the alternative names and find out that it's a fake and guess what the real content is.

      KaZaA and BitTorrent don't provide features for people to monitor their uploads, that's why people seem to care less.

      --
      Future Wiki -- If you don't think about the future, you cannot have one.
  56. Almost impossible actually by Sycraft-fu · · Score: 1

    Hash functions are, by their nature, not reversable. So there's no way to take a hash and have that give you a file that has that hash. What you have to do is generate a file, hash it, and see what it is. You then continue to do this until you hit the desired hash.

    That's how password brute force tools like John the Ripper work. You give it an /etc/secret file, which is full of hashes. It then keeps hashing test strings until it gets a hash that matches one of them. You then know you found the password.

    Well ok, that is slow even for tiny things like passwords. Indeed you go to 10+ characters passwords with mixed case and symbols and the amount of processing time needed is staggering. So for a file, which is many orders of magnitude larger than a password, it's essentially impossible.

    1. Re:Almost impossible actually by anthony_dipierro · · Score: 1

      Hash functions are, by their nature, not reversable. So there's no way to take a hash and have that give you a file that has that hash.

      That is what a secure hash function does. But just a plain old hash function may or may not be easily reversible. For instance, I can define a hash as the sum of all the 1 bits in the file. It would be trivial to create a file which has the same has, in that case.

    2. Re:Almost impossible actually by GoCoGi · · Score: 1

      Yes, that's how they should work. If there is some flaw in the used algorithm it may however be possible to generate the file from the hash. I really doubt this can generate fakes that match MD5 and filesize though. And if they could do it, we would have other problems anyway, because it is not only filesharing software that relies on MD5 being irreversible :)

    3. Re:Almost impossible actually by Short+Circuit · · Score: 1

      That's how even- and odd-parity modem connections work. :)

    4. Re:Almost impossible actually by Aeiri · · Score: 1
      That's how password brute force tools like John the Ripper work. You give it an /etc/secret file, which is full of hashes. It then keeps hashing test strings until it gets a hash that matches one of them. You then know you found the password.
      $ cat /etc/secret
      cat: /etc/secret: No such file or directory
      !!!
      Someone stole my secret file!
    5. Re:Almost impossible actually by fbjon · · Score: 1
      An apparition appears in front of you. It spells out the text:

      "8N1"

      The image flickers, then disappears.

      You feel nostalgic.

      --
      True confidence comes not from realising you are as good as your peers, but that your peers are as bad as you are.
    6. Re:Almost impossible actually by Short+Circuit · · Score: 1

      No, I don't. They're still around. :)

      (Worldgroup-based BBS, if anyone's curious.)

    7. Re:Almost impossible actually by fbjon · · Score: 1

      What a slow and dragging death... well anyway, there's another one at fix.no which is centered in Norway.

      --
      True confidence comes not from realising you are as good as your peers, but that your peers are as bad as you are.
    8. Re:Almost impossible actually by Short+Circuit · · Score: 1

      We still meet weekly after almost 15 years. (The address on that page is incorrect. See this page for the correct address.)

    9. Re:Almost impossible actually by shogun · · Score: 1

      That's how password brute force tools like John the Ripper work. You give it an /etc/secret file, which is full of hashes. It then keeps hashing test strings until it gets a hash that matches one of them. You then know you found the password.

      Or have just found a hash collision that matches that would pass as a valid password as well..

  57. If they crack the hash by miracle69 · · Score: 5, Funny

    I'm switching to hashish.

    --
    Linux - Because Mommy taught me to Share.
  58. Not about hashes by cpeikert · · Score: 1

    The linked article says nothing about hashing, period. However, it is definitely true that there are entities on P2P networks that are 'poisoning' files. This is how it works: the peers claim to have files with a popular hash value, but when you download pieces from those clients (using swarming), they give you garbage. When the entire file is pieced together, even one 'poison piece' is enough to cause a bad hash value, and the entire file gets scrapped.

    There are solutions to this that use 'tree hashing', which allows you to identify corrupt pieces without having to throw everything out. If P2P protocols don't start implementing tree hashing, the poisoners will likely succeed.

    1. Re:Not about hashes by imsabbel · · Score: 1

      Welcome to the 21th century.

      Bittorrent uses hashes per Block (most ofen 256Kbyte).The worst case that could happen would be a blockloss. Nothing like "the file has to be scapped". It just redownloads this block.
      THe same with emule (and newer emules have a secondary hashtree that limits loss to at most 200kbyte more than the actuall corrupted data, so not even a full 6MByte block is lost).

      --
      HI O WISE PRINCE. WHT TOOK U SO DAM LONG?
    2. Re:Not about hashes by cpeikert · · Score: 1

      Yes, bittorrent uses block hashes. But this requires a centralized tracker to be an arbiter of what the "good" hash values are.

      Most fully-distributed protocols like gnutella don't do hash trees (using a majority vote to determine the "good" root hash value), and they should.

    3. Re:Not about hashes by imsabbel · · Score: 1

      Er, all the hashes are in the torrent file.
      So even a compromised tracker wont result in a wrong file (it just will give an error, but if you can compromise the tracker, you can shut him down without anymore problems).

      And well, gnutella still seems to be dwelling in the last century, in fact i didnt bother installing a client the last 5 years or so. Depricated.

      --
      HI O WISE PRINCE. WHT TOOK U SO DAM LONG?
  59. Not too hard by Pheonix5000 · · Score: 1

    This is what I've been saying for a long time. Don't sue the people downloading all this stuff, just mess up their quality of service with P2P and then give out something better. They'll all come flocking over to the new service and gladly pay. Look at how well iTunes does.

    It doesn't matter what the hashing mechanism is. Due to the nature of what they are, they can be manipulated in one way or the other. The only problem with traditional methods of doing this is the amount of time and processing power required. If this works, kudos to them.
    How about redundant hashing mechanisms? SHA-1, MD5, etc. hashes of the same file? It'd be a bit harder to break then...

  60. Smoke and mirrors. by Anonymous Coward · · Score: 0

    If I recall, BitTorrent generates a hash for each individual piece of a file, then generates a hash for the .torrent file itself. To spoof that would be a serious piece of work.

  61. Sword Cuts Both Ways by 4of12 · · Score: 2, Interesting

    If someone can really poison P2P networks with junk that hash matches (and I have a difficult time believing they've cracked all the hash generators), then consider some hypothetical entity probing illicit distribution of copyrighted material using hashes. They could end up making false accusations against individuals for trading trash instead of Trash©.

    --
    "Provided by the management for your protection."
    1. Re:Sword Cuts Both Ways by dreamchaser · · Score: 1

      They (the accusers) would probably try to argue something silly like 'downloading with intent to violate copyright'.

  62. Will the hash change ? by Interrupt18 · · Score: 1

    If they can make a file with the same size and hash as a real file, when data from their file is mixed in with a real file, won't the new file have a different hash. This would at least slow the spread of these fake files.

  63. amazing advance in technology by Anonymous Coward · · Score: 0

    If a Finnish company could generate a hash file that was identical to the actual file in response to a query, that would stump those pirates. Like the mythical beast Ro. He has the head of a lion and the body of a different lion.

    On a more serious note, it seems like those files would fall under the same type of "natural selection" that bad genes would in the wild. If you had a bad file, you'd delete it if you knew about it, so unless the mother ship kept propagating, the number would quickly fall again. Is it a bad idea to think about files in P2P networks as genes in a genome? If one type of network had all bad genes, it would die the same way an organism would with all bad genes.

  64. validate file before sharing? by �berhund · · Score: 1

    How about if the client software could run some basic sanity check on the file before allowing it be shared out. The Unix/Linux "file" command would be just the thing. ("file" determines what sort of file it is by looking inside the file, regardless of file extension.)

    --
    -Uberhund
    1. Re:validate file before sharing? by �berhund · · Score: 1

      Someone will probably point out that the person who created the malicious file would use a client without this capability. And then this wouldn't work for you until you've already downloaded the file.

      But it would prevent it from spreading.

      --
      -Uberhund
  65. Is this a belated April Fool's joke? by Thangodin · · Score: 1

    Look at the name: Viralg Oy. Or, Viral Goy? Virtual algorithms? Things that smell like this usually send me running to snopes.

  66. Just what I need.... by wyldwyrm · · Score: 1

    You know some idiots are going to take my *legitimate* downloads, like Mandrake 10.1, and create fake hashes bringing you virused software now... But then again, since I'm downloading (and seeding) in Linux most of the time, I'M safe. I pity those with no/outdated antivirus....

  67. bittorrent uses sha1 by pjrc · · Score: 2, Informative
    Hard to believe this is gonna work on bittorrent... the most important file sharing app in use today.

    The Bittorrent protocol uses SHA1 hashing.

    Yes, there was recently a paper presented that "broke" SHA1, but the result is 2**69 operations instead of 2**80 to find a SHA1 collision. 2**69 is still a very large number of operations... a lot less than a full 2**80, but still a prohibitively large number (more costly than the actual realized losses the entertainment industry is suffering).

    1. Re:bittorrent uses sha1 by drinkypoo · · Score: 1

      Shit, it's probably more costly than the losses they are claiming.

      --
      "You're right," Fisheye says. "I should have set it on 'whip' or 'chop.'"
  68. Collateral Damage by DumbSwede · · Score: 4, Insightful
    Since P2P can also distribute legitimate files (I am looking into one such project even now) this can only be seen as something that will lead to unintended collateral damage(assuming it works of course).

    Here is a tool specifically designed to cripple the flow of data, how can it be thought of as anything but a virus? Should it work I could see TV and Movie studios using it surreptitiously to cripple net-based fledgling media companies.

    This should be outlawed just like another intentionally malevolent software. Why shouldn't everyone write viruses and malware when the big guys do it and the government sanctions it. This is just the kind of thing that keeps web commerce from taking off to its full potential.

    1. Re:Collateral Damage by Anonymous Coward · · Score: 0

      No it should _NOT_ be outlawed. However if someone uses it for illegal things, then that someone may be breaking some law....

    2. Re:Collateral Damage by xTMFWahoo · · Score: 1

      This assumes that whoever is creating the "bogus" files picks the same file name as legitimate ones with the same hash- right?

      I would assume people who would do this would use filenames like "50 cent...." and "Metallica..."

      --
      "Patriotism is supporting your country all the time, and your government when it deserves it." Mark Twain.
    3. Re:Collateral Damage by Anonymous Coward · · Score: 0

      What about us swedes? It's perfectly legal for us to download using P2P. Aren't they then illegally interfering with our downloads?

  69. People actually read the Inquirer? by cyborman · · Score: 1

    I admit, I take a look every now and then when I see something funny on the front page while I'm in the checkout line at Walmart. But beyond that, do people actually read it?

    1. Re:People actually read the Inquirer? by atomm1024 · · Score: 1

      You're probably thinking of the National Enquirer, an American tabloid devoted mainly to celebrity gossip. This is The Inquirer, a European technology magazine.

      --
      Signature.
  70. How to tell by SuperKendall · · Score: 1

    But how would you, the downloader, tell which one is real just by looking at the two files if they are relatively close to the same size?

    Because fourty people are sharing one and four people the other?

    With obsucre stuff it would be harder, but then obscure stuff is not likley to be targeted by these measures. I think it will be a long time before you see the complete soundtrack to the Muppet Movie have this technique applied and spread across the networks.

    --
    "There is more worth loving than we have strength to love." - Brian Jay Stanley
    1. Re:How to tell by Tim+C · · Score: 1

      Because fourty people are sharing one and four people the other?

      In my experience, people share a whole load of crap that shouldn't be on the network. Sometimes even very popular files are complete junk. (By which I mean misnamed, DRMed (and so useless) or even just plain corrupt).

      Besides which, if you're serious about poisoning a p2p network, I don't see forty clients to be that much of a stretch. Hell, if you're really serious, you could put hundreds of them out on the network. It wouldn't take that many though - as soon as people start downloading form you and uploading to others, you're gaining even more poisoned clients.

    2. Re:How to tell by Anonymous Coward · · Score: 0

      Lately anytime I've tried to find something on KaZaa I've found the complete opposite. Usually if it's a fairly popular recent song, avoid the files which have 3-4x as many nodes. 150 other downloaders? forget it, it's crap. They all download 5-10 different copies looking for a real one and leave the fake ones in their shared folder.

  71. And... by game+kid · · Score: 1

    the same SHA-1, SHA-256, SHA-384, SHA-512, and same audio/video header data. Maybe, just maybe, I'd be fooled for a second. I can check these things, you know.

    --
    You can hold down the "B" button for continuous firing.
  72. Re:Possible? Yeah by cpeikert · · Score: 1

    Now, what the company has to do is create a file of the SAME FILE SIZE

    The MD5 collisions that have already been found are for files that are of the same size. All it takes is to find one pair of blocks that collide, and you can build infinitely many pairs of same-size colliding files.

    This has nothing to do with the claims of this company, though -- the article doesn't even mention hashing.

  73. destroying files? by Iphtashu+Fitz · · Score: 1

    FTFA: it claims its technology can also destroy already shared files on peer to peer networks.

    So are they claiming that their "virtual algorithm" includes the ability to delete files or what? Or do they seem to think flooding P2P networks with bogus data equates to destroying shraed data? If their technology can damage files on my hard drive then they could end up in a lot of hot water if it deletes a single legitimite file or otherwise corrupts unrelated data.

  74. My Prediction: Vaporware by The+Raven · · Score: 1

    I fail to see how this can possibly work with any P2P system that uses a secure hashing algorithm. Sure, if they use CRC32, anyone can make a garbage file... but all the P2P apps I use incorporate secure hashing algorithms like SHA1.

    If they have succeeded in cracking SHA1 or MD5 hashes... well, I think they'll soon be into more lucrative avenues than P2P blocking... such as hacking secure government and bank communications for the Finnish government. :-)

    --
    "I will trust Google to 'do no evil' until the founders no longer run it." Hello Alphabet.
    1. Re:My Prediction: Vaporware by Anonymous Coward · · Score: 0
      The Finnish Government, heck, they'd be working for whoever has the deepest pockets.

      Unless they're one of those strange patriotic types...

  75. findhash.com - dope2u by matt+me · · Score: 1

    findhash.com - working with over ten thousand dealers across 500 cities, we can guarantee you're never further than 500m from your next toke.

    NEW - text 555 GANGE from within any major urbaninsation, and within minutes you'll receive a reply with directions to your nearest shady back-alley/public toilet. show proof of use of our service and receive an extra 1/8 free. selected peddlars only.

    remember kids, smoke local produce.

  76. Interesting idea, how can we apply it to spam? by Progman3K · · Score: 4, Interesting

    If increasing the noise ratio on P2P networks is a good thing, maybe we can use a similar technique to defeat spammers?

    For example, if we could pollute spammers' email address databases with millions of bogus e-mail addresses, then instead of delivering millions of spam e-mails to real e-mail accounts every day, maybe spammers could only reliably send a few hundred to users, the rest of their messages would be to bogus addresses and be "noise" that spammers have to deal with.

    How could we go about doing this?

    --
    I don't know the meaning of the word 'don't' - J
    1. Re:Interesting idea, how can we apply it to spam? by cloudmaster · · Score: 1

      There are web pages out there full of fake email addresses, for just that purpose. In each of the mails I send out, I have a couple of fake addresses in the headers. Somehow, the mail servers I administer still get 80%+ spam, despite that these things have been going on for years.

      Spammers can get around the problem by putting a URL in the message and using a fake sender address (or your address, for that matter). They don't care if half of their messages are bounced after the open relay they're sent through, because the messages almost never get back to the spammer anyway.

    2. Re:Interesting idea, how can we apply it to spam? by Kimos · · Score: 1

      It wouldn't work. The spammer would only have to send out a single email to every address, then remove all of the addresses which returned an undeliverable message.

      That's about the only way to effectively stop spam to your account. Remove it from your mail server for about a month, then most automated mailing systems will remove you after x-number of errors.

    3. Re:Interesting idea, how can we apply it to spam? by Anonymous Coward · · Score: 1, Insightful

      The "noise" messages will bounce, and spammer will identify all the fake addresses. Won't work.

    4. Re:Interesting idea, how can we apply it to spam? by ElliotLee · · Score: 1

      It's already being done. I've seen websites with links to special pages specifically for spambots and the like.

    5. Re:Interesting idea, how can we apply it to spam? by Incadenza · · Score: 1

      There are web pages out there full of fake email addresses, for just that purpose.
      Spammers can get around the problem by putting a URL in the message and using a fake sender address (or your address, for that matter). They don't care if half of their messages are bounced after the open relay they're sent through, because the messages almost never get back to the spammer anyway.

      On the fake page that I put up for harvesters, I use these exact URLs to annoy the spammers. The page contains:
      (a) e-mail adresses that get generated from a bogus user name + the URL of a spamvertized website (example: Nadeem.Stuffen@spamvertized.com)
      (b) links to all these spamvertized websites (http://www.spamvertized.com/ etc.)

      This way they will at least, apart from using the resources on zombied PC's, use up some of the resources of their own MXes. And the harvesting spambots will have a swell time harvesting spamvertized sites, instead of the rest of the world.

    6. Re:Interesting idea, how can we apply it to spam? by m50d · · Score: 1

      Simpler solution. Stop telling everyone "never reply to spammers". Instead, tell people "reply and string them along for a bit". If even 1 in 100 people did that it would stop spam dead.

      --
      I am trolling
    7. Re:Interesting idea, how can we apply it to spam? by Anonymous Coward · · Score: 0

      Remove it from your mail server for about a month, then most automated mailing systems will remove you after x-number of errors.

      Nope. When I look at my email server logs, accounts from 4 years ago still get spam delivery attempts.

      There is no way to get off a spammer's email list.

      Although, a 12-gauge shotgun might work...

    8. Re:Interesting idea, how can we apply it to spam? by ticktockticktock · · Score: 1

      All that would do is encourage people to DDoS innocent others when a spammer places an innocent person's email address in the from address of emails they spam out to people.

    9. Re:Interesting idea, how can we apply it to spam? by rbarreira · · Score: 3, Informative

      Your post advocates a

      (X) technical ( ) legislative ( ) market-based ( ) vigilante

      approach to fighting spam. Your idea will not work. Here is why it won't work. (One or more of the following may apply to your particular idea, and it may have other flaws which used to vary from state to state before a bad federal law was passed.)

      ( ) Spammers can easily use it to harvest email addresses
      ( ) Mailing lists and other legitimate email uses would be affected
      ( ) No one will be able to find the guy or collect the money
      ( ) It is defenseless against brute force attacks
      ( ) It will stop spam for two weeks and then we'll be stuck with it
      ( ) Users of email will not put up with it
      ( ) Microsoft will not put up with it
      ( ) The police will not put up with it
      ( ) Requires too much cooperation from spammers
      ( ) Requires immediate total cooperation from everybody at once
      ( ) Many email users cannot afford to lose business or alienate potential employers
      (X) Spammers don't care about invalid addresses in their lists
      ( ) Anyone could anonymously destroy anyone else's career or business

      Specifically, your plan fails to account for

      ( ) Laws expressly prohibiting it
      ( ) Lack of centrally controlling authority for email
      ( ) Open relays in foreign countries
      ( ) Ease of searching tiny alphanumeric address space of all email addresses
      ( ) Asshats
      ( ) Jurisdictional problems
      ( ) Unpopularity of weird new taxes
      ( ) Public reluctance to accept weird new forms of money
      ( ) Huge existing software investment in SMTP
      ( ) Susceptibility of protocols other than SMTP to attack
      ( ) Willingness of users to install OS patches received by email
      ( ) Armies of worm riddled broadband-connected Windows boxes
      ( ) Eternal arms race involved in all filtering approaches
      (X) Extreme profitability of spam
      ( ) Joe jobs and/or identity theft
      ( ) Technically illiterate politicians
      ( ) Extreme stupidity on the part of people who do business with spammers
      ( ) Dishonesty on the part of spammers themselves
      ( ) Bandwidth costs that are unaffected by client filtering
      ( ) Outlook

      and the following philosophical objections may also apply:

      (X) Ideas similar to yours are easy to come up with, yet none have ever
      been shown practical
      ( ) Any scheme based on opt-out is unacceptable
      ( ) SMTP headers should not be the subject of legislation
      ( ) Blacklists suck
      ( ) Whitelists suck
      ( ) We should be able to talk about Viagra without being censored
      ( ) Countermeasures should not involve wire fraud or credit card fraud
      (X) Countermeasures should not involve sabotage of public networks
      ( ) Countermeasures must work if phased in gradually
      ( ) Sending email should be free
      ( ) Why should we have to trust you and your servers?
      ( ) Incompatiblity with open source or open source licenses [hey, it's Microsoft... they've probably already submitted the patent...]
      ( ) Feel-good measures do nothing to solve the problem
      ( ) Temporary/one-time email addresses are cumbersome
      ( ) I don't want the government reading my email
      ( ) Killing them that way is not slow and painful enough

      Furthermore, this is what I think about you:

      (X) Sorry dude, but I don't think it would work.
      ( ) This is a stupid idea, and you're a stupid person for suggesting it.
      ( ) Nice try, assh0le! I'm going to find out where you live and burn your house down!

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    10. Re:Interesting idea, how can we apply it to spam? by zippthorne · · Score: 1

      what is the source of the spammers lists? I know many people who make up email addresses on the spot, (who is this foo@bar.com that keeps signing up for our lame contest) when confronted with email on forms.

      --
      Can you be Even More Awesome?!
    11. Re:Interesting idea, how can we apply it to spam? by Progman3K · · Score: 1

      I don't think so; more often than not, spammers use a variation of joe-jobs to deliver spam.

      Haven't you ever received a failure notification for a message you never sent that was refused by a remote domain?

      I have, and I KNOW I'm not infected, so why are the bounces coming back to me?

      If it really was the spammers actually sending the spam, the originator could be easily traced and shut down.

      So most of the time, spammers are using bot-nets. It's a zombie army doing their work for them.

      It seems like there hasn't been a very public dissection of how the bot-nets are maintained, but I am betting that they receive address lists along with their delivery payload, so maybe someone could willfully have their machine infected, and stock it with thousands of fake e-mail addresses that would get sent back to the bot-net.

      --
      I don't know the meaning of the word 'don't' - J
    12. Re:Interesting idea, how can we apply it to spam? by Progman3K · · Score: 1

      Heh heh... A classic response.
      Thanks for being polite, at least. :-)

      --
      I don't know the meaning of the word 'don't' - J
    13. Re:Interesting idea, how can we apply it to spam? by Progman3K · · Score: 1

      Reading the posts, I think that the major source of addresses for spammers must be from address-books of machines they pwn.

      I've read newsgroups USED to be a source of e-mail addresses for spammers, and web-pages too, and although they must still be used, it's probably a lot more accurate to infect a machine and steal the address book, or at least read all the addresses of messages received in the inbox...

      --
      I don't know the meaning of the word 'don't' - J
    14. Re:Interesting idea, how can we apply it to spam? by Anonymous Coward · · Score: 0

      You're forgetting that spammers are already doing this to themselves!

      Yes, you heard correctly. Spammers use dictionary attacks against mail servers -- trying every possible combination of words in the dictionary, numbers and punctuation as an email address. They make blind guesses as to which user names might possibly valid for this particular mail server. Millions of guesses. As many per second as the receiving mail server will handle.

      This is not a pleasant thing and can quickly bring a mailserver to its knees if no precautions are taken. Imagine, for example, a forwarding mailserver that cannot check user names and obediently sends every mail on to the real mailserver. Which, in turn, produces a bounce, as it is required to, according to the RFC. Ouch. I had that once, back in, oh, 2001, when these things were not as common yet.

      So, forget about increasing the noise ratio for spammers. Nothing you could do could be as bad as the stuff they're doing themselves.

      Regards, Felix.

    15. Re:Interesting idea, how can we apply it to spam? by Anonymous Coward · · Score: 1, Insightful

      > (X) Countermeasures should not involve sabotage of public networks

      What public network is being sabotaged here? So an admin puts pages of fake email addresses on his server... how is that sabotage?

      I think this particular anti-spam solution is useful. Sure, spammers don't care about invalid addresses, but this kind of thing must make life a little harder for them.

    16. Re:Interesting idea, how can we apply it to spam? by PFAK · · Score: 1

      These websites are a bad idea IMO, my personal email address (pfak at pfak dot org) is listed in a bunch of these "databases", and I recieve a couple hundered spams a day because of this.

      Go figure.

      --

      Free means no restrictions, ironic the FSF's GPL forces restrictions, isn't it? What's your definition of free?
    17. Re:Interesting idea, how can we apply it to spam? by robogun · · Score: 1

      Here's where they get emails:

      -Scraped from www pages / blogs / guestbooks
      -Purchased from "opt-in" address sellers (sign up for the FREE Ipods anyone?) & other scum who promise you the world for your contact info
      -Poached from insiders @ ISPs (the guy who worked at AOL sold I think 70 million good addresses?)
      -Scraped from Usenet
      -Scraped from Ebay/Paypal (there are ways)
      -Dictionary@MajorIsp.Com
      -Captured and forwarded by viruses from Outlook(r) Address Books
      -Secretly sold to third parties by unscrupulous businesses whom you had legitimate business with

    18. Re:Interesting idea, how can we apply it to spam? by rbarreira · · Score: 1

      Well, I was thinking about the thousands of emails being sent to invalid addresses, they could hog some networks of mail servers... Not that spammers don't do that already, but that was the reason behind that X...

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    19. Re:Interesting idea, how can we apply it to spam? by Anonymous Coward · · Score: 0

      How could we go about doing this?

      Spam the spammers. For every email your mail server receives, generate 50 replies with random email addresses in your domain, or visit their websites (neatly avoiding clicking on their banner adds, of course) and fill in any form you can find and submit it with random names and addresses. Set the ELISA bot to handle any replies to the spoofed emails.

    20. Re:Interesting idea, how can we apply it to spam? by Ernesto+Alvarez · · Score: 1

      That won't work, Mr. AC.

      You might be bombarding someone who is not really involved in spamming, but had his address used in the "From:" field.

      That's called a "Joe Job" and has already been done by spammers.

    21. Re:Interesting idea, how can we apply it to spam? by hacker · · Score: 1
      "If increasing the noise ratio on P2P networks is a good thing, maybe we can use a similar technique to defeat spammers?"

      To really stop or dramatically slow spam, we need to think about it differently. We're trying to filter out spam from legitimate email. Back when spam was "new", it was a minority of our total incoming email. Now its a significant majority.

      Why are we draining the pond to get to the fish? We should be filtering in legitimate email, not filtering out spam.

      It'll take awhile, but it will happen...

    22. Re:Interesting idea, how can we apply it to spam? by Captain+DaFt · · Score: 1

      Well, if enough did it, for long enough, it could dilute the pool of usuable addresses harvested.
      Hopefully, it would make harvesting addresses to sell to spammers unprofitable.
      (What the hell, it's worth a shot, check my sig for more info.)

      --
      The U.S. really needs an English to Wisdom dictionary.
    23. Re:Interesting idea, how can we apply it to spam? by zippthorne · · Score: 1

      Ok so a partial solution would be to populate our own address books with a million fake email addresses. there should be plenty of disk space available for that, (at 20 chars each its only 20 megabytes right?)

      --
      Can you be Even More Awesome?!
    24. Re:Interesting idea, how can we apply it to spam? by robogun · · Score: 1

      If you run Outlook, the first entry in the address book should be your own address, that way you are notified when you get 0wn3d.

    25. Re:Interesting idea, how can we apply it to spam? by m50d · · Score: 1

      If they don't include a valid way to contact them, there's no way they can make money out of it. I don't mean reply to them necessarily, just act as if you were going to buy it for as long as you can.

      --
      I am trolling
  77. Bad news for the music industry by nizo · · Score: 5, Funny

    What will they do when people like the files with random noise better than any of the current music?

    1. Re:Bad news for the music industry by Saeed+al-Sahaf · · Score: 1
      What will they do when people like the files with random noise better than any of the current music?

      There is a difference?

      --
      "Who are in control, they are not in control of anything - they don't even control themselves!" - Glen Beck
    2. Re:Bad news for the music industry by brxndxn · · Score: 1

      It wouldn't let me mod you to '6, Fucking Hilarious'

      --
      --- We need more Ron Paul!
    3. Re:Bad news for the music industry by Dr.Ruud · · Score: 1

      The good thing of hashes here is that they are not unique.
      1. Create hashes with enough bits on file-parts, for example SHA-1.
      2. Each part is just random anonymous data, findable by its hash.
      3. When a reader has retrieved m-out-of-n parts, it can create a result file. With (m-1) parts it can not create a file that comes close to that.
      4. The result file is the original file, or a file with a clue about how to change it into the original (like XOR it with the same number of bytes from some popular CD-R).
      5. The indexes (like filenames, and a list of belonging hashes, and ueber-hashes) MUST be totally separated from the parts.
        The indexes are published 'somewhere else', like on specialized and actively mirroring websites/usenet/irc.
      6. There MUST be no central notion at all of which node can supply the data from any specific hash.
      7. Clients tell the neighbouring clients which hashes they are looking for, and that gets spread.
      8. A client MUST not know anything of relations between the hashes that is has. A client can serve any collection of hashes that it finds fit.
  78. Snake Oil and backfiring by killmenow · · Score: 1

    These people are selling snake oil pure and simple. I have a high degree of skepticism on any claim to be able to produce a random file of the same size and hash as a known file. That is, as long as the hash is not CRC or something ridiculous like that. If you're talking MD5 or SHA-1 or better, it's just ridiculous.

    Oh, and just think how this could backfire on the RIAA/MPAA types: Search some P2P system for a file that might be your copyrighted material...download it to prove it is and that person X is distributing it illegally...receive unplayable garbage from P2P system instead. There goes your ability to prove in court that anybody is illegally distributing your copyrighted materials.

  79. Re:For all the new 'copysafe' tech that comes out. by Anonymous Coward · · Score: 0

    Day 1) Get Mom to stop bugging them to clean up their "Basement Layer"
    Day 2) Finding their keyboard under crusted underpants
    Day 3) Filtering out their D&D IRC channels to find one where someone says their crap is broke
    Day 4) Hanging up Pirate flag and screwing on peg leg
    Day 5) Finding enough change in the couch to buy enough Mountain Dew necesary for coding
    Day 6) Coding
    Day 7) Back to D&D, FINALLY!!!

  80. Simple solution by timdorr · · Score: 1

    IANACE (I am not a cryptography expert), but would it be possible just to provide two hashes on the same file or file portion? You would then have to find a collision of both types of hashs simultaneously. I would think that would be much harder to do. You can get a single collision easily enough, but finding one that works for both algorithms would be much harder.

    As an alternative, you could set up a system where hashes are provided on variable sections of the file. So, it's unlikely that a colliding file would have the same hash for some subsection of the file, as well. And by setting it to hash on a random portion of the file, you should not be able to create a collision for every portion of the file (at least not in a reasonable amount of time for these networks, anyways).

    --
    Tim Dorr
    Owner/Manger
    A Small Orange
    1. Re:Simple solution by Harish+Rallapali · · Score: 1

      Great idea. Heck, even migrating the network to another hash system would mess them up, but dual hashes? Extra CPU time for clients, sure, but in this day and age it really doesn't matter...

      Of course I'm always a fan of just using an encryped network like Freenet :-D

  81. It's still extremely possible to do that. by pathological+liar · · Score: 0

    SHA gives a 160bit hash. Even assuming the algorithm is perfect, there will be collisions for anything over 160bits long. Even something the size of an mp3 (a couple megabytes) will likely have many, many collisions that are the same size.

    It's extremely possible, the challenge is finding them.

    1. Re:It's still extremely possible to do that. by taniwha · · Score: 1

      possible yes, extremely no ... unless someone breaks the one-way hashing algorithm

    2. Re:It's still extremely possible to do that. by Anonymous Coward · · Score: 0

      Just because it has "many many", there are "a shitload more" (about 1400000000000000000000000000000000000000000000000 times more) that are non-collisions, so on average you'd have to go through 700000000000000000000000000000000000000000000000 to find a single collision. (Yes the numbers are smaller than that because of a weaker sha-1, but not more than a few orders of magnitude) Anyway that would take "quite some time".

  82. Experiences as a Finn by Anonymous Coward · · Score: 1, Informative

    From what I have notices, using Kazaa-type software in Finland is nowadays a complete waste of time. What you get are exactly these files the company claims to have created. Sometimes you here like 10 seconds of the actual song and the rest is just random noise.

    Now, I do not know if what they claim is technically true or whether it is this company that is behind all these files, but I can tell that in real life it is extremely hard for a "normal non-geek user" to find pirated music here in Finland anymore.

    Bittorrent and DC++ type of systems seem to be unaffected though.

  83. At most, it will simply force a new rev by Fallen+Kell · · Score: 1
    There are many ways around this. First and formost is the way already suggested, a list of valid users, the second is a rating system tied into the network itself. Basically, MD5 the individual file segment blocks, not just the file itself. Also download the block from multiple sources and compair. The one that is most prevailent can be assumed to be the correct file block, but maybe not.

    You could also tie in the actual file data into the share (i.e. have speific bytes from the block in the naming/database/share scheme that must match others availabe for it to be grouped together, not just similar MD5sum). This prevents files being corrupted because they downloaded part from a valid source vs a part from an invalid source.

    You may also come up with some sort of networked rating system for the files themselves, allowing for files to recieve values based on if they were valid or invalid. Have the functions hard coded to specific numbers say "+1" for a valid file signal being sent and "-100" for an invalid file. Force some checking before recieving the signal (i.e. the signal must be recieved from a source which has just downloaded the specified block) which will limit some of the spread of spoofed signals, but this sytem could probably be hijacked in the current form, but combining it with the users list could allow for quick removal of any files which are invalid from propigating far and wide on actually used segments of the networks vs and staged clients placed to spread junk data.

    --
    We were all warned a long time ago that MS products sucked, remember the Magic 8 Ball said, "Outlook not so good"
  84. There is one way.... by Col.+Blackwolf · · Score: 5, Funny

    You can always ensure an identical hash and size by filling the file with identical data and then uploading the new file to the P2P network. Imagine how quick filesharing would stop if all of the major industry groups started doing this. P2P wouldn't stand a chance, no siree.

  85. The hash is generated client side? by ThinkTiM · · Score: 2, Insightful

    The hash is generally generated on the client side of the original uploading system - and the validity of the file can only be checked once the file has been fully downloaded. So to break the system, just modify one of the open soure clients to report a particular hash for some random file of the same size as the original. There isn't any need to go to the effort that these guys have.

    1. Re:The hash is generated client side? by Nom+du+Keyboard · · Score: 1
      The hash is generally generated on the client side of the original uploading system - and the validity of the file can only be checked once the file has been fully downloaded.

      The article implies that the CD itself is protected by the fact that when ripped and shared on the P2P system, that its hash will match other different files, resulting in interleaved result to any downloader.

      This, is of course, impossible given varying MP3 compression, and that fact that hashes are created to prevent this very problem of two different files seeming identical.

      Only if there is a fault in hash implementation could this work on one P2P system, and it's unlikely that all P2P systems implement faulty hashing.

      --
      "It's the height of ridiculousness to say for those 9 lines you get hundreds of millions."
    2. Re:The hash is generated client side? by khrtt · · Score: 1

      ...the validity of the file can only be checked once the file has been fully downloaded.

      Two words:
      Tiger-Tree Hash.

    3. Re:The hash is generated client side? by ThinkTiM · · Score: 1

      That is three words.

  86. Already patented? by Anonymous Coward · · Score: 0

    Wasn't the idea of dumping P2P networks with bogus files with identical hashes and file sizes as the real files patented in the USA about a year ago?

    I remember that some Finnish people received an innovation award by "inventing" this idea, and some US professor had already patented it a month before they received the award..

    Anybody remember? Links?

  87. Strategies to permanently defeat this by zuvembi · · Score: 1

    So, this doesn't seem to difficult to defeat. My new P2P app EMS (Eat My Shorts) will use *two* different hashes. Granted I'm sure for real crytographic purposes this would suck. But for hashes computed to exchange files wouldn't this make it exponentially more difficult to pollute the file-space?

    Yes, I'm being fascetious about creating a new P2P app.

  88. Looking to a law suit? by crovira · · Score: 1

    He just has to screw with somebody's legitimate data source and he's going to get screwed.

    These ways of defeating P2P are most useless and wrong headed.

    --
    MSBPodcast.com The opinions expressed here are my own. If you don't like 'em... Think up your own stuff.
  89. Just finding a hash collision isn't enough really by James+Youngman · · Score: 2, Interesting
    I suppose their method is based on the fact that it turns out that it's easier to find SHA-1 and MD5 collisions than was earlier thought. In fact there's another paper (this paper is not by the Chinese team) which shows that this can be achieved on individual PCs in mere hours, which puts this sort of thing into the realm of commercial exploitability.

    For example, you send the company a copy of the .mp3 file you want to drive out of circulation. They feed it to a computation cluster and eventually out comes another file which has the same hash. You then publish this new file with the same filename on the victim P2P network and hope that it spreads enough to poison the P2P well, so to speak. There are a number of problems with this scheme (assuming of course that this is the sort of scheme that they offer):

    1. The new 'collision' file might have the same MD5 hash, but is it a valid MP3 file?
    2. All it takes to beat this scheme is for P2P software to use more than one hash function, for example
      hash (data)
      {
      return concatenate(md5(data), sha1(data));
      }
      After all, even though we now know how to find collisions in MD5 and SHA-1 (quite slowly) we don't yet know an efficient way to find a single file that is a hash collision for both of them.
    3. If the company paying the money for the 'collision' file is doing so because somebody has spread their material around the P2P network, then the file must be quite prevalent. So why would they expect the 'collision' file to preferentially spread around the network enough to displace the original file?
  90. Re:How they get the MD5/AES hashes BS!!! by Nom+du+Keyboard · · Score: 1
    They probably aren't actually making files with the same hashes, just modifying the clients, probably open source ones too, to report the md5 sums that they want to for each file,

    This has to be the answer. Just a new way of poisoning P2P. Here's why:

    Point 1: The article gives the impression that when you rip a CD using their protection method, somehow the hash result will be confused with other files that generated the same hash result, meaning you'll get bits of every file interleaved among each other on a download. BS!! The hash is computed against the actual MP3 file, which is different at minimum based on MP3 encoder used, compression settings, and even if you've modified the ID3 tags. Unless everyone was sharing perfect ripped .wav files, they won't be identical, and won't hash identically.

    Point 2: Different P2P systems use different hashing methods. I don't believe it is possible to have a one-size-fits-all unless, once again, everyone is sharing the identical file (e.g. .wav).

    Vaporware pure and simple. They are just betting the the record companies are stupider than the "pirates". Considering that the record companies spent how much on a system defeated by the SHIFT key, they may well be right, and collect a few million $'s of their own from corporate drones too stupid to understand that their cheese has moved!

    --
    "It's the height of ridiculousness to say for those 9 lines you get hundreds of millions."
  91. New Hashing Algorithm by bytesmythe · · Score: 1

    I'm about to release a P2P application based on my new hashing algorithm. The algorithm itself is deceptively simple:

    1) Look at the first bit of the file.
    2) If that bit is a one, record a one, otherwise record a zero.
    3) Repeat until you reach the end of the file.

    I'm willing to bet the company can't come up with a way to get collisions out of that one!

    --
    bytesmythe
    Hypocrisy is the resin that holds the plywood of society together.
    -- Scott Meyer
  92. Bogus Claim by darco · · Score: 1

    If this company can do what it claims it can with their "virtual algorithm", then they have the capability to wreck havoc with much more than just P2P--because they are implying that they have broken MD5(or SHA1) in such a way that would make it completely useless as a secure hashing mechanism.

    I know that MD5 is no longer considered to be a secure hash, but the scale upon which this company is claiming is simply staggering. Their claim implies that they can generate a chunk of data that is the same size and with the same MD5 has as a different chunk of data--and that they can do so quickly enough to make a business model out of destroying P2P.

    This is a bullshit claim, unless they aren't talking about MD5 or SHA1. But if they aren't talking about MD5 or SHA1, then who cares?

    --
    — darco
  93. Contact information by Anonymous Coward · · Score: 0

    The only contact information on the company's site is a single e-mail address. I find that somewhat shady.

  94. That sig is from diskworld, isn't it? by crovira · · Score: 0, Offtopic

    Or are you the actual 'AI engine' and someone has stolen your ant farm?

    --
    MSBPodcast.com The opinions expressed here are my own. If you don't like 'em... Think up your own stuff.
    1. Re:That sig is from diskworld, isn't it? by CharonX · · Score: 3, Informative

      Hehe, yup, its one of the great lines HEX produced.
      I can really reccommend Terry Pratchett's books to everyone.

      --
      +++ MELON MELON MELON +++ Out of Cheese Error +++ redo from start +++
    2. Re:That sig is from diskworld, isn't it? by rincebrain · · Score: 1

      Seconded.

      Mod parent informative!

      --
      It's only an insult if it's not true.
  95. Darknets by e2d2 · · Score: 1

    This is exactly why darknets will gain favor within the file sharing community. The need to limit access to known community members or those that can be vouched for will slowly gain ground. I think that file sharing will slowly go back to where it came from - the "underground" of the internet.

    But I could be wrong, maybe file sharing will be deemed legal in all countries in the future and this wont be a problem. HAHAHAHA.

  96. It's already been tried.. by LodCrappo · · Score: 1

    This works "by flooding p2p networks with corrupt/junk data". Didn't spammers already try to kill email with a similar technique? Isn't this the basic principal behind posting on Slashdot? Yet they both continue to thrive..

    --
    -Lod
  97. This is definitely fake technology by Enigma_Man · · Score: 1

    As the title of the article indicates.

    -Jesse

    --
    Nothing says "unprofessional job" like wrinkles in your duct tape.
    1. Re:This is definitely fake technology by cloudmaster · · Score: 1

      I clicked on the "click here to get a demonstration" link at the bottom of the page. All I got was the same flash movie and game controller guys from the front page, and some text in the form of graphics. I was promised a demo of 100% blockage of any downloads of my software. 100%! They don't even have a demo, but I should believe that they can stop *all* trading of my software through P2P networks? Ha!

  98. Re:Possible? Yeah by hackstraw · · Score: 1

    I've always thought it would be extremely possible to create a file with the same MD5 hash.

    Now, what the company has to do is create a file of the SAME FILE SIZE, with the same MD5 hash that's a fake .. then I'll be impressed.


    Well, if you've ever used tripwire, that does 8, yes, count them 8 different hashes on a file. Just in case (I hate tripwire).

    Now with the same size thing (which would be very impressive), its a little different because most if not all p2p programs do hashes on each chunk, not merely the whole file itself. So these guys have been able to figure out how to create a same sized chunk with the same hash value _on the fly_ before the download finishes.

    Trust me, if these people were able to do this, they would be doing much more profitable things besides playing around with p2p downloads.

  99. This is almost certainly Kazaa only by PhracturedBlue · · Score: 1

    I haven't looked at it recently (the last time was back when giFT first came out), but from what I remember, Kazaa does not hash the entrire file (probably because it takes too long to do). instead they hash sections of the file at specific points (something like 1k of data at 1k, 10k, 100k, 1M, 10M, etc offset)

    I believe they were using a pretty simple XOR based algorithm for hashing. Anyhow, whether it is easy or not to break Kazaa's hashes, I don't know, but it is certainly not comparable to SHA (or even MD5) on the entire file.

  100. minor annoyance by Anonymous Coward · · Score: 0

    All you have to do is use multiple hash functions. Can they really create a file that will match 2 different types of hash?

  101. Burned Hash Browns by Beautyon · · Score: 1

    Even if they manage to do this, all the P2P client developers have to do is get each client to sign the files that it is hosting and sharing. Then, via a web of trust that can be built by people signing the public keys of each others clients (say, when they get a good file), any spoofing and polluting client (and its shitty files) can be excluded (modded down so that they are invisible) because they do not have enough good signatures, or indeed, no signature at all.

    Problem solved.

    --
    ATH0 Bitcoin: 1DnwFLXczVZV8kLJbMYoheUrpqHesjxrSi
  102. Automated Autofix by Nom+du+Keyboard · · Score: 1
    One way a P2P system could automate checking that the file is valid is for there to be a whole-file hash, and incremental hashes - say first .5MB, first MB, every 5MBs after that. Hardly going to increase file size or transfer speed significantly. Then as the file arrives, if it doesn't has properly for the length received, you've been poisoned.

    Heck, could just be CRC-32 values as far as that likely goes, although hashes would be more resistent.

    Upshot, I'm not buying stock in this company any time soon, and wonder when the lawsuits for false and fraudlent advertising start arriving.

    --
    "It's the height of ridiculousness to say for those 9 lines you get hundreds of millions."
  103. No they have SMOKED hash and crack. by crovira · · Score: 1

    (Sorry I'm finishing a stats exam and I'm giong nuts here.)

    --
    MSBPodcast.com The opinions expressed here are my own. If you don't like 'em... Think up your own stuff.
  104. Couldnt this work to your advantage by Anonymous Coward · · Score: 2, Interesting

    SO say the RIAA tries to sue you, saying they saw that you had the newest 50 cent album on Kaaza. Couldn't you claim that what you had was not 50 cent's album, but random files with the same hash as 50 cent's mp3's? I mean, can't you fight the RIAA with its own weapons? If they completely destroy the mechanism with determining what files you currently have, then how does their claim that you had X file hold any merit at all?

    1. Re:Couldnt this work to your advantage by brianf711 · · Score: 1

      But they wouldn't destory the mechanism for downloading a complete file from only one provider and could simply listen to the file. They could even automate it by somehow digitally comparing the audio output with the master original, uncorrupted file. i think the mechanism mentioned here makes it difficult for users to search and find the file from the plethora of files and sources on the p2p system, but one could iteratively search all the sources of a particular song and check against the master. i don't see how this would be prevented with malformed files.

  105. Blaaaaaah by mindriot · · Score: 4, Informative

    Not only the company's, but also the submitter's claim seems to be bogus. Neither the Inquirer article nor the viralg.com website anywhere seem to be talking about hashes. Moreover, I'm kind of wondering where the Inqurer got their stuff from, since the viralg website contains... nothing. Nothing but blaah. No word at all on how they protect anything from anyone. A random link to the Finnish Top 40 allegedly showing how BMG became the market leader for domestic music. Umm, except that nothing whatsoever proves that Viralg had anything to do with it. (If you have evidence to the contrary, please post it!) Then there's some blurb about being insiders with mathematical knowledge up in the lonely north where there's nothing else to do is what got them where they are. So, where are they? Not like they actually tell us. No contact information besides the email address either (and nothing in the whois info). Apparently, being up in the lonely north with nothing else to do doesn't get you much further than producing a nonsensical website claiming you know how to save the world, find the question to the answer to life, the Universe and everything, with "stunning results."

    And, breaking hashes, nonsense. If anything, maybe they are managing to manipulate P2P protocols to send you data you weren't supposed to be getting, but which is not actually going into the checksum?

    Nothing for you to see here, methinks... and here I am wasting my time actually writing a reply to a trollish article. :)

    On another random note, I kind of liked how their website looked in links.

    Empty. :)

  106. Not all that difficult by golden_spray · · Score: 1

    BitTorrent use hashes to verify each small chunk of the file as they are downloaded. I can imagine that it is very hard to find a collision for the entire file, but given the relatively small size of each chunk, I think it would be pretty easy to generate a collision for the smaller blocks.

    Once you can do that, messing with the p2p system is trivial, just make a client that takes a torrent, makes fake data to satisfy the chunk's hashes and then start serving them up. No one will know if their download is crap until the entire file is complete, and you won't be able to tell which chunk is bad. Not only that, the "bad chunks" will propagate around they system.

    Of course, defeating such a system is equally easy, just increase the chunk size. Of course, this could degrade bittorrent's performance.

  107. We already have junk files by suitepotato · · Score: 1

    We call them Brittney MP3s.

    On a more serious note, this is pretty much a non-issue given that people can use VLC to preview incomplete files and will delete whatever seems non-kosher. If we further subdivide the hashing to blocks/parts then there's no way each individual part container will hash exactly in match with the original. Try massaging the hash for thirty separate parts. Non-trivial.

    I've said it before. P2P is advancing apace with all sorts of things and within a short time will render this totally irrellevant. They just keep illustrating how badly they still don't get it. It's as if they trying to combat piracy using VCRs by attacking the mechanism of Super-8 film cameras.

    --
    If my grammar and spelling are off, I am [distracted/tired/careless] (take your pick)
  108. Denial of service attack? by jimbro2k · · Score: 1

    Morality aside...
    Isn't this (if it actually works!) a type of denial of service attack? Those are clearly illegal. True, it is not targeting a specifically named server, but does that mean it is any less illegal because it attacks a class of machines instead of just one?

    --
    There is not nearly enough love in the world, but there is far too much trust.
    1. Re:Denial of service attack? by laird · · Score: 1

      "Isn't this (if it actually works!) a type of denial of service attack?"

      Nope. A denial of service attach means that the attacher is initiating connections to a server in order to consume the server's resources, denying the service to anyone else.

      I believe that all this company is doing (if their technology works) is to join a public network and wait for requests, then sending back bad data. This is a well understood technique.

      What this isn't:
      - A "denial of service attach" since they're not initiating any connections to anything.
      - A broad attack on the p2p networks, since the bad data is only served in response to specific files.

      The only interesting bit is that if they've figured out how to create bad data that passes a hash check then the protocol's error correction won't work. This doesn't change anything with FastTrach (which effectively has no hash checking) but could be used to inject bad data into BitTorrent, eDonkey, etc.

  109. extremely possible? by Anonymous Coward · · Score: 0

    "Possible" means p>0. "Extremely" possible is nonsensical. What probability of success do you have in mind?

  110. "Copywritten" by Dwonis · · Score: 1
    Pah!

    Copywriting is not the same as copyrighting.

  111. Worldwide Tour of Finland by Anonymous Coward · · Score: 0

    Rex Stardust, lead electric triangle with Toad the Wet Sprocket has had to have an elbow removed following their recent successful worldwide tour of Finland. Flamboyant ambidextrous Rex apparently fell off the back of a motorcycle. "Fell off the back of a motorcyclist, most likely," quipped ace drummer Jumbo McCluney upon hearing of the accident. Plans are already afoot for a major tour of Iceland.

    Divorced after only eight minutes, popular television singing star, Charisma, changed her mind on the way out of the registry office, when she realized she had married one of the Donkeys by mistake. The evening before in LA's glittering nightspot, the Abitoir, she had proposed to drummer Reg Abbot of Blind Drunk, after a whirlwind romance and a knee-trembler. But when the hangover lifted, it was Keith Sly of the Donkeys who was on her arm in the registry office. Keith, who was too ill to notice, remained unsteady during the short ceremony and when asked to exchange vows, began to recite names and addresses of people who also used the stuff. Charisma spotted the error as Keith was being carried into the wedding ambulance and became emotionally upset. However, the mistake was soon cleared up, and she stayed long enough to consummate their divorce.

    Dead Monkeys are to split up again, according to their manager, Lefty Goldblatt. They've been in the business now ten years, nine as other groups. Originally the Dead Salmon, they became for a while, Trout. Then Fried Trout, then Poached Trout In A White Wine Sauce, and finally, Herring. Splitting up for nearly a month, the re-formed as Red Herring, which became Dead Herring for a while, and then Dead Loss, which reflected the current state of the group. Splitting up again to get their heads together, they reformed a fortnight later as Heads Together, a tight little name which lasted them through a difficult period when their drummer was suspected of suffering from death. It turned out to be only a rumor and they became Dead Together, then Dead Gear, which lead to Dead Donkeys, Lead Donkeys, and the inevitable split up. After nearly ten days, they reformed again as Sole Manier, then Dead Sole, Rock Cod, Turbot, Haddock, White Baith, the Places, Fish, Bream, Mackerel, Salmon, Poached Salmon, Poached Salmon In A White Wine Sauce, Salmon-monia, and Helen Shapiro. This last name, their favorite, had to be dropped following an injunction and they split up again. When they reformed after a recordbreaking two days, they ditched the fishy references and became Dead Monkeys, a name which they stuck with for the rest of their careers. Now, a fortnight later, they've finally split up.
    (telephone ringing)
    Hello.
    "Hello"
    Yes?
    "What do you think of Dead Duck?"
    What do I think of Dead Duck?
    "or Lobster?"
    Lobster?...


    From Monty Python's Contractual Obligation Album

  112. So What? by amcdiarmid · · Score: 0

    Many people do not check the hashes on the P2P files. Rather they check the comments written about the file: As soon as one person posts that the file is a fake, no one will download it. (This also works for password encrypted files that people will avoid untill the password is posted in the comments.)

  113. Just sounds like a challenge... by msimm · · Score: 1

    And there have never been a shotage of technical people in the warez/tunez scenes. Let the sell their bandaid, I'm sure they could use a buck or two.

    But serious threat? No, just a request for a minor change in the model (or all BS marketing).

    --
    Quack, quack.
  114. April fools... by harris+s+newman · · Score: 0

    I don't believe it. Cracking MD5 is one tought nut, and to do this on massive scale as implied by the article, is impracticble. I suspect that even if they had a quick crack to MD5 or SHA, it would just mean a new hash would be needing to be developed. I'm in Texas, but still, show me.

  115. This could badly backfire by Anonymous Coward · · Score: 0

    This raises a number of interesting possibilities.

    Depending on the type of 'junk' in these files, they may be useful in generating a quick one time pad (you could combiine seversl of these junk files to get some sort of random data).

    This could badly backfire on them especially, when you consider that someone could use these 'junk' files to distribute new viruses, rootkits and other malicious code, or to disguise something more dangerous.

    1. Re:This could badly backfire by atomm1024 · · Score: 1
      It's pretty easy to generate a random file. That's not anything innovative on their part.
      dd if=/dev/urandom of=[filename here] count=[number of random 512-byte blocks]
      In any case, although one-time pads are truly unbreakable, they're not very useful. In order for a recipient of data to read it, they must also receive a big pad file at least as large as the actual data. And there has to be a program to combine them, which can't be itself encrypted, so it could be detected by virus scanners as usual.
      --
      Signature.
  116. It seems to work, look at their example. by Anonymous Coward · · Score: 0

    They applied their copy protection to their website.

  117. This technology by nilbog · · Score: 1

    ...will be used to spread viruses.

    --
    or else!
  118. PRESS SPACEBAR to Continue by webzombie · · Score: 1

    Sounds like a pressing to space bar to circumvent the "high-level" encryption to me! (:

    Maybe these guys should talk to the CherryOS people.

  119. Which hash? by MasamuneXGP · · Score: 1

    Does anyone know exactly which hash algo they RE'd? Also, DC++ (my p2p app of choice) uses Tiger Tree hashs... how secure are those?

    1. Re:Which hash? by rbarreira · · Score: 1

      Does anyone know exactly which hash algo they RE'd?

      Probably none, since their site seems like a load of total bullshit.

      Also, DC++ (my p2p app of choice) uses Tiger Tree hashs... how secure are those?

      No one has managed to crack TTH hashes for now :)

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    2. Re:Which hash? by MasamuneXGP · · Score: 1

      Kickass =D [resumes fileswapping]

  120. Some clarifications: by sarkeizen · · Score: 1

    I couldn't get to the manufacturers site but it seems likely that what this is about is hash collisions as many P2P protocols use them.

    Ok, first of all there has ALWAYS been a possibility of creating an arbitrary file with the identical MD5 (and just about any other hashing algorithm that I know of) as another file.

    The utility of MD5 (and other hashing algorithms) is that there was no algorithmic way of doing this in a reasonable period of time. IOW if you wanted to create two 1K files with the same MD5 hash, then you would have to generate all possible 1K files compute the MD5 hash and then do a compare. As you can see this becomes more problematic as your file becomes arbitrarily large.

    This landscape changed with the arrival of this paper:

    http://www.infosec.sdu.edu.cn/paper/md5-attack.p df

    and the more famous:

    http://www.doxpara.com/md5_someday.pdf

    Which talked about creating collisions with arbitrary payloads.

    Now the good news:

    This shortcut attack doesn't work for all hashing algorithms ( SHA-1 for example ).

    If this is the approach that the company in question is taking ( and I would figure if they're targeting ANY of the systems that use hashing then they must).

    Then the company is being patently stupid. The cost to develop a solution like this is going to be huge compared to the cost of simply rewriting the hash algorithm in P2P clients.
    Hands up how many people here have d/led a new P2P client because the tracker said it was obsolete? Just about everyone right?

    Compare that with the cost of someone trying to build a system to break SHA-1 hashes....and you see my point!

  121. Re:For all the new 'copysafe' tech that comes out. by Anonymous Coward · · Score: 0

    Actually, splinter cell: chaos theory, which was released 3/28, still hasn't been cracked. Of course, the copy protection (starforce) is so extreme that it installs its own CD/DVD-rom drivers, and doesn't even work on all computers, but nevertheless it seems to be quite a challenge to overcome.

  122. Re:Possible? Yeah by Chris_Jefferson · · Score: 1

    If you can make a MD5 collison for any file of my choice, then feel free to write it up, you would easily get a paper at any of the very, very good computer science conferences (even if you brute force it)

    --
    Combination - fun iPhone puzzling
  123. Has spam destroyed email? by dpbsmith · · Score: 1

    Even if the technique works as described, somebody would have to have to spend a lot of time and money generating the decoy files. And it would not affect file sharing unless the generation of these files was so widespread and thorough that they actually displaced most of the valid files.

    Even if 25% of the files on P2P networks were garbage, it would not destroy the networks. Presently, a high percentage of all emails is spam, but spam has not yet destroyed email.

    And that assumes no countermeasures by file sharers. I can think of some very obvious ones, the most obvious being to counterflood with valid files.

    The next most obvious would be to improve the hashing methods for the networks involved.

  124. Re:For all the new 'copysafe' tech that comes out. by anoiniminious+cowher · · Score: 1

    I objected to the use of the term "Pirate."

    We prefer: Buccaneer American.

  125. Why this won't affect Slashdot. by stlhawkeye · · Score: 4, Funny
    As anybody who reads Slashdot knows, perfectly legal and legitimate downloading comprises the majority of internet downloading, and actually bolsters profits to member organizations of such content ownership cartels as the RIAA.

    "This, according to the company, can altogether stop the sharing of copywritten files by flooding p2p networks with corrupt/junk data"

    Slashdot should rejoice at this! Since none of us download illegal material and nobody that any of us knows downloads illegal material, this technology might allow us to continue our legal, legitimate downloading of media and only target those handful of ruffians who engage in illegal filesharing. I'm all in favor of this!

    --
    "I have never won a debate with an ignorant person." -Ali ibn Abi Talib
    1. Re:Why this won't affect Slashdot. by 91degrees · · Score: 1

      :)

      But speaking as someone who shamelessly illegally downloads stuff via bittorrent (I just find myself unable to feel guilty about it), I have no problem with them trying to do this sort of thing. If I try to get stuff by breaking the law, they're perfectly entitled to try to stop me. Poisoning files will certainly succeed in stopping me if they can actually do this.

      And it's a lot better than suing people. The penalty is minor inconvenince for the guilty. Hardly disproportionate, especially when compared to a billion dollar lawsuit.

    2. Re:Why this won't affect Slashdot. by TheAwfulTruth · · Score: 1

      That reads a bit like you are joking, but...

      In a less utopian view of the future, crackers will also use the technique to flood the torrents with fake versions of Linux isos and everything else "just for fun" or "revenge" like they always do, thus bringing the entire thing to a crashing halt.

      Well, till 2 seconds later when the p2p program is modified to use a better hash, then the illegal file sharing will be back in force.

      It's pretty much all or nothing. What affects one will affect the other, there isn't a viewpoint or a behavior in the world that doesn't have an opposite one held by someone who is willing to take up arms over it.

      --
      Contrary to popular belief, coding is not all free blow-jobs and beer. Those things cost MONEY!
    3. Re:Why this won't affect Slashdot. by Anonymous Coward · · Score: 0

      I download illegal material, you insensitive clod!

  126. Yes, they have indeed cracked (some) hashes. by James+Youngman · · Score: 1
    This is not true. It might work on Kazaa but most other P2P networks use MD5 or better. Okay, they have found collisions but no one has found a way to generate file for a given key.
    Actually they have found a way to find a file that produces a given hash. See this paper and this paper. I think SHA-1 and MD5 are affected. Not sure about MD4.

    SHA-256 looks like it's the way to go for now. However, if you are now designing a system which is intended to last a number of years that needs to use hashes to determine if two items are the same, then I would suggest that you use two unrelated hash functions to do the job. This is especially true if anyone else might have an incentive to fool the system.

  127. Minor/major inconvenience. by rice_burners_suck · · Score: 1
    This will only be a minor inconvenience to those who wish to illegally pirate the intellectual property of others. There are many ways to compute a hash. If you can compute, for each file, both an MD5 hash and an SHA1 hash, and also record the size of the file along with those two hashes, signing the resulting three values with a known-good PGP key, then you'll have something that is darn-near unbeatable. It will be so difficult to find another file that produces the same hash under both algorithms at the same time while producing a file of identical size.

    However, this will prove to be a major inconvenience for honest people who are legally downloading things such as Linux, open source software, and free music, videos, and other items which are made available online for the purpose of the downloader's enjoyment at no cost.

  128. Let them claim their fame... by Anonymous Coward · · Score: 0

    False sense of security rulz :)

  129. Re:Possible? Yeah by fvbommel · · Score: 1

    All it takes is to find one pair of blocks that collide, and you can build infinitely many pairs of same-size colliding files.

    <nitpick>
    Since there are only finitely many possibly files of a given size, there are also only finitely many possible pairs of files of that size.
    Since the number of collisions is at most the number of pairs, that means there are only finitely many collisions of a files of that given size.
    </nitpick>

  130. Re:Not all that difficult - You've got it backward by Nom+du+Keyboard · · Score: 1
    BitTorrent use hashes to verify each small chunk of the file as they are downloaded. I can imagine that it is very hard to find a collision for the entire file, but given the relatively small size of each chunk, I think it would be pretty easy to generate a collision for the smaller blocks.

    You've got it backwards. The smaller the file being hashed, the harder it would be to create a collision.

    Why? Because you have less to work with. Consider MD5 creating 512bits of hash while you're hashing a 1-byte file. You have 256 possible values each hashing to 512 bits. Think you're going to find any collisions? 2 bytes is 65536 unique possibilities. No collisions likely here. Only with files larger than the hash size itself is it mathmatically certain that collisions must exist (e.g. 1024 bits of data hashing to 512 bits of hash guarantees that collisions must happen for some input strings).

    But then the trick is that in order to find that collision for your specific original string you may have to create and compare 2^1023 possibilities in the process.

    I'll wait while you test this for yourself.

    --
    "It's the height of ridiculousness to say for those 9 lines you get hundreds of millions."
  131. Snake oil salemen by steve_bryan · · Score: 1

    Nothing to see here except conniving thieves out to bilk the rather unsympathetic likes of the RIAA and MPAA. If the Finsish group had honestly found a way to defeat SHA-1 hashes (used in Bittorrent) they wouldn't bother with penny ante stuff like counterfeit files on a P2P network. The only reasonable explanation for this claim is that they intend to prey on the gullability and possible stupidity of organizations that I mentioned above. I doubt if they (**AA) are as clueless as this scheme would require.

    This is at least somewhat equivalent to the less than entirely candid groups who continue to claim they have retrofitted a DRM on red book audio CD's. They use it to get checks from the gullible and technically unsophisticated before their skanky scheme falls apart in the real world. It is just another con game where the greed of the mark is used to separate him from more of his money.

  132. distributed trust by Anonymous Coward · · Score: 0

    What we need is distributed trust: http://calvin.sourceforge.net/distributedtrust.htm l

  133. Not going to work that way.... by Em+Ellel · · Score: 1

    I wonder why people who use P2P don't help each other out a little more. For example, you have someone with 200 files shared. They are downloading and sharing at the same time. Sometimes they download a bad file, and share it. It would make more sense to have a "unchecked" folder for downloads, then more it to the "checked" folder to share.

    What would stop the people who are trying to corrupt the file from sharing corrupt copy as "checked"?

    Just need a better hashing mechanism.

    -Em

    --
    RelevantElephants: A Somatic WebComic...
    1. Re:Not going to work that way.... by DickBreath · · Score: 2, Interesting
      Just need a better hashing mechanism.

      How about a hash of the entire file, plus a hash of every 128 KB segment. Constructing a file that matches all of the 128 KB section hashes, plus the overall hash is a much more difficult problem.

      Plus, you know after downloading only 128 KB that the file is not the real deal. It only takes 8 * 128 bytes or 1024 bytes of hash information per megabyte of download -- really only a few packets to communicate the hash list for, say, a 10 MB file. The benefit for this cost is
      • early detection of corrupt download
      • difficult of creating a corrupt download
      Now suppose that in BitTorrent like fashion, I could download each 128 KB segment from a different location.
      --

      I'll see your senator, and I'll raise you two judges.
    2. Re:Not going to work that way.... by Issue9mm · · Score: 1

      From my understanding, the technology invented allows for arbitrary insertion of hash values into a file, and does not require tailor engineering a junk file to match the hash.

      Bear in mind, I did not RTFA whatsoever, and could quite well be speaking out of my posterior.

      -9mm-

    3. Re:Not going to work that way.... by VortexMK · · Score: 1

      Isn't it the way eMule works?

    4. Re:Not going to work that way.... by InvalidError · · Score: 1

      If I successfully forged a 128KB data piece that has the same hash value as the original block, the 128KB block hash becomes useless in determining which block was bad: the whole-file hash would fail but all block hashes would check out ok.

      As for the BT case, the INFO hash is a hash of hashes and would not even be in any way useful in detecting a file containing forged data.

      There are many ways to work around this, the simplest one being to use two hash sets, another would be altering initial hash conditions.

    5. Re:Not going to work that way.... by welsh+git · · Score: 1

      You've just described gnutella, with the PFS (partial file transfer) and TIGERTREE extensions, both of which are deployed already in most clients.

      (http://gtk-gnutella.sourceforge.net/)

      --
      Sig out of date
  134. hmmmm by rnd() · · Score: 1

    it might lead to ripping programs incorporating a trust + watermarking system, but since that would allow authorities to trace the origin of ripped files, it might actually harm p2p.

    Or maybe p2p systems will start using trust oriented encryption, so that files may be "activated" anywhere but will be hard to fool via this hashing approach.

    --

    Amazing magic tricks

  135. Super computers can be cheap... by Anonymous Coward · · Score: 0

    Imagine a beowulf cluster of 486 Thrift store computers, using their Paralel ports to communicate
    (tcpip over paralell port is still "in" linux right?)

    What would 512 486 machines be like as a cluster...

    1. Re:Super computers can be cheap... by acariquara · · Score: 1
      From TFA:

      Q: How hard would it be to find collisions in SHA-1?
      A: The reported attacks require an estimated work factor of 2^69 (approximately 590 billion billion) hash computations. While this is well beyond what is currently feasible using a normal computer, this is potentially feasible for attackers who have specialized hardware. For example, with 10,000 custom ASICs that can each perform 2 billion hash operations per second, the attack would take about one year. Computing improvements predicted by Moore 's Law will make the attack more practical over time, e.g. making it possible for a wide-spread Internet virus to use compromised computers to mount such attacks as well. Once a collision has been found, additional collisions can be found trivially by concatenating data to the matching messages.


      10,000 custom ASICs > 512 80486's
      --
      Dear aunt, let's set so double the killer delete select all
  136. What about the users? by clawhound · · Score: 1

    This technology is nice, but they forget one thing: what about the uploaders/downloaders. If I were to download something that isn't real, I'd delete it. Oh my, that was easy. This simple verification is all that it takes to stop this idea. Secondly, and more importantly, there are far more files out there than people are willing to fake. This idea may work for the most popular tunes, but for everything else, not much will change. I don't see there being a mass poisoning of "Freebird."

  137. Maybe not? by verbatim_verbose · · Score: 1

    Perhaps rathering than figuring out how to make files with the same hash, they just figured out how to tell everyone on the network that their client has a file with that hash, when really the file doesn't? That's a far more trivial feat.

  138. Fake, eh? by Jeff85 · · Score: 1

    Does this mean you can share a fake file, then counter-sue the *IAA when they sue you for sharing copyrighted files?

    --
    Fetch Text URL - Firefox Extension
  139. The hash algorithms DO NOT NEED to be broken. by atomm1024 · · Score: 2, Insightful

    P2P clients, when they search for files, receive alleged hashes from where? The peers that claim to have them. And since most of these protocols have been reverse-engineered by now, I suspect that this program just combines a random-data generator with a multi-network untrustworthy P2P client. It'll sit on a network and respond to searches, report the expected filename, filesize, and hash (whatever algorithm is used), and wait for people to bite.

    There is no technological way of verifying that the other peer is telling the truth (or at least there won't be unless the whole world implements some sort of Orwellian "Trusted Computing" requirement), aside from downloading the whole file and verifying it against the expected hash. No hash algorithms need be broken. I mean, once the whole file is downloaded, what does it matter to them whether the hash really matches? Why would even an idiot keep a downloaded file just because the program says it's verified and the size matches, if he can clearly see that the file doesn't work?

    --
    Signature.
    1. Re:The hash algorithms DO NOT NEED to be broken. by rbarreira · · Score: 1

      There is no technological way of verifying that the other peer is telling the truth (or at least there won't be unless the whole world implements some sort of Orwellian "Trusted Computing" requirement), aside from downloading the whole file and verifying it against the expected hash.

      This is why Bittorrent hashes all the blocks of the file (which aren't very big). All the P2P programs should try to start doing something like this, if possible...

      --

      The AACS key is NOT 0xF606EEFD628B1CA427BEA93A9CA9773F
    2. Re:The hash algorithms DO NOT NEED to be broken. by Jisakiel · · Score: 1

      Hmmm I think that's why chunks of the file 9 megs of size are downloaded and checked individually, at least in the ed2k protocol, though I'm not really sure of it.

  140. Re:Just finding a hash collision isn't enough real by MrAnnoyanceToYou · · Score: 1

    I may be a bit low on information on this one, but doesn't bittorrent pull from a whole lot of sources and pick the best one? This would mean that you set up a big server with a fat upload pipe it would be selected more often for transfer and PIECES of the full file would be corrupted...

    The question then becomes whether BT or whatever rehashes the file and finds it different upon download. My guess is that yes, this would come up with a different result and get flagged quite quickly.

  141. Missing the Point by Jherek+Carnelian · · Score: 4, Funny

    Y'all are missing the point.
    These guys are not about taking out P2P.
    They are part of a denial of service attack against the RIAA and MPAA, and we need more companies like them in order to make it effective.

    You see, it works like this:

    1) Make up a really snazzing sound anti-piracy product,
    2) Back it with lots of sexy buzzwords and hand-waving
    3) Sell, sorry LICENSE, it for lots of money to the (RI|MP)AA.
    4) When it fails to perform, let in the next guy ready to do the same.

    Repeat until (RI|MP)AA bank accounts have been depleted.

  142. Pitty, I thought md5 was unique by houghi · · Score: 1, Informative

    Or at least to be unique for each individual file per size. That would have ment that if you send the md5 sum plus the size info, you could in theory remake the file.

    So instead of sending 'cf878d4809930e3696d9c9c242a6f646 1450466 KB' and recalculating what the content was, I will just have to retrieve SL-9.3-LiveDVD-amd64.iso.

    Oh well, back to the drawing board.

    --
    Don't fight for your country, if your country does not fight for you.
    1. Re:Pitty, I thought md5 was unique by pe1chl · · Score: 1

      You would not believe it, some people really claim they have found such an algorithm :-)

      (they claim that they have a compression algorithm that can compress any data, and result in a much smaller file, but fail to deliver)

    2. Re:Pitty, I thought md5 was unique by Anonymous Coward · · Score: 0

      no

    3. Re:Pitty, I thought md5 was unique by Anonymous Coward · · Score: 0

      INFORMATIVE?!?!?

      It is the most basic of crypto knowledge that hashes CANNOT EVER recreate the file (Unless the file is the size of the hash). The hash is no where near unique, just sufficiently unique that the random chance of two files having the same hash are extremely mall (Though purposely creating them is not impossible).

      Informative... This is what happens when the idiots out number the intellectuals by 1000:1.

      Has this brilliant piece of "information" that Hash+Files size == Original data made it's way into Wikipedia yet?!?!?

    4. Re:Pitty, I thought md5 was unique by Anonymous Coward · · Score: 0

      Wow, you just discovered infinite compression!

      Better patent it! Have you gotten cold fusion to work too?

    5. Re:Pitty, I thought md5 was unique by houghi · · Score: 1

      Yeah, I was amazed as well that somebody did not notice that this was pure BS. From my side more a mediocer attemt to humor, because I thought the /. crowd would understand how stupid this idea is.

      You at least need the name of the file as well. :-)

      --
      Don't fight for your country, if your country does not fight for you.
  143. May not be a coincidence by Anonymous Coward · · Score: 0

    The Finnish version of the RIAA, ÄKT, has quite recently got 28 major filesharers fined here in Finland, and I wouldn't be suprised if this was merely an attempt to scare off some more of the people still sharing.

    1. Re:May not be a coincidence by Anonymous Coward · · Score: 0

      Except people aren't really scared away from downloading something for free by the possibility that they are receiving and sharing garbage.

  144. Fix by scorp1us · · Score: 1

    Use two hashes
    MD-5 and say SHA-1
    It is [nearly] mathematically impossible to create two files of the same size with the same two hashes, through two substantially different algorithms.

    Only such collisions will occur at a "node" in "hash space". Such nodes are rare, and given the same file-size for both hashes, impossible to acheive.

    --
    Slashdot's rate-of-post filter: Preventing you from posting too many great ideas at once.
  145. I think they might be on to something by Anonymous Coward · · Score: 0

    I don't have any factual information regarding how these protocols work but I would assume they trust the hash values provided by the clients.

    If this in deed is the deal, the only thing they would have to do is create a bogus client that feeds the network with hash values that match legitimate (or actually illicit) files. Then when another client wishing to get the real file starts downloading a portion of the file their bogus client just feeds them crap.

    If this is what they are doing they can download real files being shared, grab their hash values, add this to their distribution quite easily. This gives them the ability to f*ck up files on file/by/file basis, not take down the whole network.

    Now consider this sales pitch to record label "For $$$ we will go to these P2P networks and disable downloads for your new artist XYZ". Sounds like a nice deal, also I don't think they are doing anything wrong if this is their approach.

  146. Oh noes! by ultramarweeni · · Score: 1

    What's next, fake P2P magic shrooms?

  147. Easy solution by Dogun · · Score: 1

    Use more information to 'uniquely' identify files. Two different hashes might do the trick.

    Even with weaknesses in hashing algorithms, it can't be that easy to find a collision in TWO systems at once, can it? That'd make the technology useless.

  148. Hog wash! by Anonymous Coward · · Score: 0

    Maybe for simple hash codes, but if the P2P software decided to use MD5 or the likes to generate hash codes, it would be nearly impossible to find a colission; and if they did they would be more rich and famous for finding colissions.

  149. you should crumble the hash... by sum.zero · · Score: 1

    not crack it ;P

    sum.zero

  150. why don't content companies flood P2P with fakes? by cpeterso · · Score: 1


    Content companies don't need to break any hash algorithms to flood P2P systems with fake music. They could write a simulated P2P client that exposes REAL hashes of REAL music files, but then just upload white noise files when a real P2P client tries to download the music files.

  151. TOS Violation by Halvard · · Score: 1

    And won't this be a Terms of Service violation for the P2P network? Open the vendor or those employing the device/services to lawsuits?

  152. Self - Cleaning Ovens... by r00td00d · · Score: 1

    Most downloaders review their content after downloading - and, conceivably, might just delete any bogus seeded files - ending the circle of downloading crap content. Add a small functionality like 'r00d00d reviewed/approved content' and we could brand the content and create a 'web-of-trust' where people who know I do a good job of verifying my shared content, might download stuff I have reviewed knowing they will get a good file. Remember, there are people behind the technology, folks... r00td00d

  153. Rogue clients by Bihtori · · Score: 1

    Isn't it so that it is the responsibility of the client program, for example Kazaa, to calculate the hash sum of a file to be distributed? If so, wouldn't RIAA and the pals benefit from a rogue client that connects to the network and advertizes garbage files of the proper size with a proper hash? A sufficient number of such clients in a network would be a considerable annoyance for the file sharers, would it?

  154. Re:Just finding a hash collision isn't enough real by pjrc · · Score: 1
    They feed it to a computation cluster and eventually out comes another file which has the same hash.

    This is a "preimage" attack, which is very different and much harder than a "collision" attack (the subject of that paper). Also, the paper's collision attack is against MD5, not SHA1 (as used in bittorrent).

    See this earlier post for details and a link to much more info.

  155. Patent application does indeed mention hashes by joshdick · · Score: 1

    Actually, the patent application does mention hashes.

    From TFPatentApp:

    "For example, the Kazaa network that is used herein as an example, provides each file with verification information which is sometimes called a hash code. ...
    The invention is particularly useful in networks like Kazaa, in which the verification information (hash) is predominantly calculated over thethe characteristic information and the beginning of the file. Accordingly, introducing bad content may not radically change the verification information (hash) calculated by Kazaa, as long as the bad content is not near the beginning of the file. It has been found that changing the content of a file near its end may only alter the last few bytes of the hash calculated by Kazaa, whereby a falsified file that produces a perfectly-matching has can be generated by a brute-force algorithm."

    Every time they mention "verification information" in their Claims section, they mean "hash."

  156. The problem is not the hash ... by awolk · · Score: 1

    ... but the program. The problem is that when you search for a hash, then the other users are telling you they've got the file with the hash. _You_ cannot know whether the given file _in reality_ has the hash you searched for.
    So, these guys probably haven't broken SHA-1 in some new way, because they don't have to.

    On another note, when somebody wants to download something, then he searches for the name of the file, and not for the hash(!). The hash is only useful when you download large files at the same time, from different sources. So to flood e.g. the kazaa-network, one wouldn't even have to try to hash the files.

    Of course all of the above isn't true to BitTorrent, but it could be fixed by e.g.:
    Everybody downloads X pieces 2(or more times) from different sources(The tracker could also have trusted sources, etc...). If they don't match they download them from other sources, and the client whose version is wrong is reported to the tracker.
    If client Y is reported Z times, then the tracker disconnects him.

  157. The Hearse Aint got no luggage rack! by Danathar · · Score: 1

    Well...there it is. Time to Cash in that 401K. Ya can't take $$$ with ya, so you might as well try to run up some debt. The person with the most debt at death wins!

  158. This is so stupid by commodoresloat · · Score: 5, Insightful
    If the copyright issues were not present here and someone built a program that did something like this, they would be universally reviled as a malicious hacker. Hey! Here's a program that creates phony web pages with false information masquerading as legitimate pages! Here's one that copies Excel spreadsheets on the web and subtly pollutes the database with phony information, then stores multiple copies around with the same name! This handy tool attaches to a photocopy machine and randomly scrambles the words on the page you are photocopying!!

    P2P is a technology. Yes it can be used for copyright violations, just like a photocopy machine or tape recorder. But it also has amazing possibilities in terms of creating a universal organic archive. Crippling like this -- and through using lawsuits -- is an unnecessary attack on a system in its infancy.

    The copyright issues will work themselves out -- until the 20th century human art and ingenuity survived for thousands of years without the ability to make millions selling recorded music and video. If p2p has a major effect on the entertainment industry's ability to profit (and I'm still not convinced that it really will), human art and culture will survive. And people will continue to find ways to make a living creating art.

    1. Re:This is so stupid by WaterBreath · · Score: 3, Interesting
      Yes it can be used for copyright violations, just like a photocopy machine or tape recorder.

      And those things were each also embroiled in copyright lawsuits by big corporations in their day. The difference is that today, the big corps have finally gained enough political leverage to get it their way.

      Corporations are the new first-class citizens. Any individual, regardless of race, gender, or creed, is second-class compared to a corporation.

      I honestly fear that by the time the American people get fed-up enough to realize this, the transformation will be complete, and we will be powerless to change it.

    2. Re:This is so stupid by Neoncow · · Score: 1
      And if this were modern warfare, this would be espionage and counter-espoionage. Clearly that's how they see it.

      It's the Music Industry versus the People.

    3. Re:This is so stupid by patio11 · · Score: 3, Interesting

      This doesn't cripple P2P. It just makes a dent in pirate-2-pirate. There is a difference, you realize. The Blizzard Bittorrent patch downloader will still function perfectly. Indie bands who release their new CDs to Kazaa won't have anybody trying to pollute their download pools. And it probably won't even work, more's the pity.

    4. Re:This is so stupid by compm375 · · Score: 1

      That is assuming the "1337 hax0rs" don't get hold of the algorithms. I can just imagine people messing around with p2p networks just for fun. Just because something is made for one purpose doesn't mean it won't be used in other ways. I don't blame this specific company, because the technology would have come out eventually, and isn't the solution the same as the one to encryption, stronger hashes?

    5. Re:This is so stupid by kamapuaa · · Score: 2, Insightful
      You realize this technology doesn't block *all* p2p traffic, right?

      The main concern shouldn't be the use by the RIAA or MPAA to stop the bootlegging of copyrighted concerns. It's within their rights. The main concern should be possibility of the technology getting out to griefers who block the legitimate use of Bittorrent.

      But honestly, if this doesn't get out to hackers (which it probably will), this is a lot better solution than having to sue warez websites, or the users who illegally trade movies.

      --
      Slashdot: providing anti-social weirdos a soapbox, since 1997.
    6. Re:This is so stupid by cbreaker · · Score: 1

      "I honestly fear that by the time the American people get fed-up enough to realize this, the transformation will be complete, and we will be powerless to change it."

      Pretty sure it's already happened, it's just that the people still don't realize it.

      --
      - It's not the Macs I hate. It's Digg users. -
    7. Re:This is so stupid by russotto · · Score: 1

      Right. The RIAA would NEVER put up corrupt files matching the hash of a competitor. No, never in a million years.

    8. Re:This is so stupid by Deliveranc3 · · Score: 1

      Considering the computing resources needed to breach an individual file they will be quite selective.

      They aren't going to search the net traffic they are going to sign up as super seeders on torrent networks and distribute bad data... simple and evil.

    9. Re:This is so stupid by StikyPad · · Score: 2, Insightful

      If the copyright issues were not present here and someone built a program that did something like this, they would be universally reviled as a malicious hacker.

      This isn't some idealistic universe where all decisions are morally right or wrong regardless of the criteria. Your knee-jerk reaction is baseless and inflammatory.

      "Look people.. If this gangrene wasn't present here, chopping off my leg would be completely unacceptable! How can we just go around chopping off people's legs? Just because I have gangrene!?! What's next, chopping my head off because I have a cold? If someone chopped my leg off when I didn't have gangrene, they would be reviled as malicious!"

      Of course the issue of copyright matter. And, as you mention, they are present here.

      Let's review your next point...

      P2P is a technology. Yes it can be used for copyright violations, just like a photocopy machine or tape recorder. But it also has amazing possibilities in terms of creating a universal organic archive. Crippling like this -- and through using lawsuits -- is an unnecessary attack on a system in its infancy.

      So technologies are amoral? I'm glad you agree. If a technology comes along that, say, creates random data that matches the hash of another file, that technology might be used to corrupt filesharing networks, but it might also help further the development of stronger encryption.

      The copyright issues will work themselves out...If p2p has a major effect on the entertainment industry's ability to profit (and I'm still not convinced that it really will), human art and culture will survive. And people will continue to find ways to make a living creating art.

      If someone knocked on my door one day and told me I had to move because the city was tearing down my house to build a highway, I'd fight it tooth and nail. It might be patently obvious to everyone else that my efforts are futile, but I'm comfortable with my house and I like my location. It's entirely possible, and probable, that I'll find a new place to live -- maybe even a better place to live -- but that doesn't mean I want to be kicked off my property involuntarily. After all, it's also possible that I won't be able to afford a similar house. True, the highway will benefit hundreds of thousands of people, and maybe it's selfish of me to want to stay put, but I'd bet that most people would be displeased if they were in my situation.

      Nobody likes having change forced on them.. I'm not saying it's worthwhile to fight it, but I can understand why they would try.

    10. Re:This is so stupid by Anonymous Coward · · Score: 0

      I'm a little bit more optimistic. The reason some of these elite people need such scary looking security forces around them is because they are scared. They are scared of you and me. So they need to hire a whole bunch of thugs to protect themselves just in case. The corporations profit from us. Without us they cannot enrich themselves. If something triggers some major shit to hit the fan, and there were a couple of million angry average people out on the streets hunting for the folks in charge... I think change can occur and you are being a little to pessimistically dismissive of the capabilities of our fellow humans.

      I can't predict the future, so I don't really know what will come. But if you say you can't, and that you are powerless, then it means that you have given up, you are powerless, and indeed you can't. Sure, just roll over and die there...

    11. Re:This is so stupid by Anonymous Coward · · Score: 0

      If someone knocked on my door one day and told me I had to move because the city was tearing down my house to build a highway, I'd fight it tooth and nail. It might be patently obvious to everyone else that my efforts are futile, but I'm comfortable with my house and I like my location.

      It's nice to finally meet you, Mr. Dent! By the way, look out for the guy with the bulldozer in the next scene, say hi to Zaphod & Trillian for me, and whatever you do, don't forget your towel! :-)
      --
      AC

    12. Re:This is so stupid by BlowChunx · · Score: 3, Funny

      Nope, the solution to this is the Grokster case. Once you show that the creator of a product is liable for it's (mis)use, you can sue the pants off the company that made corrupted files that crippled your indie band's viability.

      Hell, you could hire hackers to flood the network, prove damages, and then earn <dr evil> BILLIONS </dr evil>. Of course, this implies the Supreme Court in the US rules the way I am implying...

    13. Re:This is so stupid by commodoresloat · · Score: 1
      this is a lot better solution than having to sue warez websites, or the users who illegally trade movies.

      An even better solution is to stop standing in the way of advances in technology on the basis of pure greed. As I noted before, humanity survived without a multimillion dollar entertainment industry; we will manage without one if need be. The greediness of the *AA companies is no excuse for attempting to cripple the use of new technologies - whether you're talking about corrupting files that you consider illegal or whether you're talking about suing people you consider pirates. It is not the role of law to protect the business model of a few companies.

    14. Re:This is so stupid by commodoresloat · · Score: 1

      Of course you miss my point entirely, but that's ok - I think I agree with your conclusion -- the RIAA/MPAA fight is not worthwhile but I too can see why they would try. But nobody is breaking down their house -- unless by "house" you mean "theoretical profit based on faulty assumptions about the market and the available technology." Your house already exists, so breaking it down would legitimately be taking something from you. Whereas the profits the industry claims to be losing are theoretical at best, and are based on a model of economic and technological change that is completely irrational. Therein lies the problem. The copyright issues, as I said, will work themselves out -- people will always find ways to make a living by producing culture, which is as it should be.

    15. Re:This is so stupid by timmyf2371 · · Score: 1
      The role of the law, copyright law in particular, is to grant the copyright holder a temporary monopoly on their "intellectual property" rights.

      Whether the copyrighted work in question be the latest Britney album or whether it be a GPL'd text editor the copyright holder in all cases should have redress by law to protect their creation against unauthorised use.

      --

      Backup not found: (A)bort (R)etry (P)anic
    16. Re:This is so stupid by ComputerizedYoga · · Score: 1

      nah, it's not that it's already happened irrevocably.

      It's that it's already happened insidiously, in the hearts and minds of the vast majority of people.

      By claiming we're powerless, we just make excuses to justify our own complacence at the progressive removal of our rights and privileges as private citizens.

    17. Re:This is so stupid by ComputerizedYoga · · Score: 2, Informative
      That is assuming the "1337 hax0rs" don't get hold of the algorithms. I can just imagine people messing around with p2p networks just for fun.


      early in the lives of gotwoot and scarywater (large, fairly well known fansub bittorrent tracker sites), they encountered ddos issues...

      people were using botnets and what amounts to trivial network code to send false complete requests to the trackers, and volunteering as seeds. So, in a field of maybe 100-200 legitimate seeds, there would be ~30,000 fakes poisoning the tracker. The tracker couldn't tell they were fakes, so was redirecting 99% of requests for blocks to the fakes advertising themselves as seeds (And eventually running out of memory as more bots were activated and the server broke under the load).

      The recent weaknesses found in md5 and sha1 also make block poisoning a possibility. Which opens the door to download pool poisoning. If an attacker can generate a block that checksums to a known good block, then the downloader will only be able to detect that poisoned block in a many-blocks hash, not in individual block hashes. This means that the bad block would be propagated before it was detected, and poison the whole larger block (chunk).

      Even further, clients would have no way of determining exactly which block is bad, so would have to discard the entire chunk and start again... and again, may very well end up with the poisoned data.

      That's assuming that the app is still using a broken hash though. This becoming a problem would probably force the application into a better hashing algorithm (the yet-unbroken sha256 over sha1 or md5, for example), or into complete unusability, assuming the attackers were determined enough to poison every file and to do so intently enough to make an impact.
    18. Re:This is so stupid by FLEB · · Score: 1

      An even better solution is to stop standing in the way of advances in technology on the basis of pure greed.

      So, the sharing networks shouldn't stand in the way of advances in hash-spoofing technology, simply because of sharers' pure greed in copyrighted content without licensing it.

      Well, although I would agree about the sharers' greed, I see it as more of a straight-up battle of technical ingenuity, which, IMO, is at least superior to the oppressive legal stomping. As long as the **AA keeps only misrepresents with the permission of the trademark holders, more power to 'em.

      --
      Information wants to be free.
      Entertainment wants to be paid.
      You just want to be cheap.
    19. Re:This is so stupid by Skrybe · · Score: 1

      Well you could argue that for all those thousands of years the technology to mass produce perfect duplicates simply didn't exist. So despite the fact that I agree with you, the logic isn't really sound.

      This "spiking" technology isn't going to affect all legitimately shared files - only files they chose to spike. Which one would assume will only be the illegally shared music/movies. So it's hard to argue that they're crippling the network - only crippling the illegal use on the network.

    20. Re:This is so stupid by kamapuaa · · Score: 1
      Dude man, yeah, like right on. That is so with it. It's like, capitalism man. Copyrights, it's like, did God, or Buddha, or whoever, copyright the sun? No, he gave it for all of us to enjoy. And that's what I believe in. Totally.

      Another thing, it's like, why do they have nuclear "secrets"??? Techonology wants to be free, you know? It's like, man survived for millions of years without these secrets. You see where I'm going here. The logic is out of this world!

      --
      Slashdot: providing anti-social weirdos a soapbox, since 1997.
    21. Re:This is so stupid by commodoresloat · · Score: 1

      Yes, yes, of course, and the hash-spoofers won't be able to stand in the way of the anti-hash-spoofer techniques that will be developed to respond to this. My point is that we might all be better off actually focusing intellectual energy on the potential benefits of the new technology rather than on developing countermeasures and counter-counter-measures. I can't believe, for example, that it's been seven years since Napster and we still do not have an easily searchable peer to peer network that functions as an archive of otherwise difficult to find audiovisual content. And no I'm not just talking about copyrighted content but certainly that is a large part of it -- old, out of print blues albums, speeches, obscure classical recordings, etc. There is a lot of content that I used to be able to easily find on Napster that I would have gladly paid for if I could find it in a record store. Peer to peer is, in my mind, a tremendous advancement in human knowledge, and people can't pursue it in an open and direct manner because they'll get sued.

    22. Re:This is so stupid by commodoresloat · · Score: 1
      Well you could argue that for all those thousands of years the technology to mass produce perfect duplicates simply didn't exist. So despite the fact that I agree with you, the logic isn't really sound.

      That's true but it has nothing to do with the soundness of my logic. You're saying that technology changed the playing field as far as art and commerce goes. I agree. For the last hundred years, the technology of p2p didn't exist. Now it does. Technology, once again, has changed the playing field as far as art and commerce goes. So roll with the punches.

    23. Re:This is so stupid by Anonymous Coward · · Score: 0

      Of course in order to make use of the breaks in MD5 or SHA1 you would have to allow for several years for each bad block you want to generate. Am I the only who can smell snake oil here?

  159. you know.... by mangus_angus · · Score: 1

    I'm probably doing the RIAA a huge favor here, but I always thought a good way to end P2P would be to edit some Yanni tracks down to the same size and give them the same name as what the kids all seem to be downloading. I know that would stop all the teens I know.

  160. Useful for virus injection by Mr+Europe · · Score: 1

    And the technology can also be used to inject viral code into bittorrents...

    Funny name, the company has.

  161. there will always be another way... by dionysian.mind · · Score: 1

    When will the media industry/ies realize that p2p will always find another way. Yea, sure you can shut down napster, flood kazaa, or shutdown the next torrent site -- but there will still be the next p2p protocol to pick up where the others left off. When will the MPAA or RIAA realize that no matter what new method is devised to stop *a* p2p network it still won't change the fact that some people are not willing to pay $16 for a cd or $20 for a dvd? Companies cannot coerce a demographic of intelligent people into doing what they want -- there will always be a spirit of resistence, and means to work around the barriers put in place (see decss, breaking of various DRM, etc.). Maybe instead of devising methods of stopping p2p, somebody should think of providing me, the consumer, with more and better options concerning how I spend my money. Such things can be successful -- look at the iTunes Music store (I don't mind spending a dollar on a song). How about a service to download movies -- $5 to download the latest feature film. How about an alternative to paying for cable when I don't want to watch half the crap they put on -- e.g. a $15 monthly service to let me download the shows I want to watch (keep your fox news and "must see tv" -- give me the daily show and deadwood). There are endless opportunities that technology and the internet provide that could limit p2p traffic purely by making it more convienent for me to get my media directly from the source, as opposed to from a back-ally bittorrnet site. The media industry seems to be more interested in regulation and litigation than serving us, the consumer -- which makes me inclined to just stick to downloading a tv show, album, or movie: they get my money when they make it worth my while. Do these companies exist just to make obscene profit margins so a CEO can buy a ninth home, or are they there to provide a service I value? Just keep trying to kill p2p, and I will keep moving on.

  162. incomplete downloads by TamMan2000 · · Score: 3, Informative

    I wonder why people who use P2P don't help each other out a little more. For example, you have someone with 200 files shared. They are downloading and sharing at the same time. Sometimes they download a bad file, and share it. It would make more sense to have a "unchecked" folder for downloads, then more it to the "checked" folder to share.

    That would break a feature which enables greater sharing... Uploading of parts of files that you do not have all of. Think BitTorrent, but less organized...

    --
    "I'll have a Guinness, no wait, make that a Coors Light" -Grad student I work with, who shall remain anonymous...
  163. Setback for Legitimate P2P? by themesb · · Score: 0

    This means that, in theory, some nogoodnik could obfuscate legitimate (a.k.a. legal) file sharing. For example, I have a Creative Commons licensed CD that can (and should) legally circulate on P2P networks. Someone (a.k.a. ex-girlfriend) could create junk "versions" of my music and prevent it from circulating properly. That would Suck.

  164. Re:Possible? Yeah by cryptoguy · · Score: 1

    Given that the original file is larger than the hash function's block size (128 bits for MD5; 160 bits for SHA-1), it is certainly possible to create a MD5 or a SHA1 collision with a file of the same size. The file size requirement introduces absolutely no additional difficulty. Start with a file of the same size, filled with any data you want (random bits are fine). Then adjust the last block of data to get the hash value you are seeking.

    This is probably feasible today with MD5 given a motivated and well funded agency. Given the size and motivation of the movie industry, it may even be feasible for them to find a collision under SHA1 for their latest blockbuster movies. Undoubtedly the attacks on SHA1 will become more efficient over time, especially given that Moore's law has not finished its work yet.

    A new hash standard is needed. SHA256 might be good enough. Or we might need a completely new approach. Meanwhile, delivering two separate and independent hash values (SHA1 and MD5) might be sufficient.

  165. Re:Possible? Yeah by Council · · Score: 1

    I've always thought it would be extremely possible to create a file with the same MD5 hash.

    Well, it's not.

    That is, the strength of any hash is based on that being near impossible. MD5 is a special case in that it's been partially broken, but generally, no, it's NOT extremely possible to create a file with the same MD5 hash, same size or not. (iirc, generated collisions have always been in same-size files).

    --
    xkcd.com - a webcomic of mathematics, love, and language.
  166. Junk Data by Anonymous Coward · · Score: 0
    can altogether stop the sharing of copywritten files by flooding p2p networks with corrupt/junk data

    Didn't junk data appear when people started sharing Britney Smears, N-Stink, and other cookie cutter boy/girl bands?
  167. Better way to defeat P2P by vrmlguy · · Score: 1
    Instead of bogus files, the best way to bring P2P to its knees would be to flood the internet with a large number of mostly valid, but slightly different, copies of the file. Anyone looking to d/l a copy would then have several thousand to choose from, all of which would be equally good, and all of which would have different checksums. This would kill the bandwidth sharing capabilities of Torrents, eDonkey, WinMX, etc., since everyone would be d/l'ing unique copies.

    As an added bonus, toss in a few seconds worth of video overlays ("Piracy is bad!") or garbled audio. Finally, make the original source run slower as more data is d/l'ed, so people will have to decide whether to abandon a d/l whose sole provider has dropped to dialup speeds.

    --
    Nothing for 6-digit uids?
  168. BS - but fine, let's run with it by gosand · · Score: 1

    OK, it is probably BS. But how would the RIAA then be able to go after people? How could they prove that you downloaded any copyrighted works? It isn't illegal to download junk files, is it?

    --

    My beliefs do not require that you agree with them.

  169. It might not be BS... by GROOFY · · Score: 0

    Maybe I'm an idiot, but it seems like they might have something here (in a bad way).

    Hashing on all modern P2P networks occurs in small chunks while downloading (for obvious reasons). But where does the comparitive hash come from? From the other client? In Bit-torrent it is easily possible that the correct hashes originate in the .torrent (forgive me if I'm wrong about that - I admit I know little of BT's inner workings. It seems doubtful though, as larger files would = larger .torrent's), but other networks don't have this comfort. It could be that the faked file is also feeding out faked hashes - hashing in P2P seems to me to be protecting from data corrupted over the transfer, not from bogus files. If my assumptions are correct (and I hope they aren't), then Viralg could fairly easily make false files without cracking MD5 or SHA (which as we all know is impossible, or improbable, or not marketable).

    Again, this is only true if my understanding of P2P hashing is correct, which it probably isn't.

  170. Re:Possible? Yeah by Mercano · · Score: 1

    Plus (at least for BitTorrent) have each of the segemnts of the file come out to the correct hash. Yeah, you could waste time pulling a bad block from a bogus seed, but, after reciving it you'd notice the block hash dosn't match and you'd throw it away and try again (hopefully from a different seed), not retransmit it to others.

    --
    #include <signature.h>
  171. Re:Just finding a hash collision isn't enough real by kryptkpr · · Score: 1

    BT won't even wait until the file is done. Blocks are verified as they're downloaded.

    Unless they can find a way to cause a collision with every single block (usually 256kb) of the file, not just the file itself, this attack is useless.

    --
    DJ kRYPT's Free MP3s!
  172. Most songs are dupes now on P2P by zymano · · Score: 1

    I can only think of bittorrent as the only trustworthy filesharing program.

    Kazaa has a 'ton' of bad dupes submitted by the Riaa.

    Blubster is the only P2p I would use but it has a ton of ad/spware and the Riaa is putting their crappy dupes in that system too.

  173. Re:Possible? Yeah by Anonymous Coward · · Score: 0

    man, you are pretty dumb

  174. RIAA can lie to the tracker by davidwr · · Score: 3, Insightful

    The RIAA can put out "evil clients" that find good files and lie to the tracker telling the tracker it's a bad file.

    Unless the tracker double-checks the file itself, or has some way to trust the clients it's getting reports from, it's vulnerable to being lied to.

    --
    Knowledge is how to play a game, intelligence is how to win, wisdom is knowing what game to play.
  175. Hoax or secret message? by BorgCopyeditor · · Score: 1
    a Finnish company known as Viralg Oy

    Hmm, why does that sound familiar? Viralg Oy. Viralg Oy. Vi-ralg Oy. AHA!

    "Viral Goy"!

    The secret message is that we gentiles are reproducing too quickly! I suspect the Pope.

    --
    Shop as usual. And avoid panic buying.
  176. Re:Just finding a hash collision isn't enough real by evilviper · · Score: 1
    The new 'collision' file might have the same MD5 hash, but is it a valid MP3 file?

    It doesn't matter.

    Practically all P2P programs now download simultaneously from multiple sources.

    If one in 100 sources with the SHA1 hash is the fake, then 1/100th of your file will be defective, and there will be no way to detect or correct this. If that 1 in 100 source with the corrupt file happens to have significantly more bandwidth available than the rest, your file will have an even higher percentage of corrupt data.

    A few dozen people download the file, with each having 1/100th corrupted, but the corrupt sections are random within each file. As others download the file, they will see the dozen people as sources, and the percentage of corrupt data they recieve will be even higher.
    --
    Slashdot gets worse every day... Pipedot: News for nerds, without the corporate slant
  177. As someone who actually _does_ have a P2P attack.. by Effugas · · Score: 5, Informative

    It's a couple pages in my paper here. Basically, the first 300Kb of Kazaa's files are hashed normally, then every 32Kb chunk of the file is hashed independently. This allows independent chunks to be downloaded out of order. These out of order chunks are recursively hashed against one another to create one final value, called a "kzhash", which is verified after the file is downloaded.

    The attack is to use the recently released collision -- which creates two blocks that, when mixed against the default initial state of MD5, emit the same system state. Every 32K, you can embed one or the other in the file you're transmitting, and kzhash can't tell. What can you do with this? Morph a file as it traverses the network; have an installation executable describe the systems its being installed on as it propogates through a network. With a fairly large installer, you'd get quite a few bits in there.

    You still don't get to do random noise, and while it's no Tiger Tree, kzhashing doesn't appear so exploitable that this group is likely to have anything. I could be wrong, but then, virtual algorithm? Right.

  178. Virlag who? by Anonymous Coward · · Score: 0

    I think these guys have only been in business long enough to buy a website,translate it to english, screw with a copule bad Finnish rap tunes and then get themselves forgetten. They're dead to me.

  179. It's like evolution.... by CFTM · · Score: 1

    These counter-measures that companies keep attempting to come out with to stop P2P remind me a lot of what is going on with pesticides and anti-biotics. As soon as they come out with the latest "greatest" thing that will put an end to P2P someone comes out with a solution to work around it. In the end the P2P just gets harder and harder to control ... all I have to say is HAHAHAHAHAHA FUCK YOU RIAA AND MPAA!

    [Also, I do not use file sharing programs. I use iTunes and pay for my music because I said I would if those jackasses came out with a system to reasonably distribute their media ... instead they use scare tactics and attempt to keep making money off of the system that they've been using for years. Too bad we exist in a free market economy]

  180. Re:Possible? Yeah by cpeikert · · Score: 1

    Since there are only finitely many possibly files of a given size, there are also only finitely many possible pairs of files of that size.
    Since the number of collisions is at most the number of pairs, that means there are only finitely many collisions of a files of that given size.


    All I said is that you can find an infinite number of pairs of colliding files where both files in each pair are the same size as each other. Since the size of these files is unbounded, there are an infinite number of such pairs.

  181. name not found on coral cache by Anonymous Coward · · Score: 0

    www.viralg.com.nyud.net cannot be found. Please check the name and try again.

  182. I have already done this: by nother_nix_hacker · · Score: 0, Redundant
    $ md5sum 02_bel_amour_bel_amour.mp3
    fda9582ef957bfaafc3533 b8760446ba
    $ cp 02_bel_amour_bel_amour.mp3 new.mp3
    $ md5sum *.mp3
    fda9582ef957bfaafc3533b8760446ba
    fda9582ef 957bfaafc3533b8760446ba
    Nothing new here, move along please.....
  183. One way to do it by u2pa · · Score: 0

    Considering that 15.000.000 bytes is sort of a standard when it comes to pirated games/isos/movies etc. Then you'd precompute a ton of hashed junk files stuff them on a HUGE fileserver (compressed file system). A big database to link hash sums with file names, and you got a possible junk seeder. (remember much of the time you'd only have to spread one corrupt file of 50-60 files). (ofcourse once the pirates catches onto this, we will start seeing releases with +1 byte incremental file sizes, or a stronger hash system)

    --
    Officially: "No comments"
  184. Gah. when will people learn? by Anonymous Coward · · Score: 0

    CopyRIGHTED, dammit, not copyWRITTEN.

  185. Two Cents by Anonymous Coward · · Score: 0

    For every artist I find fake files for their music or videos I make it a point to use another source to download a legit copy, burn it to several cd's and then proceed to hand out copies to my friends.

  186. Re: Don't forget PGP signatures by Lobachevsky · · Score: 1

    crypto signatures are based on signing the hash of the message, not the message itself (this is because signatures are based on loseless decryption, and no one wants to sign a 200KB file with a 200KB signature). Why target P2P when "Verisign-signed" certs can be forged? In other words, bullshit. They might have found some collisions in weaker hash functions, but if _strong_ hash functions were defeated, the concept of security as we know it ceases to exist.

  187. Here's one way of making sense of this by Tom7 · · Score: 1

    In all likelihood this is bullshit. Let me try to read between the lines and give the most generous guess at what they're doing that I can come up with.

    They mention DRM, so it would seem that they intend to have control over the original encoded files. Recall that P2P apps often break the file into smaller chunks, which are identified by their hashes and then downloaded individually. Then, one way to screw with P2P downloading would be to arrange so that chunks of the original files all have the same hash (or the same hash as various other data that is injected into the network by attackers). Generating collisions is known to be possible (you might be able to even just use the published collisions by Wang et al. if the P2P app uses the standard MD5 IV, and then include an equal and randomly-generated suffix). Downloading using current methods would then likely corrupt the file, which could be checked by the DRM software.

    This is pretty easy to fix in current P2P software by moving to hashes for which it is unknown how to generate collisions. (Or checking the hash of the entire file at the end, which no doubt some programs already do.) Also, since sharers don't generally start with DRM'd source material, a key assumption is violated.

  188. Hash spoofing by Otto · · Score: 1

    It's possible to spoof the hash, but eventually the hash gets checked on the other end.

    Possibilities:
    - They're only talking about the FastTrack network, which only hashes the first X bytes of the file anyway. Solution: Don't use FastTrack. Or fix FastTrack to hash the whole file.
    - They're talking about other networks that hash the whole file.

    If they're simply sending garbage that doesn't match their hash, then it gets rejected immediately, and every P2P client in the world ignores them after a few spoofs.

    If they're sending garbage that does match their hash, then either the hash won't agree with anybody else's copies on the network (since seeing corrupted files means those files get deleted and not shared anymore), or they're trying to exploit TigerTree hashing.

    In a modern network like G2 or DC, TT hashes are used to verify file integrity. A Tree hash involves breaking the file into regular sized chunks, each of which you hash separately. Then you hash those hashes together to create a new hash, and hash those together, and so on until you have one root hash for the whole file.

    The root hash tells you if the file as a whole is correct, and it's how you identify files over the network. But each level of the tree hash lets you verify parts of the file independently. Each sender tells you his own hashes for whatever sections he's sending you, up to the root hash.

    Once you have enough hashes and the pieces of the files, you can hash each one and actually find which piece is the bad piece via an iterative sequence. Even though each piece matches the hash given for it, the hashes won't combine to make the tree of hashes work out correctly.

    Google for Merkle Trees to see what I mean. They might be thinking that they can exploit a P2P network using this form of hashing, but while they can probably make clients accept the data they send, they can't actually corrupt the final file, as the tree walk will eliminate the bad data they've sent to the peers.

    --
    - Give a man a fire and he's warm for a day, but set him on fire and he's warm for the rest of his life.
    1. Re:Hash spoofing by orkysoft · · Score: 1
      In a modern network like G2 or DC, TT hashes are used to verify file integrity. A Tree hash involves breaking the file into regular sized chunks, each of which you hash separately. Then you hash those hashes together to create a new hash, and hash those together, and so on until you have one root hash for the whole file.
      Once you have enough hashes and the pieces of the files, you can hash each one and actually find which piece is the bad piece via an iterative sequence. Even though each piece matches the hash given for it, the hashes won't combine to make the tree of hashes work out correctly.

      But how does this make sense? The root hash is the hash of the hash of the hash (etc.) of parts of the file. If one of those parts is corrupted but still has the same hash (hash collision), then how would that affect the tree of hashes built from those hashes? The hash of the block in question is the same, after all.

      --

      I suffer from attention surplus disorder.
    2. Re:Hash spoofing by Otto · · Score: 1

      But how does this make sense? The root hash is the hash of the hash of the hash (etc.) of parts of the file. If one of those parts is corrupted but still has the same hash (hash collision), then how would that affect the tree of hashes built from those hashes? The hash of the block in question is the same, after all.

      Umm.. no, because if they can create a block of data with the same hash as the original one, then they have acheived something far, far greater than just putzing around with tricking P2P apps. I'm working under the assumption that they have not done this, because if they have then they are demi-gods. ;-)

      What I was saying was that in a Tree hash system, every "server" sending you a piece of a file sends a block of data *and* the hash for that block. When you hash it, you'll get a match to what they sent you. But it won't match in the hash above it in the tree, because the hash is not the same as the original hash was, therefore it fucks up the tree of hashes.

      --
      - Give a man a fire and he's warm for a day, but set him on fire and he's warm for the rest of his life.
    3. Re:Hash spoofing by ajs · · Score: 1
      "But how does this make sense? The root hash is the hash of the hash of the hash (etc.) of parts of the file. If one of those parts is corrupted but still has the same hash (hash collision), then how would that affect the tree of hashes built from those hashes? The hash of the block in question is the same, after all."

      "Umm.. no, because if they can create a block of data with the same hash as the original one, then they have acheived something far, far greater than just putzing around with tricking P2P apps."


      Not really. It depends on your block-size. There is no guarantee that there's a conflict at the particular block-size you're looking at (e.g. you might have a 4k block, and there happens to be only one 4k data chunk that has your particular hash). This is unlikely in practice, however, growing increasingly improbable as your chunk size increases.

      So the questions to ask are:
      • How big is your chunk size (C)
      • How much CPU time does the computation of a hash take (H)
      • Is there some linear reduction in hash computation time that can be used to short-circut the computation of hashes if they don't match (R)
      • How much CPU per unit time can the attacker afford to throw at the problem (A)
      • Is ((2^8^C)*H)/R/A (divided by 2 on average) less than the shelf-life of a file on a P2P network?

      There are other optimizations that are hash-specific and might reduce the search space further (parallelization, known text weaknesses, etc). Anyone skilled at breaking hashes could put together an app to do this in a few days, I'm sure... the question is: is it practical to use it? How many cycles/sec is a RIAA or MPAA label willing to pay for in order to achive this on a per-file basis?

      The mistake that people make with hashes is in assuming that they need to be broken quickly. If all you want to do is make file-sharing seem useless to the average downloader, you can corrupt fairly old files, so a year or two is fine.

      Personally, I'm all for this. Get the music kiddies off my damn network, and let me download the stuff that no one is bothering to corrupt (old stuff that's not available elsewhere, legitimate software, etc.)

      However, assuming that you're NOT ok with it, I would suggest using a hash of the original data at the file-level to re-assure yourself that you have a valid file.
  189. he should have used a big-hash by davidwr · · Score: 1

    If the hash is bigger than the data, uniqueness can be guarenteed.

    The only good reason I can think to do this is to obscurify data while maintaining collisions, e.g.:

    student ID = hash(social security number + enrollment date + random data)

    where sizeof(student ID) >= sizeof(input data)

    --
    Knowledge is how to play a game, intelligence is how to win, wisdom is knowing what game to play.
  190. Re:Possible? Yeah by cryptoguy · · Score: 1

    It seems that lots of people here are behind on their crypto news.

    MD5 is done. Put a fork in it. SHA-1 is down for the count. These are not theoretical results but actual collisions. There is little doubt that a billion dollar industry can afford to generate these collisions, if they believe it will protect their revenue stream.

  191. Modded funny??? by lilmouse · · Score: 1

    This is a very valid point! If you go to the NSA, they give you lots of forms to fill out, and put guys on your tail who wear black suits and sunglasses and never smile. If you go to the RIAA, they give you lots of cash, and you can hire models who wear black bikinis and sunglasses, and smile at you all the time!

    --LWM

  192. No way by wolff000 · · Score: 1

    Even if they have something workable which i doubt. If they release it here and it does "destroy already shared files on peer to peer networks". Can we say lawsuit, if I lose an important file beacuse I'm sharing say a disertation on the mating behavior of the madagascar hissing cockroach, yes something I'm actually working on and in my share folder, you better beleive I'm gonna sue the crap out out these guys. This will most likely never happen anyway but I can always cross my fingers and lie about my back up files and get rich sueing these assholes.

    --
    WTF?
  193. Answer by ScrewMaster · · Score: 1

    However, with the resolve of the p2p userbase, is this software really going to 'beat all Peer 2 Peer pirates at their own game,' or simply prove a minor annoyance?

    Minor annoyance.

    --
    The higher the technology, the sharper that two-edged sword.
  194. Re:You're just a paranoid troll. That's not insigh by furballphat · · Score: 1

    somehow I don't think kazaa is where you'll find "the good in humanity"

  195. Re:You're just a paranoid troll. That's not insigh by Anonymous Coward · · Score: 0

    As opposed to being a full-of-shit utopian that can't see that P2P is embraced for the primary purpose of piracy, and not for "the good of humanity" or other such rot?

    Seriously, I don't know how someone can state that opening up Kazaa or eDonkey is tantamount to bettering society without falling into a fit of the giggles.

  196. In Other News... by pdbogen · · Score: 1

    Anti-piracy companies around the world are now using the infamous "Slashdot" thinktank to refine their methods.

  197. my vote... by gandy909 · · Score: 1

    ...minor annoyance...

    --

    (Stolen sig) Remember: it's a "Microsoft virus", not an "email virus", a "Microsoft worm", not a "computer worm
  198. RIAA vs NSA by Anonymous Coward · · Score: 0

    Is it juat about whether NSA or RIAA pays more?

    Word on the street is, if you have a good crack and you DON'T go to the NSA for approval first, other undefined issues will begin to occur in your life to make you wish you had.

  199. Gnutella should be OK by smd4985 · · Score: 1

    Gnutella uses SHA1 but they also verify swarmed downloads using THEX. I think this should defeat their attempt at spamming though it will consume processing and bandwidth cycles.

    --
    smd4985
  200. Linux... by Mark_MF-WN · · Score: 1
    You could easily say the same thing about Free software users. And yet look at the staggering number of excellent Free/OSS applications and operating systems.

    Thanks for the "insight" though.

    1. Re:Linux... by Anonymous Coward · · Score: 0

      You should meet my flatmate.

      He's a big part of my 16gb traffic every month, and he actively goes out of his way to avoid uploading to anybody because he doesn't want them "freeloading" off him or something equally dumb because it slows his downloads down.

      People are really very selfish.

    2. Re:Linux... by Anonvmous+Coward · · Score: 1

      Excellent? Half-assed, maybe. Excellent? No.

  201. Re:Possible? Yeah by 91degrees · · Score: 1

    But surely they just need to create a block or two with a bogus hash. The file hash may be wrong, but unless you know exactly which segment is wrong, you have no way of fixing it.

    Or have I totally missed your point?

  202. Sounds like MS tactics by Garretjax-unb · · Score: 1

    This kinda rings to me as the ol Fear and Uncertanty type tactics employeed by big companies. I don't see any technical references, other than the embedded 'Virtual Algorithm' which sounds suspicously like a trojan - trashing other files on the P2p Network. So if I keep all my legit documents in the same folder my P2P files [which hypotheically can be used for legitiment and legal file sharing] what happens when their 'virtual algorithm trashes my files ? To me this reeks of the plan 'make them think we can do this, an they will stop' this sort of scare tactic has never worked on P2P before, why should they expect it to now ? G

  203. Registration sites by Anonymous Coward · · Score: 0

    This dubious claim will have little to no impact on BitTorrent sites that require a login account. The very first time p2p_rockz seeds a torrent with garbage in it, his login will be revoked. This works even better for sites that require peer-invites. The chances of any given movie/recording honkey getting an invite are slim.

    With that said, this will (if the technology works. hah!) change how "unregulated" p2p networks work. You have no idea if that 600mb file you are downloading is actually valid or not, since there is no accountability regarding sources.

    Of course, when i'm downloading a movie, through an unregulated BitTorrent site, I wait for about 10 mb to get downloaded, and throw it onto VLC. If VLC cries and says it doesn't know how to handle the file, I just cancel the torrent.

    Relax folks. There is nothing behind the algorithm.

  204. Re:Possible? Yeah by DarthStrydre · · Score: 1

    > Since the size of these files is unbounded

    What file system are you running that gives you limitless file size? Better yet - what universe are you from that you have an infinite amount of storage material for said file.

    Oh, pardon me. You must have one of those new-fangled Turing machines...

    *rimshot*

    Tough audience...

  205. Is there a need to crack strong hashes? by aitio · · Score: 2, Insightful

    I don't know how the search functions work in Kazaa etc. but can't you just send match to all querys with a fake client? Is there real data integrity check built into Kazaa clients?

    --
    Quidquid latine dictum sit, altum sonatur.
    1. Re:Is there a need to crack strong hashes? by guorbatschow · · Score: 1

      well obviously, the downloading client sends out a request for a file named XY. the uploading clients check for that file name, then sends the hash to the downloading client. then the downloading client can compare the results and sort the same copies of a file. this way the uploading client cant just fake a "match" because it doesnt know which hash would be a "match".

  206. In related news. . . by aarku · · Score: 1

    Céline Dion today signed a 10 year recording contract with Viralg Oy. More to come. .

  207. Great Idea for a patent by hackronym0 · · Score: 1
    Patent to increase download availability of illegal files:

    1. Make website that touts your ability to prevent piracy.

    2. require a copy of 'copyrighted material' for ability to detect it

    3. flood p2p with fake hashes

    4. laugh all the way to the bank as you just got paid to accept tons of copyrighted materials.


    I love this world!
    --
    This is completely false. This is not a sig.
  208. The Finnish shall giveth, the Finnish shall taketh by DroopyStonx · · Score: 1

    Quite a twist in the story of life.

    One Finnish guy writes an OS that screams "information wants to be free", and years later, a Finnish guy writes something to potentially destroy this very idea.

    I bet there is some complex background story that we aren't aware of... like this guy is the secret love fruit of Linus Torvalds and Condoleeza Rice. He was persuaded to join the dark side of the Whores (read ??AA) and one day father and son will have a showdown of hax0r proportions.

    The final battle will take place in Finland. Glasses will be smashed, pies will be broken, and computer boxes will be pwn3ed.

    I have seen the end, and it is geek indeed.

    --
    We have secretly replaced these Slashdot mods' sense of humor with a rusty nail. Let's see if they notice!!
  209. What they are (most likely) doing by JonXP · · Score: 1

    What they are doing is not actually a new deal, and is nowhere near as effective as they would think. P2P apps search based on a specific hash (be it MD5, SHA1, or whatever) and then any computer with a matching hash sends data to the end user. What they are doing is claiming to have matching data, then sending their own corrupt junk data. On most P2P networks (aside from old FastTrack) this would be caught once the file is downloaded at the latest, while newer protocols (like new Gnutella, G2, BT, etc) actually use advanced hasing techniques to catch the corruption DURING the download. Basically this means that this company can slow down downloads (because the hashes will fail and you'll have to redownload part or all of the file) but it won't prevent them from happening.

    They are NOT making colliding hashes. They are simply claiming to have the same file as you (based on the hash) so they can send junk data.

  210. Add another, and another,... by GrEp · · Score: 1

    Add more hashes... i.e. how many bits gzip will compress the file to, what is the hash of the file XORED with the digis of pi,...

    Oh, and the most important. Does the file play corectly and not produce "random" sound and noise?

    --

    bash-2.04$
    bash-2.04$yes "Don't you hate dialup connections?"| write USERNAME
  211. Re:Possible? Yeah by Surt · · Score: 1

    But that's not a true assumption: the size of files _is_ bounded, in this universe anyway.

    --
    "Who is the Journal of Quantum Physics going to believe?" --Stephen Hawking
  212. Re by Anonymous Coward · · Score: 0

    What about the audiofinger printing technology that record company want P2P companies to implement to stop illegal downloads (we all know it won't work). The same technology could be used against them the thwart such methods. My the guys who developed Ogg Vorbis and FLAC will develop an audio finger printing library.

  213. Re:You're just a paranoid troll. That's not insigh by Sj0 · · Score: 3, Funny

    eMule definitely helps you better yourself.

    Patience is a virtue, right?

    --
    It's been a long time.
  214. Multiple hash functions? by Shirloki · · Score: 1

    What if P2Pers were to use multiple hash functions to check files? SHA1 and MD5 sums use two very different methods to compute the hash for a file, so wouldn't using multiple hash functions mostly eliminate junk files?

  215. Re:Just finding a hash collision isn't enough real by Anonymous Coward · · Score: 0
    Re: 2.

    You're not a crypto guy (yes, I can tell) and you're giving advice that md5+sha1 is harder to crack than sha1.

    Please don't do this. Crypto is hard, and although I only pay a bit of attention to crypto I know your proposal isn't something that's respected amongst the crypto community.

    Here's a possible attack against your method,

    The weakest hash is the weakest chain in the link. If you can get a possible input for MD5 quicker than you can for SHA1 then you can use that to generate a significantly smaller set of inputs to test against SHA1, and then your concatenated string.

    Using both is little better than using the weakest hash on its own.

    I'll repeat -- please don't give crypto advice unless you pay a bit of attention to the field of crypto.

  216. Re:You're just a paranoid troll. That's not insigh by Anonymous Coward · · Score: 0

    Can't argue with that, at least.

  217. Totally OT. by cgenman · · Score: 1

    Oddly enough, that's not a real controller. If you look closely, it has 3 joysticks, a D-pad, and no face buttons. There also isn't a Z-button of any sort, which one would expect to find on a GC controller. The sticks in the bottom appear convex, which is the style for the old PS1 analog sticks before they became dual shocks. That there is only one set of L/R buttons with no Z trigger implies Xbox, but nothing else looks like an Xbox controller.

    On the other hand, no system manufacturer has released a stick in quite that contour or (probably faked) shade of blue, so it is a 3rd party joypad (or an amalgomation of 3rd party joypads) of some sort.

    Anyone recognize it?

  218. Re:Possible? Yeah by Council · · Score: 2, Interesting

    Oh, I get Mr. Schneier's thing and I'm not behind on the news; I am under the impression that that there have not been demonstrated preimage attacks on MD5, which is what I was referring to.

    Re: SHA-1:

    These are not theoretical results but actual collisions.

    Again, here it is preimage attacks that are the problem, not just any collisions. But the results mentioned in the link are NOT actual collisions, just an algorithm to produce those collisions that might be feasable to run sometime soon. They didn't actually calculate any collisions. So not "actual collisons", but a "theoretical result". But that's just pedantry, sort of.

    Anyway, as far as preimage goes SHA-1 is certainly still secure, as is -- I believe -- MD5, and this is what's relevant in downloading. If they are not, please point me to the appropriate thing.

    --
    xkcd.com - a webcomic of mathematics, love, and language.
  219. Bwahahahaahahahahah by Orion+Blastar · · Score: 1

    P2P has comments on shared files. Like "This file is fake, please stop sharing it and delete it" which tells P2P users to cancel the download, delete the file, and stop sharing it. I guess the fake P2P Hash company needs to write software to add comments like "This file is real A++++" or something into tricking people to download it.

    Ah well, P2P users usually get that trojan that wipes out their hard drive that the MPAA and RIAA co-wrote to help wipe out Internet Pirates in the form of an self-extracting EXE file that has the trojan in it, but contains a bogus file to pad it to the right lengths.

    --
    Remember, Slashdot does not have a -1 disagree moderation, and no, troll, flamebait, and overrated are not substitutes.
  220. Viral-G is my rapper name by davez0r · · Score: 1

    i get a lot of colds.

  221. The music industry is tiny... by uqbar · · Score: 1

    Despite what most people believe the recording industry is tiny, and for the most part jobs there pay for crap.

    Look at the numbers sometime, you'll be surprised.

  222. Re: Don't forget PGP signatures by Anonymous Coward · · Score: 0

    if _strong_ hash functions were defeated, the concept of security as we know it ceases to exist

    Yeah, my company figured out how to do that.. you may of heard of us - we're called "Setec Astronomy". :o)

  223. Right! by mfh · · Score: 1
    What will they do when people like the files with random noise better than any of the current music?

    Please make a selection:
    1. Britney Spears
    2. Static
    3. Madonna having another emotional fit over P2P!
    (Circles 3, holds breath)
    --
    The dangers of knowledge trigger emotional distress in human beings.
  224. full potential=more competition by uqbar · · Score: 1

    In this case full potential means competition for the major labels - something they don't want.

    At a certain point, it starts to look like anti-trust teritory, since newer legitimate business models for music distro that are based on P2P are hampered by this dinosaur's last gasp effort to undo progress...

  225. Credence by Haxwell · · Score: 1

    I haven't seen it mentioned in this thread yet which is really surpising when you think how cool this project is..

    But Cornell U's Credence project completely circumvents the problems that this company may introduce to P2P.. And it depends on people, not computers, so you may be able to fool a computer, but not a person.

    http://www.cs.cornell.edu/People/egs/credence/inde x.html

    --
    http://www.haxwell.org
  226. Justification? by Anonymous Coward · · Score: 0

    Why are they doing this? P2p technology has "legitamate" uses other than "pirating" media. What if a music artist wants to distribute his music on bittorrent? Who are they to corrupt it? What if someone wants to download a large file, like an .iso of Knoppix STD? (2 hour download for me on high speed connection) Why should someone be able to screw that up? IMHO they are as bad as "pirates" who download songs that they could get for 99 cents.

  227. Re: this interpretation is flawed by Anonymous Coward · · Score: 0

    Basically, given a standard distribution,..

    The distribution is not standard. Besides SHA1 and MD5 hashes are correlated, so the target hash space is not 2^288.

  228. Mod this up to Eleven! by awfar · · Score: 1

    So, the "preponderance of evidence" is diluted even further, in a big way...

  229. Re:Possible? Yeah by Obliviously · · Score: 1

    Why not just work with a user input ranking system. Then use an algorithm and apply a positive/negative flag (in terms of a good/bad file) as salt.

    Obviously a large marjority of p2p users would choose not to participate in file hash "ranking" so the p2p app developer could implement a "download bin" and then a "committed download bin". This could determine a postive/negative flag for the file hash without the user being aware of their participation.

    The recording industry would attempt to counter the hash "ranking" system by providing postive hash salts for garbage files. But in the event this occurred a system could be put in place like on ebay's rankings...if you get too many negative/false remarks that go against the majority (p2p users) your credibility is diminished.

  230. Re:Just finding a hash collision isn't enough real by MrAnnoyanceToYou · · Score: 1

    Well, all they need to do then is store the 2^256,000 hash codes and their collisions and then upload them when requested.

    That's how many codes again?

  231. easy fixes by DunbarTheInept · · Score: 1

    easy fixes:

    1 - Change to a different hash checksum algorithm after the one you were using becomes spoofed.

    2 - In the case of digital media like text files, audio files, or movie files, you can change a byte or two and not affect the human usability one iota - for example, by adding a couple of extra blank linefeeds to a text file here and there you have the same file but it now has a different checksum.
    Or, for a sound file, by changing several sound sample's values in ways undetectable to the human ear: (i.e. three consecutive sound samples in a CD quality audio file might have values of 8019,8020,8022. subtract 1 from each of them to get 8018,8019,8021 and no human being on the planet could hear the difference. Do that at 10 random places in the file. Now it has a different checksum number but is still the exact the same song - besides, you'd get more of a difference than that during the playback translation from digital to analog as the signal is used to move some speakers' membranes.

    I'm sure something similar can be done for video - change all the white pixels' colors from 0xFFFFFF to OxFFFFFE - totally different checksum for the file, but no human could tell it's a different movie file by watching it.

    --

    Don't label something "offtopic" unless you know the topic well enough to tell what's on topic.

  232. "Patented virtual algorithm" it's a joke by Charles+Dodgeson · · Score: 1
    I was wondering the same thing. There is nothing in TFA or on the company's site that says anything about hash collisions. At least nothing I could find.

    They do get as specific as saying "patented virtual algorithm". So here are some guesses.

    • It's a joke.
    • It's complete and utter snake oil.
    • The "virtual algorithm" is to upload junk with same hashes as real content. What makes the algorithm "virual" is that they just haven't quite figured out how to create such files.
    Those options are not mutually exclusive.

    Of course there was no reference to a patent filing. I am really inclined to think this is a joke.

    --
    Prime numbers are exactly what Alan Greenspan says they are -S. Minsky
  233. Linux...Ghost Net. by Anonymous Coward · · Score: 0

    "You could easily say the same thing about Free software users. And yet look at the staggering number of excellent Free/OSS applications and operating systems."

    Which doesn't NEED geo-scrambling or payload-hiding technology.

  234. Wow! They just embarrassed every mathematician! by Anonymous Coward · · Score: 0

    Since most hashing algorithms are not only NP-complete, but NP-hard, and they claim that this algorithm works in reasonable (i.e. polynomial) time on normal computers (non-deterministic turing machines and hypercomputers need not apply), then this means that P=NP.

    That means they just proved virtually every mathematician wrong. (It is generally believed that P != NP, but NP is a superset of P.)

    Why are they contacting the RIAA? Shouldn't they be reporting to the Clay Mathematics Institute to pick up their million-dollar award, and then swing by Stockholm to collect a few Nobel prizes? (If their claim holds, then they just said some astonishing things about the fields of modern physics and information theory.)

    1. Re:Wow! They just embarrassed every mathematician! by Anonymous Coward · · Score: 0

      Addendum: P is KNOWN to be a subset of NP. (Obviously; anything a deterministic Turing machine can do, a non-deterministic Turing machine can do at least as well.)

  235. Shady at best by Anonymous Coward · · Score: 0

    Tried searching some info about the company and
    didn't find much at all. I'd be really sceptic
    about any claims they make, seems a bit ambiguous.

    Nothing to see here move along.

  236. Better Hashes will be created. by Darkmadda · · Score: 1

    We all know that pirates and others will find a way around it. A different hash will be created that will prevent generated files from being created. I don't know if anyone has suggested this but why doesn't someone create a hash that also contains sample data from varios locations in within the file (ie a hash of the file followed by 100 bytes taken from begining, middle and end)(coupled with a filesize tag). The ability to create collisions within a hashing scheme like that would be even harder to do, and with a scheme somewhat similiar could make it possible to eliminate collisions all together. I don't know... just the first thought that popped into my head when i read the article

  237. No idea how the blurb relates to the link! by hurfy · · Score: 1

    No idea how the blurb relates to the link!

    Blurb talks about hashs and the link talks really nasty sounding stuff but nothing about hashes. I could not read the site linked by the article however.

    from the article:
    "In a statement, it claims its technology can also destroy already shared files on peer to peer networks."

    Destroying someones files is apparrently legal in finland?!? Wouldn't this be blatently illegal most anywhere else?

    It either 'destroys' someones files or it secretly hides a program that corrupts on export. Seems like a big as legal issue as they are trying to solve !!

    I can solve filesharing also as long as legalities aren't an issue :)

  238. Re:For all the new 'copysafe' tech that comes out. by orkysoft · · Score: 1

    But once it's cracked, the cracked version will be better than the original version, since it doesn't come with such invasive copy protection, and will probably work on more computers because of that.

    --

    I suffer from attention surplus disorder.
  239. Good Luck Poisoning Torrents by NFN_NLN · · Score: 2, Informative

    I've already looked into poisoning Torrents: 1) There is a hash on the entire file (simple enough) 2) The data shared from a torrent is broken up into pieces. Contributors can only send whole pieces. (ie many people contribute to the entire file you're downloading but only 1 person contributes to a given piece). AND EACH PIECE IS HASHED. Take a look at the .torrent for yourself. The .torrent contains the hash of every piece. So not only would you have to make a file of the SAME SIZE with the SAME HASH, but every 1MB (for example) would also need to have the SAME HASH. Not only that but if you inject enough bad pieces you get booted (and yes this can be tracked, becuase as I stated before pieces come from a single individual).

    1. Re:Good Luck Poisoning Torrents by Sigma+7 · · Score: 1
      2) The data shared from a torrent is broken up into pieces. Contributors can only send whole pieces. (ie many people contribute to the entire file you're downloading but only 1 person contributes to a given piece). AND EACH PIECE IS HASHED. Take a look at the .torrent for yourself. The .torrent contains the hash of every piece. So not only would you have to make a file of the SAME SIZE with the SAME HASH, but every 1MB (for example) would also need to have the SAME HASH.


      This won't be a problem at all. If you inject a single incorrect block, it will not be detected until the file is completely downloaded (assuming that it disrupts the hash of the entire file.) When it is detected, the client will have to go through the trouble of trying to find which block was corrupted - which can be troublesome as the bad block was already transferred to other downloading peers which inturn are passing the bad block as legit.

      Most likely, the Finnish research team (who's website is currently offline) have probably found a way to disrupt individual blocks and the entire file without changing the hash. This is the real problem, but BitTorrent could still easily defeat this by using a striped hash (every 256'th byte) in addition to it's current Linear hash (series of bytes that cover 1/256th of the file).

      BitTorrent also has some other shortcomings:
      - In practice, it has very shoddy performance behind a firewall, as if it was not designed for use in mind. (I can still get 2:1 upload ratio in some cases.) This could be easily fixed by adding a "firewalled" bit to the appropriate clients and by including some planning commands to help firewalled clients maximize whatever bandwidth they can get. (e.g. I'll download block 1, you download block 2, then we can exchange those blocks.)
      - There are cases where a torrent file loses all of its seeds, and results in a file that is 90% or so downloaded for all remaining clients. Usenet already adaped to situations where segments disappear by creating PAR files - Bittorrent can easily gain from this by including special recovery blocks. (This might not be needed with BitTorrent, but in cases where bandwidth is a bottleneck, there should always be an option for the CPU to help speed things up.)
    2. Re:Good Luck Poisoning Torrents by NFN_NLN · · Score: 1

      This won't be a problem at all. If you inject a single incorrect block, it will not be detected until the file is completely downloaded (assuming that it disrupts the hash of the entire file.) When it is detected, the client will have to go through the trouble of trying to find which block was corrupted - which can be troublesome as the bad block was already transferred to other downloading peers which inturn are passing the bad block as legit.

      You can poison a piece as you stated, however a piece isn't shared as it comes in, you only share a piece once you receive the entire thing (ie all blocks) and have confirmed the hash OF THE PIECE (the hash of the entire file is done as a double check at the end).

      Therefore you can waste someones time by injecting poisoned blocks but since that pieces hash won't check out it won't get propogated to anyone else.

      In addition anyone who sends blocks which ultimately result in a BAD piece... get the boot!

  240. Re:Just finding a hash collision isn't enough real by James+Youngman · · Score: 1

    If the hash you're talking about is MD5, it has only 256 output bits (as opposed to SHA-1's 160), so you would need at most 2^256 input files to get a 'full set'.

    While it may be the case that for some hashed values there are no bit sequences of the right length that produce the given hash result, that won't matter as they'll never be needed (since we're talking about finding bogus data with the same hash as a known file).

    So the good news then is that they only need to store a maximum of
    5028786540381533915569733539034509401168311539 5958 303487667351851366745611458 example blocks for full coverage...

  241. Re:Possible? Yeah by cryptoguy · · Score: 2, Interesting
    Here are two different files with the same md5 sum. They are quite similar, but notice for example the differences at byte 20 and at byte 27.
    file1.dat:


    00000000 d1 31 dd 02 c5 e6 ee c4 69 3d 9a 06 98 af f9 5c
    00000010 2f ca b5 87 12 46 7e ab 40 04 58 3e b8 fb 7f 89
    00000020 55 ad 34 06 09 f4 b3 02 83 e4 88 83 25 71 41 5a
    00000030 08 51 25 e8 f7 cd c9 9f d9 1d bd f2 80 37 3c 5b
    00000040 96 0b 1d d1 dc 41 7b 9c e4 d8 97 f4 5a 65 55 d5
    00000050 35 73 9a c7 f0 eb fd 0c 30 29 f1 66 d1 09 b1 8f
    00000060 75 27 7f 79 30 d5 5c eb 22 e8 ad ba 79 cc 15 5c
    00000070 ed 74 cb dd 5f c5 d3 6d b1 9b 0a d8 35 cc a7 e3

    MD5(file1.dat) = a4c0d35c95a63a805915367dcfe6b751

    file2.dat:

    00000000 d1 31 dd 02 c5 e6 ee c4 69 3d 9a 06 98 af f9 5c
    00000010 2f ca b5 07 12 46 7e ab 40 04 58 3e b8 fb 7f 89
    00000020 55 ad 34 06 09 f4 b3 02 83 e4 88 83 25 f1 41 5a
    00000030 08 51 25 e8 f7 cd c9 9f d9 1d bd 72 80 37 3c 5b
    00000040 96 0b 1d d1 dc 41 7b 9c e4 d8 97 f4 5a 65 55 d5
    00000050 35 73 9a 47 f0 eb fd 0c 30 29 f1 66 d1 09 b1 8f
    00000060 75 27 7f 79 30 d5 5c eb 22 e8 ad ba 79 4c 15 5c
    00000070 ed 74 cb dd 5f c5 d3 6d b1 9b 0a 58 35 cc a7 e3

    MD5(file2.dat) = a4c0d35c95a63a805915367dcfe6b751

    For SHA1, you are correct. They presented an algorithm for finding collisions in full 80-round SHA1, and demonstrated the correctness of the algorithm on SHA1 reduced to 58 rounds. Here is the SHA1 announcement:

    http://theory.csail.mit.edu/~yiqun/shanote.pdf

  242. Nope by No+Such+Agency · · Score: 3, Insightful

    Sorry, that level of doublethink is only alowed for corporate lawyers. Your lawyer will be smacked down for trying it, since it is not a defense permitted to second-class citizens (see earlier post).

    --
    Freedom: "I won't!"
  243. Haha, trust us, we don't. by No+Such+Agency · · Score: 1

    We are after all a government agency.

    --
    Freedom: "I won't!"
  244. DMCA by brianf711 · · Score: 1
    I wonder if there is any way to apply the DMCA against this type of attack, so either they have to argue against the DMCA or they have to argue for P2P and against the DMCA. Though unlikely, that would be a great catch-22 for RIAA to get into.

    (great for people who appreciate freedom, but not necessarily great for RIAA, though many might argue that it is in the long run)

    1. Re:DMCA by Anonymous Coward · · Score: 0

      If you appreciate freedom, then you wouldn't try to get the DMCA legitimized like that.

  245. Re:Possible? Yeah by cryptoguy · · Score: 1

    There is a simple python program which demonstrates this collision: http://tinyurl.com/amp43 I'd post the program but slashdot lameness test commplains about junk characters.

  246. Only one way to stop it.. by nurb432 · · Score: 1

    Charge *outragous* fees for bandwidth useage..

    Make it cost more for the average joe to download a song then to go buy it at the store... ( or movie, program, etc )

    Then that will effectivly stop it.. ( well, not completely, but for all practical purposes its over )

    Until then, its all just a speed bump...

    --
    ---- Booth was a patriot ----
  247. Other way to tell by SuperKendall · · Score: 1

    Besides which, if you're serious about poisoning a p2p network, I don't see forty clients to be that much of a stretch. Hell, if you're really serious, you could put hundreds of them out on the network.

    Ok then, take the one that has fourty shared instead of four hundred. :-)

    Seriosuly though as you note P2P is already "poisoned" and I think anything this company does is a drop in the bucket. Probably people will do what they've always done, which is to download a few different versions and keep the one that turns out best.

    In fact will it not make it harder for enforcement companies to do thier job if there's a lot more trash on the network? What if someone is sharing a garbage file and gets sued - or even a real one! Then they could just claim they were really sharing the garbage version. After all, the CRC's are the same...

    --
    "There is more worth loving than we have strength to love." - Brian Jay Stanley
  248. Might work for small files... by TENTH+SHOW+JAM · · Score: 1

    This might solve the problems of the RIAA and MP3s, but with technologies to move ISO images where the file size is greater than say 10MB, you want to do this in chips, chunks, and hunks.

    Each one is going to have an algorythm to calculate it. If each one is a different algorythm (say a simple CRC on a chip, MDA/SHA-1 on a chunk etcetra) to provide false data, and prevent being blocked from the network, then the garbage generator must come up with a file that acheives three algorythms. Boy is that an ask. Now if we lay an encrypted pipe between each node on the network, then the system can quickly demote a client as untrusted. If the client sends reliable data, their "reputation" increases. If ones reputation falls below a certain threshold, that certificate is rejectedby each other client, and the user must generate a new certificate and gain the trust of each client on the network again. (starting with a reputation of 0 once more)

    Such a scheme would ensure that those who consistantly send good data would continue unabated. Those with dodgy links (noise on the line) would be slightly hampered (rather than a 100% reputation, they may be a touch less. The astroturfing, data polluting, corporate shills wiuld quickly gain a negative reputation and be booted by each individual client.

    Now if a file is released with a name like "Brand new EMINEM single.mp3" and it turns out to be garbage, why would people be surprised? by the way, the above data integrity system to my knowledge has not been built, but it probably will.

    --
    A sig is placed here
    To display how futile
    English Haiku is
  249. Blah blah blah by Anonymous Coward · · Score: 0

    The second this gets "released" will be the second that P2P programmers will come up with a better hashing sceme and instantly defeat it.

    In fact if P2P authors are listening, start NOW.

    The type of people that use those programs are the type that are already used to having to upgrade them every 6 months anyway, so it'll be a zero impact issue.

  250. Re:For all the new 'copysafe' tech that comes out. by Anonymous Coward · · Score: 0

    I'll also chip in that dongle based software is becoming a pretty tough nut to crack apparently. Witness Steinberg's Cubase SX 3... It was released last year. I know that there was no working crack for a long time, and that may possibly still be the case. I have heard rumors that it will be impossible to completely emulate/replace/crack this software. I suppose given enough time it could be reverse engineered, but that could take until after v4 or longer? I may be way off at this point, I don't know the exact state of this situation, but as far as I know their protection is sophisticated enough now to basically be not worth the effort to run a pirate copy because of the flakey/crash-proned bad crack. Of course as an aside I've always heard Cubase SX was a peice of crap as far as MIDI timing is concerned so good luck making anything that sounds good with that POS.

  251. OWNER OF VIRALG.COM ALSO OWNS A HUMOR-SITE! by Junnonen · · Score: 1

    According to whois.org, the registrant of viralg.com , Juha Natunen, also owns a humor site called hupsis.com.

    I think one could draw some conclusions...

  252. Lies, pure lies by Corpus_Callosum · · Score: 1
    This slashdot summary is bunk. It reads as if the indicated company has broken all secure hashing algorithms in existence today. I can guarantee that has not happened and they cannot do what they claim to do.

    However, there was an interesting claim in the actual article:
    The company says it has developed digital rights protection software that can be incorporated into digital movie, music or software releases and set to play havoc with P2P networks on which releases may appear.
    I take this to mean that, perhaps, they have a means to prepare a digital file (say a movie) such that the 128k segments that bittorrent hashes will have always result in the same hash, allowing them to take junk data (that also hashes to the same value) and substitute it in the bittorrent network. While this is still a substantially difficult problem, it is much more believable than breaking secure hash.

    If what I am suggesting is true, then they will only be able to wreak havok on their own digitally prepared files. If you are downloading a DVD rip, for example, there is nothing they can do about it.

    This will never bother anyone. It is just some finish company trying to take advantage of MPAA type paranoia. I wish them success and hope they make a bundle off of what they are doing ;-)
    --
    The reason that it can be true that 1+1 > 2 is that very peculiar nonzero value of the + operator
  253. Wouldn't this be allowing the distributions? by Kaenneth · · Score: 1

    If the RIAA authorized the free release and duplication of a product, for example titled 'New Boy Band - New Hot Song.mp3', and advertised it's parameters (size, bit rate, even a 'secure' hash value); havn't they effectively released the title with those parameters for public duplication?

    It would be like standing on a street corner, announcing "Free California Oranges!", while someone next to you hands out oranges... then when the 'customer' tries to leave you say "Hey! you owe me ten dollars! That was a Florida Orange"

    1. Re:Wouldn't this be allowing the distributions? by brianf711 · · Score: 1

      I don't think this is the case as at no time did they relinquish copyright. They have an interfering file with the same name, but this in no way invalidates their copyright the same as if they offer the legitimate song for sale. Secondly, I'm not sure how far you can stretch the advertising metaphor as they are technically being polled by clients, rather than advertising, at least as far as I understand it. There may be other issues with the ethics and legality with which they are operating, but i'm not sure that advertising is one of them. Perhaps it could be argued that way, thought it might be a tough sell, especially since they are not selling a product so many of the rules may not apply if it is advertising.

  254. Re:Possible? Yeah by Council · · Score: 1

    I know. I've seen this before.

    But I repeat, this is not a preimage attack; you're not generating the collision for a chosen file, and it is thus not a problem in the P2P context. I don't think MD5 is vulnerable to this yet. If it is, please correct me.

    My original point was that a good hash function is not vulnerable to either preimage OR general collisions (contrary to the OP's supposition), but even a function with general collision weakness (MD5 or SHA-l now) is not necersarially weak for certain purposes (e.g. file integrity check or the P2P stuff).

    --
    xkcd.com - a webcomic of mathematics, love, and language.
  255. Already been done by Anonymous Coward · · Score: 0

    Well, kinda..

  256. OWNER OF VIRALG.COM ALSO OWNS A HUMOUR-SITE!!! by Junnonen · · Score: 1

    I post this here, so maybe it will be better noticed than at the bottom of the page...

    According to whois.org, the registrant of viralg.com, Juha Natunen, also owns a humour site called hupsis.com.

    I think one could draw some conclusions...

  257. just brilliant by Anonymous Coward · · Score: 0

    P2P bandwidth usage is already 60% of the world's network traffic... why not flood the internet will useless junk, and bring every internet connection back down to dialup speeds...

  258. What if... by jessecurry · · Score: 1

    ...I were to be using P2P software to copy some media that I own from my computer at home to one at my cottage? Wouldn't the intentional destruction of this file by a third party be an illegal activity?

    --
    Those who know, do not speak. Those who speak, do not know. ~Lao Tzu
  259. lets see that bullshit work on winny by sakura+the+mc · · Score: 0

    where alot of files distributed werent packed/encoded/ripped by a group but rather an individual. i didnt rtfa and i dont plan to. another thing in my day to call bullshit on.

    so bullshit.

  260. Fun with lawyers by Ernesto+Alvarez · · Score: 1

    The document was garbled, however the first page was readable.

    In that page, it is mentioned that this method is used to add garbage to generate a second, garbled file that is not recognizable from a first, copyrighted file (the copyrighted part IS in the document).

    That would mean that this patent is good only for copyrighted files. What if someone patents the SAME algorithm (using the SAME document) but for NOT COPYRIGHTED FILES (by adding a not to the original patent)? Either both should be accepted or not (they are both equally creative). If they are both accepted, when they fuck up and use their program on a non-copyrighted file they get sued for patent infringement.

    Yes, I know it won't happen, but it was funny that the patent "works" only on copyrighted material and I wanted to make you guys notice that.

    (And if you sue the hell out of them, don't forget to tell me ;-). Sorry, too much h2g2)

  261. Some interesting points... by xquark · · Score: 1

    Initially what kind of hashes are they producing? Can they replicated md5,
    sha, sha-1 etc all in a reasonable amount of time?

    I doubt they can, and even if they could the hashing criteria is based on
    other things as well, such as exact file size in bytes and a possible fuzzy
    file name match.

    So there are actually three pieces of information that have to be equivalent:

    message digest + file size + fuzzy file name match

    I want to see them produce 2 files that have the same hash value (be it MD5,
    SHA-1 etc..) and also be of the same file size.

    If they can do that my hats are off to them, if not good-night sleep tight,
    don't let the bed bugs bite! :)

    Arash Partow
    __________________________________________ ________
    Be one who knows what they don't know,
    Instead of being one who knows not what they don't know,
    Thinking they know everything about all things.
    http://www.partow.net

    --
    Arash Partow's Philosophy: Be a person who knows what they don't know, and not a person who doesn't know.
  262. Let's play the headline editing game by Anonymous Coward · · Score: 0

    Let's see how much more accurate the headline becomes if we merely drop two words from it:

    Finnish Firm Claims Fake Technology

  263. Already being done, with little advantages for us. by ezthrust · · Score: 1
    There are already people making pages of fake email addresses on the www for bots to find. All this accomplishes is that whatever address the spammers use as a spoof reply-to address gets millions of bounced emails.

    I don't see the advantage of this.

  264. strange by juenger1701 · · Score: 1

    anyone else notice that they don't say what exactly the patent numbers are and what the hell is a virtual algorithm

  265. workaround by Cyno · · Score: 1

    Use two hashes for each file. 1 md5 and 1 sha1. Getting a file that matches both and has the same file size is probably impossible. But who knows. Its just a simple small hash key and there are lots of bits in a file.

    1. Re:workaround by radu124 · · Score: 1

      for MD5 some people managed obtaining pairs of documents with same hash. This is why the algorithm is no longer considered secure. Doing this however requires a lot of computing power for each generated pair. For SHA nobody can do it so far and nobody won't be able in the forseeable future. There is no need to use two hashes. Just use a longer hash.

      They might be able to break the hash of one particular network (eDonkey or something) but their claim that they cracked all of them is absurd.

    2. Re:workaround by Cyno · · Score: 1

      But why not use two hashes? Or hash up each segment of the file as it gets broken up before transfer.

      Multiple hashes per file would make it more difficult to spoof.

      Saying "There is no need..." is why they have this problem in the first place. Besides, what are you going to do with those extra CPU cycles?

  266. Re:Just finding a hash collision isn't enough real by kryptkpr · · Score: 1

    According to matlab, 2^(2^18) is infinity (integer overflow).

    However, if the blocks are only 512-bytes each then 2^(2^9) is 1.3408 x 10^154.. so start from there and use the fact that squaring means multiplying the exponent by 2, 2^(2^18) is on the order of 10^78848..

    --
    DJ kRYPT's Free MP3s!
  267. KAZAA uses weak hash!! by khrtt · · Score: 1

    Let's just concede they can actually produce a junk file which has the same hash.

    KAZAA uses weak hash that only hashes small parts of the file. Just search wikipedia for UUHash for details. Given that, injecting bad data into KAZAA is trivial, and not even worth a patent. All other P2P networks use secure hash algorithms, and are not vulnerable to this nonsense anyways.

  268. Re:Agreed - and beware the sneakiness of MS by Anonymous Coward · · Score: 0

    You may not be far from the truth about Microsoft. I believe they snuck that stuff in already.

    Not long ago, I copied some MP3s (made from my own CDs, thank you very much) from my Linux drive over to the XP partition and played them with WMP.

    It wasn't until a few weeks later I noticed during a file search by date that these MP3s popped into the list. The dates, and file sizes, had been changed!

    Quick experiment was performed: copy original from Linux, play it, see file change once it played to the end.

    I have no idea what WMP added to the file, but needless to say, I was pissed that the file was modified at all. I even made sure the WMP's (available) settings had disabled everything I could find.

    MS media products are not welcome in my world anymore, be it for music or video.

  269. Laughable by Donny+Smith · · Score: 1

    > Shareaza has a "commenting" system for just this purpose.

    Ha, ha!
    Gazillions of dilligent sharers modding up "good" files - yea, right!
    Of course if I were a record company I'd mod all my fakes "excellent" and add some random comments ("ruL3z", "kewl", etc.).

  270. It would be illegal by Anonymous Coward · · Score: 0

    Anything flooding my network is illegal.
    I would sue the shit out of them.

  271. Just the first by Anonymous Coward · · Score: 0

    I'm astonished that it has taken this long for a technology specifically aimed at 'poisoning' P2P systems to emerge. It probably has more to do with squeamishness in the various legal departments of the record companies than the difficulty of the problem. Fundamentally, peer to peer is a system where all the peers are trusted by all the others, and anyone can act as a peer. It relies on all the peers conforming to the protocol and behaving themselves, and there is no failsafe way of excluding those that don't. This must inevitably mean that a sufficiently motivated party could disrupt these systems, regardless of what technical measures are taken to make it harder. To keep bad clients out of the network you'd need some kind of cryptographic trust maintenance thing going on, and in order to do this you're no longer anonymous, which you aren't going to be willing to do, as you're doing something illegal. So far, attempts to poison the networks have been unsophisticated (posting 'dummy' versions of copyrighted material). This technology is more sophisticated, being able to 'jam' the broadcast of a file which as originally distributed was what it claimed to be. If this technology is successfully deployed and noone manages to convince a court that the RIAA isn't allowed to use it, expect more things on similar lines to emerge very quickly indeed. My next guess would be something that disrupts the way a client searches the network for files. I'm guessing if you inserted some non-complient peers in there and moved them around enough, it would become hard to find anything; you might be able to knock the entire service over if you were sufficiently determined. You'd have to be a reasonably smart cookie to do this, but by no means a genius. Now the really dedicated filesharer is going to find a way around these things, but the more active the RIAA is in jamming/disrupting new p2p technologies, the more active you're going to have to be to get your warez. Remember: the RIAA don't have to eliminate all piracy. They just have to make it sufficiently inconvenient that paying fees on iTunes and the like is a more attractive proposition for anyone who was likely to spend money on music in the first place. For me, they're getting there already; I find things like eMule and Kazaa and so on a pain to use due to the amount of noise there. The richer the punters are, the less tolerant they're likely to be of futzing around with kazaa and the more likely they are to pay; so by doing even a little bit of disruption you get the best customers back first. The hard core filesharers aren't worth having as customers, because a) you can't disuade them; pinching music is a matter of honor and b) they probably don't have any money anyway. All they have to do is make p2p around as inconvenient as finding someone you know who has a CD you can copy (which was where they were beforehand) and they're home free. The only obstacle between them and this outcome is legal, and remember, you can probably do this from any country with convenient laws and an internet connection. The famous lawlesness of the internet is made to serve the man after all...

  272. FADE ain't all that by TubeSteak · · Score: 1
    one of the probs with this type of copy "protection" is that discs fail sooner than usual from normal wear and tear.

    FADE
    SafeDisc 3

    As for SAP, etc. We've all seen just what happens when you try for a fully encrypted pipeline for your digital data. someone somewhere will either find a chink in the encrypted stream, or they'll capture it before/after it hits the processing stages.

    Its still amazing that the tv people talked someone into thinking limited hardware was a good idea for their broadcast flag.

    --
    [Fuck Beta]
    o0t!
  273. This disturbs me. by NnT042 · · Score: 1
    No, not the article.
    The fact that from over six hundred posts, I only see a few dozen suggesting the entire concept is bullshit, and only a small subsection of those that (brilliantly?) deduced that the whole thing is a joke.

    Geez, it really isn't that hard. I know it's a stretch to even RTFA, but the "company" website is only a click away from that...
    Stare at that site real close for a minute or two. See the humor now?
    I mean, seriously: "protect your revenue"? "virtual algorithm"? What is a virtual algorithm, anyway? By definition, it's an algorithm that does not exist. ;) The title tag on that page is "New Page 1" - would any company raking in money by selling Total Blocking of Peer 2 Peer Sharing for Your Intellectual Property (that line cracked me up even as I typed it) seriously be that retarded?

    And that's only the front page. Click around a bit and even more 'clues' pop up, including random statistics and physically or mathematically impossible claims.
    How can anyone look at that and think "Oh crap, we need to change our hashes now!" or "You won't break MY p2p!!" instead of ROFL?

  274. yeah dude by commodoresloat · · Score: 1
    I can't wait to see the look on those little Eichmann's faces when they download this crunchy groove....

    ;^)

  275. Re:Er.. yourself by Eivind · · Score: 1
    To compute a hash, you have to read the entire file, and do some math on the contents.

    Correct this far.

    If you have 3 hashes, you have to read your entire 4GB+ file from your hard drive 3 times over,

    This however, is absolutely braindead and completely wrong. You are correct that reading the entire file is in general the slowest part of creating a hash, but there's no reason you'd have to do that three times for three hashes.

    In general you create a hash by first initializing the hash-function, then repeatedly "updating" it with the entire contents of the file, and then finally finalizing it.

    With three hashes you can trivially do that while only reading the file once by doing something like so:

    h1 = md5.init()
    h2 = sha1.init()
    h3 = myhash.init()

    while not file.eof
    buf = file.read(BLOCKSIZE)
    h1.update(buf)
    h2.update(bu f)
    h3.update(buf)
    end (end while-loop)

    print h1.gethash()
    print h2.gethash()
    print h3.gethash()

    In practice on a modern computer this would be more or less identically quick to a single hash. Yes, it'd consume almost 3 times the cpu, but this is (as you correctly point out) a job that is going to be io-limited anyway.

  276. Not so straightforward by thisisauniqueid · · Score: 1

    (a) Same hash: easy.
    (b) Same hash and size: much harder.
    (c) Same hash and size, and same hash using a second, entirely different hashing algorithm, for arbitrary data: Virtually impossible.

    They would need more computers than those available in the world, for a time longer than the lifetime of the earth, to do (c) for enough files to cause a problems. And in general there is no solution that will create simultaneous collisions in two different hash algorithms for arbitrary data of arbitrary size.

    They would do better to flood the networks with files of the same name, with different sizes and hashes -- that way finding the right hash is going to be difficult (it becomes a SNR problem).

  277. AES? by Anonymous Coward · · Score: 0

    AES is a block cipher, not a hash function...I guess you mean SHA-1.

    Read doxpara for more info, it is possible to generate collisions in MD5 (two or more different techniques).

  278. Create Bogus Sites of Viralg by Prodigy+Savant · · Score: 1

    Let us all get together and flood the www with many many bogus sites claiming to be Viralg.

    Use their own tech against them!
    What would be better would be to create copies of their site with only some text changed:).
    I dont know if the hash of the sites can be the same as the original, but wtf!

    --
    Dont make a better sig, you insensitive clod!
  279. New Page 1 by TwentyTwo · · Score: 1

    Seems that http://www.viralg.com/index.html/ 's title got broken by some mysterious gargabe-injection technology.

  280. Re:Possible? Yeah by cryptoguy · · Score: 2, Informative

    All we can really say is that these researchers did not demonstrate a preimage attack. However what they did demonstrate should raise serious concerns that a preimage attack might be possible. For example, I could hash the latest blockbuster movie file, saving the internal MD5 state at the last iteration. Then, proceed with their algorithm, searching for a pair of two-block extensions to add to the file which lead to MD5 collisions of the entire file. If not, why not?

    Bottom line, attacks get stronger over time, never weaker. Once a crack appears, further probing generally widens the crack.

    MD5 is probably ok to use in a scenario where you don't expect an active adversary, or in a keyed hash where the security is protected by a secret key. But relying on MD5 to protect data integrity against a well funded adversary is foolish at this point.

  281. But is it a problem? by The_Button_Man · · Score: 1

    There have definitely been some interesting posts about the possibility of such a technology destroying the ambitious and forward-looking tech that is P2P. But surely this isn't a problem - as long as the only files targeted were those which would fall under some form copyright, and would therefore be illegal, then the remaining files would be left untouched. So the more interesting side of P2P (for examples sites such as http://www.10eastern.com/foundphotos/)would be left relatively untouched, as would fully legal uses of such software. I mean, you can't really complain about it being a bit more tricky to download the latest game, can you? It's a bit like a shoplifter complaining about empty display CD-cases on the shelves of record shops...

  282. KZHASH clarified, TigerTree? by gojomo · · Score: 1

    To clarify: Kazaa's old hash, pre-2.6, hashed the first 300K with MD5, then small samples of the rest of the file with crc32. There were giant ranges of file that could be changed without affecting the early Kazaa hash at all.

    Starting in 2.6, they kept that flawed hash as the first 20 bytes of 'kzhash', but then added a hash-tree based on MD5 of every 32K chunk. Much better, as long as you trust MD5 -- but anyone who's read Effugas's paper shouldn't trust MD5. (Despite the title "...harmful someday", the content of the paper suggests to me MD5 is harmful today.)

    Public domain code to calculate both Kazaa hashes is available as part of the Bitcollider project. See for example for the original super-flawed hash:

    http://cvs.sourceforge.net/viewcvs.py/bitcollide r/ bitcollider/lib/ftuuhash.c?rev=1.2&view=auto

    Or for the 2.6-and-up improved (but still dependent on MD5) tree hash:

    http://cvs.sourceforge.net/viewcvs.py/bitcollide r/ bitcollider/lib/kztree.c?rev=1.3&view=auto

    Finally, a question: your last throwaway line seems to imply you think that TigerTree is in some way "more exploitable" than (the newer) kzhash.

    But TigerTree uses a hash against which no MD5-like cmpromising results have been announced, and a similar tree calculation method with an added leaf/node discriminant suggested by professional cryptographers.

    So if there's a published or unpublished weakness there you know about, can you please supply details?

    1. Re:KZHASH clarified, TigerTree? by Effugas · · Score: 1

      kzhash isn't as nice as Tiger Tree, for the specific reason you mention (no leaf/node discriminant). I do think the "md5 stego" channel will eventually be ported to Tiger Trees, but not until we get MD5 collision discovery code.

      MD5 won't be in panic stages until second preimage comes into play, thus the "someday". But we're learning so much, so quickly about mechanisms of hash destruction that I think it's going to happen, and soon. Did you see the paper that pointed out that the bigger a file, the more intermediate hashes are inside of it (for either MD5 or SHA-1), and thus the more points there are to collide against while maintaining a route to the correct final hash? Very cool work.

    2. Re:KZHASH clarified, TigerTree? by gojomo · · Score: 1

      But: TigerTree uses the 'tiger' 192-bit hash, specifically designed to be different from the MD4/MD5/SHA1 family, so MD5 results should not be generally applicable to tiger. (Perhaps, given the apparent 'momentum' of new discoveries, all extant hashes should be looked upon with extra wariness. But no recent results specifically impugn either tiger or TigerTree, as far as I know.)

      Interesting consideration that larger files provide more 'hook points' against which isomorph ranges could be inserted.. I hadn't seen that pointed out before, though I suppose it makes a certain intuitive sense...

    3. Re:KZHASH clarified, TigerTree? by Effugas · · Score: 1

      Bah, that's right, I forgot Tiger Trees didn't just refer to the tree mechanism but also the fundamental hash in play.

      Regarding the 'hook points' -- a 1GB file has 15M intermediate hashes; this is approximately 2^24. So a 128 bit hash ends up getting dropped down to a strength of 2^104 vs. second preimage. Not a problem.

      Now, if you have truncated hashes, it's a different story. Against a 64 bit truncation, it would only take 2^40 tries to collide somewhere inside the file. However, each collision would indeed be vaguely painful to compute, due to the MD-hardening at the end of the file. You still need to end up with a correctly sized file for the final hash to come out the same! So you can't just hash something once and see if it matches a list of intermediate values...you need to hash your desired payload combined with enough extra data to get you to the intermediate hash point. If I'm thinking of this right...bleagh. It means you end up doing much more work than simply creating a "fixit" block after your malicious payload is complete.

      Annoying.

      Do Tiger Trees encode the final size of the file?

    4. Re:KZHASH clarified, TigerTree? by gojomo · · Score: 1

      No, there's no special encoding/padding of file size, beyond what happens for the last, often odd-sized leaf node.

  283. Direct Connect by THE+ROCK · · Score: 1

    Bad files have been around for a few years now. They are the main reason I stopped using KLite and searched out something better.

    Use DC++. All hubs are policed by hub owners and hub operators. When you find somebody sharing a garbage file, you just have to tell an op. The op can then tell that person to remove that file and if they don't they are banned.

    The fundamental problem with kazaa and similar p2p networks is the lack of ability to deal with "bad" users who share bogus files and such. There is an easy solution to this found at http://dcplusplus.sourceforge.net/.