{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:49:49Z","timestamp":1725731389958},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390586"},{"type":"electronic","value":"9783642390593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39059-3_29","type":"book-chapter","created":{"date-parts":[[2013,6,14]],"date-time":"2013-06-14T01:33:17Z","timestamp":1371173597000},"page":"419-434","source":"Crossref","is-referenced-by-count":0,"title":["Secret Sharing Schemes with Conversion Protocol to Achieve Short Share-Size and Extendibility to Multiparty Computation"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Kikuchi","sequence":"first","affiliation":[]},{"given":"Koji","family":"Chida","sequence":"additional","affiliation":[]},{"given":"Dai","family":"Ikarashi","sequence":"additional","affiliation":[]},{"given":"Koki","family":"Hamada","sequence":"additional","affiliation":[]},{"given":"Katsumi","family":"Takahashi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: STOC, pp. 1\u201310 (1988)","key":"29_CR1","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the National Computer Conference, vol.\u00a048, pp. 313\u2013317 (1979)","key":"29_CR2","DOI":"10.1109\/MARK.1979.8817296"},{"key":"29_CR3","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":"G.R. Blakley","year":"1985","unstructured":"Blakley, G.R., Meadows, C.: Security of ramp schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 242\u2013268. Springer, Heidelberg (1985)"},{"key":"29_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-88313-5_13","volume-title":"Computer Security - ESORICS 2008","author":"D. Bogdanov","year":"2008","unstructured":"Bogdanov, D., Laur, S., Willemson, J.: Sharemind: A framework for fast privacy-preserving computations. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 192\u2013206. Springer, Heidelberg (2008)"},{"issue":"6","key":"29_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10207-012-0177-2","volume":"11","author":"D. Bogdanov","year":"2012","unstructured":"Bogdanov, D., Niitsoo, M., Toft, T., Willemson, J.: High-performance secure multi-party computation for data mining applications. Int. J. Inf. Sec.\u00a011(6), 403\u2013418 (2012)","journal-title":"Int. J. Inf. Sec."},{"unstructured":"Burkhart, M., Strasser, M., Many, D., Dimitropoulos, X.A.: Sepia: Privacy-preserving aggregation of multi-domain network events and statistics. In: USENIX Security Symposium, pp. 223\u2013240 (2010)","key":"29_CR6"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols (extended abstract). In: STOC, pp. 11\u201319 (1988)","key":"29_CR7","DOI":"10.1145\/62212.62214"},{"key":"29_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-540-72540-4_19","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"R. Cramer","year":"2007","unstructured":"Cramer, R., Damg\u00e5rd, I., de Haan, R.: Atomic secure multi-party multiplication with low communication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 329\u2013346. Springer, Heidelberg (2007)"},{"key":"29_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-30576-7_19","volume-title":"Theory of Cryptography","author":"R. Cramer","year":"2005","unstructured":"Cramer, R., Damg\u00e5rd, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378, pp. 342\u2013362. Springer, Heidelberg (2005)"},{"key":"29_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45539-6_22","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Cramer","year":"2000","unstructured":"Cramer, R., Damg\u00e5rd, I., Maurer, U.M.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 316\u2013334. Springer, Heidelberg (2000)"},{"key":"29_CR11","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.\u00a03876, pp. 285\u2013304. Springer, Heidelberg (2006)"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/0-387-34805-0_28","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y., Frankel, Y.: Threshold cryptosystems. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 307\u2013315. Springer, Heidelberg (1990)"},{"doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: STOC, pp. 699\u2013710 (1992)","key":"29_CR13","DOI":"10.1145\/129712.129780"},{"issue":"3","key":"29_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s10623-011-9515-z","volume":"62","author":"H. Ghodosi","year":"2012","unstructured":"Ghodosi, H., Pieprzyk, J., Steinfeld, R.: Multi-party computation with conversion of secret sharing. Des. Codes Cryptography\u00a062(3), 259\u2013272 (2012)","journal-title":"Des. Codes Cryptography"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O.: The Foundations of Cryptography. Basic Applications, vol.\u00a02. Cambridge University Press (2004)","key":"29_CR15","DOI":"10.1017\/CBO9780511721656"},{"unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structure. In: Proc. of the IEEE Global Telecommunication Conf., Globecom 1987, pp. 99-102 (1987)","key":"#cr-split#-29_CR16.1"},{"doi-asserted-by":"crossref","unstructured":"Journal version: Multiple assignment scheme for sharing secret. J. of Cryptology 6(1), 15-20 (1993)","key":"#cr-split#-29_CR16.2","DOI":"10.1007\/BF02620229"},{"key":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 136\u2013146. Springer, Heidelberg (1994)"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M.O. Rabin","year":"1989","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. Journal of the ACM\u00a036(2), 335\u2013348 (1989)","journal-title":"Journal of the ACM"},{"key":"29_CR19","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1007\/978-1-4612-3352-7_32","volume-title":"Sequences","author":"M.O. Rabin","year":"1990","unstructured":"Rabin, M.O.: Sequences, pp. 406\u2013419. Springer-Verlag New York, Inc., New York (1990)"},{"unstructured":"Resch, J.K., Plank, J.S.: Aont-rs: Blending security and performance in dispersed storage systems. In: FAST, pp. 191\u2013202 (2011)","key":"29_CR20"},{"key":"29_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0052348","volume-title":"Fast Software Encryption","author":"R.L. Rivest","year":"1997","unstructured":"Rivest, R.L.: All-or-nothing encryption and the package transform. In: Biham, E. (ed.) FSE 1997. LNCS, vol.\u00a01267, pp. 210\u2013218. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Rogaway, P., Bellare, M.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: ACM Conference on Computer and Communications Security, pp. 172\u2013184 (2007)","key":"29_CR22","DOI":"10.1145\/1315245.1315268"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/11426639_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"A. Sahai","year":"2005","unstructured":"Sahai, A., Waters, B.: Fuzzy identity-based encryption. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 457\u2013473. Springer, Heidelberg (2005)"},{"issue":"11","key":"29_CR24","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. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"unstructured":"Yamamoto, H.: Secret sharing system using (k,l,n) threshold scheme. IECE Trans.\u00a0J68-A(9), 945-952 (1985) (in Japanese)","key":"#cr-split#-29_CR25.1"},{"doi-asserted-by":"crossref","unstructured":"English translation: Electronics and Communications in Japan, Part I, vol. 69(9), pp. 46-54. Scripta Technica, Inc. (1986)","key":"#cr-split#-29_CR25.2","DOI":"10.1002\/ecja.4410690906"}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39059-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,25]],"date-time":"2022-02-25T03:09:07Z","timestamp":1645758547000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39059-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390586","9783642390593"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39059-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}