If you’re curious about the matter, there’s an alternative technique called differential privacy that adds randomization to the data, and is able to provide guarantees that individual records cannot be identified. k-anonymity is subject to e.g. linkage attacks of the kind that differential privacy seeks to eliminate.
Bonus: The differential privacy algorithm is so simple. "When you're about to insert some data, flip a coin. If it's heads, insert it as-is. If it's tails, insert a random value."
