Advertisement

Using Oblivious RAM in Genomic Studies

  • Nikolaos P. Karvelas
  • Andreas Peter
  • Stefan Katzenbeisser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10436)

Abstract

Since the development of tree-based Oblivious RAMs by Shi et al. it has become apparent that privacy preserving outsourced storage can be practical. Although most current constructions follow a client-server model, in many applications, such as Genome Wide Association Studies (GWAS), it is desirable that multiple entities can share data, while being able to hide access patterns not only from the server, but also from any other entities that can access parts of the data. Inspired by the efficiency and simplicity of Path-ORAM, in this work, we study an extension of Path-ORAM that allows oblivious sharing of data in a multi-client setting, so that accesses can be hidden from the server and from other clients. We address various challenges that emerge when using Path-ORAM in a multi-client setting, and prove that with adequate changes, Path-ORAM is still secure in a setting, where the clients are semi-honest, do not trust each other, but try to learn the access patterns of each other. We demonstrate our ORAM construction in a GWAS setting. Our experiments show that in databases storing \(2^{23}\) data blocks (corresponding to a database holding \(2^{17}\) blocks per client, capable of storing human genome in the form of SNPs, for 100 clients), the average query time is less than 7 s, yielding a secure and practical solution.

Keywords

Path-ORAM Multiple clients Genomic privacy 

Notes

Acknowledgments

This work has been funded by the DFG as part of project S5 within the CRC 1119 CROSSING, and by the Netherlands Organisation for Scientific Research (NWO) in the context of the CRIPTIM project.

References

  1. 1.
    Backes, M., Herzberg, A., Kate, A., Pryvalov, I.: Anonymous RAM. In: ESORICS 2016 (2016)Google Scholar
  2. 2.
    Bellare, M., Boldyreva, A., Desai, A., Pointcheval, D.: Key-privacy in public-key encryption. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 566–582. Springer, Heidelberg (2001). doi: 10.1007/3-540-45682-1_33CrossRefzbMATHGoogle Scholar
  3. 3.
    Brandon, M.C., Wallace, D.C., Baldi, P.: Data structures and compression algorithms for genomic sequence data. Bioinformatics 25, 1731–1738 (2009)CrossRefGoogle Scholar
  4. 4.
    Franz, M., Williams, P., Carbunar, B., Katzenbeisser, S., Peter, A., Sion, R., Sotakova, M.: Oblivious outsourced storage with delegation. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 127–140. Springer, Heidelberg (2012). doi: 10.1007/978-3-642-27576-0_11CrossRefGoogle Scholar
  5. 5.
    Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious RAMs. J. ACM 43, 431–473 (1996)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Golle, P., Jakobsson, M., Juels, A., Syverson, P.: Universal re-encryption for mixnets. In: Okamoto, T. (ed.) CT-RSA 2004. LNCS, vol. 2964, pp. 163–178. Springer, Heidelberg (2004). doi: 10.1007/978-3-540-24660-2_14CrossRefGoogle Scholar
  7. 7.
    Goodrich, M.T., Mitzenmacher, M.: Privacy-preserving access of outsourced data via oblivious RAM simulation. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6756, pp. 576–587. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-22012-8_46CrossRefGoogle Scholar
  8. 8.
    Karvelas, N.P., Peter, A., Katzenbeisser, S.: Blurry-ORAM: a multi-client oblivious storage architecture. IACR Cryptology ePrint Archive, p. 1077 (2016)Google Scholar
  9. 9.
    Karvelas, N., Peter, A., Katzenbeisser, S., Tews, E., Hamacher, K.: Privacy-preserving whole genome sequence processing through proxy-aided ORAM. In: WPES (2014)Google Scholar
  10. 10.
    Maffei, M., Malavolta, G., Reinert, M., Schröder, D.: Privacy and access control for outsourced personal records. In: IEEE Symposium on Security and Privacy (2015)Google Scholar
  11. 11.
    Mayberry, T., Blass, E.O., Noubir, G.: Multi-user oblivious RAM secure against malicious servers. IACR Cryptology ePrint Archive (2015)Google Scholar
  12. 12.
    Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197–214. Springer, Heidelberg (2011). doi: 10.1007/978-3-642-25385-0_11CrossRefGoogle Scholar
  13. 13.
    Stefanov, E., Shi, E.: Oblivistore: High performance oblivious distributed cloud data store. In: NDSS 2013 (2013)Google Scholar
  14. 14.
    Stefanov, E., Shi, E., Song, D.X.: Towards practical oblivious RAM. In: NDSS 2012 (2012)Google Scholar
  15. 15.
    Stefanov, E., van Dijk, M., Shi, E., Fletcher, C.W., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple oblivious RAM protocol. In: CCS 2013 (2013)Google Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  • Nikolaos P. Karvelas
    • 1
  • Andreas Peter
    • 2
  • Stefan Katzenbeisser
    • 1
  1. 1.TU DarmstadtDarmstadtGermany
  2. 2.University of TwenteEnschedeThe Netherlands

Personalised recommendations