Paper 2008/289

Sharemind: a framework for fast privacy-preserving computations

Dan Bogdanov, Sven Laur, and Jan Willemson


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.

Available format(s)
Publication info
Published elsewhere. Full version of a paper that will be published at ESORICS 2008.
privacy preserving data miningshare computing
Contact author(s)
db @ math ut ee
2008-07-03: received
Short URL
Creative Commons Attribution


      author = {Dan Bogdanov and Sven Laur and Jan Willemson},
      title = {Sharemind: a framework for fast privacy-preserving computations},
      howpublished = {Cryptology ePrint Archive, Paper 2008/289},
      year = {2008},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.