{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:11Z","timestamp":1725516251682},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850922"},{"type":"electronic","value":"9783540850939"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85093-9_15","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T06:24:37Z","timestamp":1218522277000},"page":"137-155","source":"Crossref","is-referenced-by-count":5,"title":["Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary"],"prefix":"10.1007","author":[{"given":"Ashish","family":"Choudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arpita","family":"Patra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. V.","family":"Ashwinkumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"Srinathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_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 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)"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. of 20th ACM STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"15_CR3","unstructured":"Choudhary, A., Patra, A., Ashwinkumar, B.V., Srinathan, K., Pandu Rangan, C.: Perfectly reliable and secure communication tolerating static and mobile mixed adversary. Cryptology ePrint Archive, Report 2008\/232 (2008)"},{"key":"15_CR4","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)"},{"issue":"1","key":"15_CR5","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. JACM\u00a040(1), 17\u201347 (1993)","journal-title":"JACM"},{"issue":"1","key":"15_CR6","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"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. of 19th ACM STOC, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"15_CR8","first-page":"193","volume-title":"Proc. of 21st PODC","author":"M.V.N.A. Kumar","year":"2002","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Rangan, C.P.: On perfectly secure communication over arbitrary networks. In: Proc. of 21st PODC, pp. 193\u2013202. ACM Press, New York (2002)"},{"key":"15_CR9","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. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 324\u2013340. Springer, Heidelberg (2008)"},{"key":"15_CR10","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)"},{"key":"15_CR11","unstructured":"Patra, A., Choudhary, A., Gayatri, M., Pandu Rangan, C.: Efficient perfectly reliable and secure communication tolerating mobile adversary. In: Proc. of ACISP 2008. Cryptology ePrint Archive, Report 2008\/086 (to appear, 2008)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11941378_16","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"A. Patra","year":"2006","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Rangan, C.P.: Constant phase bit optimal protocols for perfectly reliable and secure message transmission. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, pp. 221\u2013235. Springer, Heidelberg (2006)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Rabin, T., Ben-Or, M.: Verifiable secret sharing and multiparty protocols with honest majority. In: Proc. of 21st ACM STOC, pp. 73\u201385 (1989)","DOI":"10.1145\/73007.73014"},{"issue":"1","key":"15_CR14","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"},{"key":"15_CR15","unstructured":"Srinathan, K.: Secure distributed communication. PhD Thesis, IIT Madras (2006)"},{"key":"15_CR16","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., Pandu Rangan, C.: Optimal perfectly secure message transmission. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 545\u2013561. Springer, Heidelberg (2004)"},{"key":"15_CR17","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 - possibility, feasibility and optimality. In: Srinathan, K., Rangan, C.P., Yung, M. (eds.) INDOCRYPT 2007. LNCS, vol.\u00a04859, pp. 101\u2013122. Springer, Heidelberg (2007)"},{"key":"15_CR18","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Prasad, N.R., Pandu Rangan, C.: On the optimal communication complexity of multiphase protocols for perfect communication. In: IEEE Symposium on Security and Privacy, pp. 311\u2013320 (2007)","DOI":"10.1109\/SP.2007.31"},{"key":"15_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-540-73458-1_33","volume-title":"Information Security and Privacy","author":"K. Srinathan","year":"2007","unstructured":"Srinathan, K., Raghavendra, P., Pandu Rangan, C.: On proactive perfectly secure message transmission. In: Pieprzyk, J., Ghodosi, H., Dawson, E. (eds.) ACISP 2007. LNCS, vol.\u00a04586, pp. 461\u2013473. Springer, Heidelberg (2007)"},{"key":"15_CR20","unstructured":"AshwinKumar, B.V., Patra, A., Choudhary, A., Srinathan, K., Pandu Rangan, C.: On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary. In: Proc. of ACM PODC (to appear, 2008)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proc. of 23rd IEEE FOCS, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Information Theoretic Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85093-9_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:40:48Z","timestamp":1619509248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}