{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:51Z","timestamp":1740123531794,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T00:00:00Z","timestamp":1561680000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1007\/s11227-019-02910-w","type":"journal-article","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T15:02:42Z","timestamp":1561734162000},"page":"7314-7336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["High-speed GPU implementation of a secret sharing scheme based on cellular automata"],"prefix":"10.1007","volume":"75","author":[{"given":"Saeideh","family":"Kabirirad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahmood","family":"Fazlali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9818-3911","authenticated-orcid":false,"given":"Ziba","family":"Eslami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,28]]},"reference":[{"issue":"22","key":"2910_CR1","doi-asserted-by":"publisher","first-page":"4382","DOI":"10.1016\/j.ins.2008.07.010","volume":"178","author":"G Alvarez","year":"2008","unstructured":"Alvarez G, Encinas LH, Del Rey AM (2008) A multisecret sharing scheme for color images based on cellular automata. Inf Sci 178(22):4382\u20134395","journal-title":"Inf Sci"},{"key":"2910_CR2","unstructured":"Blakley GR et al (1979) Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference. vol 48, pp 313\u2013317"},{"key":"2910_CR3","doi-asserted-by":"crossref","unstructured":"Cramer R, Damg\u00e5rd I, Nielsen JB (2001) Multiparty computation from threshold homomorphic encryption. In: International Conference on the Theory and Applications of Cryptographic Techniques. Springer, pp 280\u2013300","DOI":"10.1007\/3-540-44987-6_18"},{"issue":"2","key":"2910_CR4","first-page":"1356","volume":"170","author":"AM Del Rey","year":"2005","unstructured":"Del Rey AM, Mateus JP, S\u00e1nchez GR (2005) A secret sharing scheme based on cellular automata. Appl Math Comput 170(2):1356\u20131364","journal-title":"Appl Math Comput"},{"issue":"15","key":"2910_CR5","doi-asserted-by":"publisher","first-page":"2889","DOI":"10.1016\/j.ins.2010.04.015","volume":"180","author":"Z Eslami","year":"2010","unstructured":"Eslami Z, Ahmadabadi JZ (2010) A verifiable multi-secret sharing scheme based on cellular automata. Inf Sci 180(15):2889\u20132894","journal-title":"Inf Sci"},{"issue":"6","key":"2910_CR6","first-page":"331","volume":"19","author":"KM Faraoun","year":"2014","unstructured":"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\u2013340","journal-title":"J Inf Secur Appl"},{"key":"2910_CR7","doi-asserted-by":"crossref","unstructured":"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\u201398","DOI":"10.1145\/1180405.1180418"},{"key":"2910_CR8","doi-asserted-by":"crossref","unstructured":"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\u201331","DOI":"10.1145\/2458523.2458526"},{"issue":"7","key":"2910_CR9","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1109\/TPDS.2009.135","volume":"21","author":"PH Ha","year":"2010","unstructured":"Ha PH, Tsigas P, Anshus OJ (2010) The synchronization power of coalesced memory accesses. IEEE Trans Parallel Distrib Syst 21(7):939\u2013953","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"2","key":"2910_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1049\/el:19950073","volume":"31","author":"J He","year":"1995","unstructured":"He J, Dawson E (1995) Multisecret-sharing scheme based on one-way function. Electron Lett 31(2):93\u201395","journal-title":"Electron Lett"},{"key":"2910_CR11","first-page":"649","volume":"10","author":"A Hernandez-Becerril","year":"2013","unstructured":"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\u2013660","journal-title":"J Commun Comput"},{"key":"2910_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013196","DOI":"10.1109\/SoMeT.2013.6645679"},{"issue":"4","key":"2910_CR13","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1007\/s11227-016-1646-6","volume":"72","author":"RA Hernandez-Becerril","year":"2016","unstructured":"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\u20131311","journal-title":"J Supercomput"},{"key":"2910_CR14","unstructured":"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\u00a01"},{"key":"2910_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013320","DOI":"10.1145\/2304576.2304619"},{"issue":"9","key":"2910_CR16","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"1989","unstructured":"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\u201364","journal-title":"Electron Commun Jpn (Part III Fundam Electron Sci)"},{"issue":"2","key":"2910_CR17","first-page":"840","volume":"167","author":"LJ Pang","year":"2005","unstructured":"Pang LJ, Wang YM (2005) A new (t, n) multi-secret sharing scheme based on shamirs secret sharing. Appl Math Comput 167(2):840\u2013848","journal-title":"Appl Math Comput"},{"key":"2910_CR18","unstructured":"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"},{"key":"2910_CR19","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1016\/j.procs.2011.04.221","volume":"4","author":"A Sch\u00e4fer","year":"2011","unstructured":"Sch\u00e4fer A, Fey D (2011) High performance stencil code algorithms for GPGPUs. Procedia Comput Sci 4:2027\u20132036","journal-title":"Procedia Comput Sci"},{"key":"2910_CR20","doi-asserted-by":"crossref","unstructured":"Schoenmakers B (1999) A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Annual International Cryptology Conference. Springer, pp 148\u2013164","DOI":"10.1007\/3-540-48405-1_10"},{"issue":"11","key":"2910_CR21","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"2910_CR22","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ins.2014.03.025","volume":"278","author":"J Shao","year":"2014","unstructured":"Shao J (2014) Efficient verifiable multi-secret sharing scheme based on hash function. Inf Sci 278:104\u2013109","journal-title":"Inf Sci"},{"issue":"10","key":"2910_CR23","doi-asserted-by":"publisher","first-page":"2776","DOI":"10.1016\/j.patcog.2006.11.018","volume":"40","author":"D Wang","year":"2007","unstructured":"Wang D, Zhang L, Ma N, Li X (2007) Two secret sharing schemes based on boolean operations. Pattern Recognit 40(10):2776\u20132785","journal-title":"Pattern Recognit"},{"issue":"1","key":"2910_CR24","first-page":"312","volume":"185","author":"S Wijaya","year":"2007","unstructured":"Wijaya S, Tan SK, Guan SU (2007) Permutation and sampling with maximum length CA or pseudorandom number generation. Appl Math Comput 185(1):312\u2013321","journal-title":"Appl Math Comput"},{"key":"2910_CR25","doi-asserted-by":"publisher","DOI":"10.1201\/9780429494093","volume-title":"Cellular automata and complexity: collected papers","author":"S Wolfram","year":"2018","unstructured":"Wolfram S (2018) Cellular automata and complexity: collected papers. CRC Press, Boca Raton"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02910-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02910-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02910-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,27]],"date-time":"2020-06-27T02:36:42Z","timestamp":1593225402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02910-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,28]]},"references-count":25,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["2910"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02910-w","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,6,28]]},"assertion":[{"value":"28 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}