Theory of Cryptography Conference

TCC 2016: Theory of Cryptography pp 3-30

Delegating RAM Computations with Adaptive Soundness and Privacy

  • Prabhanjan Ananth
  • Yu-Chi Chen
  • Kai-Min Chung
  • Huijia Lin
  • Wei-Kai Lin
Conference paper

DOI: 10.1007/978-3-662-53644-5_1

Volume 9986 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Ananth P., Chen YC., Chung KM., Lin H., Lin WK. (2016) Delegating RAM Computations with Adaptive Soundness and Privacy. In: Hirt M., Smith A. (eds) Theory of Cryptography. TCC 2016. Lecture Notes in Computer Science, vol 9986. Springer, Berlin, Heidelberg

Abstract

We consider the problem of delegating RAM computations over persistent databases. A user wishes to delegate a sequence of computations over a database to a server, where each computation may read and modify the database and the modifications persist between computations. Delegating RAM computations is important as it has the distinct feature that the run-time of computations maybe sub-linear in the size of the database.

We present the first RAM delegation scheme that provide both soundness and privacy guarantees in the adaptive setting, where the sequence of delegated RAM programs are chosen adaptively, depending potentially on the encodings of the database and previously chosen programs. Prior works either achieved only adaptive soundness without privacy [Kalai and Paneth, ePrint’15], or only security in the selective setting where all RAM programs are chosen statically [Chen et al. ITCS’16, Canetti and Holmgren ITCS’16].

Our scheme assumes the existence of indistinguishability obfuscation (\(\mathsf {i}\mathcal {O}\)) for circuits and the decisional Diffie-Hellman (DDH) assumption. However, our techniques are quite general and in particular, might be applicable even in settings where iO is not used. We provide a “security lifting technique” that “lifts” any proof of selective security satisfying certain special properties into a proof of adaptive security, for arbitrary cryptographic schemes. We then apply this technique to the delegation scheme of Chen et al. and its selective security proof, obtaining that their scheme is essentially already adaptively secure. Because of the general approach, we can also easily extend to delegating parallel RAM (PRAM) computations. We believe that the security lifting technique can potentially find other applications and is of independent interest.

Copyright information

© International Association for Cryptologic Research 2016

Authors and Affiliations

  • Prabhanjan Ananth
    • 1
  • Yu-Chi Chen
    • 2
  • Kai-Min Chung
    • 2
  • Huijia Lin
    • 3
  • Wei-Kai Lin
    • 4
  1. 1.Center for Encrypted FunctionalitiesUniversity of California Los AngelesLos AngelesUSA
  2. 2.Academia SinicaTaipeiTaiwan
  3. 3.University of CaliforniaSanta BarbaraUSA
  4. 4.Cornell UniversityIthacaUSA