Simulation of Collision Resistant Secure Sum Protocol

TL;DR

This paper presents both theoretical analysis and experimental implementation of a secure sum protocol in multi-party computation, focusing on data security, efficiency, and complexity metrics.

Contribution

It provides the first combined theoretical and experimental evaluation of Shukla et al.'s secure sum protocol implemented in Visual C++.

Findings

Data outflow probability varies with parameters.

Time and space complexity are quantified.

Implementation demonstrates practical feasibility.

Abstract

secure multi-party computation is widely studied area in computer science. It is touching all most every aspect of human life. This paper demonstrates theoretical and experimental results of one of the secure multi-party computation protocols proposed by Shukla et al. implemented using visual C++. Data outflow probability is computed by changing parameters. At the end, time and space complexity is calculated using theoretical and experimental results.