Cryptology ePrint Archive: Report 2011/482

Secure Computation with Sublinear Amortized Work

Dov Gordon and Jonathan Katz and Vladimir Kolesnikov and Tal Malkin and Mariana Raykova and Yevgeniy Vahlis

Abstract: Traditional approaches to secure computation begin by representing the function $f$ being computed as a circuit. For any function~$f$ that depends on each of its inputs, this implies a protocol with complexity at least linear in the input size. In fact, linear running time is inherent for secure computation of non-trivial functions, since each party must ``touch'' every bit of their input lest information about other party's input be leaked. This seems to rule out many interesting applications of secure computation in scenarios where at least one of the inputs is huge and sublinear-time algorithms can be utilized in the insecure setting; private database search is a prime example.

We present an approach to secure two-party computation that yields sublinear-time protocols, in an amortized sense, for functions that can be computed in sublinear time on a random access machine~(RAM). Furthermore, a party whose input is ``small'' is required to maintain only small state. We provide a generic protocol that achieves the claimed complexity, based on any oblivious RAM and any protocol for secure two-party computation. We then present an optimized version of this protocol, where generic secure two-party computation is used only for evaluating a small number of simple operations.

Category / Keywords: cryptographic protocols / amortized sublinear secure computation, oblivious RAM, RAM compiler

Date: received 6 Sep 2011, last revised 8 Sep 2011

Contact author: mariana at cs columbia edu

Available format(s): PDF | BibTeX Citation

Version: 20110908:185138 (All versions of this report)

Short URL:

[ Cryptology ePrint archive ]