Efficient Secure Floating-point Arithmetic using Shamir Secret Sharing

Octavian Catrina

2019

Abstract

Successful deployment of privacy preserving collaborative applications, like statistical analysis, benchmarking, and optimizations, requires more efficient secure computation with real numbers. We present a complete family of protocols for secure floating-point arithmetic, constructed using a small set of building blocks that preserve data privacy using well known primitives based on Shamir secret sharing and related cryptographic techniques. Using new building blocks and optimizations and simpler secure fixed-point arithmetic, we obtain floating-point protocols with substantially improved efficiency.

Paper Citation

in Harvard Style

Catrina O. (2019). Efficient Secure Floating-point Arithmetic using Shamir Secret Sharing.In Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT, ISBN 978-989-758-378-0, pages 49-60. DOI: 10.5220/0007834100490060

in Bibtex Style

@conference{secrypt19,
author={Octavian Catrina},
title={Efficient Secure Floating-point Arithmetic using Shamir Secret Sharing},
booktitle={Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,},
year={2019},
pages={49-60},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007834100490060},
isbn={978-989-758-378-0},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 16th International Joint Conference on e-Business and Telecommunications - Volume 2: SECRYPT,
TI - Efficient Secure Floating-point Arithmetic using Shamir Secret Sharing
SN - 978-989-758-378-0
AU - Catrina O.
PY - 2019
SP - 49
EP - 60
DO - 10.5220/0007834100490060