Elementary secure-multiparty computation for massive-scale collaborative network monitoring: A quantitative assessment

Explore this paper's citation graph

Summary

Two possible schemes: the Shamir's Secret Sharing (SSS) based on polynomial interpolation on prime fields and the Globally-Constrained Randomization (GCR) scheme based on simple blinding are considered, which show that additions via GCR are faster than via SSS, and that the relative performance gain increases when scaling up the data volume and/or number of participants, and when network conditions get worse.

Type
article
Published
2013-12-01
Cited by
2
References
24
Access
Open access

Keywords

Computer science, Scalability, Liveness, Context (archaeology), Overhead (engineering)

References

Cited by

Related papers