{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:04:18Z","timestamp":1725516258179},"publisher-location":"Berlin, Heidelberg","reference-count":8,"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_1","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T10:24:37Z","timestamp":1218536677000},"page":"1-1","source":"Crossref","is-referenced-by-count":2,"title":["Partially Connected Networks: Information Theoretically Secure Protocols and Open Problems (Invited Talk)"],"prefix":"10.1007","author":[{"given":"Juan A.","family":"Garay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proc. 20th STOC, May 1988, pp. 1\u201310 (1988)","key":"1_CR1","DOI":"10.1145\/62212.62213"},{"doi-asserted-by":"crossref","unstructured":"Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proc. 20th STOC, May 1988, pp. 11\u201319 (1988)","key":"1_CR2","DOI":"10.1145\/62212.62214"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"1","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The Byzantine generals strike again. Journal of Algorithms\u00a01(3), 14\u201330 (1982)","journal-title":"Journal of Algorithms"},{"issue":"40","key":"1_CR4","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., Young, M.: Perfectly secure message transmission. Journal of ACM\u00a01(40), 17\u201347 (1993)","journal-title":"Journal of ACM"},{"doi-asserted-by":"crossref","unstructured":"Dwork, C., Peleg, D., Pippinger, N., Upfal, E.: Fault tolerance in networks of bounded degree. In: Proc. 18th STOC, May 1986, pp. 370\u2013379 (1986)","key":"1_CR5","DOI":"10.1145\/12130.12169"},{"key":"1_CR6","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\u2013Eurocrypt 2008","author":"J. Garay","year":"2008","unstructured":"Garay, J., Ostrovsky, R.: Almost-everywhere secure computation. In: Advances in Cryptology\u2013Eurocrypt 2008, April 2008. LNCS, vol.\u00a04965, pp. 307\u2013323. Springer, Heidelberg (2008)"},{"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)","key":"1_CR7","DOI":"10.1145\/322186.322188"},{"unstructured":"Vaya, S.: Secure computation on incomplete networks. In: Cryptology ePrint archive, Report 2007\/346 (September 2007)","key":"1_CR8"}],"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_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:40:46Z","timestamp":1619523646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85093-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850922","9783540850939"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85093-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}