(Server-Aided) Two-Party Multiplication of Encrypted Shares Using (k, n) Threshold Secret Sharing With N ≥ k Servers
Two-party computation allows two clients to jointly compute an arbitrary function of their inputs without revealing these inputs to each other.In this study, we adopt a server-aided model, in which a set of computing servers performs computation using the inputs of two clients.In the (k, $n$ ) threshold secret sharing scheme, input $s$ is divided i