Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
We consider the problem of reconstructing a shared secret in the presence of faulty shares, with unconditional security. We require that any t shares give no information on the shared secret, and reconstruction is possible even if up to t out of the n shares are incorrect. The interesting setting is n/3
Damian Vizár, Reza Reyhanitabar, Emiljano Gjiriti
Serge Vaudenay, Andrea Felice Caforio, Daniel Patrick Collins, Hailun Yan