Secret Shared Random Access Machine

Shlomi Dolev; Yin Li

Paper 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.

Metadata

Available format(s): PDF
Category: Foundations
Publication info: Preprint. MINOR revision.
Keywords: Random access machine secret sharing information theoretic security
Contact author(s): yunfeiyangli @ gmail com
History: 2015-04-01: received
Short URL: https://ia.cr/2015/292
License: CC BY

BibTeX

@misc{cryptoeprint:2015/292,
      author = {Shlomi Dolev and Yin Li},
      title = {Secret Shared Random Access Machine},
      howpublished = {Cryptology {ePrint} Archive, Paper 2015/292},
      year = {2015},
      url = {https://eprint.iacr.org/2015/292}
}