{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T03:40:02Z","timestamp":1748403602505,"version":"3.41.0"},"publisher-location":"Cham","reference-count":37,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319197128"},{"type":"electronic","value":"9783319197135"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19713-5_30","type":"book-chapter","created":{"date-parts":[[2015,5,26]],"date-time":"2015-05-26T13:19:45Z","timestamp":1432646385000},"page":"347-365","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SW-SSS: Slepian-Wolf Coding-Based Secret Sharing Scheme"],"prefix":"10.1007","author":[{"given":"Kazumasa","family":"Omote","sequence":"first","affiliation":[]},{"given":"Tran Phuong","family":"Thao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"30_CR1","unstructured":"Pedersen, T.B, Saygin, Y., Savas, E.: Secret Sharing vs. Encryption-based techniques for privacy preserving data mining, pp. 17\u201319. Sciences, New York (2007)"},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"Nirali, R.N., Devesh, C.J.: A game theory based repeated rational secret sharing scheme for privacy preserving distributed data mining. SECRYPT, pp. 512\u2013517 (2013)","DOI":"10.5220\/0004525205120517"},{"key":"30_CR3","series-title":"Lecture notes in computer science (lecture notes in artificial intelligence)","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-77018-3_29","volume-title":"Emerging Technologies in Knowledge Discovery and Data Mining","author":"SV Kaya","year":"2007","unstructured":"Kaya, S.V., Pedersen, T.B., Sava\u015f, E., Sayg\u0131\u00fdn, Y.: Efficient privacy preserving distributed clustering based on secret sharing. In: Washio, T., Zhou, Z.-H., Huang, J.Z., Hu, X., Li, J., Xie, C., He, J., Zou, D., Li, K.-C., Freire, M. (eds.) PAKDD 2007. LNCS (LNAI), vol. 4819, pp. 280\u2013291. Springer, Heidelberg (2007)"},{"issue":"11","key":"30_CR4","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. Proc. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Proc. Commun. ACM"},{"key":"30_CR5","first-page":"313","volume":"48","author":"GR Blakley","year":"1979","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. AFIPS National Comput. Conf. 48, 313\u2013317 (1979)","journal-title":"AFIPS National Comput. Conf."},{"issue":"1","key":"30_CR6","first-page":"3541","volume":"29","author":"E Karnin","year":"1983","unstructured":"Karnin, E., Greene, J.W., Hellman, M.E.: On secret sharing systems. IEEE Trans. Inform. Theory 29(1), 3541 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"157167","DOI":"10.1007\/BF00198463","volume":"6","author":"RM Capocelli","year":"1993","unstructured":"Capocelli, R.M., Santis, A.D., Gargano, L., Vaccaro, U.: On the size of shares for secret sharing schemes. J. Cryptology 6, 157167 (1993)","journal-title":"J. Cryptology"},{"key":"30_CR8","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/3-540-39568-7_20","volume-title":"Advances in Cryptology","author":"GR Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"30_CR9","unstructured":"Yamamoto, H.: On secret sharing systems using $$(k, L, n)$$ threshold scheme. IEICE Trans. Fundam. 68(9), 945\u2013952 (1985) (Japanese Edition)"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Okada, K., Sakano, K., Ogata, W., Tsujii, T.: Non perfect secret sharing schemes and matroids. In: Workshop on the Theory and Application of Cryptographic Techniques (EUROCRYPT). LNCS 765, Springer, pp. 126\u2013141 (1993)","DOI":"10.1007\/3-540-48285-7_11"},{"issue":"8","key":"30_CR11","first-page":"690","volume":"4","author":"W Ogata","year":"1998","unstructured":"Ogata, W., Kurosawa, K.: Some basic properties of general nonperfect secret sharing schemes. J. Univ. Comput. Sci. 4(8), 690\u2013704 (1998)","journal-title":"J. Univ. Comput. Sci."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Okada, K., Kurosawa, K.: Lower bound on the size of shares of nonperfect secret sharing schemes. In: Conference on the Theory and Applications of Cryptology (ASIACRYPT). LNCS 917, p. 3441. Springer (1994)","DOI":"10.1007\/BFb0000422"},{"key":"30_CR13","volume-title":"Efficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud without Encryption","author":"Y Wang","year":"2012","unstructured":"Wang, Y.: Efficient LDPC Code Based Secret Sharing Schemes and Private Data Storage in Cloud without Encryption. Technical report, UNC Charlotte (2012)"},{"key":"30_CR14","unstructured":"Ishizu, H., Ogihara, T.: A study on long-term storage of electronic data. IEICE Gen. Conf. 125(1), 9\u201310 (2004)"},{"key":"30_CR15","unstructured":"Hosaka, N., Tochikubo, K., Fujii, Y., Tada, M., Kato, T.: $$(2, n)$$-threshold secret sharing systems based on binary matrices. In: Symposium on SCIS, pp. 2D1-4 (2007) (in Japanese)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast (3, n)-threshold secret sharing scheme using exclusive-OR operations. IEICE Trans. E91-A(1), 127\u2013138 (2008)","DOI":"10.1093\/ietfec\/e91-a.1.127"},{"key":"30_CR17","unstructured":"Shiina, N., Okamoto, T., Okamoto, E.: How to convert 1-out-of-n proof into k-out-of-n proof. In: Symposium on SCIS (in Japanese), pp. 1435\u20131440 (2004)"},{"key":"30_CR18","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-540-85886-7_31","volume-title":"Information Security","author":"J Kurihara","year":"2008","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A new (k,n)-threshold secret sharing scheme and its extension. In: Wu, T.-C., Lei, C.-L., Rijmen, V., Lee, D.-T. (eds.) ISC 2008. LNCS, vol. 5222, pp. 455\u2013470. Springer, Heidelberg (2008)"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Chunli, L., Jia, X., Tian, L., Jing, J., Sun, M.: Efficient ideal threshold secret sharing schemes based on EXCLUSIVE-OR operations. In: 4th Conference on Network and System Security (NSS), pp. 136\u2013143 (2010)","DOI":"10.1109\/NSS.2010.82"},{"key":"30_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Y., Desmedt, Y.: Efficient Secret Sharing Schemes Achieving Optimal Information Rate. In: Information Theory Workshop (ITW) (2014)","DOI":"10.1109\/ITW.2014.6970885"},{"key":"30_CR21","doi-asserted-by":"publisher","unstructured":"Kurihara, J., Kiyomoto, S., Fukushima, K., Tanaka, T.: A fast (k-L-N)-threshold Ramp secret sharing scheme. IEICE Trans. Fundam. (2009). doi:10.1587\/transfun.E92.A.1808","DOI":"10.1587\/transfun.E92.A.1808"},{"key":"30_CR22","unstructured":"Kurihara, M., Kuwakado, H.: Secret sharing schemes based on minimum bandwidth regenerating codes. In: Symposium on Information Theory and its Applications (ISITA), pp. 255\u2013259 (2012)"},{"key":"30_CR23","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-319-02726-5_6","volume-title":"Information and Communications Security","author":"J Liu","year":"2013","unstructured":"Liu, J., Wang, H., Xian, M., Huang, K.: A secure and efficient scheme for cloud storage against eavesdropper. In: Qing, S., Zhou, J., Liu, D. (eds.) ICICS 2013. LNCS, vol. 8233, pp. 75\u201389. Springer, Heidelberg (2013)"},{"key":"30_CR24","unstructured":"Cai, N., Raymond, W.Y.: Secure network coding. In: IEEE International Symposium on Information Theory (2002)"},{"issue":"3","key":"30_CR25","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1109\/TNET.2008.923722","volume":"16","author":"S Katti","year":"2008","unstructured":"Katti, S., Rahul, H., Hu, W., Katabi, D., Medard, M., Crowcroft, J.: XORs in the air: practical wireless network coding. Trans. Netw. 16(3), 497\u2013510 (2008)","journal-title":"Trans. Netw."},{"key":"30_CR26","doi-asserted-by":"crossref","unstructured":"Yu, Z., Wei, Y., Ramkumar, B., Guan, Y.: An efficient scheme for securing XOR network coding against pollution attacks. In: 28th Conference on Computer Communication (INFOCOM), pp. 406\u2013414 (2009)","DOI":"10.1109\/INFCOM.2009.5061945"},{"issue":"4","key":"30_CR27","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TIT.1973.1055037","volume":"19","author":"D Slepian","year":"1973","unstructured":"Slepian, D., Wolf, J.K.: Noiseless coding of correlated information sources. IEE Trans. Inf. Theory 19(4), 471\u2013480 (1973)","journal-title":"IEE Trans. Inf. Theory"},{"key":"30_CR28","unstructured":"Cheng, S.: Slepian-Wolf Code Designs. http:\/\/tulsagrad.ou.edu\/samuel_cheng\/information_theory_2010\/swcd.pdf (2010)"},{"issue":"4","key":"30_CR29","doi-asserted-by":"publisher","first-page":"1204","DOI":"10.1109\/18.850663","volume":"46","author":"R Ahlswede","year":"2000","unstructured":"Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204\u20131216 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"30_CR30","doi-asserted-by":"publisher","first-page":"4413","DOI":"10.1109\/TIT.2006.881746","volume":"52","author":"T Ho","year":"2006","unstructured":"Ho, T., Medard, M., Koetter, R., Karger, D.R., Effros, M., Shi, J., Leong, B.: A random linear network coding approach to multicast. IEEE Trans. Inf. Theory 52(10), 4413\u20134430 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"30_CR31","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1109\/TIT.2002.807285","volume":"49","author":"S-YR Li","year":"2003","unstructured":"Li, S.-Y.R., Raymond, W.Y., Cai, N.: Linear network coding. IEEE Trans. Inf. Theory 49(2), 371\u2013381 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR32","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-642-01957-9_18","volume-title":"Applied Cryptography and Network Security","author":"S Agrawal","year":"2009","unstructured":"Agrawal, S., Boneh, D.: Homomorphic MACs: MAC-based integrity for network coding. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 292\u2013305. Springer, Heidelberg (2009)"},{"issue":"4","key":"30_CR33","doi-asserted-by":"publisher","first-page":"1495","DOI":"10.1109\/TIT.2006.871046","volume":"52","author":"V Stankovic","year":"2006","unstructured":"Stankovic, V., Liveris, A.D., Xiong, Z., Georghiades, C.N.: On code design for the Slepian-Wolf problem and lossless multiterminal networks. IEEE Trans. Inf. Theory 52(4), 1495\u20131507 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Stankovi, V., Liveris, A.D., Xiong, Z., Georghiades, C.N: Design of Slepian-Wolf codes by channel code partitioning. In: Data Compression Conference (DCC), pp. 302\u2013311 (2004)","DOI":"10.1109\/DCC.2004.1281475"},{"issue":"10","key":"30_CR35","doi-asserted-by":"publisher","first-page":"2096","DOI":"10.1109\/TC.2012.135","volume":"62","author":"C Cheng","year":"2012","unstructured":"Cheng, C., Jiang, T.: An efficient homomorphic MAC with small key size for authentication in network coding. IEEE Trans. Comput. 62(10), 2096\u20132100 (2012)","journal-title":"IEEE Trans. Comput."},{"key":"30_CR36","doi-asserted-by":"crossref","unstructured":"Johnson, R., Molnar, D., Song, D., Wagner, D.: Homomorphic Signature Schemes. In: Preneel, B. (ed.). CT-RSA 2002. LNCS, vol. 2271, pp. 244\u2013262. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45760-7_17"},{"key":"30_CR37","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1007\/978-3-642-30057-8_41","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"DM Freeman","year":"2012","unstructured":"Freeman, D.M.: Improved security for linearly homomorphic signatures: a generic framework. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol. 7293, pp. 697\u2013714. Springer, Heidelberg (2012)"}],"container-title":["Advances in Intelligent Systems and Computing","International Joint Conference"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19713-5_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T03:11:55Z","timestamp":1748401915000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19713-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319197128","9783319197135"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19713-5_30","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}