Skip to main content
SpringerLink
Log in

Using Smart Contracts to Improve Searchable Symmetric Encryption

  • Conference paper
  • First Online:
Applied Cryptography in Computer and Communications (AC3 2021)

  • 491 Accesses

Abstract

In this paper, we propose a smart contract based searchable symmetric encryption scheme. The existing searchable symmetric encryption protocol can resist malicious servers when using the MAC algorithm; however, it is more effective only under the assumption that the server is running. If the server receives a user’s money but does not provide a service to the user (or if the server shuts down after receiving the user’s money), the user cannot withdraw the money paid. In addition, if the server wants to reduce computing costs, bandwidth, etc., then it may reduce the number of documents to be searched or omit part of the search results. As a result, there is no guarantee that all files have been searched. We use the Merkle tree to construct search integrity verification. Implementing search integrity verification ensures that it is nearly impossible for searchers to provide integrity verification without searching all documents. Smart contracts use computing resources effectively and help us better search the blockchain. All information is recorded on the blockchain and will not be tampered with. In addition, integrity verification and smart contracts slightly reduce the efficiency but are feasible in practice. Finally, we have theoretically and experimentally verified the safety and feasibility of the proposed scheme.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Androulaki, E., Karame, G., Roeschlin, M., Scherer, T., Capkun, S.: Evaluating User Privacy in Bitcoin. IACR Cryptology ePrint Archive 2012:596 (2012)

    Google Scholar 

  2. Buchbinder, N., Petrank, E.: Lower and upper bounds on obtaining history independence. Inf. Comput. 204(2), 291–337 (2006)

    Article  MathSciNet  Google Scholar 

  3. Curtmola, R., Garay, J.A., Kamara, S., Ostrovsky, R.: Searchable symmetric encryption: improved definitions and efficient constructions. J. Comput. Secur. 19(5), 895–934 (2011)

    Article  Google Scholar 

  4. Goh, E.-J.: Secure Indexes. IACR Cryptology ePrint Archive 2003:216 (2003)

    Google Scholar 

  5. Kamara, S., Papamanthou, C.: Parallel and dynamic searchable symmetric encryption. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 258–274. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-39884-1_22

    Chapter  Google Scholar 

  6. Kurosawa, K., Ohtaki, Y.: UC-secure searchable symmetric encryption. In: Keromytis, A.D. (ed.) FC 2012. LNCS, vol. 7397, pp. 285–298. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-32946-3_21

    Chapter  Google Scholar 

  7. Li, H., Tian, H., Zhang, F., He, J.: Blockchain-based searchable symmetric encryption scheme. Comput. Electr. Eng. 73, 32–45 (2019)

    Article  Google Scholar 

  8. Li, H., Zhang, F., He, J., Tian, H.: A searchable symmetric encryption scheme using blockchain. arXiv preprint arXiv:1711.01030 (2017)

  9. McIlroy, M.: Development of a spelling list. IEEE Trans. Commun. 30(1), 91–99 (1982)

    Article  Google Scholar 

  10. Meitinger, T.H.: Smart contracts. Informatik-Spektrum 40(4), 371–375 (2017). https://doi.org/10.1007/s00287-017-1045-2

    Article  Google Scholar 

  11. Mullin, J.K., Margoliash, D.J.: A tale of three spelling checkers. Softw. Pract. Exper. 20(6), 625–630 (1990)

    Article  Google Scholar 

  12. Naor, M., Teague, V.: Anti-persistence: history independent data structures. In: ACM Symposium on Theory of Computing, pp. 492–501 (2001)

    Google Scholar 

  13. Roy, S.S., Karmakar, A., Verbauwhede, I.: Ring-LWE: applications to cryptography and their efficient realization. In: Carlet, C., Hasan, M.A., Saraswat, V. (eds.) SPACE 2016. LNCS, vol. 10076, pp. 323–331. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-49445-6_18

    Chapter  MATH  Google Scholar 

  14. Szabo, N.: Smart contracts: building blocks for digital markets. EXTROPY J. Transhumanist Thought 18(16), 2 (1996)

    Google Scholar 

  15. Szabo, N.: Formalizing and securing relationships on public networks. First Monday 2(9) (1997)

    Google Scholar 

  16. Wan, Z., Cai, M., Lin, X., Yang, J.: Blockchain federation for complex distributed applications. In: Joshi, J., Nepal, S., Zhang, Q., Zhang, L.-J. (eds.) ICBC 2019. LNCS, vol. 11521, pp. 112–125. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-23404-1_8

    Chapter  Google Scholar 

  17. Zhang, C., Fu, S., Ao, W.: A blockchain based searchable encryption scheme for multiple cloud storage. In: Vaidya, J., Zhang, X., Li, J. (eds.) CSS 2019. LNCS, vol. 11982, pp. 585–600. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-37337-5_48

    Chapter  Google Scholar 

  18. Zhang, Y., Rajimwale, A., Arpaci-Dusseau, A.C., Arpaci-Dusseau, R.H.: End-to-end data integrity for file systems: a ZFS case study. In: 8th USENIX Conference on File and Storage Technologies, San Jose, CA, USA, 23–26 February 2010, pp. 29–42. USENIX (2010)

    Google Scholar 

Download references

Acknowledgments

We would like to thank the anonymous reviewers. This work is supported by The National Key Research and Development Program of China (Grant No. 2018YFA0704701), National Natural Science Foundation of China (Grant No. 62072270), National Cryptography Development Fund (Grant No. MMJJ20170121), and Shandong Province Key Research and Development Project (Grant Nos. 2020ZLYS09 and 2019JZZY010133).

Author information

Authors and Affiliations

  1. Institute for Advanced Study, Tsinghua University, Beijing, 100084, China

    Yanbing Wu

  2. Institute for Network Sciences and Cyberspace, BNRist, Tsinghua University, Beijing, 100084, China

    Keting Jia

Authors
  1. Yanbing Wu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keting Jia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Keting Jia .

Editor information

Editors and Affiliations

  1. Michigan Technological University, Houghton, MI, USA

    Bo Chen

  2. Fujian Normal University, Fuzhou, Fujian, China

    Xinyi Huang

Rights and permissions

Reprints and permissions

Copyright information

© 2021 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Wu, Y., Jia, K. (2021). Using Smart Contracts to Improve Searchable Symmetric Encryption. In: Chen, B., Huang, X. (eds) Applied Cryptography in Computer and Communications. AC3 2021. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 386. Springer, Cham. https://doi.org/10.1007/978-3-030-80851-8_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-80851-8_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-80850-1

  • Online ISBN: 978-3-030-80851-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation