{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:19:49Z","timestamp":1777983589186,"version":"3.51.4"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T00:00:00Z","timestamp":1292371200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s12095-010-0039-6","type":"journal-article","created":{"date-parts":[[2010,12,15]],"date-time":"2010-12-15T18:54:32Z","timestamp":1292439272000},"page":"65-86","source":"Crossref","is-referenced-by-count":11,"title":["Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures"],"prefix":"10.1007","volume":"3","author":[{"given":"Keith M.","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maura B.","family":"Paterson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas R.","family":"Stinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,15]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Ning, P., di Vimercati, S.D.C., Syverson, P.F. (eds.) ACM Conference on Computer and Communications Security, pp. 172\u2013184. ACM (2007)","DOI":"10.1145\/1315245.1315268"},{"issue":"3","key":"39_CR2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"ER Berlekamp","year":"1978","unstructured":"Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans. Inf. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proc. 1979 National Comp. Conf., vol. 48, pp. 313\u2013317. AFIPS Press (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Blundo, C., Santis, A.D., Vaccaro, U.: Efficient sharing of many secrets. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds.) STACS \u201993. LNCS, vol. 665, pp. 692\u2013703. Springer (1993)","DOI":"10.1007\/3-540-56503-5_68"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Chen, H., Cramer, R.: Algebraic geometric secret sharing schemes and secure multi-party computations over small fields. In: Dwork, C. (ed.) CRYPTO \u201906. LNCS, vol. 4117, pp. 521\u2013536. Springer (2006)","DOI":"10.1007\/11818175_31"},{"key":"39_CR6","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 \u201985, pp. 383\u2013395. IEEE (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damgard, I., Maurer, U.: General secure multi-party computation from any linear secret-sharing scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316\u2013334. Springer (2000)","DOI":"10.1007\/3-540-45539-6_22"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Cramer, R., Daza, V., Gracia, I., Urroz, J.J., Leander, G., Mart\u00ed-Farr\u00e9, J., Padr\u00f3, C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. In: Shoup, V. (ed.) CRYPTO \u201905. LNCS, vol. 3621, pp. 327\u2013343. Springer (2005)","DOI":"10.1007\/11535218_20"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Wang, Y., Burmester, M.: A complete characterization of tolerable adversary structures for secure point-to-point transmissions without feedback. In: Deng, X., Du, D.Z. (eds.) ISAAC \u201905. LNCS, vol. 3827, pp. 277\u2013287. Springer (2005)","DOI":"10.1007\/11602613_29"},{"issue":"1","key":"39_CR10","doi-asserted-by":"crossref","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 40(1), 17\u201347 (1993). doi: 10.1145\/138027.138036","journal-title":"J. ACM"},{"key":"39_CR11","doi-asserted-by":"crossref","unstructured":"Fehr, S., Maurer, U.M.: Linear vss and distributed commitments based on secret sharing and pairwise checks. In: Yung, M. (ed.) CRYPTO \u201902. LNCS, vol. 2442, pp. 565\u2013580. Springer (2002)","DOI":"10.1007\/3-540-45708-9_36"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Franklin, M.K., Garay, J.A., Vardhan, S.H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC \u201907. LNCS, vol. 4392, pp. 311\u2013322. Springer (2007)","DOI":"10.1007\/978-3-540-70936-7_17"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Hirt, M., Maurer, U.M.: General adversaries in unconditional multi-party computation. In: Lam, K.Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT \u201999. LNCS, vol. 1716, pp. 232\u2013246. Springer (1999)","DOI":"10.1007\/978-3-540-48000-6_19"},{"issue":"1","key":"39_CR14","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s001459910003","volume":"13","author":"M Hirt","year":"2000","unstructured":"Hirt, M., Maurer, U.: Player simulation and general adversary structures in perfect multiparty computation. J. Cryptol. 13(1), 31\u201360 (2000)","journal-title":"J. Cryptol."},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.M.: Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract). In: PODC, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Huffman, W.C., Pless, V.: Fundamentals of Error-correcting Codes. Cambridge Univ. Press (2003)","DOI":"10.1017\/CBO9780511807077"},{"issue":"1","key":"39_CR17","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M Ito","year":"1993","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. J. Cryptol. 6(1), 15\u201320 (1993)","journal-title":"J. Cryptol."},{"key":"39_CR18","doi-asserted-by":"crossref","unstructured":"Jackson, W.A., Martin, K.M.: Cumulative arrays and geometric secret sharing schemes. In: Seberry, J., Zheng, Y. (eds.) AUSCRYPT \u201992. LNCS, vol. 718, pp. 48\u201355. Springer (1992)","DOI":"10.1007\/3-540-57220-1_51"},{"key":"39_CR19","first-page":"51","volume":"14","author":"WA Jackson","year":"1996","unstructured":"Jackson, W.A., Martin, K.M.: A combinatorial interpretation of ramp schemes. Australas. J. Combin. 14, 51\u201360 (1996)","journal-title":"J. Combin."},{"key":"39_CR20","unstructured":"Kurosawa, K.: General error decodable secret sharing scheme and its application. Cryptology ePrint Archive, Report 2009\/263 (2009). http:\/\/eprint.iacr.org\/"},{"key":"39_CR21","doi-asserted-by":"crossref","unstructured":"Kurosawa, K., Obana, S., Ogata, W.: t-cheater identifiable (k, n) threshold secret sharing schemes. In: Coppersmith, D. (ed.) CRYPTO \u201995. LNCS, vol. 963, pp. 410\u2013423. Springer (1995)","DOI":"10.1007\/3-540-44750-4_33"},{"key":"39_CR22","unstructured":"Martin, K.M.: Challenging the adversary model in secret sharing schemes. In: Coding and Cryptography II, Proceedings of the Royal Flemish Academy of Belgium for Science and the Arts, pp. 45\u201363 (2008)"},{"issue":"2","key":"39_CR23","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1016\/j.dam.2005.03.020","volume":"154","author":"UM Maurer","year":"2006","unstructured":"Maurer, U.M.: Secure multi-party computation made simple. Discrete Appl. Math. 154(2), 370\u2013381 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"9","key":"39_CR24","doi-asserted-by":"crossref","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). doi: 10.1145\/358746.358762","journal-title":"Commun. ACM"},{"key":"39_CR25","doi-asserted-by":"crossref","unstructured":"Obana, S., Araki, T.: Almost optimum secret sharing schemes secure against cheating for arbitrary secret distribution. In: Lai, X., Chen, K. (eds.) ASIACRYPT \u201906. LNCS, vol. 4284, pp. 364\u2013379. Springer (2006)","DOI":"10.1007\/11935230_24"},{"key":"39_CR26","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1137\/S0895480100378689","volume":"20","author":"W Ogata","year":"2006","unstructured":"Ogata, W., Kurosawa, K., Stinson, D.: Optimum secret sharing scheme secure against cheating. SIAM J. Discrete Math. 20, 79\u201395 (2006)","journal-title":"SIAM J. Discrete Math."},{"key":"39_CR27","unstructured":"Rees, R.S., Stinson, D.R., Wei, R., van Rees, G.H.J.: An application of covering designs: determining the maximum consistent set of shares in a threshold scheme. Ars Comb. 53 (1999)"},{"issue":"11","key":"39_CR28","doi-asserted-by":"crossref","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). doi: 10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"39_CR29","first-page":"169","volume":"61","author":"DR Stinson","year":"2007","unstructured":"Stinson, D.R., Zhang, S.: Algorithms for detecting cheaters in threshold schemes. J. Comb. Math. Comb. Comput. 61, 169\u2013191 (2007)","journal-title":"J. Comb. Math. Comb. Comput."},{"key":"39_CR30","doi-asserted-by":"crossref","unstructured":"Tso, R., Miao, Y., Okamoto, E.: A new algorithm for searching a consistent set of shares in a threshold scheme with cheaters. In: Lim, J.I., Lee, D.H. (eds.) ICISC \u201903. LNCS, vol. 2971, pp. 377\u2013385. Springer (2004)","DOI":"10.1007\/978-3-540-24691-6_28"},{"key":"39_CR31","doi-asserted-by":"crossref","unstructured":"Ye, Q., Steinfeld, R., Pieprzyk, J., Wang, H.: Efficient fuzzy matching and intersection on private datasets. In: Lee, D., Hong, S. (eds.) ICISC \u201909. LNCS, vol. 5984, pp. 211\u2013228. Springer (2009)","DOI":"10.1007\/978-3-642-14423-3_15"},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Liu, M., Chee, Y.M., Ling, S., Wang, H.: Strongly multiplicative and 3-multiplicative linear secret sharing schemes. In: Pieprzyk, J. (ed.) ASIACRYPT \u201908. LNCS, vol. 5350, pp. 19\u201336. Springer (2008)","DOI":"10.1007\/978-3-540-89255-7_2"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-010-0039-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-010-0039-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-010-0039-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,14]],"date-time":"2020-06-14T18:25:57Z","timestamp":1592159157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-010-0039-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,15]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s12095-010-0039-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,15]]}}}