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