Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation

Details Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation

2010-02-11

arxiv.org/abs/1002.2409v1

International Journal of Computer Science and Information Security, IJCSIS, Vol. 7, No. 1, pp. 239-243, January 2010, USA

Computer Science

Cryptography and Security

IEEE format, International Journal of Computer Science and Information Security, IJCSIS January 2010, ISSN 1947 5500, http:/

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Changing Neighbors k Secure Sum Protocol for Secure Multi Party Computation will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-69125