Paper 2011/244

PRISM -- Privacy-Preserving Search in MapReduce

Erik-Oliver Blass, Roberto Di Pietro, Refik Molva, and Melek Onen


We present PRISM, a privacy-preserving scheme for word search in cloud computing. In the face of a curious cloud provider, the main challenge is to design a scheme that achieves privacy while preserving the efficiency of cloud computing. Solutions from related research, like encrypted keyword search or Private Information Retrieval (PIR), fall short of meeting real-world cloud requirements and are impractical. PRISM's idea is to transform the problem of word search into a set of parallel instances of PIR on small datasets. Each PIR instance on a small dataset is efficiently solved by a node in the cloud during the ``Map'' phase of MapReduce. Outcomes of map computations are then aggregated during the ``Reduce'' phase. Due to the linearity of PRISM, the simple aggregation of map results yields the final output of the word search operation. We have implemented PRISM on Hadoop MapReduce and evaluated its efficiency using real-world DNS logs. PRISM's overhead over non-private search is only 11%. Thus, PRISM offers privacy-preserving search that meets cloud computing efficiency requirements. Moreover, PRISM is compatible with standard MapReduce, not requiring any change to the interface or infrastructure.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Cloud computingsecurityprivacyword searchMapReduce
Contact author(s)
blass @ ccs neu edu
2012-05-09: last of 6 revisions
2011-05-18: received
See all versions
Short URL
Creative Commons Attribution


      author = {Erik-Oliver Blass and Roberto Di Pietro and Refik Molva and Melek Onen},
      title = {PRISM -- Privacy-Preserving Search in MapReduce},
      howpublished = {Cryptology ePrint Archive, Paper 2011/244},
      year = {2011},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.