Cryptology ePrint Archive: Report 2010/499

Secure Computations on Non-Integer Values

M. Franz and B. Deiseroth and K. Hamacher and S. Jha and 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.

Category / Keywords:

Date: received 28 Sep 2010

Contact author: mfranz at seceng informatik tu-darmstadt de

Available format(s): PDF | BibTeX Citation

Version: 20100929:024344 (All versions of this report)

Short URL: ia.cr/2010/499

Discussion forum: Show discussion | Start new discussion