{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T06:51:59Z","timestamp":1726037519249},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242701"},{"type":"electronic","value":"9783030242718"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-24271-8_16","type":"book-chapter","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T23:19:24Z","timestamp":1563405564000},"page":"178-187","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multiplicative Linear Secret Sharing Without Interaction"],"prefix":"10.1007","author":[{"given":"Bo","family":"Mi","sequence":"first","affiliation":[]},{"given":"Darong","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Jianqiu","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Ping","family":"Long","sequence":"additional","affiliation":[]},{"given":"Hongyang","family":"Pan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,7,11]]},"reference":[{"issue":"99","key":"16_CR1","doi-asserted-by":"publisher","first-page":"1706","DOI":"10.1109\/ACCESS.2017.2780087","volume":"6","author":"H El-Sayed","year":"2018","unstructured":"El-Sayed, H., Sankar, S., Prasad, M., et al.: Edge of things: the big picture on the integration of edge, IoT and the cloud in a distributed computing environment. IEEE Access 6(99), 1706\u20131717 (2018)","journal-title":"IEEE Access"},{"unstructured":"Sabat\u00c9, M., Costa, M.A., Kozuma, K., et al.: Survey on various data integrity attacks in cloud environment and the solutions. In: International Conference on Circuits, Power and Computing Technologies, pp. 1076\u20131081. IEEE (2013)","key":"16_CR2"},{"doi-asserted-by":"crossref","unstructured":"Patel, K: Secure multiparty computation using secret sharing. In: International Conference on Signal Processing, Communication, Power and Embedded System, pp. 863\u2013866. IEEE (2017)","key":"16_CR3","DOI":"10.1109\/SCOPES.2016.7955564"},{"unstructured":"Liu, J., Li, W., Karame, G.O., et al.: Scalable byzantine consensus via hardware-assisted secret sharing. IEEE Trans. Comput. 1 (2016)","key":"16_CR4"},{"issue":"3","key":"16_CR5","first-page":"184","volume":"40","author":"MM Xie","year":"2014","unstructured":"Xie, M.M., Liao, X.F., Zhou, Q.: Generalized oblivious transfer protocol in distributed setting based on secret sharing. Comput. Eng. 40(3), 184\u2013187 (2014)","journal-title":"Comput. Eng."},{"issue":"2","key":"16_CR6","first-page":"1","volume":"2017","author":"V Attasena","year":"2017","unstructured":"Attasena, V., Darmont, J., Harbi, N.: Secret sharing for cloud data security: a survey. VLDB J. 2017(2), 1\u201325 (2017)","journal-title":"VLDB J."},{"key":"16_CR7","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, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys, p. 313. IEEE Computer Society (1979)","key":"16_CR8","DOI":"10.1109\/MARK.1979.8817296"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1007\/3-540-46885-4_45","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1989","author":"EF Brickell","year":"1990","unstructured":"Brickell, E.F.: Some ideal secret sharing schemes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 468\u2013475. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_45"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in Cryptology\u2014AUSCRYPT 1992","author":"M Bertilsson","year":"1993","unstructured":"Bertilsson, M., Ingemarsson, I.: A construction of practical secret sharing schemes using linear block codes. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 67\u201379. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57220-1_53"},{"doi-asserted-by":"crossref","unstructured":"Van Dijk, M., Kevenaar, T., Schrijen, G.J., et al.: Improved constructions of secret sharing schemes by applying (\u03bb, w)-decompositions. In: Proceedings of the IEEE International Symposium on Information Theory, p. 282. IEEE (2003)","key":"16_CR11","DOI":"10.1109\/ISIT.2003.1228297"},{"doi-asserted-by":"crossref","unstructured":"Beimel, A., Weinreb, E.: Monotone circuits for monotone weighted threshold functions. Elsevier North-Holland, Inc. (2006)","key":"16_CR12","DOI":"10.1016\/j.ipl.2005.09.008"},{"unstructured":"Li, H., Liu, H.: Multi-access structure secret sharing schemes without dealer. Nat. Sci. J. Harbin Normal Univ. (2013)","key":"16_CR13"},{"doi-asserted-by":"crossref","unstructured":"Basit, A., Kumar, N.C., Venkaiah, V.C., et al.: Multi-stage multi-secret sharing scheme for hierarchical access structure. In: International Conference on Computing, Communication and Automation. IEEE (2017)","key":"16_CR14","DOI":"10.1109\/CCAA.2017.8229863"},{"issue":"9","key":"16_CR15","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1002\/ecjc.4430720906","volume":"72","author":"M Ito","year":"2010","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. Electron. Commun. Jpn. 72(9), 56\u201364 (2010)","journal-title":"Electron. Commun. Jpn."},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology\u2014CRYPTO 1988","author":"J Benaloh","year":"1990","unstructured":"Benaloh, J., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 27\u201335. Springer, New York (1990). https:\/\/doi.org\/10.1007\/0-387-34799-2_3"},{"unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: IEEE Conference on Structure in Complexity Theory, pp. 102\u2013111. IEEE Computer Society (1993)","key":"16_CR17"},{"issue":"4","key":"16_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/s001459900029","volume":"10","author":"L Csirmaz","year":"1997","unstructured":"Csirmaz, L.: The size of a share must be large. J. Cryptol. 10(4), 223\u2013231 (1997)","journal-title":"J. Cryptol."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-642-39884-1_9","volume-title":"Financial Cryptography and Data Security","author":"MP Jhanwar","year":"2013","unstructured":"Jhanwar, M.P., Safavi-Naini, R.: Unconditionally-secure robust secret sharing with minimum share size. In: Sadeghi, A.-R. (ed.) FC 2013. LNCS, vol. 7859, pp. 96\u2013110. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39884-1_9"},{"issue":"99","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TBDATA.2017.2708085","volume":"PP","author":"T Tran","year":"2017","unstructured":"Tran, T., Rahman, M., Bhuiyan, M.Z.A., et al.: Optimizing share size in efficient and robust secret sharing scheme for big data. IEEE Trans. Big Data PP(99), 1 (2017)","journal-title":"IEEE Trans. Big Data"},{"doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., et al.: Homomorphic secret sharing: optimizations and applications. In: ACM SIGSAC Conference on Computer and Communications Security, pp. 2105\u20132122. ACM (2017)","key":"16_CR21","DOI":"10.1145\/3133956.3134107"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11681878_15","volume-title":"Theory of Cryptography","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285\u2013304. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11681878_15"},{"key":"16_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-71677-8_23","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"T Nishide","year":"2007","unstructured":"Nishide, T., Ohta, K.: Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343\u2013360. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71677-8_23"},{"unstructured":"Boyle, E., Gilboa, N., Ishai, Y., et al.: Foundations of homomorphic secret sharing. In: 9th Innovations in Theoretical Computer Science Conference, vol. 21, pp. 1\u201320 (2018)","key":"16_CR24"},{"doi-asserted-by":"crossref","unstructured":"Gennaro, R., Rabin, M.O., Rabin, T.: Simplified VSS and fast-track multiparty computations with applications to threshold cryptography. In: Proceedings of the ACM Symposium on Principles of Distributed Computing, pp. 101\u2013111. ACM Press (1998)","key":"16_CR25","DOI":"10.1145\/277697.277716"},{"unstructured":"Ishai, Y., Kushilevitz, E.: Randomizing polynomials: a new representation with applications to round-efficient secure computation. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 294\u2013304. IEEE (2000)","key":"16_CR26"},{"key":"16_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1007\/978-3-642-36594-2_34","volume-title":"Theory of Cryptography","author":"Y Ishai","year":"2013","unstructured":"Ishai, Y., Kushilevitz, E., Meldgaard, S., Orlandi, C., Paskin-Cherniavsky, A.: On the power of correlated randomness in secure computation. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 600\u2013620. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_34"},{"issue":"4","key":"16_CR28","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/s00145-010-9056-z","volume":"23","author":"O Barkol","year":"2010","unstructured":"Barkol, O., Ishai, Y., Weinreb, E.: On d-multiplicative secret sharing. J. Cryptol. 23(4), 580\u2013593 (2010)","journal-title":"J. Cryptol."},{"key":"16_CR29","first-page":"73","volume-title":"Lecture Notes in Computer Science","author":"Maki Yoshida","year":"2017","unstructured":"Yoshida, M., Obana, S.: Verifiably multiplicative secret sharing. In: International Conference on Information Theoretic Security, pp. 73\u201382 (2017)"},{"key":"16_CR30","series-title":"Lecture Notes in Electrical Engineering","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-662-45402-2_16","volume-title":"Computer Science and its Applications","author":"T Watanabe","year":"2015","unstructured":"Watanabe, T., Iwamura, K., Kaneda, K.: Secrecy multiplication based on a (k, n)-threshold secret-sharing scheme using only k servers. In: Park, J., Stojmenovic, I., Jeong, H., Yi, G. (eds.) Computer Science and its Applications. LNEE, vol. 330, pp. 107\u2013112. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-45402-2_16"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/3-540-68339-9_10","volume-title":"Advances in Cryptology\u2014EUROCRYPT 1996","author":"SR Blackburn","year":"1996","unstructured":"Blackburn, S.R., Burmester, M., Desmedt, Y., Wild, P.R.: Efficient multiplicative sharing schemes. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 107\u2013118. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_10"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/10718964_28","volume-title":"Information Security and Privacy","author":"H Wang","year":"2000","unstructured":"Wang, H., Lam, K.Y., Xiao, G.-Z., Zhao, H.: On multiplicative secret sharing schemes. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) ACISP 2000. LNCS, vol. 1841, pp. 342\u2013351. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10718964_28"},{"issue":"4","key":"16_CR33","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s001459900031","volume":"10","author":"WA Jackson","year":"1997","unstructured":"Jackson, W.A., Martin, K.M., O\u2019Keefe, C.M.: Mutually trusted authority-free secret sharing schemes. J. Cryptol. 10(4), 261\u2013289 (1997)","journal-title":"J. Cryptol."},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/978-3-319-56614-6_6","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"E Boyle","year":"2017","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Group-based secure computation: optimizing rounds, communication, and computation. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 163\u2013193. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_6"},{"issue":"1","key":"16_CR35","first-page":"2","volume":"14","author":"H Pilaram","year":"2017","unstructured":"Pilaram, H., Eghlidos, T.: An efficient lattice based multi-stage secret sharing scheme. IEEE Trans. Dependable Secure Comput. 14(1), 2\u20138 (2017)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"issue":"99","key":"16_CR36","first-page":"1","volume":"PP","author":"M Shi","year":"2017","unstructured":"Shi, M., Guan, Y., Sol\u00e9, P.: Two new families of two-weight codes. IEEE Trans. Inf. Theory PP(99), 1 (2017)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"16_CR37","doi-asserted-by":"crossref","first-page":"341","DOI":"10.32604\/cmc.2018.04006","volume":"57","author":"V Gopinath","year":"2018","unstructured":"Gopinath, V., Bhuvaneswaran, R.S.: Design of ECC based secured cloud storage mechanism for transaction rich applications. CMC: Comput. Mater. Continua 57(2), 341\u2013352 (2018)","journal-title":"CMC: Comput. Mater. Continua"},{"issue":"3","key":"16_CR38","doi-asserted-by":"crossref","first-page":"621","DOI":"10.32604\/cmc.2018.03706","volume":"57","author":"J Zhong","year":"2018","unstructured":"Zhong, J., Liu, Z., Xu, J.: Analysis and improvement of an efficient controlled quantum secure direct communication and authentication protocol. CMC: Comput. Mater. Continua 57(3), 621\u2013633 (2018)","journal-title":"CMC: Comput. Mater. Continua"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24271-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,18]],"date-time":"2023-09-18T10:26:20Z","timestamp":1695032780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24271-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242701","9783030242718"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24271-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"incodldos2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icaisconf.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}