Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation
Cryptography and Security
2010-02-12 v1
Abstract
Secure sum computation of private data inputs is an important component of Secure Multi party Computation (SMC).In this paper we provide a protocol to compute the sum of individual data inputs with zero probability of data leakage. In our proposed protocol we break input of each party into number of segments and change the arrangement of the parties such that in each round of the computation the neighbors are changed. In this protocol it becomes impossible for semi honest parties to know the private data of some other party.
Cite
@article{arxiv.1002.2409,
title = {Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation},
author = {Rashid Sheikh and Beerendra Kumar and Durgesh Kumar Mishra},
journal= {arXiv preprint arXiv:1002.2409},
year = {2010}
}
Comments
IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http://sites.google.com/site/ijcsis/