An important problem in secret sharing schemes is minimizing the share size. For (k, n)-threshold
schemes and (k, L, n)-ramp schemes, constructions that minimize the share size are …

We study the equivalence between non-perfect secret sharing (NSS) and symmetric private
information retrieval (SPIR) with arbitrary response and collusion patterns. NSS and SPIR …

A secret sharing scheme is a cryptographic technique to protect a secret from loss and leakage
by dividing it into shares. A ramp secret sharing scheme can improve efficiency in terms …

Consider the problem of storing data in a distributed manner over T servers. Specifically, the
data needs to (i) be recoverable from any τ servers, and (ii) remain private from any z …

The Cloud-based storage is able to store more information in gigabyte size in all formats such
as text, image or video and it can access at any time with their login credentials. In such a …

Consider a user who wishes to store a file in multiple servers such that at least $t$ servers
are needed to reconstruct the file, and $z$ colluding servers cannot learn any information …

We consider the problem of storing data in a distributed manner over T servers. We require
the data (i) to be recoverable from the T servers, and (ii) to remain private from any T -1 …

This dissertation focuses on secure computation and learning from the perspective of
information-theoretic symmetric private information retrieval (SPIR). Private information retrieval (…