this post was submitted on 19 Dec 2024
23 points (100.0% liked)

Technology

37801 readers
230 users here now

A nice place to discuss rumors, happenings, innovations, and challenges in the technology sphere. We also welcome discussions on the intersections of technology and society. If it’s technological news or discussion of technology, it probably belongs here.

Remember the overriding ethos on Beehaw: Be(e) Nice. Each user you encounter here is a person, and should be treated with kindness (even if they’re wrong, or use a Linux distro you don’t like). Personal attacks will not be tolerated.

Subcommunities on Beehaw:


This community's icon was made by Aaron Schneider, under the CC-BY-NC-SA 4.0 license.

founded 2 years ago
MODERATORS
all 8 comments
sorted by: hot top controversial new old
[–] t3rmit3@beehaw.org 5 points 1 week ago* (last edited 1 week ago) (2 children)

I'm extremely wary of any law that can be used to censor or otherwise remove material online, but one gripe i have with the Techdirt article is their assertion that hash matching is expensive or difficult.

Generating a SHA hash of an image when uploaded is very inexpensive in terms of processing, and there's already going to be a db somewhere that stores the image metadata, so it's not like putting the hash there is hard. Similarly, a simple No/SQL lookup for a known hash is incredibly simple and non-intensive.

The real issue is the lack of an appeal mechanism, the lack of penalty for, or legal mechanism to, ignore false reports (which should probably be about spam/ volume of requests, rather than single requests), and the lack of definition around what exactly a site must do to show good-faith, reasonable compliance.

[–] jarfil@beehaw.org 8 points 6 days ago (2 children)

Depends on "how identical" is "identical".

The SHA hash of a file, is easy to calculate, but pretty much useless at detecting similar images; change a single bit, and the SHA hash changes.

In order to detect similar content, you need perceptual hashes, which are no longer that easy to calculate.

[–] chicken@lemmy.dbzer0.com 1 points 6 days ago (1 children)
[–] vrighter@discuss.tchncs.de 6 points 6 days ago (1 children)

because of the "perceptual" part.

A normal hash has the property that it produces wildly different hashes for even the tiniest of changes in the file.

Perceptual hashing flips that requirement on its head, and therefore makes finding a suitable hash function much harder.

[–] chicken@lemmy.dbzer0.com 1 points 6 days ago

Oh, the way I read it it seemed like they were saying perceptual hashes used to be easier to calculate

[–] ryannathans@aussie.zone 4 points 6 days ago

Change one bit, now we have a brand new hash