Realizing NI-PSC Sample Clauses

Realizing NI-PSC. NI-PSC can be realized with a primitive known as Non- Interactive MPC (NI-MPC). We assume we are in the PKI (public key infrastructure) model where the parties know each other’s authentic public key. Then, in NI-MPC, each party need only send one message, which contains its input and the function to be evaluated. Given the messages from all parties, the desired function can be computed on the parties’ inputs. Choosing the function fj described in our protocol above as the function computed by NI-MPC would fully realize NI-PSC. Known constructions of NI-MPC rely on indistinguishability obfuscation (iO) [16], [17], which has not been realized from standard assumptions. Basing NI- MPC on standard assumptions is a stubbornly difficult open problem because NI-MPC for general functions implies iO. Since “pure” NI-PSC is so difficult to achieve under standard assumptions, we intend to consider various relaxations as part of future work in order to give constructions under standard assumptions.