Paper 2010/499

Secure Computations on Non-Integer Values

M. Franz, B. Deiseroth, K. Hamacher, S. Jha, S. Katzenbeisser, and H. Schroeder


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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Contact author(s)
mfranz @ seceng informatik tu-darmstadt de
2010-09-29: received
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.