research-article

Storage Efficient Substring Searchable Symmetric Encryption

Authors:

Iraklis Leontiadis,

Ming LiAuthors Info & Claims

SCC '18: Proceedings of the 6th International Workshop on Security in Cloud Computing

Pages 3 - 13

https://doi.org/10.1145/3201595.3201598

Published: 23 May 2018 Publication History

Abstract

We address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable encryption in order to reduce the storage cost of auxiliary data structures. Our solution entails a suffix array based index design, which allows optimal storage cost $O(n)$ with small hidden factor at the size of the string n. Moreover, we implemented our scheme and the state of the art protocol \citeChase to demonstrate the performance advantage of our solution with precise benchmark results.

References

[1]

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, and Stefan Kurtz. 2002. Optimal Exact String Matching Based on Suffix Arrays. In In Proceedings of the Ninth International Symposium on String Processing and Information Retrieval. SpringerVerlag, Lecture Notes in Computer Science.

Digital Library

[2]

Robert S. Boyer and J. Strother Moore. 1977. A Fast String Searching Algorithm. Commun. ACM 20, 10 (Oct. 1977), 762--772.

Digital Library

[3]

M. Burrows and D. J. Wheeler. 1994. A block-sorting lossless data compression algorithm. Technical Report.

[4]

David Cash, Stanislaw Jarecki, Charanjit S. Jutla, Hugo Krawczyk, Marcel-Catalin Rosu, and Michael Steiner. 2013. Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries. In Advances in Cryptology - CRYPTO 2013 - 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I. 353--373.

[5]

Yan-Cheng Chang and Michael Mitzenmacher. 2005. Privacy Preserving Keyword Searches on Remote Encrypted Data. In Proceedings of the Third International Conference on Applied Cryptography and Network Security (ACNS'05). SpringerVerlag, Berlin, Heidelberg, 442--455.

Digital Library

[6]

Melissa Chase and Seny Kamara. 2010. Structured Encryption and Controlled Disclosure. In Advances in Cryptology - ASIACRYPT 2010 - 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5--9, 2010. Proceedings. 577--594.

[7]

Melissa Chase and Emily Shen. 2015. Substring-Searchable Symmetric Encryption. PoPETs 2015, 2 (2015), 263--281. http://www.degruyter.com/view/j/popets.2015. 2015.issue-2/popets-2015-0014/popets-2015-0014.xml

[8]

Reza Curtmola, Juan Garay, Seny Kamara, and Rafail Ostrovsky. 2006. Searchable Symmetric Encryption: Improved Definitions and Efficient Constructions. In Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS '06). ACM, New York, NY, USA, 79--88.

Digital Library

[9]

Sky Faber, Stanislaw Jarecki, Hugo Krawczyk, Quan Nguyen, Marcel-Catalin Rosu, and Michael Steiner. 2015. Rich Queries on Encrypted Data: Beyond Exact Matches. In Computer Security - ESORICS 2015 - 20th European Symposium on Research in Computer Security, Vienna, Austria, September 21--25, 2015, Proceedings, Part II. 123--145.

[10]

Sebastian Faust, Carmit Hazay, and Daniele Venturi. 2013. Outsourced Pattern Matching. In Automata, Languages, and Programming, FedorV. Fomin, Rusins Freivalds, Marta Kwiatkowska, and David Peleg (Eds.). Lecture Notes in Computer Science, Vol. 7966. Springer Berlin Heidelberg, 545--556.

Digital Library

[11]

P. Ferragina and G. Manzini. 2000. Opportunistic Data Structures with Applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS '00). IEEE Computer Society, Washington, DC, USA, 390--. http://dl.acm.org/citation.cfm?id=795666.796543

Digital Library

[12]

Craig Gentry, Kenny A. Goldman, Shai Halevi, Charanjit S. Jutla, Mariana Raykova, and Daniel Wichs. 2013. Optimizing ORAM and Using It Efficiently for Secure Computation. In Privacy Enhancing Technologies - 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10--12, 2013. Proceedings. 1--18.

[13]

Gaston H. Gonnet, Ricardo A. Baeza-Yates, and Tim Snider. 1992. Information Retrieval. Prentice-Hall, Inc., Upper Saddle River, NJ, USA, Chapter New Indices for Text: PAT Trees and PAT Arrays, 66--82.

Digital Library

[14]

Juha Karkkainen and Peter Sanders. 2003. Simple Linear Work Suffix Array Construction. In Automata, Languages and Programming, 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings. 943--955.

Digital Library

[15]

Richard M. Karp and Michael O. Rabin. 1987. Efficient Randomized Patternmatching Algorithms. IBM J. Res. Dev. 31, 2 (March 1987), 249--260.

Digital Library

[16]

Donald E. Knuth, James H. Morris Jr., and Vaughan R. Pratt. 1977. Fast Pattern Matching in Strings. SIAM J. Comput. 6, 2 (1977), 323--350.

Digital Library

[17]

Iraklis Leontiadis and Ming Li. 2018. Storage Efficient Substring Searchable Symmetric Encryption. EPFL scientific publications, Report 254805. (2018). https: //infoscience.epfl.ch/record/254805.

[18]

Yehuda Lindell. 2016. How To Simulate It - A Tutorial on the Simulation Proof Technique. IACR Cryptology ePrint Archive 2016 (2016), 46. http://eprint.iacr.org/ 2016/046

[19]

Udi Manber and Gene Myers. 1990. Suffix Arrays: A New Method for On-line String Searches. In Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '90). Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 319--327.

Digital Library

[20]

Edward M. McCreight. 1976. A Space-Economical Suffix Tree Construction Algorithm. J. ACM 23, 2 (April 1976), 262--272.

Digital Library

[21]

Tarik Moataz and Erik-Oliver Blass. 2015. Oblivious Substring Search with Updates. Cryptology ePrint Archive, Report 2015/722. (2015). http://eprint.iacr. org/2015/722.

[22]

E. Ukkonen. 1958. On-line construction of suffix trees. Algorithmica 14, 3 (1958), 249--260.

Digital Library

[23]

Peter Weiner. 1973. Linear pattern matching algorithms. In Switching and Automata Theory, 1973. SWAT '08.

Digital Library

Cited By

Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3617991
Ngoc Hoang CHieu Nguyen MThu Thi Nguyen TQuang Vu H(2023)A novel method for designing indexes to support efficient substring queries on encrypted databasesJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2023.02.00835:3(20-36)Online publication date: Mar-2023
https://doi.org/10.1016/j.jksuci.2023.02.008
Bouscatié ÉCastagnos GSanders O(2023)Pattern Matching in Encrypted Stream from Inner Product EncryptionPublic-Key Cryptography – PKC 202310.1007/978-3-031-31368-4_27(774-801)Online publication date: 2-May-2023
https://doi.org/10.1007/978-3-031-31368-4_27
Show More Cited By

Index Terms

Storage Efficient Substring Searchable Symmetric Encryption
1. Networks
  1. Network properties
    1. Network security
      1. Security protocols
2. Security and privacy
  1. Database and storage security

Recommendations

Deniable Searchable Symmetric Encryption

In the recent years, Searchable Symmetric Encryption (SSE) has become one of the hottest topic in cloud-computing area because of its availability and flexibility, and there are a series of SSE schemes were proposed. The adversary considered in these ...
An efficient and secure searchable public key encryption scheme with privacy protection for cloud storage

In the area of searchable encryption, the searchable public key encryption (SPE) is an attractive technique in secure cloud storage. SPE assures the data confidentiality without affecting the usage of the data stored in the cloud. Furthermore, compared ...
Searchable Symmetric Encryption: Searchable symmetric encryption schemes review and prototype for secured file searching system

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

Program Chairs:
Aziz Mohaisen
University of Central Florida, USA
,
Qian Wang
Wuhan University, China

Copyright © 2018 ACM.

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 ACM 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

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 23 May 2018

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ASIA CCS '18

Sponsor:

SIGSAC

ASIA CCS '18: ACM Asia Conference on Computer and Communications Security

June 4, 2018

Incheon, Republic of Korea

Acceptance Rates

SCC '18 Paper Acceptance Rate 6 of 17 submissions, 35%;

Overall Acceptance Rate 64 of 159 submissions, 40%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
149
Total Downloads

Downloads (Last 12 months)10
Downloads (Last 6 weeks)0

Reflects downloads up to 22 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3617991
Ngoc Hoang CHieu Nguyen MThu Thi Nguyen TQuang Vu H(2023)A novel method for designing indexes to support efficient substring queries on encrypted databasesJournal of King Saud University - Computer and Information Sciences10.1016/j.jksuci.2023.02.00835:3(20-36)Online publication date: Mar-2023
https://doi.org/10.1016/j.jksuci.2023.02.008
Bouscatié ÉCastagnos GSanders O(2023)Pattern Matching in Encrypted Stream from Inner Product EncryptionPublic-Key Cryptography – PKC 202310.1007/978-3-031-31368-4_27(774-801)Online publication date: 2-May-2023
https://doi.org/10.1007/978-3-031-31368-4_27
Tahir STahir HTahir RRajarajan MAbbas H(2022)Water Is a Viable Data Storage Medium: A Security and Privacy ViewpointElectronics10.3390/electronics1105081811:5(818)Online publication date: 5-Mar-2022
https://doi.org/10.3390/electronics11050818
YAMAMOTO HODA RWACHI YFUJIWARA H(2022)Substring Searchable Symmetric Encryption Based on an Improved DAWGIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences10.1587/transfun.2021EAP1122E105.A:12(1578-1590)Online publication date: 1-Dec-2022
https://doi.org/10.1587/transfun.2021EAP1122
Okada MSuzuki TNishio NWaidyasooriya HHariyama M(2022)FPGA-Accelerated Searchable Encrypted Database Management Systems for Cloud ServicesIEEE Transactions on Cloud Computing10.1109/TCC.2020.296965510:2(1373-1385)Online publication date: 1-Apr-2022
https://doi.org/10.1109/TCC.2020.2969655
Yin FLu RZheng YTang X(2021)Achieve Efficient and Privacy-Preserving Compound Substring Query over CloudSecurity and Communication Networks10.1155/2021/79412332021Online publication date: 3-Dec-2021
https://dl.acm.org/doi/10.1155/2021/7941233
Mainardi NBarenghi APelosi G(2021)Privacy-aware Character Pattern Matching over Outsourced Encrypted DataDigital Threats: Research and Practice10.1145/34623333:1(1-38)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3462333
Bouscatié ÉCastagnos GSanders O(2021)Public Key Encryption with Flexible Pattern MatchingAdvances in Cryptology – ASIACRYPT 202110.1007/978-3-030-92068-5_12(342-370)Online publication date: 1-Dec-2021
https://doi.org/10.1007/978-3-030-92068-5_12
Mainardi NSampietro DBarenghi APelosi G(2020)Efficient Oblivious Substring Search via Architectural SupportProceedings of the 36th Annual Computer Security Applications Conference10.1145/3427228.3427296(526-541)Online publication date: 7-Dec-2020
https://dl.acm.org/doi/10.1145/3427228.3427296
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents