{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T15:53:47Z","timestamp":1769097227592,"version":"3.49.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Real-Time Image Proc"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s11554-023-01337-0","type":"journal-article","created":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T19:03:17Z","timestamp":1689015797000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["FPGA acceleration of secret sharing for 3D data cubes"],"prefix":"10.1007","volume":"20","author":[{"given":"Zi-Ming","family":"Wu","sequence":"first","affiliation":[]},{"given":"Tao","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Jeng-Shyang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Hong-Mei","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"issue":"3","key":"1337_CR1","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.335890","volume":"40","author":"A Beimel","year":"1994","unstructured":"Beimel, A., Chor, B.: Universally ideal secret-sharing schemes. IEEE Trans. Inf. Theory 40(3), 786\u2013794 (1994)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1337_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: International workshop on managing requirements knowledge, pp. 313\u2013313. IEEE Computer Society (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"1337_CR3","doi-asserted-by":"crossref","unstructured":"Blanton, M., Kang, A., Yuan, C.: Improved building blocks for secure multi-party computation based on secret sharing with honest majority. In: International Conference on Applied Cryptography and Network Security. Springer, pp. 377\u2013397 (2020)","DOI":"10.1007\/978-3-030-57808-4_19"},{"issue":"4","key":"1337_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s13735-018-0161-3","volume":"8","author":"OB Chanu","year":"2019","unstructured":"Chanu, O.B., Neelima, A.: A survey paper on secret image sharing schemes. Int. J. Multimed. Inf. Retriev. 8(4), 195\u2013215 (2019). https:\/\/doi.org\/10.1007\/s13735-018-0161-3","journal-title":"Int. J. Multimed. Inf. Retriev."},{"key":"1337_CR5","doi-asserted-by":"crossref","unstructured":"Halpern, J., Teague, V.: Rational secret sharing and multiparty computation. In: Proceedings of the Thirty-Sixth Annual ACM Symposium on Theory of Computing, pp. 623\u2013632 (2004)","DOI":"10.1145\/1007352.1007447"},{"issue":"10","key":"1337_CR6","doi-asserted-by":"publisher","first-page":"1202","DOI":"10.1093\/comjnl\/bxs061","volume":"55","author":"J Han","year":"2012","unstructured":"Han, J., Susilo, W., Mu, Y., Yan, J.: Attribute-based oblivious access control. Comput. J. 55(10), 1202\u20131215 (2012). https:\/\/doi.org\/10.1093\/comjnl\/bxs061","journal-title":"Comput. J."},{"issue":"3","key":"1337_CR7","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1093\/comjnl\/45.3.293","volume":"45","author":"G Hanaoka","year":"2002","unstructured":"Hanaoka, G., Nishioka, T., Zheng, Y., Imai, H.: A hierarchical non-interactive key-sharing scheme with low memory size and high resistance against collusion attacks. Comput. J. 45(3), 293\u2013303 (2002). https:\/\/doi.org\/10.1093\/comjnl\/45.3.293","journal-title":"Comput. J."},{"key":"1337_CR8","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1090\/conm\/686\/13783","volume":"686","author":"JP Hansen","year":"2017","unstructured":"Hansen, J.P.: Secret sharing schemes with strong multiplication and a large number of players from toric varieties. Contemp. Math. 686, 171\u2013185 (2017). https:\/\/doi.org\/10.1090\/conm\/686\/13783","journal-title":"Contemp. Math."},{"key":"1337_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.entcs.2007.01.065","volume":"186","author":"S Iftene","year":"2007","unstructured":"Iftene, S.: General secret sharing based on the Chinese remainder theorem with applications in e-voting. Electro. Notes Theor. Comput. Sci. 186, 67\u201384 (2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.01.065","journal-title":"Electro. Notes Theor. Comput. Sci."},{"key":"1337_CR10","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jisa.2019.03.018","volume":"47","author":"S Kabirirad","year":"2019","unstructured":"Kabirirad, S., Eslami, Z.: Improvement of $$(n, n)$$-multi-secret image sharing schemes based on Boolean operations. J. Inf. Secur. Appl. 47, 16\u201327 (2019). https:\/\/doi.org\/10.1016\/j.jisa.2019.03.018","journal-title":"J. Inf. Secur. Appl."},{"key":"1337_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-021-11554-z","author":"S Kumar","year":"2022","unstructured":"Kumar, S.: Extending boolean operations-based secret image sharing to compartmented access structure. Multimed. Tools Appl. (2022). https:\/\/doi.org\/10.1007\/s11042-021-11554-z","journal-title":"Multimed. Tools Appl."},{"issue":"4","key":"1337_CR12","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1093\/comjnl\/bxw061","volume":"60","author":"J Liu","year":"2017","unstructured":"Liu, J., Wu, Y., Liu, X., Zhang, Y., Xue, G., Zhou, W., Yao, S.: On the (in) security of recent group key distribution protocols. Comput. J. 60(4), 507\u2013526 (2017). https:\/\/doi.org\/10.1093\/comjnl\/bxw061","journal-title":"Comput. J."},{"key":"1337_CR13","doi-asserted-by":"publisher","DOI":"10.3390\/app9214670","author":"T Liu","year":"2019","unstructured":"Liu, T., Yan, B., Pan, J.S.: Color visual secret sharing for QR code with perfect module reconstruction. Appl. Sci. (2019). https:\/\/doi.org\/10.3390\/app9214670","journal-title":"Appl. Sci."},{"issue":"9","key":"1337_CR14","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"RJ McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Commun. ACM 24(9), 583\u2013584 (1981). https:\/\/doi.org\/10.1145\/358746.358762","journal-title":"Commun. ACM"},{"key":"1337_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.104049","volume":"97","author":"JS Pan","year":"2021","unstructured":"Pan, J.S., Sun, X.X., Chu, S.C., Abraham, A., Yan, B.: Digital watermarking with improved SMS applied for QR code. Eng. Appl. Artif. Intell. 97, 104049 (2021). https:\/\/doi.org\/10.1016\/j.engappai.2020.104049","journal-title":"Eng. Appl. Artif. Intell."},{"key":"1337_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2021.103405","volume":"82","author":"JS Pan","year":"2022","unstructured":"Pan, J.S., Liu, T., Yang, H.M., Yan, B., Chu, S.C., Zhu, T.: Visual cryptography scheme for secret color images with color QR codes. J. Vis. Commun. Image Represent. 82, 103405 (2022)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1337_CR17","doi-asserted-by":"crossref","unstructured":"Patel, R., Wolfe, P.F., Munafo, R., Varia, M., Herbordt, M.: Arithmetic and Boolean secret sharing MPC on FPGAs in the data center. In: 2020 IEEE High Performance Extreme Computing Conference (HPEC), pp. 1\u20138. IEEE (2020)","DOI":"10.1109\/HPEC43674.2020.9286159"},{"issue":"1","key":"1337_CR18","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1049\/ise2.12007","volume":"15","author":"H Pilaram","year":"2021","unstructured":"Pilaram, H., Eghlidos, T., Toluee, R.: An efficient lattice-based threshold signature scheme using multi-stage secret sharing. IET Inf. Secur. 15(1), 98\u2013106 (2021). https:\/\/doi.org\/10.1049\/ise2.12007","journal-title":"IET Inf. Secur."},{"key":"1337_CR19","doi-asserted-by":"crossref","unstructured":"Prasetyo, H., Simatupang, J.W.: XOR-ed based friendly-progressive secret sharing. In: 2019 International Symposium on Intelligent Signal Processing and Communication Systems (ISPACS), pp. 1\u20132. IEEE (2019)","DOI":"10.1109\/ISPACS48206.2019.8986406"},{"issue":"4","key":"1337_CR20","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1109\/TCSVT.2021.3091319","volume":"32","author":"C Qin","year":"2021","unstructured":"Qin, C., Jiang, C., Mo, Q., Yao, H., Chang, C.C.: Reversible data hiding in encrypted image via secret sharing based on GF (p) and GF ($$2^{8}$$). IEEE Trans. Circ. Syst. Video Technol. 32(4), 1928\u20131941 (2021). https:\/\/doi.org\/10.1109\/TCSVT.2021.3091319","journal-title":"IEEE Trans. Circ. Syst. Video Technol."},{"key":"1337_CR21","unstructured":"Rolf, O.: Contemporary cryptography. Ph.D. thesis, Artech House, Inc. (2011)"},{"issue":"11","key":"1337_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979). https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"1337_CR23","doi-asserted-by":"crossref","unstructured":"Stangl, J., Lor\u00fcnser, T., Dinakarrao, S.M.P.: A fast and resource efficient FPGA implementation of secret sharing for storage applications. In: 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 654\u2013659. IEEE (2018)","DOI":"10.23919\/DATE.2018.8342091"},{"issue":"5","key":"1337_CR24","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/S0097-8493(02)00131-0","volume":"26","author":"CC Thien","year":"2002","unstructured":"Thien, C.C., Lin, J.C.: Secret image sharing. Comput. Graph. 26(5), 765\u2013770 (2002). https:\/\/doi.org\/10.1016\/S0097-8493(02)00131-0","journal-title":"Comput. Graph."},{"issue":"6","key":"1337_CR25","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.patrec.2005.09.021","volume":"27","author":"RZ Wang","year":"2006","unstructured":"Wang, R.Z., Su, C.H.: Secret image sharing with smaller shadow images. Pattern Recogn. Lett. 27(6), 551\u2013555 (2006). https:\/\/doi.org\/10.1016\/j.patrec.2005.09.021","journal-title":"Pattern Recogn. Lett."},{"issue":"11","key":"1337_CR26","doi-asserted-by":"publisher","first-page":"2094","DOI":"10.1002\/SEC.921","volume":"7","author":"F Wang","year":"2014","unstructured":"Wang, F., Chang, C.C., Harn, L.: Simulatable and secure certificate-based threshold signature without pairings. Secur. Commun. Netw. 7(11), 2094\u20132103 (2014). https:\/\/doi.org\/10.1002\/SEC.921","journal-title":"Secur. Commun. Netw."},{"key":"1337_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jvcir.2022.103520","volume":"86","author":"F Xing","year":"2022","unstructured":"Xing, F., Yan, X., Yu, L., Sun, Y.: Information hiding in the sharing domain. J. Vis. Commun. Image Represent. 86, 103520 (2022). https:\/\/doi.org\/10.1016\/j.jvcir.2022.103520","journal-title":"J. Vis. Commun. Image Represent."},{"key":"1337_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2021.108064","volume":"185","author":"L Xiong","year":"2021","unstructured":"Xiong, L., Han, X., Yang, C.N.: CP-PSIS: CRT and polynomial-based progressive secret image sharing. Signal Process. 185, 108064 (2021). https:\/\/doi.org\/10.1016\/j.sigpro.2021.108064","journal-title":"Signal Process."}],"container-title":["Journal of Real-Time Image Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11554-023-01337-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11554-023-01337-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11554-023-01337-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T19:24:38Z","timestamp":1690226678000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11554-023-01337-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1337"],"URL":"https:\/\/doi.org\/10.1007\/s11554-023-01337-0","relation":{},"ISSN":["1861-8200","1861-8219"],"issn-type":[{"value":"1861-8200","type":"print"},{"value":"1861-8219","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"12 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 June 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"82"}}