Tag Info

Hot answers tagged


Hint: you can notice that $n! > 2^n$ (except for very small $n$).


Assuming that the probability distributions of $\pi_{k_1}$ and $\pi_{k_2}$ are both uniform (that is, each permutation can take on any particular setting with probability $1/n!$), then no, adversary does not have enough information to learn anything about the original positions. This remains true even if we assume the adversary can perform unbounded ...

Only top voted, non community-wiki answers of a minimum length are eligible