Enhancing Secure Multi-Party Computation with Damgård-Jurik and NIZK Proofs: A Lightweight Protocol for Scalable Aggregation

Read the full article See related articles

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

This paper introduces a secure sum protocol using the Damgrd-Jurik cryptosystem, implemented and evaluated within an experimental setup that considers both vertical and horizontal partitioning. The proposed protocol offers significant improvements in privacy and efficiency due to its homomorphic properties and the conceptual enhancement of the protocol, where only a single piece of data needs to be encrypted per party, since the sum of each party’s data is performed locally. Furthermore, the practical feasibility of this protocol is reinforced by the proof-of-concept and performance evaluation, demonstrating its effectiveness and efficiency in handling large datasets. The findings underscore the protocol’s ability to maintain data privacy through encryption and ensure result integrity via Non-Interactive Zero-Knowledge Proofs (NIZK). The results and evaluations presented herein support its potential practical applicability.

Article activity feed