{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:16:40Z","timestamp":1725567400990},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666660"},{"type":"electronic","value":"9783540480006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/978-3-540-48000-6_31","type":"book-chapter","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T06:51:39Z","timestamp":1287039099000},"page":"390-398","source":"Crossref","is-referenced-by-count":4,"title":["A 3-Codes under Collusion Attacks"],"prefix":"10.1007","author":[{"given":"Yejing","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rei","family":"Safavi-Naini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-45961-8_5","volume-title":"Advances in Cryptology - EUROCRYPT \u201988","author":"E.F. Brickell","year":"1988","unstructured":"Brickell, E.F., Stinson, D.R.: Authentication codes with multiple arbiters. In: G\u00fcnther, C.G. (ed.) EUROCRYPT 1988. LNCS, vol.\u00a0330, pp. 51\u201355. Springer, Heidelberg (1988)"},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/3-540-38424-3_13","volume-title":"Advances in Cryptology - CRYPTO \u201990","author":"Y. Desmedt","year":"1991","unstructured":"Desmedt, Y., Yung, M.: Arbitrated unconditionally secure authentication can be unconditionally protected against arbiter\u2019s attack. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol.\u00a0537, pp. 177\u2013188. Springer, Heidelberg (1991)"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Johansson, T.: Further results on asymmetric authentication schemes. Information and Computation\u00a0151 (1999)","DOI":"10.1006\/inco.1998.2767"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/BFb0028468","volume-title":"Information and Communications Security","author":"S. Obana","year":"1997","unstructured":"Obana, S., Kurosawa, K.: A2-code=affine resolvable + BIBD. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol.\u00a01334, pp. 118\u2013129. Springer, Heidelberg (1997)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF00191354","volume":"8","author":"D. Pei","year":"1995","unstructured":"Pei, D.: Information-theoretic bounds for authentication codes and block designs. Journal of Cryptology\u00a08, 177\u2013188 (1995)","journal-title":"Journal of Cryptology"},{"key":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/3-540-48970-3_25","volume-title":"Information Security and Privacy","author":"D. Pei","year":"1999","unstructured":"Pei, D., Li, Y., Wang, Y., Safavi-Naini, R.: Characterization of optimal authentication codes with arbitration. In: Pieprzyk, J.P., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol.\u00a01587, pp. 303\u2013313. Springer, Heidelberg (1999)"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/3-540-39568-7_32","volume-title":"Advances in Cryptology","author":"G.J. Simmons","year":"1985","unstructured":"Simmons, G.J.: Authentication theory\/Coding theory. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 411\u2013431. Springer, Heidelberg (1985)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF00204449","volume":"2","author":"G.J. Simmons","year":"1990","unstructured":"Simmons, G.J.: A cartesian construction for uncondetionally secure authentication codes that permit arbitration. Journal of Cryptology\u00a02, 77\u2013104 (1990)","journal-title":"Journal of Cryptology"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/BFb0053440","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"R. Taylor","year":"1995","unstructured":"Taylor, R.: Near optimal unconditionally secure authentication. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 244\u2013253. Springer, Heidelberg (1995)"},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Frankel, Y., Desmedt, Y., Yung, M.: Multi-receiver\/multi-sender network securety: efficient authenticated multicast\/feedback. In: IEEE Infocom, pp. 2045\u20132054 (1992)","DOI":"10.1109\/INFCOM.1992.263476"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - ASIACRYPT\u201999"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-48000-6_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T12:55:18Z","timestamp":1559739318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-48000-6_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666660","9783540480006"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-48000-6_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}