Published Paper Details:

In this research work, we investigate an Elliptic Curve Cryptography-based approach to Secure Multiparty Computation (SMC). The extensive availability of data and the advancement of communication technologies have made it feasible for people in a scattered settings to collaborate on computations. The confidentiality of the information shared between the parties is crucial. The conventional approach to SMC is to have a trusted third party (TTP) to do the calculations. TTPs are difficult to implement in practice, which is why eliminating them from SMC is so important. Traditional homomorphic encryption methods, such as RSA and Paillier, are also used in the current proposed solutions for SMC. The increased costs of utilizing such cryptosystems render the resultant SMC protocols unscalable. We propose an Elliptic Curve Cryptography (ECC)-based approach to SMC that is TTP-free and scalable (in terms of computational and communication cost). Research and study of the many ECC-based homomorphic schemes described in the literature is required in order to choose the most suitable scheme for a given application. We conduct an empirical analysis of the available ECC-based homomorphic encryption algorithms, contrasting their relative merits in terms of metrics like computational and transmission overhead. From a pool of viable options, we advise one that is both secure and efficient enough to be utilized for any work that has to be kept secret.