{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,22]],"date-time":"2025-05-22T04:58:30Z","timestamp":1747889910547,"version":"3.41.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319174693"},{"type":"electronic","value":"9783319174709"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17470-9_3","type":"book-chapter","created":{"date-parts":[[2015,4,3]],"date-time":"2015-04-03T06:09:35Z","timestamp":1428041375000},"page":"33-50","source":"Crossref","is-referenced-by-count":2,"title":["Round-Optimal Perfectly Secret Message Transmission with Linear Communication Complexity"],"prefix":"10.1007","author":[{"given":"Ravi","family":"Kishore","sequence":"first","affiliation":[]},{"given":"Ashutosh","family":"Kumar","sequence":"additional","affiliation":[]},{"given":"Chiranjeevi","family":"Vanarasa","sequence":"additional","affiliation":[]},{"given":"Srinathan","family":"Kannan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Secure hypergraphs: privacy from partial broadcast (extended abstract). In: Leighton, F.T., Borodin, A. (eds.) STOC, pp. 36\u201344. ACM (1995)","DOI":"10.1145\/225058.225077"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete Characterization of Adversaries Tolerable in Secure Multi-party Computation. In: Proceedings of the 16th Symposium on Principles of Distributed Computing (PODC), pp. 25\u201334. ACM Press (August 1997)","DOI":"10.1145\/259380.259412"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to Withstand Mobile Virus Attacks. In: Proceedings of the 10th Symposium on Principles of Distributed Computing (PODC), pp. 51\u201361. ACM Press (1991)","DOI":"10.1145\/112600.112605"},{"key":"3_CR4","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., Chandrasekaran, P.R.: 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":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BFb0055724","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Hirt, M., Maurer, U.M.: Trading Correctness for Privacy in Unconditional multi-party Computation. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 121\u2013136. Springer, Heidelberg (1998)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-540-85093-9_15","volume-title":"Information Theoretic Security","author":"A. Choudhary","year":"2008","unstructured":"Choudhary, A., Patra, A., Ashwinkumar, B.V., Srinathan, K., Rangan, C.P.: Perfectly reliable and secure communication tolerating static and mobile mixed adversary. In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, pp. 137\u2013155. Springer, Heidelberg (2008)"},{"key":"3_CR7","unstructured":"Sayeed, H., Abu-Amara, H.: Perfectly Secure Message Transmission in Asynchronous Networks. In: Seventh IEEE Symposium on Parallel and Distributed Processing (1995)"},{"issue":"1","key":"3_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 Association for Computing Machinery (JACM)\u00a040(1), 17\u201347 (1993)","journal-title":"Journal of the Association for Computing Machinery (JACM)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-642-20728-0_4","volume-title":"Information Theoretic Security","author":"M. Nayak","year":"2011","unstructured":"Nayak, M., Agrawal, S., Srinathan, K.: Minimal connectivity for unconditionally secure message transmission in synchronous directed networks. In: Fehr, S. (ed.) ICITS 2011. LNCS, vol.\u00a06673, pp. 32\u201351. Springer, Heidelberg (2011)"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"96","DOI":"10.4064\/fm-10-1-96-115","volume":"10","author":"K. Menger","year":"1927","unstructured":"Menger, K.: Zur allgemeinen kurventheorie. Fundamenta Mathematicae\u00a010, 96\u2013115 (1927)","journal-title":"Fundamenta Mathematicae"},{"issue":"11","key":"3_CR11","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 Trans. Inf. Theor.\u00a055(11), 5223\u20135232 (2009)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/2371656.2371657","volume":"59","author":"A. Badanidiyuru","year":"2012","unstructured":"Badanidiyuru, A., Patra, A., Choudhury, A., Srinathan, K., Rangan, C.P.: On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM\u00a059(5), 22 (2012)","journal-title":"J. ACM"},{"key":"3_CR13","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., Vardhan, S.H.: Towards optimal and efficient perfectly secure message transmission. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 311\u2013322. Springer, Heidelberg (2007)"},{"key":"3_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.geb.2014.01.012","volume":"85","author":"J. Renault","year":"2014","unstructured":"Renault, J., Renou, L., Tomala, T.: Secure message transmission on directed networks. Games and Economic Behavior\u00a085, 1\u201318 (2014)","journal-title":"Games and Economic Behavior"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, M.V.N.A., Goundan, P.R., Srinathan, K., Pandu Rangan, C.: On perfectly secure communication over arbitrary networks. In: Proceedings of the 21st Symposium on Principles of Distributed Computing (PODC), Monterey, California, USA, pp. 193\u2013202. ACM Press (July 2002)","DOI":"10.1145\/571825.571858"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22, 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR17","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.G. Desmedt","year":"2002","unstructured":"Desmedt, Y.G., Wang, Y.: Perfectly Secure Message Transmission Revisited. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 502\u2013517. Springer, Heidelberg (2002)"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Srinathan, K., Rangan, C.P.: Possibility and complexity of probabilistic reliable communications in directed networks. In: Proceedings of 25th ACM Symposium on Principles of Distributed Computing, PODC 2006 (2006)","DOI":"10.1145\/1146381.1146421"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Franklin, M.K., Yung, M.: Communication complexity of secure computation (extended abstract). In: Kosaraju, S.R., Fellows, M., Wigderson, A., Ellis, J.A. (eds.) Proceedings of the 24th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 4-6, pp. 699\u2013710. ACM (1992)","DOI":"10.1145\/129712.129780"},{"key":"3_CR20","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. Communications of the ACM\u00a022, 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"3_CR21","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)"},{"key":"3_CR22","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/800119.803897","volume-title":"Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974","author":"R. Endre Tarjan","year":"1974","unstructured":"Endre Tarjan, R.: Testing graph connectivity. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 185\u2013193. ACM, New York (1974)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum flow problem. Journal of the ACM\u00a035, 921\u2013940 (1988)","journal-title":"Journal of the ACM"}],"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-319-17470-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T21:19:30Z","timestamp":1747862370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17470-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319174693","9783319174709"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17470-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}