skip to main content
10.1145/3201595.3201597acmconferencesArticle/Chapter ViewAbstractPublication PagessccConference Proceedingsconference-collections
research-article

Secure and Scalable Multi-User Searchable Encryption

Published: 23 May 2018 Publication History

Abstract

By 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).

References

[1]
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.
[2]
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.
[3]
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.
[4]
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.
[5]
Andrei Z. Broder and Michael Mitzenmacher. 2003. Survey: Network Applications of Bloom Filters: A Survey. Internet Mathematics Vol. 1, 4 (2003), 485--509.
[6]
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
[7]
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.

Cited By

View all
  • (2025)Multi-User Searchable EncryptionEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1476(1616-1618)Online publication date: 8-Jan-2025
  • (2024)Cross-User Leakage Mitigation for Authorized Multi-User Encrypted Data SharingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.333324419(1213-1226)Online publication date: 2024
  • (2023)Multi-User Dynamic Searchable Symmetric Encryption With Corrupted ParticipantsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.312754620:1(114-130)Online publication date: 1-Jan-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
SCC '18: Proceedings of the 6th International Workshop on Security in Cloud Computing
May 2018
71 pages
ISBN:9781450357593
DOI:10.1145/3201595
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 2018

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. multi-user searchable encryption
  2. searchable encryption

Qualifiers

  • Research-article

Funding Sources

  • H2020-EU.2.1.1.
  • EU FP7 ERANET

Conference

ASIA CCS '18
Sponsor:

Acceptance Rates

SCC '18 Paper Acceptance Rate 6 of 17 submissions, 35%;
Overall Acceptance Rate 64 of 159 submissions, 40%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)58
  • Downloads (Last 6 weeks)8
Reflects downloads up to 17 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2025)Multi-User Searchable EncryptionEncyclopedia of Cryptography, Security and Privacy10.1007/978-3-030-71522-9_1476(1616-1618)Online publication date: 8-Jan-2025
  • (2024)Cross-User Leakage Mitigation for Authorized Multi-User Encrypted Data SharingIEEE Transactions on Information Forensics and Security10.1109/TIFS.2023.333324419(1213-1226)Online publication date: 2024
  • (2023)Multi-User Dynamic Searchable Symmetric Encryption With Corrupted ParticipantsIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2021.312754620:1(114-130)Online publication date: 1-Jan-2023
  • (2023)Multi-User Collusion-Resistant Searchable Encryption for Cloud StorageIEEE Transactions on Cloud Computing10.1109/TCC.2023.3249189(1-16)Online publication date: 2023
  • (2023)Efficient and Secure Spatial Range Query over Large-scale Encrypted Data2023 IEEE 43rd International Conference on Distributed Computing Systems (ICDCS)10.1109/ICDCS57875.2023.00055(1-11)Online publication date: Jul-2023
  • (2023)One for all: Efficient verifiable dynamic multi-user searchable encryption in the presence of corrupted usersJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2023.10170335:8(101703)Online publication date: Sep-2023
  • (2023)Recent Advancements on Functionality and PerformanceSearchable Encryption10.1007/978-3-031-21377-9_4(47-76)Online publication date: 5-Jan-2023
  • (2022)A Hierarchical Searchable Encryption Scheme Using Blockchain-Based IndexingElectronics10.3390/electronics1122383211:22(3832)Online publication date: 21-Nov-2022
  • (2022)Hardening secure search in encrypted database: a KGA-resistance conjunctive searchable encryption scheme from latticeSoft Computing10.1007/s00500-022-07469-y26:21(11139-11151)Online publication date: 12-Sep-2022
  • (2022)IntroductionSearchable Encryption10.1007/978-3-031-21377-9_1(1-15)Online publication date: 15-Nov-2022
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media