Cryptology ePrint Archive: Report 2013/850

Secure Floating-Point Arithmetic and Private Satellite Collision Analysis

Liina Kamm and Jan Willemson

Abstract: In this paper we show that it is possible and, indeed, feasible to use secure multiparty computation for calculating the probability of a collision between two satellites. For this purpose, we first describe basic floating-point arithmetic operators (addition and multiplication) for multiparty computations. The operators are implemented on the SHAREMIND secure multiparty computation engine. We discuss the implementation details, provide methods for evaluating example elementary functions (inverse, square root, exponentiation of e, error function). Using these primitives, we implement a satellite conjunction analysis algorithm and give benchmark results for the primitives as well as the conjunction analysis itself.

Category / Keywords: implementation / secure floating-point arithmetics, satellite collision analysis, benchmark results

Date: received 16 Dec 2013

Contact author: liina at cyber ee

Available format(s): PDF | BibTeX Citation

Version: 20131217:154023 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]