{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T06:17:27Z","timestamp":1725603447897},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242083"},{"type":"electronic","value":"9783642242090"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24209-0_22","type":"book-chapter","created":{"date-parts":[[2011,8,29]],"date-time":"2011-08-29T00:37:43Z","timestamp":1314578263000},"page":"325-337","source":"Crossref","is-referenced-by-count":1,"title":["Public Discussion Must Be Back and Forth in Secure Message Transmission"],"prefix":"10.1007","author":[{"given":"Takeshi","family":"Koshiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinya","family":"Sawada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-85093-9_2","volume-title":"Information Theoretic Security","author":"T. Araki","year":"2008","unstructured":"Araki, T.: Almost secure 1-round message transmission scheme with polynomial-time message decryption. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 2\u201313. Springer, Heidelberg (2008)"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/11818175_24","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"S. Agarwal","year":"2006","unstructured":"Agarwal, S., Cramer, R., de Haan, R.: Asymptotically optimal two-round perfectly secure message transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 394\u2013408. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th Annual ACM Symposium on Theory of Computing, pp. 1\u201310 (1988)","key":"22_CR3","DOI":"10.1145\/62212.62213"},{"issue":"7","key":"22_CR4","first-page":"62","volume":"2","author":"P. Berman","year":"1993","unstructured":"Berman, P., Garay, J.A.: Fast consensus in networks of bounded degree. Distributed Computing\u00a02(7), 62\u201373 (1993)","journal-title":"Distributed Computing"},{"key":"22_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-14162-1_21","volume-title":"Automata, Languages and Programming","author":"N. Chandran","year":"2010","unstructured":"Chandran, N., Garay, J.A., Ostrovsky, R.: Improved fault tolerance and secure computation on sparse networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010 (Part 2). LNCS, vol.\u00a06199, pp. 249\u2013260. Springer, Heidelberg (2010)"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditionally secure protocols. In: Proc. 20th Annual ACM Symposium on Theory of Computing, pp. 11\u201319 (1988)","key":"22_CR6","DOI":"10.1145\/62212.62214"},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","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\u00a040(1), 17\u201347 (1993)","journal-title":"J. ACM"},{"issue":"5","key":"22_CR8","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1137\/0217061","volume":"17","author":"C. Dwork","year":"1988","unstructured":"Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput.\u00a017(5), 975\u2013988 (1988)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"22_CR9","doi-asserted-by":"publisher","first-page":"2582","DOI":"10.1109\/TIT.2008.921676","volume":"54","author":"Y. Desmedt","year":"2008","unstructured":"Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. IEEE Trans. Information Theory\u00a054(6), 2582\u20132595 (2008)","journal-title":"IEEE Trans. Information Theory"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-70936-7_17","volume-title":"Theory of Cryptography","author":"M. Fitzi","year":"2007","unstructured":"Fitzi, M., Franklin, M.K., Garay, J.A., Simhadri, H.V.: Towards optimal and efficient perfectly message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"issue":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M.K. Franklin","year":"2000","unstructured":"Franklin, M.K., Wright, R.N.: Secure communication in minimal connectivity models. J. Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"J. Cryptology"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78967-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J.A. Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-13190-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J.A. Garay","year":"2010","unstructured":"Garay, J.A., Givens, C., Ostrovsky, R.: Secure message transmission with small public discussion. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 177\u2013196. Springer, Heidelberg (2010)"},{"issue":"11","key":"22_CR14","doi-asserted-by":"publisher","first-page":"5223","DOI":"10.1109\/TIT.2009.2030434","volume":"55","author":"K. Kurosawa","year":"2009","unstructured":"Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. IEEE Transactions on Information Theory\u00a055(11), 5223\u20135232 (2009)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1587\/transfun.E92.A.105","volume":"E92-A","author":"K. Kurosawa","year":"2009","unstructured":"Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences\u00a0E92-A(1), 105\u2013112 (2009)","journal-title":"IEICE Trans. Fundamentals of Electronics Communications and Computer Sciences"},{"doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secrete sharing and multiparty protocols with honest majority. In: Proc. 21st Annual ACM Symposium on Theory of Computing, pp. 73\u201385 (1989)","key":"22_CR16","DOI":"10.1145\/73007.73014"},{"issue":"1","key":"22_CR17","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"126","author":"H. Sayeed","year":"1996","unstructured":"Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation\u00a0126(1), 53\u201361 (1996)","journal-title":"Information and Computation"},{"doi-asserted-by":"crossref","unstructured":"Shi, H., Jiang, S., Safavi-Naini, R., Tuhin, M.A.: Optimal secure message transmission by public discussion. In: Proc. IEEE International Symposium on Information Theory 2009, pp. 1313\u20131317 (2009)","key":"22_CR18","DOI":"10.1109\/ISIT.2009.5205936"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1007\/978-3-540-28628-8_33","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"K. Srinathan","year":"2004","unstructured":"Srinathan, K., Narayanan, A., Rangan, C.P.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-540-77026-8_9","volume-title":"Progress in Cryptology \u2013 INDOCRYPT 2007","author":"K. Srinathan","year":"2007","unstructured":"Srinathan, K., Patra, A., Choudhary, A., Rangan, C.P.: Probabilistic perfectly reliable and secure message transmission \u2014 possibility, feasibility and optimality. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 101\u2013122. Springer, Heidelberg (2007)"},{"issue":"2","key":"22_CR21","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1006\/inco.1994.1099","volume":"115","author":"E. Upfal","year":"1994","unstructured":"Upfal, E.: Tolerating a linear number of faults in networks of bounded degree. Information and Computation\u00a0115(2), 312\u2013320 (1994)","journal-title":"Information and Computation"},{"issue":"2","key":"22_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0022-0000(81)90033-7","volume":"22","author":"M. Wegman","year":"1981","unstructured":"Wegman, M., Carter, J.: New hash functions and their use in authentication and set equality. J. Computer and System Sciences\u00a022(2), 265\u2013279 (1981)","journal-title":"J. Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24209-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T10:41:51Z","timestamp":1560508911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24209-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242083","9783642242090"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24209-0_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}