the input data is encrypted by different public keys, at last when the result parties get the output, how could they decrypt? using different secret key to try? and in the computing nodes, how could they compute over the encrypted data? since the the data in computing nodes have been encrypted, so why there's still a need to let them be in random sequence and why still need to split data? because in my minde, encryption has provided protection.
According to me: The input data is encrypted with the Public Key of the Computing Nodes, so that computing nodes can decrypt it for computation and at last the aggregate data is encrypted with Public Key of the Result Parties so that they can use the resulted data...
True, the video only shows it only gives output to the mean value of all salaries. Maybe with the mean they could calculate the difference to their salary and go through the process again. Then all people below that mean of the difference value repeat the process, until only one person falls under that condition. With that you can rule out Bobby to have the highest salary
As a matter a fact you can follow the same principles as explained. In its most simple form, max salary can be calculated using max(a,b)=1/2(a+b+|a−b|).
@@joe3342 thanks alot,,, but may i ask how that can work if i have more than two Salaries. My main task is that im trying to get the highiest bid in an anonymous auction using MPC concept
Great explanation ❤
the input data is encrypted by different public keys, at last when the result parties get the output, how could they decrypt? using different secret key to try?
and in the computing nodes, how could they compute over the encrypted data?
since the the data in computing nodes have been encrypted, so why there's still a need to let them be in random sequence and why still need to split data? because in my minde, encryption has provided protection.
According to me: The input data is encrypted with the Public Key of the Computing Nodes, so that computing nodes can decrypt it for computation and at last the aggregate data is encrypted with Public Key of the Result Parties so that they can use the resulted data...
Great vid so many awful explanations of mpc on youtube this is brilliant thank you!
is homomorphic encryption used here?
Amazing
What if i wanna compute the max or highest salary???
True, the video only shows it only gives output to the mean value of all salaries.
Maybe with the mean they could calculate the difference to their salary and go through the process again. Then all people below that mean of the difference value repeat the process, until only one person falls under that condition. With that you can rule out Bobby to have the highest salary
As a matter a fact you can follow the same principles as explained. In its most simple form, max salary can be calculated using max(a,b)=1/2(a+b+|a−b|).
@@joe3342 thanks alot,,, but may i ask how that can work if i have more than two Salaries. My main task is that im trying to get the highiest bid in an anonymous auction using MPC concept
*👍класс и привет от тренера по футболу!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!*