{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:05:06Z","timestamp":1773317106988,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T00:00:00Z","timestamp":1488844800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1513671"],"award-info":[{"award-number":["1513671"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["09165174"],"award-info":[{"award-number":["09165174"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1118126"],"award-info":[{"award-number":["1118126"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1136174"],"award-info":[{"award-number":["1136174"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1619348"],"award-info":[{"award-number":["1619348"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation (US)","doi-asserted-by":"crossref","award":["1065276"],"award-info":[{"award-number":["1065276"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/100006221","name":"United States - Israel Binational Science Foundation","doi-asserted-by":"publisher","award":["2008411"],"award-info":[{"award-number":["2008411"]}],"id":[{"id":"10.13039\/100006221","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004399","name":"Okawa Foundation for Information and Telecommunications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004399","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100002414","name":"Xerox Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100002414","id-type":"DOI","asserted-by":"publisher"}]},{"name":"B. John Garrick Foundation for the Advancement of the Risk Sciences (US)"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s12095-017-0215-z","type":"journal-article","created":{"date-parts":[[2017,3,7]],"date-time":"2017-03-07T08:30:18Z","timestamp":1488875418000},"page":"79-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Efficient robust secret sharing from expander graphs"],"prefix":"10.1007","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4344-7406","authenticated-orcid":false,"given":"Brett","family":"Hemenway","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,7]]},"reference":[{"key":"215_CR1","unstructured":"Beimel, A: Secure schemes for secret sharing and key distribution. PhD thesis, Technion (1996)"},{"key":"215_CR2","first-page":"11","volume-title":"Coding and cryptology, volume 6639 of lecture notes in computer science","author":"A Beimel","year":"2011","unstructured":"Beimel, A: Secret-sharing schemes: a survey. In: Chee, Y, Guo, Z, Ling, S, Shao, F, Tang, Y, Wang, H, Xing, C (eds.) Coding and cryptology, volume 6639 of lecture notes in computer science, pp 11\u201346. Springer, Berlin (2011)"},{"key":"215_CR3","first-page":"27","volume-title":"Advances in cryptology \u2014 CRYPTO\u2019 88, volume 403 of lecture notes in computer science","author":"J Benaloh","year":"1988","unstructured":"Benaloh, J, Leichter, J: Generalized secret sharing and monotone functions. In: Goldwasser, S (ed.) Advances in cryptology \u2014 CRYPTO\u2019 88, volume 403 of lecture notes in computer science, pp 27\u201335. Springer, New York (1988)"},{"key":"215_CR4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-57220-1_53","volume-title":"Advances in cryptology \u2014 AUSCRYPT \u201992, volume 718 of Lecture Notes in Computer Science","author":"M Bertilsson","year":"1993","unstructured":"Bertilsson, M, Ingemarsson, I: A construction of practical secret sharing schemes using linear block codes. In: Seberry, J, Zheng, Y (eds.) Advances in cryptology \u2014 AUSCRYPT \u201992, volume 718 of Lecture Notes in Computer Science, pp 67\u201379. Springer, Berlin (1993)"},{"key":"215_CR5","doi-asserted-by":"crossref","unstructured":"Bishop, A, Pastro, V, Rajaraman, R, Wichs, D: Essentially optimal robust secret sharing with maximal corruptions. In: Eurocrypt, pp. 58\u201386 (2016)","DOI":"10.1007\/978-3-662-49890-3_3"},{"key":"215_CR6","doi-asserted-by":"crossref","unstructured":"Blakley, GR: Safeguarding cryptographic keys. In: International workshop on managing requirements knowledge, volume 0, p. 313. IEEE Computer Society, Los Alamitos (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"issue":"4","key":"215_CR7","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G Bracha","year":"1987","unstructured":"Bracha, G: An o(l o g n) expected rounds randomized byzantine generals protocol. J. ACM 34(4), 910\u2013920 (1987)","journal-title":"J. ACM"},{"key":"215_CR8","first-page":"468","volume-title":"Advances in cryptology \u2014 EUROCRYPT \u201989, volume 434 of Lecture Notes in Computer Science, chapter 45","author":"EF Brickell","year":"1989","unstructured":"Brickell, EF: Some ideal secret sharing schemes. In: Quisquater, J-J, Vandewalle, J (eds.) Advances in cryptology \u2014 EUROCRYPT \u201989, volume 434 of Lecture Notes in Computer Science, chapter 45, pp 468\u2013475. Springer, Berlin (1989)"},{"key":"215_CR9","first-page":"185","volume-title":"Fundamentals of Computation Theory, volume 1684","author":"S Cabello","year":"1999","unstructured":"Cabello, S, Padr\u00f3, C, S\u00e1ez, G: Secret sharing schemes with detection of cheaters for a general access structure. In: Ciobanu, G, P\u0103un, G (eds.) Fundamentals of Computation Theory, volume 1684, pp 185\u2013194. Springer, Berlin (1999)"},{"issue":"2","key":"215_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1023\/A:1013856431727","volume":"25","author":"S Cabello","year":"2002","unstructured":"Cabello, S, Padr\u00f3, C, Germ\u00e1n, S: Secret sharing schemes with detection of cheaters for a general access structure. Des. Codes Crypt. 25(2), 175\u2013188 (2002)","journal-title":"Des. Codes Crypt."},{"key":"215_CR11","doi-asserted-by":"crossref","unstructured":"Carpentieri, M., De Santis, A., Vaccaro, U., Size of Shares and Probability of Cheating in Threshold Schemes. In: EUROCRYPT \u201993, volume 765, pp. 118\u2013125. Springer (1993)","DOI":"10.1007\/3-540-48285-7_10"},{"issue":"2","key":"215_CR12","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J Lawrence Carter","year":"1979","unstructured":"Lawrence Carter, J., Wegman, M.N.: Universal classes of hash functions. J. Comput. Syst. Sci. 18(2), 143\u2013154 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"215_CR13","doi-asserted-by":"crossref","unstructured":"\u00c7amtepe, SA, Yener, B, Yung, M: Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks. In: 2006 IEEE International Conference on Communications, volume 5, pp. 2262\u20132267 (2006)","DOI":"10.1109\/ICC.2006.255107"},{"key":"215_CR14","doi-asserted-by":"crossref","unstructured":"Cevallos, A, Fehr, S, Ostrovsky, R, Rabani, Y: Unconditionally-Secure Robust Secret Sharing with Compact Shares. In: Pointcheval, D, Johansson, T (eds.) EUROCRYPT, vol. 7237, pp 195\u2013208. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-29011-4_13"},{"key":"215_CR15","doi-asserted-by":"crossref","unstructured":"Chandran, N, Garay, J., Ostrovsky, R: Almost-Everywhere secure computation with edge corruptions. J. Cryptol. 1\u201324 (2013)","DOI":"10.1007\/s00145-013-9176-3"},{"key":"215_CR16","doi-asserted-by":"crossref","unstructured":"Chen, H, Cramer, R: Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields. In CRYPTO \u201906, pp. 521\u2013536 (2006)","DOI":"10.1007\/11818175_31"},{"key":"215_CR17","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M: Nearly Optimal Robust Secret Sharing. In: ISIT, pp. 2509\u20132513 (2016)","DOI":"10.1109\/ISIT.2016.7541751"},{"key":"215_CR18","first-page":"313","volume-title":"Advances in Cryptology - EUROCRYPT 2015, volume 9057 of Lecture Notes in Computer Science","author":"R Cramer","year":"2015","unstructured":"Cramer, R, Damg\u00e5rd, I, D\u00f6ttling, N, Fehr, S, Spini, G: Linear secret sharing schemes from error correcting codes and universal hash functions. In: Oswald, E, Fischlin, M (eds.) Advances in Cryptology - EUROCRYPT 2015, volume 9057 of Lecture Notes in Computer Science, pp 313\u2013336. Springer, Berlin (2015)"},{"key":"215_CR19","first-page":"503","volume-title":"CRYPTO, volume 2139","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, volume 2139, pp 503\u2013523. Springer, Berlin (2001)"},{"key":"215_CR20","first-page":"471","volume-title":"EUROCRYPT, volume 4965 of Lecture Notes in Computer Science","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, NP (ed.) EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, pp 471\u2013488. Springer, Berlin (2008)"},{"key":"215_CR21","first-page":"272","volume-title":"Advances in Cryptology \u2014 CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, chapter 18","author":"R Cramer","year":"2002","unstructured":"Cramer, R, Fehr, S: Optimal Black-Box Secret Sharing over Arbitrary Abelian Groups. In: Yung, M (ed.) Advances in Cryptology \u2014 CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, chapter 18 , pp 272\u2013287. Springer, Berlin (2002)"},{"key":"215_CR22","first-page":"501","volume-title":"Advances in Cryptology - CRYPTO 2006, volume 4117 of Lecture Notes in Computer Science","author":"I Damg\u00e5rd","year":"2006","unstructured":"Damg\u00e5rd, I, Ishai, Y: Scalable Secure Multiparty Computation. In: Dwork, C (ed.) Advances in Cryptology - CRYPTO 2006, volume 4117 of Lecture Notes in Computer Science, pp 501\u2013520. Springer, Berlin (2006)"},{"key":"215_CR23","first-page":"445","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science","author":"I Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I, Ishai, Y, Kr\u00f8igaard, M: Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography. In: Gilbert, H (ed.) Advances in Cryptology \u2013 EUROCRYPT 2010, volume 6110 of Lecture Notes in Computer Science, pp 445\u2013465. Springer, Berlin (2010)"},{"key":"215_CR24","first-page":"241","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science","author":"I Damg\u00e5rd","year":"2008","unstructured":"Damg\u00e5rd, I, Ishai, Y, Kr\u00f8igaard, M, Nielsen, JB, Smith, A: Scalable Multiparty Computation with Nearly Optimal Work and Resilience. In: Wagner, D (ed.) Advances in Cryptology \u2013 CRYPTO 2008, volume 5157 of Lecture Notes in Computer Science, pp 241\u2013261. Springer, Berlin (2008)"},{"key":"215_CR25","first-page":"572","volume-title":"Advances in Cryptology - CRYPTO 2007, volume 4622 of Lecture Notes in Computer Science","author":"I Damg\u00e5rd","year":"2007","unstructured":"Damg\u00e5rd, I, Nielsen, JB: Scalable and Unconditionally Secure Multiparty Computation. In: Menezes, A (ed.) Advances in Cryptology - CRYPTO 2007, volume 4622 of Lecture Notes in Computer Science, pp 572\u2013590. Springer, Berlin (2007)"},{"issue":"1","key":"215_CR26","first-page":"65","volume":"2","author":"B den Boer","year":"1993","unstructured":"den Boer, B: A simple and key-economical unconditional authentication scheme. J. Comput. Secur. 2(1), 65\u201371 (1993)","journal-title":"J. Comput. Secur."},{"issue":"1","key":"215_CR27","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, Moti, Y: Perfectly secure message transmission. J. ACM 40(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"key":"215_CR28","first-page":"311","volume-title":"Theory of Cryptography, volume 4392 of Lecture Notes in Computer Science","author":"M Fitzi","year":"2007","unstructured":"Fitzi, M, Franklin, M, Garay, J, Harsha Vardhan, S: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S (ed.) Theory of Cryptography, volume 4392 of Lecture Notes in Computer Science, pp 311\u2013322. Springer, Berlin (2007)"},{"key":"215_CR29","doi-asserted-by":"crossref","unstructured":"Franklin, M, Moti, Y: Communication Complexity of Secure Computation (Extended Abstract). In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, STOC \u201992, pp. 699\u2013710, ACM, New York (1992)","DOI":"10.1145\/129712.129780"},{"key":"215_CR30","unstructured":"G\u00e1l, A: Combinatorial Methods in Boolean Function Complexity. PhD thesis, University of Chicago (1995)"},{"key":"215_CR31","doi-asserted-by":"crossref","unstructured":"Garay, J., Givens, C., Rafail, O.: Secure Message Transmission With Small Public Discussion. IEEE Trans. Inf. Theory 60(4), 2373\u20132390 (April 2014)","DOI":"10.1109\/TIT.2014.2307309"},{"key":"215_CR32","first-page":"307","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008, volume 4965 of Lecture Notes in Computer Science","author":"J Garay","year":"2008","unstructured":"Garay, J., Ostrovsky, R: Almost-Everywhere Secure Computation. In: Smart, N (ed.) Advances in Cryptology \u2013 EUROCRYPT 2008, volume 4965 of Lecture Notes in Computer Science, pp 307\u2013323. Springer, Berlin (2008)"},{"key":"215_CR33","unstructured":"Gennaro, R: Theory and Practice of Verifiable Secret Sharing. PhD thesis, MIT (1996)"},{"key":"215_CR34","doi-asserted-by":"crossref","unstructured":"Ghosh, SK: On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks. In: Security and Privacy in Ad-Hoc and Sensor Networks: Third European Workshop, ESAS 2006, Hamburg, Germany, September 20-21, 2006, Revised Selected Papers, pp. 121\u2013135. Springer, Berlin (2006)","DOI":"10.1007\/11964254_12"},{"issue":"3","key":"215_CR35","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"EN Gilbert","year":"1974","unstructured":"Gilbert, EN, MacWilliams, FJ, Sloane, NJA: Codes which detect deception. Bell Labs Technical J. 53(3), 405\u2013424 (1974)","journal-title":"Bell Labs Technical J."},{"issue":"1","key":"215_CR36","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."},{"issue":"4","key":"215_CR37","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S, Linial, N, Wigderson, A: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"215_CR38","first-page":"21","volume-title":"Ronald Cramer, editor, Theory of Cryptography, volume 7194 of Lecture Notes in Computer Science","author":"Y Ishai","year":"2012","unstructured":"Ishai, Y, Ostrovsky, R, Seyalioglu, H: Identifying Cheaters without an Honest Majority Ronald Cramer, editor, Theory of Cryptography, volume 7194 of Lecture Notes in Computer Science, pp 21\u201338. Springer, Berlin (2012)"},{"key":"215_CR39","doi-asserted-by":"crossref","unstructured":"Jhanwar, MP, Safavi-Naini, R: Unconditionally-Secure Robust Secret Sharing with Minimum Share Size. In: Sadeghi, A-R (ed.) Financial Cryptography, vol. 7859, pp 96\u2013110. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39884-1_9"},{"key":"215_CR40","doi-asserted-by":"crossref","unstructured":"Johansson, T, Kabatianskii, G, Smeets, B: On the relation between a-codes and codes correcting independent errors. In: Workshop on the Theory and Application of of Cryptographic Techniques, pp. 1\u201311. Springer (1993)","DOI":"10.1007\/3-540-48285-7_1"},{"key":"215_CR41","doi-asserted-by":"crossref","unstructured":"Kendall, M, Martin, KM: On the Role of Expander Graphs in Key Predistribution Schemes for Wireless Sensor Networks. In: Research in Cryptology: 4th Western European Workshop, WEWoRC 2011, Weimar, Germany, July 20-22, 2011, Revised Selected Papers, pp. 62\u201382, Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-34159-5_5"},{"issue":"9","key":"215_CR42","doi-asserted-by":"crossref","first-page":"6304","DOI":"10.1109\/TIT.2011.2161927","volume":"57","author":"K Kurosawa","year":"2011","unstructured":"Kurosawa, K: General error decodable secret sharing scheme and its application. IEEE Trans. Inf. Theory 57(9), 6304\u20136309 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"215_CR43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1587\/transfun.E92.A.105","volume":"E92-A","author":"K Kurosawa","year":"2009","unstructured":"Kurosawa, K, Kazuhiro, S: Almost Secure (1-Round, n-Channel) Message Transmission Scheme. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E92-A (1), 105\u2013112 (2009)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"215_CR44","unstructured":"Lewko, AB, Pastro, V: Robust Secret Sharing Schemes Against Local Adversaries Cryptology ePrint Archive: Report 2014\/909 (2014)"},{"key":"215_CR45","first-page":"273","volume-title":"Theory of Cryptography, volume 4392 of Lecture Notes in Computer Science","author":"J Mart\u00ed-Farr\u00e9","year":"2007","unstructured":"Mart\u00ed-Farr\u00e9, J, Padr\u00f3, C: On Secret Sharing Schemes, Matroids and Polymatroids. In: Vadhan, SP (ed.) Theory of Cryptography, volume 4392 of Lecture Notes in Computer Science, pp 273\u2013290. Springer, Berlin (2007)"},{"issue":"2","key":"215_CR46","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s12095-010-0039-6","volume":"3","author":"KM Martin","year":"2011","unstructured":"Martin, KM, Paterson, MB, Stinson, DR: Error decodable secret sharing and one-round perfectly secure message transmission for general adversary structures. Cryptogr. Commun. 3(2), 65\u201386 (2011)","journal-title":"Cryptogr. Commun."},{"issue":"1","key":"215_CR47","first-page":"33","volume":"18","author":"M Ram Murty","year":"2003","unstructured":"Ram Murty, M: Ramanujan graphs. J.-Ramanujan Math. Soc. 18(1), 33\u201352 (2003)","journal-title":"J.-Ramanujan Math. Soc."},{"key":"215_CR48","doi-asserted-by":"crossref","unstructured":"Ogata, W, Kurosawa, K: Optimum Secret Sharing Scheme Secure against Cheating. In: Maurer, U (ed.) EUROCRYPT, vol. 1070, pp 200\u2013211. Springer, Berlin (1996)","DOI":"10.1007\/3-540-68339-9_18"},{"issue":"1-3","key":"215_CR49","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0012-365X(03)00283-8","volume":"279","author":"W Ogata","year":"2004","unstructured":"Ogata, W, Kurosawa, K, Stinson, DR, Saido, H: New combinatorial designs and their applications to authentication codes and secret sharing schemes. Discret. Math. 279(1-3), 383\u2013405 (2004)","journal-title":"Discret. Math."},{"key":"215_CR50","doi-asserted-by":"crossref","unstructured":"Puder, D: Expansion of random graphs: New proofs, new results. Invent. Math. 1\u201364 (2015)","DOI":"10.1007\/s00222-014-0560-x"},{"key":"215_CR51","doi-asserted-by":"crossref","unstructured":"Rabin, T, Ben-Or, M: Verifiable secret sharing and multiparty protocols with hest majority. In: Proceedings of the twenty-first annual ACM symposium on Theory of computing, STOC \u201989, pp. 73\u201385. ACM, New York (1989)","DOI":"10.1145\/73007.73014"},{"issue":"5","key":"215_CR52","first-page":"554","volume":"23","author":"R Safavi-Naini","year":"2015","unstructured":"Safavi-Naini, R, Wang, P: A model for adversarial wiretap channels and its applications. J. Inf. Process. 23(5), 554\u2013561 (2015)","journal-title":"J. Inf. Process."},{"key":"215_CR53","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, 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"issue":"5","key":"215_CR54","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/5.4445","volume":"76","author":"GJ Simmons","year":"1988","unstructured":"Simmons, GJ: A survey of information authentication. Proc. IEEE 76(5), 603\u2013620 (1988)","journal-title":"Proc. IEEE"},{"key":"215_CR55","doi-asserted-by":"crossref","unstructured":"Taylor, R: An integrity check value algorithm for stream ciphers. In: Annual International Cryptology Conference, pp. 40\u201348. Springer (1993)","DOI":"10.1007\/3-540-48329-2_4"},{"issue":"3","key":"215_CR56","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF02252871","volume":"1","author":"M Tompa","year":"1989","unstructured":"Tompa, M, Heather, W: How to share a secret with cheaters. J. Cryptol. 1 (3), 133\u2013138 (1989)","journal-title":"J. Cryptol."},{"key":"215_CR57","unstructured":"Van Dijk, M: Secret key sharing and secret key generation. PhD thesis, Eindhoven University of Technology (1997)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-017-0215-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0215-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-017-0215-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T10:44:42Z","timestamp":1658745882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-017-0215-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,7]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["215"],"URL":"https:\/\/doi.org\/10.1007\/s12095-017-0215-z","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,7]]}}}