Paper 2010/499
Secure Computations on Non-Integer Values
M. Franz, B. Deiseroth, K. Hamacher, S. Jha, S. Katzenbeisser, and H. Schroeder
Abstract
In this paper we present for the first time a framework that allows secure two-party computations on approximations of real valued signals. In our solution, we use a quantized logarithmic representation of the signal samples, which enables to represent both very small and very large numbers with bounded relative error. We show that numbers represented in this way can be encrypted using standard homomorphic encryption schemes; furthermore we give protocols that allow to perform all arithmetic operations on such encrypted values. Finally we demonstrate the practicality of our framework by applying it to the problem of filtering encrypted signals.
Metadata
- Available format(s)
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- mfranz @ seceng informatik tu-darmstadt de
- History
- 2010-09-29: received
- Short URL
- https://ia.cr/2010/499
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/499, author = {M. Franz and B. Deiseroth and K. Hamacher and S. Jha and S. Katzenbeisser and H. Schroeder}, title = {Secure Computations on Non-Integer Values}, howpublished = {Cryptology {ePrint} Archive, Paper 2010/499}, year = {2010}, url = {https://eprint.iacr.org/2010/499} }