How to Garble RAM Programs?
- Steve LuAffiliated withStealth Software Technologies, Inc.
- , Rafail OstrovskyAffiliated withDepartment of Computer Science and Department of Mathematics, UCLA
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.
KeywordsSecure Computation Oblivious RAM Garbled Circuits
- How to Garble RAM Programs?
- Book Title
- Advances in Cryptology – EUROCRYPT 2013
- Book Subtitle
- 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings
- pp 719-734
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- International Association for Cryptologic Research
- Additional Links
- Secure Computation
- Oblivious RAM
- Garbled Circuits
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 16. Dept. of Electrical and Information Technology, Lund University
- 17. Départment d’informatique, Ecole normale supérieure
- Author Affiliations
- 18. Stealth Software Technologies, Inc., USA
- 19. Department of Computer Science and Department of Mathematics, UCLA, USA
To view the rest of this content please follow the download PDF link above.