Internet Archive Scholar

Lightweight Self-Bootstrapping Multiparty Computations of Time-Series Data with Custom Collusion Tolerance [article]

Michael Clear and Constantinos Patsakis and Paul Laird
2014 arXiv   pre-print

Preserved Fulltext

fulltext thumbnail
Web Archive Capture PDF (398.2 kB)
https://web.archive.org/web/20200902171032/https://arxiv.org/pdf/1402.7118v1.pdf

A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL. The file type is application/pdf.

In this work we compare two recent multiparty computation (MPC) protocols for private summation in terms of performance. Both protocols allow multiple rounds of aggregation from the same set of public keys generated by parties in an initial stage. We instantiate the protocols with a fast elliptic curve and provide an experimental comparison of their performance for different phases of the protocol. Furthermore, we introduce a technique that allows the computational load of both protocols to be
more » ... educed at the expense of protection against collusion tolerance. We prove that both protocols remain secure with this technique, and evaluate its impact on collusion tolerance and the number of rounds supported.
arXiv:1402.7118v1 fatcat:zahpok5iozhvfn6b5iypufza3y
Open Access
Citation

Michael Clear and Constantinos Patsakis and Paul Laird. "Lightweight Self-Bootstrapping Multiparty Computations of Time-Series Data with Custom Collusion Tolerance." arXiv (2014)