Could anybody provide the seminal paper and/or every specific manual in mathematics that describes a secure multiparty computation procedure, where the players will exchange encrypted messages (possibly privately) of their secret that they share with each others. The share that they will give to every other player will differ (as it is done in a similar scheme with Shamir's sharing scheme) and in order to find the rule function $f(inputs)$ of the protocol of communication, they will need to create in first place the encrypted $Enc(f(\text{input of individual secrets}))=c(ouput)$ one. Then in order to find their output they will need a key, such that $k_i=c_i(outpout)$ and $output_i=c_i^{-1}(k_i)$ or something like this. My field of study is far away from cryptography, but taking a look in some seminal papers (like Ben-or and Rabin and Ben-or et al) I think that I am searching for something specific like the idea that I provided above. SI there any chance that someone knows some valuable information of such a paper, or a combination of papers in order to build such a protocol?
P.S. I have seen this lecture of Tal Rabin, where in some part she presents a combination of FHE and threshold crypto for multiparty computations and I think it is close to my idea... Could you provide more details and about the maths also?
