{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:39:07Z","timestamp":1725755947862},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642413827"},{"type":"electronic","value":"9783642413834"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41383-4_17","type":"book-chapter","created":{"date-parts":[[2013,11,11]],"date-time":"2013-11-11T04:37:33Z","timestamp":1384144653000},"page":"258-271","source":"Crossref","is-referenced-by-count":11,"title":["On Cheater Identifiable Secret Sharing Schemes Secure against Rushing Adversary"],"prefix":"10.1007","author":[{"given":"Rui","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"11","key":"17_CR1","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\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: AFIPS:79 National Computer Conference, pp. 313\u2013317. IEEE Computer Society (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1002\/ett.4460050407","volume":"5","author":"Y. Desmedt","year":"1994","unstructured":"Desmedt, Y.: Threshold cryptography. European Transactions on Telecommunications\u00a05(4), 449\u2013458 (1994)","journal-title":"European Transactions on Telecommunications"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC, vol.\u00a01989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"17_CR5","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.: 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)"},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. J. ACM\u00a040(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"issue":"2","key":"17_CR7","first-page":"133","volume":"1","author":"M. Tompa","year":"1988","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptology\u00a01(2), 133\u2013138 (1988)","journal-title":"J. Cryptology"},{"issue":"9","key":"17_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. McEliece","year":"1981","unstructured":"McEliece, R., Sarwate, D.: On sharing secrets and reed-solomon codes. Commun. ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Commun. ACM"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1007\/3-540-44750-4_33","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"K. Kurosawa","year":"1995","unstructured":"Kurosawa, K., Obana, S., Ogata, W.: t-cheater identifiable (k, n) threshold secret sharing schemes. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 410\u2013423. Springer, Heidelberg (1995)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-20465-4_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"S. Obana","year":"2011","unstructured":"Obana, S.: Almost optimum t-cheater identifiable secret sharing schemes. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 284\u2013302. Springer, Heidelberg (2011)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Choudhury, A.: Brief announcement: optimal amortized secret sharing with cheater identification. In: PODC 2012, pp. 101\u2013102 (2012)","DOI":"10.1145\/2332432.2332453"},{"key":"17_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-642-29011-4_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A. Cevallos","year":"2012","unstructured":"Cevallos, A., Fehr, S., Ostrovsky, R., Rabani, Y.: Unconditionally-secure robust secret sharing with compact shares. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 195\u2013208. Springer, Heidelberg (2012)"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01388382","volume":"5","author":"M. Carpentieri","year":"1995","unstructured":"Carpentieri, M.: A perfect threshold secret sharing scheme to identify cheaters. Des. Codes Cryptography\u00a05(3), 183\u2013187 (1995)","journal-title":"Des. Codes Cryptography"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-28914-9_2","volume-title":"Theory of Cryptography","author":"Y. Ishai","year":"2012","unstructured":"Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 21\u201338. Springer, Heidelberg (2012)"},{"key":"17_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-44647-8_30","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Fehr, S.: On the cost of reconstructing a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 503\u2013523. Springer, Heidelberg (2001)"},{"issue":"2","key":"17_CR16","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I. Reed","year":"1960","unstructured":"Reed, I., Solomon, G.: Polynomial codes over certain finite fields. Journal of the Society for Industrial & Applied Mathematics\u00a08(2), 300\u2013304 (1960)","journal-title":"Journal of the Society for Industrial & Applied Mathematics"},{"key":"17_CR17","unstructured":"Welch, L., Berlekamp, E.: Error correction for algebraic block codes US Patent 4,633,470 (December 30, 1986)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Roth, R.: Introduction to coding theory. Cambridge University Press (2006)","DOI":"10.1017\/CBO9780511808968"},{"issue":"3","key":"17_CR19","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, L.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci.\u00a022(3), 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41383-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T14:04:29Z","timestamp":1596809069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41383-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642413827","9783642413834"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41383-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}