Cryptology ePrint Archive: Report 2011/429

Round-efficient Oblivious Database Manipulation

Sven Laur and Jan Willemson and Bingsheng Zhang

Abstract: Most of the multi-party computation frameworks can be viewed as oblivious databases where data is stored and processed in a secret-shared form. However, data manipulation in such databases can be slow and cumbersome without dedicated protocols for certain database operations. In this paper, we provide efficient protocols for oblivious selection, filtering and shuffle---essential tools in privacy-preserving data analysis. As the first contribution, we present a $1$-out-of-$n$ oblivious transfer protocol with $O(\log\log n)$ rounds, which achieves optimal communication and time complexity and works over any ring $Z_N$. Secondly, we show that the round complexity $\tau_{bd}$ of a bit decomposition protocol can be almost matched with oblivious transfer, and that there exists an oblivious transfer protocol with $O(\tau_{bd}\log^*n)$ rounds. Finally, we also show how to construct round-efficient shuffle protocols with optimal asymptotic computation complexity and provide several optimizations.

Category / Keywords: cryptographic protocols / Secure multi-party computation, oblivious transfer, verifiable shuffle, oblivious filtering

Publication Info: Full version of a paper to be published at ISC2011

Date: received 9 Aug 2011

Contact author: jan willemson at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20110812:183130 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]