Skip to main content
Springer Nature Link
Log in

Secure, Efficient and Searchable File System on Distributed Clouds

  • Conference paper
  • First Online:
Data Science (ICPCSEE 2019)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 1059))

  • 1406 Accesses

Abstract

Many enterprises and personals are inclining to outsource their data to public clouds, but security and privacy are two critical problems cannot be ignored. The door of cloud provider may be broken, and the data may also be dug into by providers to find valuable information. In this paper, a secure and efficient storage file (SES_FS) system is proposed to distribute files in several clouds and allows users to search the files securely and efficiently. In the proposed system, keywords were transformed into integers and secretly shared in a defined finite field, then the shares were mapped to random numbers in specified random domain in each cloud. Files were encrypted with distinct secret key and scattered within different clouds. Information about keyword/file was secretly shared among cloud providers. Legal users can search in the clouds to find correct encrypted files and reconstruct corresponding secret key. No adversary can find or detect the real file information even they can collude all the servers. Manipulation on shares by one or more clouds can be detected with high probability. The system can also detect malicious servers through introduced virtual points. One interesting property for the scheme is that new keywords can be added easily, which is difficult and usually not efficient for many searchable symmetric encryption systems. Detailed experimental result shows, with tolerable uploading delay, the scheme exhibits excellent performance on data retrieving aspect.

This work is supported by Demonstration on the Construction of Guangdong Survey and Geomatics Industry Technology Innovation Alliance (2017B090907030), The Demonstration of Big Data Application for Land Resource Management and Service (2015B010110006). Qiong Huang is supported by Guangdong Natural Science Funds for Distinguished Young Scholar (No. 2014A030306021), Guangdong Program for Special Support of Top-notch Young Professionals (No. 2015TQ01X796), Pearl River Nova Program of Guangzhou (No. 201610010037), and the National Natural Science Foundation of China (Nos. 61472146, 61672242).

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Asmuth, C., Bloom, J.: A modular approach to key safeguarding. IEEE Trans. Inf. Theory 29(2), 208–210 (1983)

    Article  MathSciNet  Google Scholar 

  2. Attasena, V., Harbi, N., Darmont, J.: fVSS: a new secure and cost-efficient scheme for cloud data warehouses. In: Proceedings of the 17th International Workshop on Data Warehousing and OLAP, pp. 81–90. ACM (2014)

    Google Scholar 

  3. Avni, H., Dolev, S., Gilboa, N., Li, X.: SSSDB: database with private information search. In: Karydis, I., Sioutas, S., Triantafillou, P., Tsoumakos, D. (eds.) ALGOCLOUD 2015. LNCS, vol. 9511, pp. 49–61. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-29919-8_4

    Chapter  Google Scholar 

  4. Benaloh, J.C.: Secret sharing homomorphisms: keeping shares of a secret secret (extended abstract). In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 251–260. Springer, Heidelberg (1987). https://doi.org/10.1007/3-540-47721-7_19

    Chapter  Google Scholar 

  5. Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. SIAM J. Comput. 43(2), 831–871 (2014)

    Article  MathSciNet  Google Scholar 

  6. Cai, Q., Lin, J., Li, F., Wang, Q.: SEDB: building secure database services for sensitive data. In: Hui, L.C.K., Qing, S.H., Shi, E., Yiu, S.M. (eds.) ICICS 2014. LNCS, vol. 8958, pp. 16–30. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21966-0_2

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  8. Dautrich, J.L., Ravishankar, C.V.: Security limitations of using secret sharing for data outsourcing. In: Cuppens-Boulahia, N., Cuppens, F., Garcia-Alfaro, J. (eds.) DBSec 2012. LNCS, vol. 7371, pp. 145–160. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31540-4_12

    Chapter  Google Scholar 

  9. Dolev, S., Gilboa, N., Li, X.: Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation. In: Proceedings of the 3rd International Workshop on Security in Cloud Computing, pp. 21–29. ACM (2015)

    Google Scholar 

  10. Emekci, F., Methwally, A., Agrawal, D., El Abbadi, A.: Dividing secrets to secure data outsourcing. Inf. Sci. 263, 198–210 (2014)

    Article  MathSciNet  Google Scholar 

  11. Ferretti, L., Colajanni, M., Marchetti, M.: Distributed, concurrent, and independent access to encrypted cloud databases. IEEE Trans. Parallel Distrib. Syst. 25(2), 437–446 (2014)

    Article  Google Scholar 

  12. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, 31 May–2 June 2009, pp. 169–178 (2009)

    Google Scholar 

  13. Gentry, C., Halevi, S.: Implementing gentry’s fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129–148. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20465-4_9

    Chapter  Google Scholar 

  14. Hadavi, M.A., Damiani, E., Jalili, R., Cimato, S., Ganjei, Z.: AS5: a secure searchable secret sharing scheme for privacy preserving database outsourcing. In: Di Pietro, R., Herranz, J., Damiani, E., State, R. (eds.) DPM/SETOP 2012. LNCS, vol. 7731, pp. 201–216. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-35890-6_15

    Chapter  Google Scholar 

  15. Hadavi, M.A., Jalili, R.: Secure data outsourcing based on threshold secret sharing; towards a more practical solution. In: Proceedings of the VLDB PhD Workshop, pp. 54–59 (2010)

    Google Scholar 

  16. Hadavi, M.A., Jalili, R., Damiani, E., Cimato, S.: Security and searchability in secret sharing-based data outsourcing. Int. J. Inf. Secur. 14(6), 513–529 (2015)

    Article  Google Scholar 

  17. Hadavi, M.A., Noferesti, M., Jalili, R., Damiani, E.: Database as a service: towards a unified solution for security requirements. In: 2012 IEEE 36th Annual Computer Software and Applications Conference Workshops (COMPSACW), pp. 415–420. IEEE (2012)

    Google Scholar 

  18. Kaya, K., Selçuk, A.A.: Threshold cryptography based on asmuth-bloom secret sharing. Inf. Sci. 177(19), 4148–4160 (2007)

    Article  MathSciNet  Google Scholar 

  19. Monz, T., et al.: Realization of a scalable shor algorithm. Science 351(6277), 1068–1070 (2016)

    Article  MathSciNet  Google Scholar 

  20. Muhammad, Y.I., Kaiiali, M., Habbal, A., Wazan, A.S., Sani Ilyasu, A.: A secure data outsourcing scheme based on asmuth-bloom secret sharing. Enterp. Inf. Syst. 10(9), 1001–1023 (2016)

    Article  Google Scholar 

  21. Pal, D., Khethavath, P., Thomas, J.P., Chen, T.: Multilevel threshold secret sharing in distributed cloud. In: Abawajy, J.H., Mukherjea, S., Thampi, S.M., Ruiz-Martínez, A. (eds.) SSCC 2015. CCIS, vol. 536, pp. 13–23. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-22915-7_2

    Chapter  Google Scholar 

  22. Poh, G.S., Mohamad, M.S., Chin, J.J.: Searchable symmetric encryption over multiple servers. Crypt. Commun. 10(1), 139–158 (2018)

    Article  MathSciNet  Google Scholar 

  23. Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)

    Article  MathSciNet  Google Scholar 

  24. Tian, X.X., Sha, C.F., Wang, X.L., Zhou, A.Y.: Privacy preserving query processing on secret share based data storage. In: Yu, J.X., Kim, M.H., Unland, R. (eds.) DASFAA 2011. LNCS, vol. 6587, pp. 108–122. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20149-3_10

    Chapter  Google Scholar 

  25. Trummer, I., Koch, C.: Multiple query optimization on the D-Wave 2X adiabatic quantum computer. Proc. VLDB Endow. 9(9), 648–659 (2016)

    Article  Google Scholar 

  26. Wang, W., Hu, Y., Chen, L., Huang, X., Sunar, B.: Exploring the feasibility of fully homomorphic encryption. IEEE Trans. Comput. 64(3), 698–706 (2015)

    Article  MathSciNet  Google Scholar 

  27. Wu, C., Zapevalova, E., Chen, Y., Li, F.: Time optimization of multiple knowledge transfers in the big data environment. Comput. Mater. Continua 54(3), 269–285 (2018)

    Google Scholar 

  28. Zhu, H., Liu, T., Zhu, D., Li, H.: Robust and simple N-party entangled authentication cloud storage protocol based on secret sharing scheme. J. Inf. Hiding Multimed. Signal Process. 4(2), 110–117 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Mathematics and Informatics, South China Agricultural University, Guangzhou, China

    Ximing Li, Weizhao Chen, Yubin Guo, Sha Ma & Qiong Huang

Authors
  1. Ximing Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Weizhao Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yubin Guo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sha Ma
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Qiong Huang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yubin Guo .

Editor information

Editors and Affiliations

  1. College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China

    Rui Mao

  2. Harbin Institute of Technology, Harbin, China

    Hongzhi Wang

  3. Guilin University of Technology, Guilin, China

    Xiaolan Xie

  4. National Academy of Guo Ding Institute of Data Science, Harbin, China

    Zeguang Lu

A Algorithm of Transforming String to Integer

A Algorithm of Transforming String to Integer

We here give a function \(HF_{SToI}\) to convert a keyword to a distinct number in \(\mathbb {Z}_p\) (where p is a prime number). Below, we give the detailed process.

  1. (1)

    Convert each character of the keyword kw into a binary data bkw.

  2. (2)

    For each binary data bkw, if its length is not an exact multiple, pad digit 1 in the front of bkw until its length is a multiple which is named fbkw.

  3. (3)

    For each l bit block of fbkw, convert it to a decimal digit.

  4. (4)

    Compute the product of all decimal blocks fbkw and get an integer number Ikw.

  5. (5)

    Compute \(Ikw \mod p\).

In the function, there is a small probability that two or more strings are converted to the same integer in \(\mathbb {Z}_p\). Figure 10 gives an example that converts string kw to a numeric value where p = 2017. In the example the string kw is converted to bitstring 0110101101110111, and then padded with 111111. Finally, the number of kw is 559 in finite field \(\mathbb {Z}_{2017}\).

Fig. 10.
figure 10

Sample data type conversion process

Full size image

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, X., Chen, W., Guo, Y., Ma, S., Huang, Q. (2019). Secure, Efficient and Searchable File System on Distributed Clouds. In: Mao, R., Wang, H., Xie, X., Lu, Z. (eds) Data Science. ICPCSEE 2019. Communications in Computer and Information Science, vol 1059. Springer, Singapore. https://doi.org/10.1007/978-981-15-0121-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-0121-0_19

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-0120-3

  • Online ISBN: 978-981-15-0121-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics