last week Hannes and I met in Munich to discuss the Geolocation
Policy draft. We decided to write a text to address the raised
concerns regarding the location obfuscation algorithm. The
problem is both when movement occurs and an update of the
obscured location is necessary, and also when repeatedly the
same location is visited and different obscured locations are
provided.
The new draft is:
http://www.ietf.org/internet-drafts/draft-ietf-geopriv-policy-22.txt
The idea of the proposed algorithm is that only a fixed set
of "cells" are used and the points in those cells are
indistinguishable. Only one variant of a general type of
algorithms is presented here, The details of the construction of
the grids and the calculations are spelled out for the so called
Mercator "secant projection",
(http://en.wikipedia.org/wiki/Scale_%28map%29#Secant.2C_or_modified.2C_projections).
You might also find the following slide sets interesting:
Ciao,
Jorge
_______________________________________________
Geopriv mailing list
Geopriv@ietf.org
https://www.ietf.org/mailman/listinfo/geopriv
