Department of Mathematics
Server

Since 1979, \( (k,n) \) secret sharing schemes have been of interest to the cryptographic community, though in their original inception - and many present cases - they have issues with reuse over multiple secrets. This talk will focus on the concept of reusable shares, a remedy to this issue, and I'll provide several examples of schemes possessing such feature. Afterwards will be given conclusion as to any generalities between these schemes.