Cryptology ePrint Archive: Report 2015/292

Secret Shared Random Access Machine

Shlomi Dolev and Yin Li

Abstract: Secure and private computations over RAM are preferred over computations with circuits or Turing machines. Secure and private RAM executions become more and more important in the scope avoiding information leakage when executing programs over a single computer as well as over the clouds. In this paper, we propose a distributed scheme for evaluating RAM programs without revealing any information on the computation including the program the data and the result. We use the Shamir secret sharing to share all the program instructions and private string matching technique to ensure the execution of the right instruction sequence. We stress that our scheme obtains information theoretic security and does not rely on any computational hardness assumptions, therefore, gaining indefinite private and secure RAM execution of perfectly unrevealed programs.

Category / Keywords: foundations / Random access machine, secret sharing, information theoretic security

Date: received 28 Mar 2015

Contact author: yunfeiyangli at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20150401:134123 (All versions of this report)

Short URL: ia.cr/2015/292

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]