Chapter

Advances in Cryptology – EUROCRYPT 2013

Volume 7881 of the series Lecture Notes in Computer Science pp 719-734

How to Garble RAM Programs?

  • Steve LuAffiliated withStealth Software Technologies, Inc.
  • , Rafail OstrovskyAffiliated withDepartment of Computer Science and Department of Mathematics, UCLA

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Assuming solely the existence of one-way functions, we show how to construct Garbled RAM Programs (GRAM) where its size only depends on fixed polynomial in the security parameter times the program running time. We stress that we avoid converting the RAM programs into circuits. As an example, our techniques implies the first garbled binary search program (searching over sorted encrypted data stored in a cloud) which is poly-logarithmic in the data size instead of linear. Our result requires the existence of one-way function and enjoys the same non-interactive properties as Yao’s original garbled circuits.

Keywords

Secure Computation Oblivious RAM Garbled Circuits