{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T22:57:02Z","timestamp":1777157822709,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709350","type":"print"},{"value":"9783540709367","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_17","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T11:43:44Z","timestamp":1179315824000},"page":"311-322","source":"Crossref","is-referenced-by-count":45,"title":["Towards Optimal and Efficient Perfectly Secure Message Transmission"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Fitzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan","family":"Garay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Harsha","family":"Vardhan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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, Springer, Heidelberg (2006)"},{"key":"17_CR2","first-page":"17","volume-title":"Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC\u00a0\u201983)","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC\u00a0\u201983), pp. 17\u201319. ACM Press, New York (1983)"},{"key":"17_CR3","first-page":"1","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201988)","author":"M. Ben-Or","year":"1988","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201988), pp. 1\u201310. Springer, Heidelberg (1988)"},{"key":"17_CR4","unstructured":"Berlekamp, E., Welch, L.: Error correction of algebraic block codes. US Patent 4,633,470"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4615-3422-8_27","volume-title":"Computer Science Research","author":"P. Berman","year":"1992","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313\u2013322. Plenum Publishing Corporation, New York (1992)"},{"issue":"4","key":"17_CR6","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1145\/31846.42229","volume":"34","author":"G. Bracha","year":"1987","unstructured":"Bracha, G.: An O(logn) expected rounds randomized Byzantine generals protocol. Journal of the Association for Computing Machinery\u00a034(4), 910\u2013920 (1987)","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"1","key":"17_CR7","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0890-5401(92)90004-Y","volume":"97","author":"B.A. Coan","year":"1992","unstructured":"Coan, B.A., Welch, J.L.: Modular construction of a Byzantine agreement protocol with optimal message bit complexity. Information and Computation\u00a097(1), 61\u201385 (1992)","journal-title":"Information and Computation"},{"issue":"1","key":"17_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"},{"key":"17_CR9","first-page":"370","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201986)","author":"C. Dwork","year":"1986","unstructured":"Dwork, C., Peleg, D., Pippinger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201986), pp. 370\u2013379. ACM, New York (1986)"},{"key":"17_CR10","first-page":"218","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201987)","author":"O. Goldreich","year":"1987","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201987), pp. 218\u2013229. ACM, New York (1987)"},{"issue":"1","key":"17_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"},{"issue":"301","key":"17_CR12","doi-asserted-by":"publisher","first-page":"13","DOI":"10.2307\/2282952","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"Hoeffding, W.: Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association\u00a058(301), 13\u201330 (1963)","journal-title":"Journal of the American Statistical Association"},{"key":"17_CR13","volume-title":"Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u00a0\u201906)","author":"V. King","year":"2006","unstructured":"King, V., Saia, J., Sanwalani, V., Vee, E.: Towards secure and scalable computation in Peer-to-Peer networks. In: Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS\u00a0\u201906), IEEE, Los Alamitos (2006)"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Prog. Lang. Syst.\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Prog. Lang. Syst."},{"key":"17_CR15","first-page":"234","volume-title":"Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201994)","author":"R. Ostrovsky","year":"1994","unstructured":"Ostrovsky, R., Rajagopalan, S., Vazirani, U.: Simple and efficient leader election in the full information model. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201994), pp. 234\u2013242. ACM, New York (1994)"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11941378_16","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"A. Patra","year":"2006","unstructured":"Patra, A., Choudhary, A., Srinathan, K., Pandu Rangan, C.: Constant phase bit optimal protocols for perfectly secure message transmission. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol.\u00a04329, Springer, Heidelberg (2006)"},{"issue":"1","key":"17_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 Communication\u00a0126(1), 53\u201361 (1996)","journal-title":"Information and Communication"},{"key":"17_CR18","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":"17_CR19","first-page":"160","volume-title":"Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS\u00a0\u201982)","author":"A.C. Yao","year":"1982","unstructured":"Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual IEEE Symposium on Foundations of Computer Science (FOCS\u00a0\u201982), pp. 160\u2013164. IEEE, Los Alamitos (1982)"},{"key":"17_CR20","first-page":"286","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201996)","author":"D. Zuckerman","year":"1996","unstructured":"Zuckerman, D.: Randomness-optimal sampling, extractors, and constructive leader election. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC\u00a0\u201996), pp. 286\u2013295. ACM, New York (1996)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70936-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:12:52Z","timestamp":1605762772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_17","relation":{},"subject":[]}}