A zero-hacking protocol for secure multiparty computation using multiple TTP

We present a solution to the Secure Multi-party Computation (SMC) problem in the form of a protocol that ensures zero-hacking. The solution comprises of a protocol with several trusted third parties (TTPs) where there is a possibility of threat to the security. Our protocol unanimously selects one TTP among all TTPs in the SMC architecture that owns the responsibility of all the computation in the system. This TTP is called the master TTP and it is different at different times. The procedure of selecting master TTP could be non-deterministic but it is made deterministic by randomization technique. This ensures that no single TTP controls the entire system all the times. At the same time, this also ensures that no TTP knows where the computation is taking place. This approach is having merit over the other one where only one TTP is given the responsibility to hold entire data of the system. Hence, the chances of corruption can be reduce to negligible when we randomize the selection of one TTP instead of having unknown TTP. Our algorithm works on the concepts of multiple TTP to provide zero-hacking for the entire system owing to the situation that it becomes almost impossible for any party to break the security. Formally it is achieved by imposing high computational complexity on the parties.