{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:06:08Z","timestamp":1725494768837},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540769682"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76969-9_6","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T06:32:49Z","timestamp":1195021969000},"page":"80-101","source":"Crossref","is-referenced-by-count":10,"title":["Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary"],"prefix":"10.1007","author":[{"given":"Arpita","family":"Patra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bhavani","family":"Shankar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Choudhary","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":"6_CR1","doi-asserted-by":"crossref","unstructured":"Desmedt, Y., Wang, Y.: Perfectly secure message transmission revisited. Cryptology ePrint Archive, Report 2002\/128 (2002), http:\/\/eprint.iacr.org","DOI":"10.1007\/3-540-46035-7_33"},{"key":"6_CR2","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":"6_CR3","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)"},{"issue":"1","key":"6_CR4","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"},{"key":"6_CR5","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., Pandu Rangan, C.: On perfectly secure communication over arbitrary networks. In: Proc. of 21st PODC, pp. 193\u2013202. ACM Press, New York (2002)"},{"key":"6_CR6","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Holland Publishing Company (1978)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Patra, A., Choudhary, A., Pandu Rangan, C.: Brief announcement: Constant phase efficient protocols for secure message transmission in directed networks. In: Proc of ACM PODC, pp. 322\u2013323 (2007)","DOI":"10.1145\/1281100.1281153"},{"issue":"1","key":"6_CR8","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"},{"issue":"11","key":"6_CR9","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(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"6_CR10","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":"6_CR11","first-page":"265","volume-title":"Proc. of 25th PODC","author":"K. Srinathan","year":"2006","unstructured":"Srinathan, K., Pandu Rangan, C.: Possibility and complexity of probabilistic reliable communication in directed networks. In: Proc. of 25th PODC, pp. 265\u2013274. ACM Press, New York (2006)"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76969-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:50:54Z","timestamp":1619520654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76969-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540769682"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76969-9_6","relation":{},"subject":[]}}