Paper 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.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
secure floating-point arithmeticssatellite collision analysisbenchmark results
Contact author(s)
liina @ cyber ee
History
2013-12-17: received
Short URL
https://ia.cr/2013/850
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/850,
      author = {Liina Kamm and Jan Willemson},
      title = {Secure Floating-Point Arithmetic and Private Satellite Collision Analysis},
      howpublished = {Cryptology ePrint Archive, Paper 2013/850},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/850}},
      url = {https://eprint.iacr.org/2013/850}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.