Secure Computation with Fixed-Point Numbers

Abstract. Secure computation is a promising approach to business problems in which several parties want to run a joint application and cannot reveal their inputs. Secure computation preserves the privacy of input data using cryptographic protocols, allowing the parties to obtain the benefits of data sharing and at the same time avoid the associated risks. These business applications need protocols that support all the primitive data types and allow secure protocol composition and efficient application development. Secure computation with rational numbers has been a challenging problem. We present in this paper a family of protocols for multiparty computation with rational numbers using fixed-point representation. This approach offers more efficient solutions for secure computation than other usual representations.

• Type: Conference
• Year: 2010
• Where: FC
• Authors: Octavian Catrina, Amitabh Saxena
• Keywords: Cryptology, FC 2010, Rational Numbers, Secure Computation, Secure Protocol Composition