nach oben

The VLDB Journal

Erschienen in:

29.06.2017 | Regular Paper

Secret sharing for cloud data security: a survey

verfasst von: Varunya Attasena, Jérôme Darmont, Nouria Harbi

Erschienen in: The VLDB Journal | Ausgabe 5/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Cloud computing helps reduce costs, increase business agility and deploy solutions with a high return on investment for many types of applications. However, data security is of premium importance to many users and often restrains their adoption of cloud technologies. Various approaches, i.e., data encryption, anonymization, replication and verification, help enforce different facets of data security. Secret sharing is a particularly interesting cryptographic technique. Its most advanced variants indeed simultaneously enforce data privacy, availability and integrity, while allowing computation on encrypted data. The aim of this paper is thus to wholly survey secret sharing schemes with respect to data security, data access and costs in the pay-as-you-go paradigm.

Vorheriger Artikel Enhancing online video recommendation using social user interactions

Nächster Artikel Query-aware locality-sensitive hashing scheme for norm

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Uniquely relatively primes are random prime numbers that are related to each other by some conditions.

A is a Jordan normal form of D if \(DY=YA\), where Y is a row matrix and A is a square, upper triangular matrix whose entries are all the same integer values on the diagonal, all 1 on the entries immediately above the diagonal, and 0 elsewhere.

Agrawal, D., Abbadi, A.E., Emekci, F., Metwally, A.: database management as a service: challenges and opportunities. In: 25th IEEE International Conference on Data Engineering (ICDE 2009), Shanghai, China, pp. 1709–1716 (2009)

Ali, M., Khan, S.U., Vasilakos, A.V.: Security in cloud computing: opportunities and challenges. Inf. Sci. 305, 357–383 (2015)MathSciNetCrossRef

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

Attasena, V., Harbi, N., Darmont, J.: fVSS: A new secure and cost-efficient scheme for cloud data warehouses. In: ACM 17th International Conference on Data Warehouses and OLAP (DOLAP 2014), Shanghai, China, pp. 81–90. ACM (2014)

Attasena, V.: Secret Sharing Approaches for Secure Data Warehousing and On-Line Analysis Processing in the Cloud. Ph.D. thesis, Université Lumière Lyon 2, France (2015)

Attasena, V., Harbi, N., Darmont, J.: A novel multi-secret sharing approach for secure data warehousing and on-line analysis processing in the cloud. Int. J. Data Warehous. Min. 11(2), 21–42 (2015)CrossRef

Baron, J., Defrawy, K.E., Lampkins, J., Ostrovsky, R.: Communication-optimal proactive secret sharing for dynamic groups. Comput. Sci. Appl. Cryptogr. Netw. Secur. 9092, 23–41 (2016)MathSciNetMATH

Beimel, A.: Secret-sharing schemes: a survey. In: 3rd International Conference on Coding and Cryptology (IWCC 2011), Qingdao, China, pp. 11–46 (2011)

Bellare, M., Goldreich, O., Goldwasser, S.: Incremental cryptography: the case of hashing and signing. In: 14th Annual International Cryptology Conference (CRYPTO 1994), Santa Barbara, USA, pp. 216–233 (1994)

10.

Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: 8th Annual International Cryptology Conference (CRYPTO 1988), Santa Barbara, USA, pp. 27–35 (1990)

11.

Bilal, K., Malik, S.U.R., Khan, S.U., Zomaya, A.Y.: Trends and challenges in cloud datacenters. IEEE Cloud Comput. 1(1), 10–20 (2014)CrossRef

12.

Blakley, G.R., Meadows, C.A.: Security of ramp schemes. In: Advances in Cryptology (CRYPTO 1984), Santa Barbara, California, USA, Lecture Notes in Computer Science, vol. 196, pp. 242–268 (1985)

13.

Blakley, G.R.: Safeguarding cryptographic keys. In: National Computer Conference (AFIPS 1979), Monval, USA, pp. 313–317 (1979)

14.

Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing: improvements and extensions. In: ACM SIGSAC Conference on Computer and Communications Security (CCS 2016), Vienna, Austria, pp. 1292–1303 (2016)

15.

Boyle, E., Gilboa, N., Ishai, Y.: Function secret sharing. EUROCRYPT 2015(9057), 337–367 (2015)MathSciNetMATH

16.

Bu, S., Yang, R.: Novel and effective multi-secret sharing scheme. In: International Conference on Information Engineering and Applications (IEA 2012), pp. 461–467 (2013)

17.

Cachin, C., Kursawe, K., Lysyanskaya, A., Strobl, R.: Asynchronous verifiable secret sharing and proactive cryptosystems. In: the 9th ACM Conference on Computer and Communications Securit (CCS 2002), pp. 88–97 (2002)

18.

Chan, C.W., Chang, C.C.: A scheme for threshold multi-secret sharing. Appl. Math. Comput. 166(1), 1–14 (2005)MathSciNetMATH

19.

Chang, T.Y., Hwang, M.S., Yang, W.P.: An improvement on the lin-wu (t, n) threshold verifiable multi-secret sharing scheme. Appl. Math. Comput. 163(1), 169–178 (2005)MathSciNetMATH

20.

Chen, W., Long, X., Bai, Y., Gao, X.: A new dynamic threshold secret sharing scheme from bilinear maps. In: International Conference on Parallel Processing Workshops (ICPPW 2007), Xi-An, China, p. 19 (2007)

21.

Chen, G., Wang, H., Wang, L., Jin, Y.: A distributed multi-secret sharing scheme on the (t,n) threshold. In: 2nd International Conference on Network Computing and Information Security (NCIS 2012), Shanghai, China, pp. 358–364 (2012)

22.

Chow, R., Golle, P., Jakobsson, M., Shi, E., Staddon, J., Masuoka, R., Molina, J.: Controlling data in the cloud: outsourcing computation without outsourcing control. In: 1st ACM Cloud Computing Security Workshop (CCSW 2009), Chicago, USA, pp. 85–90 (2009)

23.

Chunming, T., an Yao, Z.: A new (t,n) threshold secret sharing scheme. In: International Conference on Advanced Computer Theory and Engineering (ICACTE 2008), Phuket, Thailand, pp. 920–924 (2008)

24.

Cormode, G., Srivastava, D.: Anonymized data: generation, models, usage. In: 26th IEEE International Conference on Data Engineering (ICDE 2010), Long Beach, USA, pp. 1015–1018 (2010)

25.

Das, A., Adhikari, A.: An efficient multi-use multi-secret sharing scheme based on hash function. Appl. Math. Lett. 23(9), 993–996 (2010)MathSciNetCrossRefMATH

26.

Dautrich, J.L., Ravishankar, C.V.: Security limitations of using secret sharing for data outsourcing. In: IFIP Annual Conference on Data and Applications Security and Privacy (DBSec 2016), Trento, Italy, pp. 151–160 (2016)

27.

Dehkordi, M.H., Mashhadi, S.: An efficient threshold verifiable multi-secret sharing. Comput. Stand. Interfaces 30(3), 187–190 (2008)CrossRefMATH

28.

Dehkordi, M.H., Mashhadi, S.: New efficient and practical verifiable multi-secret sharing schemes. Inf. Sci. 178(9), 2262–2274 (2008)MathSciNetCrossRefMATH

29.

Derbeko, P., Dolev, S., Gudes, E., Sharma, S.: Security and privacy aspects in mapreduce on clouds: a survey. Comput. Sci. Rev. 20, 1–28 (2016)MathSciNetCrossRefMATH

30.

Ding, C., Pei, D., Salomaa, A.: Chinese Remainder Theorem: Applications in Computing, Coding, Cryptography. World Scientific Publishing, Singapore (1996)CrossRefMATH

31.

Dolev, S., Li, Y., Sharma, S.: Private and secure secret shared mapreduce (extended abstract). In: IFIP Annual Conference on Data and Applications Security and Privacy XXVI (DBSec 2012), Paris, France, pp. 145–160 (2016)

32.

Dolev, S., ElDefrawy, K., Lampkins, J., Ostrovsky, R., Yung, M.: Proactive secret sharing with a dishonest majority. Comput. Sci. Secur. Cryptogr. Netw. 9841, 529–548 (2016)MathSciNetMATH

33.

Drgan, C.C., iplea, F.L.: Distributive weighted threshold secret sharing schemes. Inf. Sci. 339, 85–97 (2016)MathSciNetCrossRef

34.

Dwork, C.: Differential privacy. In: International Colloquium of Automata, Languages and Programming (ICALP 2006), Venice, Italy, pp. 1–12 (2006)

35.

Emekci, F., Agrawal, D., Abbadi, A.E., Gulbeden, A.: Privacy preserving query processing using third parties. In: 22nd IEEE International Conference on Data Engineering (ICDE 2006), Atlanta, USA, pp. 27–37 (2006)

36.

Emekci, F., Agrawal, D., Abbadi, A.E.: Abacus: a distributed middleware for privacy preserving data sharing across private data warehouses. In: 6th International Conference on Middleware (USENIX 2005), Grenoble, France, pp. 21–41 (2005)

37.

Eslami, Z., Ahmadabadi, J.Z.: A verifiable multi-secret sharing scheme based on cellular automata. Inf. Sci. 180(15), 2889–2894 (2010)MathSciNetCrossRefMATH

38.

Eslami, Z., Rad, S.K.: A new verifiable multi-secret sharing scheme based on bilinear maps. Wirel. Person. Commun. 63(2), 459–467 (2012)CrossRef

39.

Gentry, C.: Fully homomorphic encryption using ideal lattices. In: 41st Annual ACM Symposium on Theory of Computing (STOC 2009), Bethesda, USA, pp. 169–178 (2009)

40.

Gong, G., Harn, L., Wu, H.: The gh public-key cryptosystem. Selected areas in cryptography. Spinger 2259, 284–300 (2001)MATH

41.

Gong, G., Harn, L.: Public-key cryptosystems based on cubic finite field extensions. IEEE Trans. Inf. Theory 45(7), 2601–2605 (1999)MathSciNetCrossRefMATH

42.

Hadavi, M.A., Damiani, E., Jalili, R., Cimato, S., Ganjei, Z.: As5: a secure searchable secret sharing scheme for privacy preserving database outsourcing. In: ESORICS DPM/SETOP 2012 International Workshops, Pisa, Italy, pp. 201–216 (2012)

43.

Hadavi, M.A., Jalili, R.: Secure data outsourcing based on threshold secret sharing: towards a more practical solution. In: VLDB 2010 Ph.D. Workshop, Singapore, pp. 54–59 (2010)

44.

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

45.

Harn, L., Fuyou, M.: Weighted secret sharing based on the chinese remainder theorem. Netw. Secur. 16(6), 420–425 (2014)MATH

46.

Harn, L., Lin, C.: Strong (n, t, n) verifiable secret sharing scheme. Inf. Sci. 180(16), 3059–3064 (2010)MathSciNetCrossRefMATH

47.

Hashizume, K., Rosado, D.G., Fernndez-Medina, E., Fernandez, E.B.: An analysis of security issues for cloud computing. Internet Serv. Appl. 4(1), 1–13 (2013)CrossRef

48.

He, Z., Wong, W.K., Kao, B., Cheung, D.W.L.: Sdb: A secure query processing system with data interoperability. In: the 41st International Conference on Very Large Data Bases, Hawaii, USA, pp. 1876–1879 (2015)

49.

He, J., Dawson, E.: Multistage secret sharing based on one-way function. Electron. Lett. 30(19), 1591–1592 (1994)CrossRef

50.

Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: 15th Annual international cryptology conference (CRYPTO 1995), Santa Barbara, USA, pp. 339–352 (1995)

51.

Hu, C., Liao, X., Cheng, X.: Verifiable multi-secret sharing based on LFSR sequences. Theor. Comput. Sci. 445, 52–62 (2012)MathSciNetCrossRefMATH

52.

Hwang, R., Chang, C.: An on-line secret sharing scheme for multi-secrets. Comput. Commun. 21(13), 1170–1176 (1998)CrossRef

53.

Iftene, S.: General secret sharing based on the chinese remainder theorem with applications in e-voting. Electron. Notes Theor. Comput. Sci. 186, 67–84 (2007)MathSciNetCrossRefMATH

54.

Hazewinkel, M. (ed.): Totient Function. Encyclopedia of Mathematics. Springer, Heidelberg (2001)

55.

Iwamoto, M., Yamamoto, H.: Strongly secure ramp secret sharing schemes for general access structures. Inf. Process. Lett. 97(2), 52–57 (2006)MathSciNetCrossRefMATH

56.

Joshi, J.B., Takabi, H., Ahn, G.J.: Security and privacy challenges in cloud computing environments. IEEE Secur. Priv. 8, 24–31 (2010)CrossRef

57.

Khan, M.A.: A survey of security issues for cloud computing. J. Netw. Comput. Appl. 71, 11–29 (2016)CrossRef

58.

Kher, V., Kim, Y.: Securing distributed storage: challenges, techniques, and systems. In: ACM Workshop on Storage Security and Survivability (StorageSS 2005), Fairfax, USA, pp. 9–25 (2005)

59.

Komargodski, I., Zhandry, M.: Cutting-edge cryptography through the lens of secret sharing. EUROCRYPT 2015(9563), 449–479 (2015)MATH

60.

Li, S., Lai, H., Wu, W., Jiang, S.: Novel space efficient secret sharing for implicit data security. In: 8th International Conference on Information Science and Digital Content Technology (ICIDT 2012), Jeju, Japan, pp. 283–286 (2009)

61.

Lin, T.-Y., Wu, T.-C.: (t, n) Threshold verifiable multi secret sharing scheme based on factorisation intractability and discrete logarithm modulo a composite problems. IEEE Comput. Digit. Tech. 146(5), 263–264 (1999)

62.

Liu, Y.X., Harn, L., Yang, C.N., Zhang, Y.Q.: Efficient (n, t, n) secret sharing schemes. J. Syst. Softw. 85(6), 1325–1332 (2012)CrossRef

63.

Mashhadi, S.: Secure publicly verifiable and proactive secret sharing schemes with general access structure. Inf. Sci. 378, 99–108 (2017)MathSciNetCrossRef

64.

Morillo, P., Padr, C., Sez, G., Villar, J.: Weighted threshold secret sharing schemes. Inf. Process. Lett. 70(5), 211–216 (1999)MathSciNetCrossRefMATH

65.

Muhil, M., Krishna, U., Kumar, R., Anita, E.A.M.: Securing multi-cloud using secret sharing algorithm. In: IFIP Annual Conference on Application of Fuzzy Systems and Soft Computing (ICAFS 2016), Vienna, Austria, pp. 145–160 (2016)

66.

Nojoumian, M., Stinson, D.R.: Social secret sharing in cloud computing using a new trust function. In: 10th Annual International Conference on Privacy, Security and Trust (PST 2012), Paris, France, pp. 161–167 (2012)

67.

Nojoumian, M., Stinson, D.R.: Socio-rational secret sharing as a new direction in rational cryptography. In: 3rd International Conference Decision and Game Theory for Security (GameSec 2012), Budapest, Hungary, pp. 18–37 (2012)

68.

Nojoumian, M., Stinson, D.R., Grainger, M.: Unconditionally secure social secret sharing scheme. Inf. Secur. IET 4(4), 202–211 (2010)CrossRef

69.

Oktay, K.Y., Mehrotra, S., Khadilkar, V., Kantarcioglu, M.: Semrod: Secure and efficient mapreduce over hybrid clouds. In: International Conference on Management of Data (SIGMOD 2015), Melbourne, Australia, pp. 153–166 (2015)

70.

Padmanabhan, P., Gruenwald, L., Vallur, A., Atiquzzaman, M.: A survey of data replication techniques for mobile ad hoc network databases. VLDB J. 17(5), 1143–1164 (2008)CrossRef

71.

Pal, D., Khethavath, P., Thomas, J.P.: Multilevel threshold secret sharing in distributed cloud. Secur. Comput. Commun. 536, 13–23 (2015)CrossRef

72.

Parakh, A., Kak, S.: Online data storage using implicit security. Inf. Sci. 179(19), 3323–3331 (2009)CrossRefMATH

73.

Parakh, A., Kak, S.: Space efficient secret sharing for implicit data security. Inf. Sci. 181(2), 335–341 (2011)MathSciNetCrossRef

74.

Pedersen, T.P.: A threshold cryptosystem without a trusted party. In: Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT 1991), Brighton, UK, pp. 522–526 (1991)

75.

Perlner, R.A., Cooper, D.A.: Quantum resistant public key cryptography: a survey. In: 8th Symposium on Identity and Trust on the Internet (IDtrust 2009), Gaithersburg, Maryland, USA, ACM ICPS, pp. 85–93 (2009)

76.

Runhual, S., Liusheng, H., yonglong, L., Hong2, Z.: A threshold multi-secret sharing scheme. In: IEEE International Conference on Networking, Sensing and Control (ICNSC 2008), Sanya, China, pp. 1705–1707 (2008)

77.

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

78.

ShanYue, B., Hong, Z.: A secret sharing scheme based on NTRU algorithm. In: Wireless Communications, Networking and Mobile Computing (WiCom 2009), Beijing, China, pp. 1–4 (2009)

79.

Shao, J., Cao, Z.: A new efficient (t, n) verifiable multi-secret sharing (VMSS) based on YCH scheme. Appl. Math. Comput. 168(1), 135–140 (2005)MathSciNetMATH

80.

Shen, F., Hai Jiang, C.M., Xu, Z.: Towards secure and reliable data storage with multi-coefficient secret sharing. In: 2010 IEEE 10th International Conference on Computer and Information Technology (CIT), Bradford, UK, pp. 797–802 (2010)

81.

Shi, R., Zhong, H., Huang, L.: A (t, n)-threshold verified multi-secret sharing scheme based on ECDLP. In: International Conference on InterSoftware Engineering, Artifificial Intelligence, Networking, and Parallel/Distributed (ACIS 2007), pp. 9–13 (2007)

82.

Sion, R.: Secure data outsourcing. In: 33rd International Conference on Very Large Data Bases (VLDB 2007), Vienna, Austria, pp. 1431–1432 (2007)

83.

Takahashi, S., Iwamura, K.: Secret sharing scheme suitable for cloud computing. In: 27th International Conference on Advanced Information Networking and Applications (AINA 2013), Barcelona, Spain, pp. 530–536 (2013)

84.

Takahashi, S., Iwamura, K.: Secret sharing scheme suitable for cloud computing. In: International Conference on Advanced Information Networking and Applications (AINA 2013), Barcelona, Spain, pp. 530–537 (2013)

85.

Tang, C., Yao, Z.: Definition and construction of multi-prover zero-knowledge arguments. In: International Conference on Communications and Mobile Computing (CMC 2009), Yunnan, China, pp. 375–379 (2009)

86.

Thompson, B., Haber, S., Horne, W.G., Sander, T., Yao, D.: Privacy-preserving computation and verification of aggregate queries on outsourced databases. In: 9th International Symposium on Privacy Enhancing Technologies (PETS 2009), Seattle, USA, pp. 185–201 (2009)

87.

Wang, S., Agrawal, D., Abbadi, A.E.: A comprehensive framework for secure query processing on relational data in the cloud. In: 8th VLDB International Conference on Secure Data Management (SDM 2011), Berlin, Germany, pp. 52–69 (2011)

88.

Wang, Q., Wang, C., Li, J., Ren, K., Lou, W.: Enabling public verifiability and data dynamics for storage security in cloud computing. In: 14th European Conference on Research in Computer Security (ESORICS 2009), Saint-Malo, France, pp. 355–370 (2009)

89.

Wang, S.J., Tsai, Y.R., Shen, C.C.: Verifiable threshold scheme in multi-secret sharing distributions upon extensions of ECC. Wirel. Person. Comun. 56(1), 173–182 (2011)CrossRef

90.

Waseda, A., Soshi, M.: Consideration for multi-threshold multi-secret sharing schemes. In: 2012 International Symposium on Information Theory and its Applications (ISITA 2012), Honolulu, USA, pp. 265–269 (2012)

91.

Wei, D.S., Murugesan, S., Kuo, S.Y., Naik, K., Krizanc, D.: Enhancing data integrity and privacy in the cloud: an agenda. IEEE Comput. 46(11), 87–90 (2013)CrossRef

92.

Wong, T.M., Wang, C., Wing, J.M.: Verifiable secret redistribution for archive systems. In: International IEEE Security in Storage Workshop, pp. 94–106 (2002)

93.

Xu, Z., Martin, K., Kotnik, C.: A survey of security services and techniques in distributed storage systems. In: 2011 International Conference on Security and Management (SAM 2011), Las Vegas, USA, pp. 3–9 (2011)

94.

Yang, C.C., Chang, T.Y., Hwang, M.S.: A (t, n) multi-secret sharing scheme. Appl. Math. Comput. 151(2), 483–490 (2004)MathSciNetMATH

95.

Yao, A.C.C.: How to generate and exchange secrets. In: 27th Annual Symposium on Foundations of Computer Science, Toronto, Canada, pp. 162–167 (1986)

96.

Zhang, C., Chang, E.C., Yap, R.H.: Tagged-mapreduce: a general framework for secure computing with mixed-sensitivity data on hybrid clouds. In: International Symposium on Cluster, Cloud and Grid Computing (CCGrid 2014), Chicago, IL, USA, pp. 31–40 (2014)

97.

Zhang, F., Chen, H.: Security-preserving live migration of virtual machines in the cloud. Netw. Syst. Manag. 21(4), 562–587 (2013)CrossRef

98.

Zhao, J., Zhang, J., Zhao, R.: A practical verifiable multi-secret sharing scheme. Comput. Stand. Interfaces 29(1), 138–141 (2007)

99.

Zhao, D., Peng, H., Wang, C., Yang, Y.: A secret sharing scheme with a short share realizing the (t, n) threshold and the adversary structure. Comput. Math. Appl. 64(4), 611615 (2012)MathSciNetCrossRefMATH

100.

Zheng, T., Wu, H., Lin, H.W., Pan, J.: Application of belief learning model based socio-rational secret sharing scheme on cloud storage. In: 6th International Conference on Genetic and Evolutionary Computing (ICGEC 2012), Kitakyushu, Japan, pp. 15–18 (2012)

101.

Zhou, Z., Zhang, H., Du, X., Li, P., Yu, X.: Prometheus: privacy-aware data retrieval on hybrid cloud. In: Proceedings of the IEEE INFOCOM 2013, Turin, Italy, pp. 2643–2651 (2013)

102.

Zhou, M., Zhang, R., Xie, W., Qian, W., Zhou, A.: Security and privacy in cloud computing: a survey. In: International Conference on Semantics, Knowledge and Grids (SKG 2010), Beijing, China, pp. 105–112 (2010)

103.

Zhou, L., Schneider, F.B., Renesse, R.V.: APSS: proactive secret sharing in asynchronous systems. ACM Trans. Inf. Syst. Secur. (TISSEC) 8(3), 259–286 (2005)CrossRef

104.

Zissis, D., Lekkas, D.: Addressing cloud computing security issues. Future Gen. Comput. Syst. 28(3), 583–592 (2012)CrossRef

Titel: Secret sharing for cloud data security: a survey
verfasst von: Varunya Attasena
Jérôme Darmont
Nouria Harbi
Publikationsdatum: 29.06.2017
Verlag: Springer Berlin Heidelberg
Erschienen in: The VLDB Journal / Ausgabe 5/2017
Print ISSN: 1066-8888
Elektronische ISSN: 0949-877X
DOI: https://doi.org/10.1007/s00778-017-0470-9

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 5/2017

Enhancing online video recommendation using social user interactions

A distributed in-memory key-value store system on heterogeneous CPU–GPU cluster

Query-aware locality-sensitive hashing scheme for norm

Geo-social group queries with minimum acquaintance constraints

Graph repairing under neighborhood constraints

Premium Partner