Oblivious scalar-product protocols

Abstract

In this paper, a new notion which we call oblivious scalar-product protocols is introduced and formalized. We then propose an efficient implementation of oblivions scalar-product protocols based on homomorphic cryptographic primitives (e.g., homomorphic encryptions and homomorphic commitments). Finally we show that our implementation is provably secure assuming that the underlying Fujisaki-Okamoto's commitment scheme is statistically hiding and computationally binding, and Paillier's encryption scheme is semantically secure in the common reference string model. © Springer-Verlag Berlin Heidelberg 2006.