Does Shamir's Sharing Scheme make sense if k=2 and n=2? Given that I have a secret which I want to split into 2 parts (n=2) and require 2 parts to restore it (k=2), does it still make sense to use Shamir's Scheme or would a trivial scheme with XOR (generate a random string, same long as the secret, XOR those, random string and the XOR result become shares) be just as secure? Are there any benefits in using Shamir's Scheme in such case?

In general, what would be the recommended sharing scheme for this use case?
Except for the extensibility (being able to latter add a third user), the trivial scheme with XOR works just as well as Shamir; the trivial scheme retains the following properties:


The length of each share is still as long as the original secret (in fact, you don't need to bother assigning share identifiers, which you have to with Shamir's scheme)
It is information theoretically secure.