{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:06:04Z","timestamp":1776881164203,"version":"3.51.2"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319491745","type":"print"},{"value":"9783319491752","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","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":[[2016]]},"DOI":"10.1007\/978-3-319-49175-2_1","type":"book-chapter","created":{"date-parts":[[2016,11,9]],"date-time":"2016-11-09T06:59:42Z","timestamp":1478674782000},"page":"3-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters"],"prefix":"10.1007","author":[{"given":"Avishek","family":"Adhikari","sequence":"first","affiliation":[]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[]},{"given":"Satoshi","family":"Obana","sequence":"additional","affiliation":[]},{"given":"Partha Sarathi","family":"Roy","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Xu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,10]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-73458-1_11","volume-title":"Information Security and Privacy","author":"T Araki","year":"2007","unstructured":"Araki, T.: Efficient ( $$k$$ , $$n$$ ) threshold secret sharing schemes secure against cheating from $$n - 1$$ cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 133\u2013142. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73458-1_11"},{"key":"1_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-540-73458-1_10","volume-title":"Information Security and Privacy","author":"T Araki","year":"2007","unstructured":"Araki, T., Obana, S.: Flaws in some secret sharing schemes against cheating. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol. 4586, pp. 122\u2013132. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73458-1_10"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of AFIPS 1979, National Computer Conference, vol. 48, pp. 313\u2013137 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"3","key":"1_CR4","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 Cryptogr. 5(3), 183\u2013187 (1995)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello, S., Padr\u00f3, C., S\u00e1ez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Cryptogr. 25(2), 175\u2013188 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Choudhury, A.: Brief announcement: optimal amortized secret sharing with cheater identification. In: Proceedings of PODC 2012, pp. 101\u2013101. ACM (2012)","DOI":"10.1145\/2332432.2332453"},{"key":"1_CR7","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 \u2014 CRYPTO 2001","author":"R Cramer","year":"2001","unstructured":"Cramer, R., Damg\u00e5rd, I., Fehr, S.: On the cost of reconstruction a secret, or VSS with optimal reconstruction phase. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 503\u2013523. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44647-8_30"},{"key":"1_CR8","first-page":"65","volume":"2","author":"B Boer den","year":"1993","unstructured":"den Boer, B.: A simple and key-economical unconditional authentication scheme. J. Comput. Secur. 2, 65\u201371 (1993)","journal-title":"J. Comput. Secur."},{"key":"1_CR9","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. 7194, pp. 21\u201338. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-28914-9_2"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-44750-4_33","volume-title":"Advances in Cryptology \u2014 CRYPTO 1995","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. 963, pp. 410\u2013423. Springer, Heidelberg (1995). doi: 10.1007\/3-540-44750-4_33"},{"issue":"9","key":"1_CR11","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)","journal-title":"Commun. ACM"},{"key":"1_CR12","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. 6632, pp. 284\u2013302. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20465-4_17"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/11935230_24","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"S Obana","year":"2006","unstructured":"Obana, S., Araki, T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol. 4284, pp. 364\u2013379. Springer, Heidelberg (2006). doi: 10.1007\/11935230_24"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Ogata, W., Eguchi, H.: Cheating detectable threshold scheme against most powerful cheaters for long secrets. Des. Codes Cryptogr., October 2012. (Published online 2012)","DOI":"10.1007\/s10623-012-9756-5"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-44448-3_29","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2000","author":"W Ogata","year":"2000","unstructured":"Ogata, W., Kurosawa, K.: Provably secure metering scheme. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol. 1976, pp. 388\u2013398. Springer, Heidelberg (2000). doi: 10.1007\/3-540-44448-3_29"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.R.: Optimum secret sharing scheme secure against cheating. SIAM J. Discrete Math. 20(1), 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Roy, P.S., Adhikari, A., Xu, R., Kirill, M., Sakurai, K.: An efficient $$t$$ -cheater identifiable secret sharing scheme with optimal cheater resiliency. eprint.iacr.org\/2014\/628.pdf","DOI":"10.1007\/978-3-319-12060-7_4"},{"issue":"11","key":"1_CR19","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)","journal-title":"Commun. ACM"},{"issue":"3","key":"1_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa, M., Woll, H.: How to share a secret with cheaters. J. Cryptol. 1(3), 133\u2013138 (1989)","journal-title":"J. Cryptol."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"MN Wegman","year":"1981","unstructured":"Wegman, M.N., Lawrence Carter, J.: New hash functions and their use in authentication and set equality. J. Comput. Syst. Sci. 22, 265\u2013279 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/978-3-642-41383-4_17","volume-title":"Advances in Information and Computer Security","author":"R Xu","year":"2013","unstructured":"Xu, R., Morozov, K., Takagi, T.: On cheater identifiable secret sharing schemes secure against rushing adversary. In: Sakiyama, K., Terada, M. (eds.) IWSEC 2013. LNCS, vol. 8231, pp. 258\u2013271. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-41383-4_17"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-09843-2_6","volume-title":"Advances in Information and Computer Security","author":"R Xu","year":"2014","unstructured":"Xu, R., Morozov, K., Takagi, T.: Cheater identifiable secret sharing schemes via multi-receiver authentication. In: Yoshida, M., Mouri, K. (eds.) IWSEC 2014. LNCS, vol. 8639, pp. 72\u201387. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-09843-2_6"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-49175-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T07:50:15Z","timestamp":1568533815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-49175-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319491745","9783319491752"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-49175-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"10 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICITS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Theoretic Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tacoma","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":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icits2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}