{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T02:43:14Z","timestamp":1747104194300,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642144950"},{"type":"electronic","value":"9783642144967"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-14496-7_14","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T11:51:35Z","timestamp":1284119495000},"page":"159-176","source":"Crossref","is-referenced-by-count":8,"title":["Cryptanalysis of Secure Message Transmission Protocols with Feedback"],"prefix":"10.1007","author":[{"given":"Qiushi","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yvo","family":"Desmedt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"14_CR1","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 Hann, R.: Asymptotically optimal two-round perfectly secure message transmission. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 394\u2013408. Springer, Heidelberg (2006)"},{"key":"14_CR2","first-page":"1","volume-title":"Proc. ACM STOC 1988","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computing. In: Proc. ACM STOC 1988, pp. 1\u201310. ACM Press, New York (1988)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Blakley, G.: Safeguarding cryptographic keys. In: Proc. AFIPS 1979 National Computer Conference, New York, June 1979, vol.\u00a048, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR4","first-page":"11","volume-title":"Proc. ACM STOC 1988","author":"D. Chaum","year":"1988","unstructured":"Chaum, D., Cr\u00e9peau, C., Damg\u00e5rd, I.: Multiparty unconditional secure protocols. In: Proc. ACM STOC 1988, pp. 11\u201319. ACM Press, New York (1988)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-46035-7_33","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y. Desmedt","year":"2002","unstructured":"Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 502\u2013517. Springer, Heidelberg (2002)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11602613_29","volume-title":"Algorithms and Computation","author":"Y. Desmedt","year":"2005","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 2005. LNCS, vol.\u00a03827, pp. 277\u2013287. Springer, Heidelberg (2005)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. J. of Algorithms\u00a03, 14\u201330 (1982)","journal-title":"J. of Algorithms"},{"issue":"1","key":"14_CR8","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. Journal of the ACM\u00a040(1), 17\u201347 (1993)","journal-title":"Journal of the ACM"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Wright, R.: Secure communication in minimal connectivity models. Journal of Cryptology\u00a013(1), 9\u201330 (2000)","journal-title":"Journal of Cryptology"},{"issue":"3","key":"14_CR10","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1002\/j.1538-7305.1974.tb02751.x","volume":"53","author":"E. Gilbert","year":"1974","unstructured":"Gilbert, E., MacWilliams, F., Sloane, N.: Codes which detect deception. The BELL System Technical Journal\u00a053(3), 405\u2013424 (1974)","journal-title":"The BELL System Technical Journal"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","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. Journal of Cryptology\u00a013(1), 31\u201360 (2000)","journal-title":"Journal of Cryptology"},{"key":"14_CR12","first-page":"99","volume-title":"Proc. IEEE Global Telecommunications Conf., Globecom 1987","author":"M. Ito","year":"1987","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Secret sharing schemes realizing general access structures. In: Proc. IEEE Global Telecommunications Conf., Globecom 1987, pp. 99\u2013102. IEEE Communications Soc. Press, Los Alamitos (1987)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Kumar, M., Goundan, P., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proc. ACM PODC 2002, pp. 293\u2013202 (2002)","DOI":"10.1145\/571825.571858"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-540-78967-3_19","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"K. Kurosawa","year":"2008","unstructured":"Kurosawa, K., Suzuki, K.: Truly efficient 2-round perfectly secure message transmission scheme. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 324\u2013340. Springer, Heidelberg (2008)"},{"key":"14_CR15","volume-title":"The theory of error-correcting codes","author":"F.J. MacWilliams","year":"1978","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The theory of error-correcting codes. North-Holland Publishing Company, Amsterdam (1978)"},{"issue":"9","key":"14_CR16","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R.J. McEliece","year":"1981","unstructured":"McEliece, R.J., Sarwate, D.V.: On sharing secrets and Reed-Solomon codes. Communications of ACM\u00a024(9), 583\u2013584 (1981)","journal-title":"Communications of ACM"},{"key":"14_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-85855-3_21","volume-title":"Security and Cryptography for Networks","author":"A. Patra","year":"2008","unstructured":"Patra, A., Cloudhary, A., Rangan, C.P.: Unconditionally reliable and secure message transmission in directed networks revisited. In: Ostrovsky, R., De Prisco, R., Visconti, I. (eds.) SCN 2008. LNCS, vol.\u00a05229, pp. 309\u2013326. Springer, Heidelberg (2008)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Patra, A., Cloudhary, A., Rangan, C.P.: Brief announcement: perfectly secure message transmission in directed networks re-visited. In: PODC 2009, pp. 278\u2013279 (2009)","DOI":"10.1145\/1582716.1582763"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Patra, A., Shankar, B., Choudhary, A., Srinathan, K., Rangan, C.P.: Perfectly secure message transmission in directed networks tolerating threshold and non threshold adversary. In: Proc. CANS, pp. 80\u2013101 (2007)","DOI":"10.1007\/978-3-540-76969-9_6"},{"issue":"6","key":"14_CR20","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1145\/195613.195621","volume":"41","author":"T. Rabin","year":"1994","unstructured":"Rabin, T.: Robust sharing of secrets when the dealer is honest or cheating. J. of the ACM\u00a041(6), 1089\u20131109 (1994)","journal-title":"J. of the ACM"},{"key":"14_CR21","first-page":"73","volume-title":"Proc. ACM STOC 1989","author":"T. Rabin","year":"1989","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. ACM STOC 1989, pp. 73\u201385. ACM Press, New York (1989)"},{"issue":"11","key":"14_CR22","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. Communication of ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communication of ACM"},{"key":"14_CR23","unstructured":"Shankar, B., Gopal, P., Srinathan, K., Rangan, C.P.: Unconditionally reliable message transmission in directed networks. In: Huang, S.-T. (ed.) SODA, pp. 1048\u20131055 (2008)"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"14_CR25","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Possibility and complexity of probabilistic reliable communications in directed networks. In: Proc. ACM PODC 2006 (2006)","DOI":"10.1145\/1146381.1146421"},{"issue":"6","key":"14_CR26","doi-asserted-by":"publisher","first-page":"2582","DOI":"10.1109\/TIT.2008.921676","volume":"54","author":"Y. Wang","year":"2008","unstructured":"Wang, Y., Desmedt, Y.: Perfectly secure message transmission revisited. IEEE Transaction on Information Theory\u00a054(6), 2582\u20132595 (2008)","journal-title":"IEEE Transaction on Information Theory"},{"key":"14_CR27","unstructured":"Yang, Q., Desmedt, Y.: Cryptanalysis of secure message transmission protocols with feedback (full version). Cryptology ePrint Archive, Report 2009\/632 (2009)"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14496-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:13:40Z","timestamp":1676070820000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14496-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642144950","9783642144967"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14496-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}