This alert has been successfully added and will be sent to: You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below. Manage my AlertsBy allowing a large number of users to behave as readers or writers, Multi-User Searchable Encryption (MUSE) raises new security and performance challenges beyond the typical requirements of Symmetric Searchable Encryption (SSE). In this paper we identify two core mandatory requirements of MUSE protocols being privacy in face of users colluding with the CSP and low complexity for the users, pointing that no existing MUSE protocol satisfies these two requirements at the same time. We then come up with the first MUSE protocol that satisfies both of them. The design of the protocol also includes new constructions for a secure variant of Bloom Filters (BFs) and multi-query Oblivious Transfer (OT).
Muhammad Rizwan Asghar, Giovanni Russello, Bruno Crispo, and Mihaela Ion. 2013. Supporting complex queries and access policies for multi-user encrypted databases CCSW'13, Proceedings of the 2013 ACM Cloud Computing Security Workshop, Co-located with CCS 2013, Berlin, Germany, November 4, 2013. 77--88.
Feng Bao, Robert H. Deng, Xuhua Ding, and Yanjiang Yang. 2008. Private Query on Encrypted Data in Multi-user Settings Information Security Practice and Experience, 4th International Conference, ISPEC 2008, Sydney, Australia, April 21--23, 2008, Proceedings. 71--85.
Erik-Oliver Blass, Roberto Di Pietro, Refik Molva, and Melek Önen. 2012. PRISM - Privacy-Preserving Search in MapReduce. In Privacy Enhancing Technologies - 12th International Symposium, PETS 2012, Vigo, Spain, July 11--13, 2012. Proceedings. 180--200.
Dan Boneh, Giovanni Di Crescenzo, Rafail Ostrovsky, and Giuseppe Persiano. 2004. Public Key Encryption with Keyword Search. In Advances in Cryptology - EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2--6, 2004, Proceedings. 506--522.
Andrei Z. Broder and Michael Mitzenmacher. 2003. Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics Vol. 1, 4 (2003), 485--509.
Christoph Bösch, Pieter Hartel, Willem Jonker, and Andreas Peter. 2014. A Survey of Provably Secure Searchable Encryption. Comput. Surveys Vol. 47, 2 (Aug. 2014), 1--51. 9/CloudCom.2011.43
Fangming Zhao, Takashi Nishide, and Kouichi Sakurai. 2011. Multi-User Keyword Search Scheme for Secure Data Sharing with Fine-Grained Access Control. In Information Security and Cryptology - ICISC 2011 - 14th International Conference, Seoul, Korea, November 30 - December 2, 2011. Revised Selected Papers. 406--418.