{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:05:20Z","timestamp":1725584720025},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642209000"},{"type":"electronic","value":"9783642209017"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20901-7_8","type":"book-chapter","created":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T10:11:30Z","timestamp":1307182290000},"page":"126-141","source":"Crossref","is-referenced-by-count":6,"title":["Secure Message Transmission by Public Discussion: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Juan","family":"Garay","sequence":"first","affiliation":[]},{"given":"Clint","family":"Givens","sequence":"additional","affiliation":[]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_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)"},{"issue":"6","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1109\/18.476316","volume":"41","author":"C.H. Bennett","year":"1995","unstructured":"Bennett, C.H., Brassard, G., Cr\u00e8peau, C., Maurer, U.: Generalized privacy amplification. IEEE Transactions on Information Theory\u00a041(6), 1015\u20131923 (1995)","journal-title":"IEEE Transactions on Information Theory"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Bennett, C.H., Brassard, G., Robert, J.M.: Privacy amplification by public discussion. Siam Journal of Computing\u00a017(2) (1988)","DOI":"10.1137\/0217014"},{"issue":"7","key":"8_CR4","first-page":"62","volume":"2","author":"P. Berman","year":"1991","unstructured":"Berman, P., Garay, J.: Fast consensus in networks of bounded degree. Distributed Computing\u00a02(7), 62\u201373 (1991); Preliminary version in WDAG 1990","journal-title":"Distributed Computing"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1\u201310 (1988)","DOI":"10.1145\/62212.62213"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11\u201319 (1988)","DOI":"10.1145\/62212.62214"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-642-14162-1_21","volume-title":"Automata, Languages and Programming","author":"N. Chandran","year":"2010","unstructured":"Chandran, N., Garay, J., Ostrovsky, R.: Improved fault tolerance and secure computation on sparse networks. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol.\u00a06199, pp. 249\u2013260. Springer, Heidelberg (2010)"},{"key":"8_CR8","unstructured":"Choudhary, A., Patra, A., Pandu Rangan, C., Srinathan, K.: Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality. Cryptology ePrint Archive, Report 2008\/141 (2008)"},{"issue":"40","key":"8_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"1","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. Journal of ACM\u00a01(40), 17\u201347 (1993)","journal-title":"Journal of ACM"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. SIAM J. Comput. (2008)","DOI":"10.1137\/060651380"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippinger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: STOC, pp. 370\u2013379 (1986)","DOI":"10.1145\/12130.12169"},{"key":"8_CR12","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)"},{"issue":"4","key":"8_CR13","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous Byzantine agreement. SIAM J. Comput.\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/BFb0054138","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Franklin","year":"1998","unstructured":"Franklin, M., Wright, R.: Secure communication in minimal connectivity models. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 346\u2013360. Springer, Heidelberg (1998)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-85093-9_1","volume-title":"Information Theoretic Security","author":"J.A. Garay","year":"2008","unstructured":"Garay, J.A.: Partially connected networks: Information theoretically secure protocols and open problems (Invited talk). In: Safavi-Naini, R. (ed.) ICITS 2008. LNCS, vol.\u00a05155, p. 1. Springer, Heidelberg (2008)"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-13190-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"J. Garay","year":"2010","unstructured":"Garay, J., Givens, C., Ostrovsky, R.: Secure message transmission with small public discussion. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 177\u2013196. Springer, Heidelberg (2010); Full version in Cryptology ePrint Archive, Report 2009\/519"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J. Garay","year":"1998","unstructured":"Garay, J., Moses, Y.: Fully polynomial Byzantine agreement for n\u2009>\u20093t processors in t\u2009+\u20091 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998); Prelim. in STOC 1992","journal-title":"SIAM J. Comput."},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-540-78967-3_18","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J.A. Garay","year":"2008","unstructured":"Garay, J.A., Ostrovsky, R.: Almost-everywhere secure computation. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11818175_27","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Katz","year":"2006","unstructured":"Katz, J., Koo, C.-Y.: On expected constant-round protocols for byzantine agreement. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 445\u2013462. Springer, Heidelberg (2006)"},{"key":"8_CR20","unstructured":"Kurosawa, K., Suzuki, K.: Almost secure (1-round, n-channel) message transmission scheme. Cryptology ePrint Archive, Report 2007\/076 (2007)"},{"key":"8_CR21","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)"},{"issue":"5","key":"8_CR22","doi-asserted-by":"publisher","first-page":"1231","DOI":"10.1137\/S0097539705446846","volume":"36","author":"J. Kamp","year":"2006","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. SIAM J. Comput.\u00a036(5), 1231\u20131247 (2006)","journal-title":"SIAM J. Comput."},{"key":"8_CR23","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 382\u2013401 (July 1982)","DOI":"10.1145\/357172.357176"},{"key":"8_CR24","volume-title":"The Theory of Error-Correcting Codes","author":"F. Macwilliams","year":"1983","unstructured":"Macwilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1983)"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM, JACM\u00a027(2) (April 1980)","DOI":"10.1145\/322186.322188"},{"issue":"126","key":"8_CR26","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/inco.1996.0033","volume":"1","author":"H. Sayeed","year":"1996","unstructured":"Sayeed, H., Abu-Amara, H.: Efficient perfectly secure message transmission in synchronous networks. Information and Computation\u00a01(126), 53\u201361 (1996)","journal-title":"Information and Computation"},{"key":"8_CR27","doi-asserted-by":"crossref","unstructured":"Shi, H., Jiang, S., Safavi-Naini, R., Tuhin, M.: Optimal secure message transmission by public discussion. In: IEEE Symposium on Information Theory (2009)","DOI":"10.1109\/ISIT.2009.5205936"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"8_CR29","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":"8_CR30","doi-asserted-by":"crossref","unstructured":"Upfal, E.: Tolerating linear number of faults in networks of bounded degree. In: PODC, pp. 83\u201389 (1992)","DOI":"10.1145\/135419.135437"}],"container-title":["Lecture Notes in Computer Science","Coding and Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20901-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T03:39:57Z","timestamp":1553744397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20901-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642209000","9783642209017"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20901-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}