Cryptology ePrint Archive: Report 2008/289
Sharemind: a framework for fast privacy-preserving computations
Dan Bogdanov and Sven Laur and Jan Willemson
Abstract: Gathering and processing sensitive data is a difficult task. In fact, there is no common recipe for building the necessary information systems. In this paper, we present a provably secure and efficient general-purpose computation system to address this problem. Our solution - SHAREMIND - is a virtual machine for privacy-preserving data processing that relies on share computing techniques. This is a standard way for securely evaluating functions in a multi-party computation environment. The novelty of our solution is in the choice of the secret sharing scheme and the design of the protocol suite. We have made many practical decisions to make large-scale share computing feasible in practice. The protocols of SHAREMIND are information-theoretically secure in the honest-but-curious model with three computing participants. Although the honest-but-curious model does not tolerate malicious participants, it still provides significantly increased privacy preservation when compared to standard centralised databases.
Category / Keywords: implementation / privacy preserving data mining, share computing
Publication Info: Full version of a paper that will be published at ESORICS 2008.
Date: received 27 Jun 2008
Contact author: db at math ut ee
Available format(s): PDF | BibTeX Citation
Version: 20080703:190107 (All versions of this report)
Short URL: ia.cr/2008/289
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]