Hacker News new | ask | show | jobs
by pageandrew 1761 days ago
What about a constant, random, per-match offset? An error applied to a match's position that can't be averaged out, because it is always wrong by the exact same amount. Use a different error in a different direction for each unique match so one can't figure it out once and apply it system wide.

I suppose the downside is that this could put someone else at risk if the tweaked position happens to be on top of their house.

2 comments

1. The attacker can use multiple accounts to collect data, so an offset specific to the viewer wouldn't work

2. If you can collect the offset location over a longer time, you can correlate it with likely travel paths (e.g. along major roads) to figure out what the offset is.

It’s the same thing but more time consuming.

If you knew this was happening, you’d create N accounts, match with the same person, and average queries over account pairs.

Also, if the error is constrained to be the same, then the attack is reduced to estimating the radius of a circle where you are given points on the perimeter, which you should be able to do in very few queries (3?). I haven’t worked out the triangulation math but you’d basically solve for x^2+y^2=r^2.