Skip to main content
Top
Published in: The Journal of Supercomputing 11/2019

28-06-2019

High-speed GPU implementation of a secret sharing scheme based on cellular automata

Authors: Saeideh Kabirirad, Mahmood Fazlali, Ziba Eslami

Published in: The Journal of Supercomputing | Issue 11/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Parallel implementation provides a solution for the problem of accelerating cellular automata (CA)-based secret sharing schemes and make them appropriate for bulk data sharing and real-time applications. By presenting new platforms, we need new implementation techniques to run algorithms as fast as possible on the platform. In this paper, we present a new implementation of a CA-based secret sharing scheme using the Graphic Processing Unit (GPU). We propose a new data arrangement that reduces the total number of accesses to the memories in GPU. Our algorithm further reduces the amount of data required by each thread and at the same time achieves a high cache hit rate. Also, it can achieve coalesced memory accesses to optimal use of the global memory bandwidth. The proposed method obtains speedup up to four times faster than the best previous GPU implemented CA-based multi-secret sharing schemes.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

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!

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!

Literature
1.
go back to reference Alvarez G, Encinas LH, Del Rey AM (2008) A multisecret sharing scheme for color images based on cellular automata. Inf Sci 178(22):4382–4395CrossRef Alvarez G, Encinas LH, Del Rey AM (2008) A multisecret sharing scheme for color images based on cellular automata. Inf Sci 178(22):4382–4395CrossRef
2.
go back to reference Blakley GR et al (1979) Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. vol 48, pp 313–317 Blakley GR et al (1979) Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. vol 48, pp 313–317
3.
go back to reference Cramer R, Damgård I, Nielsen JB (2001) Multiparty computation from threshold homomorphic encryption. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 280–300 Cramer R, Damgård I, Nielsen JB (2001) Multiparty computation from threshold homomorphic encryption. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 280–300
4.
go back to reference Del Rey AM, Mateus JP, Sánchez GR (2005) A secret sharing scheme based on cellular automata. Appl Math Comput 170(2):1356–1364MathSciNetMATH Del Rey AM, Mateus JP, Sánchez GR (2005) A secret sharing scheme based on cellular automata. Appl Math Comput 170(2):1356–1364MathSciNetMATH
5.
go back to reference Eslami Z, Ahmadabadi JZ (2010) A verifiable multi-secret sharing scheme based on cellular automata. Inf Sci 180(15):2889–2894MathSciNetCrossRef Eslami Z, Ahmadabadi JZ (2010) A verifiable multi-secret sharing scheme based on cellular automata. Inf Sci 180(15):2889–2894MathSciNetCrossRef
6.
go back to reference Faraoun KM (2014) A novel fast and provably secure (t, n)-threshold secret sharing construction for digital images. J Inf Secur Appl 19(6):331–340MathSciNet Faraoun KM (2014) A novel fast and provably secure (t, n)-threshold secret sharing construction for digital images. J Inf Secur Appl 19(6):331–340MathSciNet
7.
go back to reference Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. ACM, pp 89–98 Goyal V, Pandey O, Sahai A, Waters B (2006) Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. ACM, pp 89–98
8.
go back to reference Grosser T, Cohen A, Kelly P.H, Ramanujam J, Sadayappan P, Verdoolaege S (2013) Split tiling for GPUs: automatic parallelization using trapezoidal tiles. In: Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units. ACM, pp 24–31 Grosser T, Cohen A, Kelly P.H, Ramanujam J, Sadayappan P, Verdoolaege S (2013) Split tiling for GPUs: automatic parallelization using trapezoidal tiles. In: Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units. ACM, pp 24–31
9.
go back to reference Ha PH, Tsigas P, Anshus OJ (2010) The synchronization power of coalesced memory accesses. IEEE Trans Parallel Distrib Syst 21(7):939–953CrossRef Ha PH, Tsigas P, Anshus OJ (2010) The synchronization power of coalesced memory accesses. IEEE Trans Parallel Distrib Syst 21(7):939–953CrossRef
10.
go back to reference He J, Dawson E (1995) Multisecret-sharing scheme based on one-way function. Electron Lett 31(2):93–95CrossRef He J, Dawson E (1995) Multisecret-sharing scheme based on one-way function. Electron Lett 31(2):93–95CrossRef
11.
go back to reference Hernandez-Becerril A, Nakano-Miyatake M, Ramirez-Tachiquin M, Perez-Meana H (2013) Parallel implementation of multiple secret image sharing based on cellular automata. J Commun Comput 10:649–660 Hernandez-Becerril A, Nakano-Miyatake M, Ramirez-Tachiquin M, Perez-Meana H (2013) Parallel implementation of multiple secret image sharing based on cellular automata. J Commun Comput 10:649–660
12.
go back to reference Hernandez-Becerril A, Nakano-Miyatake M, Ramirez-Tachiquin M, Perez-Meana H (2013) A parallel implementation of multiple secrete image sharing based on cellular automata with LSB steganography. In: Intelligent Software Methodologies, Tools and Techniques (SoMeT), 2013 IEEE 12th International Conference on. IEEE, pp 191–196 Hernandez-Becerril A, Nakano-Miyatake M, Ramirez-Tachiquin M, Perez-Meana H (2013) A parallel implementation of multiple secrete image sharing based on cellular automata with LSB steganography. In: Intelligent Software Methodologies, Tools and Techniques (SoMeT), 2013 IEEE 12th International Conference on. IEEE, pp 191–196
13.
go back to reference Hernandez-Becerril RA, Bucio-Ramirez AG, Nakano-Miyatake M, Perez-Meana H, Ramirez-Tachiquin MP (2016) A GPU implementation of secret sharing scheme based on cellular automata. J Supercomput 72(4):1291–1311CrossRef Hernandez-Becerril RA, Bucio-Ramirez AG, Nakano-Miyatake M, Perez-Meana H, Ramirez-Tachiquin MP (2016) A GPU implementation of secret sharing scheme based on cellular automata. J Supercomput 72(4):1291–1311CrossRef
14.
go back to reference Hernandez-Becerrjl A, Nakano-Miyatake M, Perez-Meana H.M, Bucio A, Ramirez-Tachiquin M (2014) A parallel authenticated encryption sharing scheme based on cellular automata. In: Proceedings of the World Congress on Engineering and Computer Science. vol 1 Hernandez-Becerrjl A, Nakano-Miyatake M, Perez-Meana H.M, Bucio A, Ramirez-Tachiquin M (2014) A parallel authenticated encryption sharing scheme based on cellular automata. In: Proceedings of the World Congress on Engineering and Computer Science. vol 1
15.
go back to reference Holewinski J, Pouchet L.N, Sadayappan P (2012) High-performance code generation for stencil computations on GPU architectures. In: Proceedings of the 26th ACM International Conference on Supercomputing. ACM, pp 311–320 Holewinski J, Pouchet L.N, Sadayappan P (2012) High-performance code generation for stencil computations on GPU architectures. In: Proceedings of the 26th ACM International Conference on Supercomputing. ACM, pp 311–320
16.
go back to reference Ito M, Saito A, Nishizeki T (1989) Secret sharing scheme realizing general access structure. Electron Commun Jpn (Part III Fundam Electron Sci) 72(9):56–64MathSciNetCrossRef Ito M, Saito A, Nishizeki T (1989) Secret sharing scheme realizing general access structure. Electron Commun Jpn (Part III Fundam Electron Sci) 72(9):56–64MathSciNetCrossRef
17.
go back to reference Pang LJ, Wang YM (2005) A new (t, n) multi-secret sharing scheme based on shamirs secret sharing. Appl Math Comput 167(2):840–848MathSciNetMATH Pang LJ, Wang YM (2005) A new (t, n) multi-secret sharing scheme based on shamirs secret sharing. Appl Math Comput 167(2):840–848MathSciNetMATH
18.
go back to reference Rahman S.M.F, Yi Q, Qasem A (2011) Understanding stencil code performance on multicore architectures. In: Proceedings of the 8th ACM International Conference on Computing Frontiers. ACM, p 30 Rahman S.M.F, Yi Q, Qasem A (2011) Understanding stencil code performance on multicore architectures. In: Proceedings of the 8th ACM International Conference on Computing Frontiers. ACM, p 30
19.
go back to reference Schäfer A, Fey D (2011) High performance stencil code algorithms for GPGPUs. Procedia Comput Sci 4:2027–2036CrossRef Schäfer A, Fey D (2011) High performance stencil code algorithms for GPGPUs. Procedia Comput Sci 4:2027–2036CrossRef
20.
go back to reference Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Annual International Cryptology Conference. Springer, pp 148–164 Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Annual International Cryptology Conference. Springer, pp 148–164
22.
23.
go back to reference Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on boolean operations. Pattern Recognit 40(10):2776–2785CrossRef Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on boolean operations. Pattern Recognit 40(10):2776–2785CrossRef
24.
go back to reference Wijaya S, Tan SK, Guan SU (2007) Permutation and sampling with maximum length CA or pseudorandom number generation. Appl Math Comput 185(1):312–321MathSciNetMATH Wijaya S, Tan SK, Guan SU (2007) Permutation and sampling with maximum length CA or pseudorandom number generation. Appl Math Comput 185(1):312–321MathSciNetMATH
25.
go back to reference Wolfram S (2018) Cellular automata and complexity: collected papers. CRC Press, Boca RatonCrossRef Wolfram S (2018) Cellular automata and complexity: collected papers. CRC Press, Boca RatonCrossRef
Metadata
Title
High-speed GPU implementation of a secret sharing scheme based on cellular automata
Authors
Saeideh Kabirirad
Mahmood Fazlali
Ziba Eslami
Publication date
28-06-2019
Publisher
Springer US
Published in
The Journal of Supercomputing / Issue 11/2019
Print ISSN: 0920-8542
Electronic ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-019-02910-w

Other articles of this Issue 11/2019

The Journal of Supercomputing 11/2019 Go to the issue

Premium Partner