{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T18:06:08Z","timestamp":1776881168073,"version":"3.51.2"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319120591","type":"print"},{"value":"9783319120607","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12060-7_4","type":"book-chapter","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T09:49:50Z","timestamp":1412761790000},"page":"47-58","source":"Crossref","is-referenced-by-count":11,"title":["An Efficient Robust Secret Sharing Scheme with Optimal Cheater Resiliency"],"prefix":"10.1007","author":[{"given":"Partha Sarathi","family":"Roy","sequence":"first","affiliation":[]},{"given":"Avishek","family":"Adhikari","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Kirill","family":"Morozov","sequence":"additional","affiliation":[]},{"given":"Kouichi","family":"Sakurai","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4_CR1","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.\u00a04586, pp. 122\u2013132. Springer, Heidelberg (2007)"},{"key":"4_CR2","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 \u2212 1 cheaters. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 133\u2013142. Springer, Heidelberg (2007)"},{"key":"4_CR3","unstructured":"Berlekamp, E.R., Welch, L.R.: Error correction of algebraic block codes. U.S. Patent Number 4, 633.470 (1986)"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: AFIPS 1979, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"4_CR5","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":"2","key":"4_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S. Cabello","year":"2002","unstructured":"Cabello, S., Padro, C., Saez, G.: Secret sharing schemes with detection of cheaters for a general access structure. Design Codes Cryptography\u00a025(2), 175\u2013188 (2002)","journal-title":"Design Codes Cryptography"},{"issue":"3","key":"4_CR7","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. Design Codes Cryptography\u00a05(3), 183\u2013187 (1995)","journal-title":"Design Codes Cryptography"},{"key":"4_CR8","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":"4_CR9","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.B., 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)"},{"key":"4_CR10","first-page":"65","volume":"2","author":"B. Den Boer","year":"1993","unstructured":"Den Boer, B.: A simple and key-economical unconditional authentication scheme. Journal of Computer Security\u00a02, 65\u201372 (1993)","journal-title":"Journal of Computer Security"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-540-78967-3_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Cramer","year":"2008","unstructured":"Cramer, R., Dodis, Y., Fehr, S., Padr\u00f3, C., Wichs, D.: Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 471\u2013488. Springer, Heidelberg (2008)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults (Extended Abstract). In: FOCS 1985, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. In: FOCS 1990, pp. 36\u201345 (1990), Journal version in J. ACM 40(1), 17\u201347 (1993)","DOI":"10.1145\/138027.138036"},{"key":"4_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)"},{"issue":"4","key":"4_CR15","first-page":"279","volume":"7","author":"M.P. Jhanwar","year":"2013","unstructured":"Jhanwar, M.P., Safavi-Naini, R.: Unconditionally-secure ideal robust secret sharing schemes for threshold and multilevel access structure. Mathematical Cryptology\u00a07(4), 279\u2013296 (2013)","journal-title":"Mathematical Cryptology"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48285-7_1","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"T. Johansson","year":"1994","unstructured":"Johansson, T., Kabatianskii, G., Smeets, B.: On the relation between A-codes and codes correcting independent errors. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 1\u201311. Springer, Heidelberg (1994)"},{"key":"4_CR17","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)"},{"issue":"9","key":"4_CR18","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/TPDS.2003.1233705","volume":"14","author":"S. Lakshmanan","year":"2003","unstructured":"Lakshmanan, S., Ahamad, M., Venkateswaran, H.: Responsive security for stored data. IEEE Trans. Parallel Distrib. Syst.\u00a014(9), 818\u2013828 (2003)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"4_CR19","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes, vol.\u00a016. Elsevier (1977)"},{"issue":"2","key":"4_CR20","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s12095-010-0039-6","volume":"3","author":"K.M. Martin","year":"2011","unstructured":"Martin, K.M., Paterson, M.B., Stinson, D.R.: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptography and Communications\u00a03(2), 65\u201386 (2011)","journal-title":"Cryptography and Communications"},{"issue":"9","key":"4_CR21","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":"4_CR22","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":"4_CR23","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.\u00a04284, pp. 364\u2013379. Springer, Heidelberg (2006)"},{"issue":"1","key":"4_CR24","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.\u00a020(1), 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"4_CR25","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority (extended abstract). In: STOC 1989, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"11","key":"4_CR26","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. Comm. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Comm. ACM"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-48329-2_4","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"R. Taylor","year":"1994","unstructured":"Taylor, R.: An Integrity Check Value Algorithm for Stream Ciphers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 40\u201348. Springer, Heidelberg (1994)"},{"issue":"2","key":"4_CR28","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":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/502152.502154","volume":"1","author":"M. Waldman","year":"2001","unstructured":"Waldman, M., Rubin, A.D., Cranor, L.F.: The architecture of robust publishing systems. ACM Trans. Internet Techn.\u00a01(2), 199\u2013230 (2001)","journal-title":"ACM Trans. Internet Techn."},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Wegman, M.N., Lawrence Carter, J.: New classes and applications of hash functions. In: FOCS 1979, pp. 175\u2013182 (1979)","DOI":"10.1109\/SFCS.1979.26"},{"key":"4_CR31","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.\u00a08231, pp. 258\u2013271. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Security, Privacy, and Applied Cryptography Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12060-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T14:23:35Z","timestamp":1675347815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12060-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319120591","9783319120607"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12060-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}