  We develop a connection between tripartite information $I_3$, secret sharing
protocols and multi-unitaries. This leads to explicit ((2,3)) threshold schemes
in arbitrary dimension minimizing tripartite information $I_3$. As an
application we show that Page scrambling unitaries simultaneously work for all
secrets shared by Alice. Using the $I_3$-Ansatz for imperfect sharing schemes
we discover examples of VIP sharing schemes.
