Efficient Recovery of a Shared Secret via Cooperation: Applications to SDMM and PIR
share
This work considers the problem of privately outsourcing the computation of a matrix product over a finite field 𝔽_q to N helper servers. These servers are considered to be honest but curious, i.e., they behave according to the protocol but will try to deduce information about the user's data. Furthermore, any set of up to X servers is allowed to share their data. Previous works considered this collusion a hindrance and the download cost of the schemes increases with growing X. We propose to utilize such linkage between servers to the user's advantage by allowing servers to cooperate in the computational task. This leads to a significant gain in the download cost for the proposed schemes. The gain naturally comes at the cost of increased communication load between the servers. Hence, the proposed cooperative scheme can be understood as outsourcing both computational cost and communication cost. While the present work exemplifies the proposed server cooperation in the case of a specific secure distributed matrix multiplication (SDMM) scheme, the same idea applies to many other use cases as well. For instance, other SDMM schemes as well as linear private information retrieval (PIR) as a special case of SDMM are instantly covered.
READ FULL TEXT
