摘要：In this paper, we focus on Elliptic Curve Cryptography
based approach for Secure Multiparty Computation (SMC) problem.
Widespread proliferation of data and the growth of communication technologies
have enabled collaborative computations among parties in distributed scenario.
Preserving privacy of data owned by parties is crucial in such scenarios.
Classical approach to SMC is to perform computation using Trusted Third Party (TTP).
However, in practical scenario, TTPs are hard to achieve and it is imperative
to eliminate TTP in SMC. In addition, existing solutions proposed for SMC use
classical homomorphic encryption schemes such as RSA and Paillier. Due to the
higher cost incurred by such cryptosystems, the resultant SMC protocols are not
scalable. We propose Elliptic Curve Cryptography (ECC) based
approach for SMC that is scalable in terms of computational and communication
cost and avoids TTP. In literature, there do exist various ECC based
homomorphic schemes and it is imperative to investigate and analyze these
schemes in order to select the suitable for a given application. In this paper,
we empirically analyze various ECC based homomorphic encryption schemes based
on performance metrics such as computational cost and communication cost. We
recommend an efficient algorithm amongst several selected ones,
that offers security with lesser overheads and can be applied in any application
demanding privacy.
