{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T20:00:59Z","timestamp":1758398459537},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T00:00:00Z","timestamp":1192492800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s00145-007-9018-2","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T18:01:05Z","timestamp":1192471265000},"page":"250-279","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Probabilistic Reliability and Privacy of Communication Using Multicast in General Neighbor Networks"],"prefix":"10.1007","volume":"21","author":[{"given":"J\u00e9r\u00f4me","family":"Renault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tristan","family":"Tomala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,16]]},"reference":[{"key":"9018_CR1","first-page":"1","volume-title":"Essays on Game Theory","author":"R.J. Aumann","year":"1994","unstructured":"R.J. Aumann, L.S. Shapley, Long-term competition\u2014a game theoretic analysis, in Essays on Game Theory, ed. by N.\u00a0Megiddo (Springer, New York, 1994), pp.\u00a01\u201315."},{"key":"9018_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0304-3975(98)00241-2","volume":"220","author":"A. Beimel","year":"1999","unstructured":"A. Beimel, M. Franklin, Reliable communication over partially authenticated networks. Theor. Comput. Sci. 220, 185\u2013210 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9018_CR3","unstructured":"A. Beimel, L. Malka, Efficient reliable communication over partially authenticated networks, in Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (2003), pp.\u00a0233\u2013242"},{"key":"9018_CR4","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jeth.1996.0090","volume":"70","author":"E. Ben-Porath","year":"1996","unstructured":"E. Ben-Porath, M. Kahneman, Communication in repeated games with private monitoring. J.\u00a0Econ. Theory 70, 281\u2013297 (1996)","journal-title":"J.\u00a0Econ. Theory"},{"issue":"2","key":"9018_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/s00145-001-0002-y","volume":"14","author":"Y. Desmedt","year":"2001","unstructured":"Y. Desmedt, Y. Wang, Secure communication in multicast channels: the answer to Franklin and Wright\u2019s question. J.\u00a0Cryptol. 14(2), 121\u2013135 (2001)","journal-title":"J.\u00a0Cryptol."},{"key":"9018_CR6","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"D. Dolev, The Byzantine general strikes again. J.\u00a0Algorithms 3, 14\u201330 (1982)","journal-title":"J.\u00a0Algorithms"},{"issue":"1","key":"9018_CR7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"D. Dolev, C. Dwork, O. Waarts, M. Yung, Perfectly secure message transmission. J.\u00a0Assoc. Comput. Mach. 40(1), 17\u201347 (1993)","journal-title":"J.\u00a0Assoc. Comput. Mach."},{"key":"9018_CR8","series-title":"Annals of Mathematic Study","volume-title":"Contributions to the Theory of Games, vol.\u00a0II","author":"H.W. Kuhn","year":"1953","unstructured":"H.W. Kuhn, Extensive games and the problem of information, in Contributions to the Theory of Games, vol.\u00a0II, ed. by Kuhn and Tucker, Annals of Mathematic Study, vol.\u00a028 (Princeton University Press, Princeton, 1953)"},{"issue":"1","key":"9018_CR9","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s001459910002","volume":"13","author":"M. Franklin","year":"2000","unstructured":"M. Franklin, R.N. Wright, Secure communication in minimal connectivity models. J.\u00a0Cryptol. 13(1), 9\u201330 (2000)","journal-title":"J.\u00a0Cryptol."},{"key":"9018_CR10","unstructured":"M. Franklin, M. Yung, Secure hypergraphs: privacy from partial broadcast, in Proceedings of the 27th ACM Symposium on the Theory of Computing (1995), pp.\u00a036\u201344"},{"key":"9018_CR11","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/s001820050089","volume":"27","author":"J. Renault","year":"1998","unstructured":"J. Renault, T. Tomala, Repeated proximity games. Int. J. Game Theory 27, 539\u2013559 (1998)","journal-title":"Int. J. Game Theory"},{"key":"9018_CR12","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/S0899-8256(03)00153-2","volume":"47","author":"J. Renault","year":"2004","unstructured":"J. Renault, T. Tomala, Learning the state of nature in repeated game with incomplete information and signals. Games Econ. Behav. 47, 124\u2013156 (2004)","journal-title":"Games Econ. Behav."},{"key":"9018_CR13","doi-asserted-by":"crossref","unstructured":"K. Srinathan, C. Pandu Rangan, Possibility and complexity of probabilistic reliable communication in directed networks, in PODC\u201906, July 2006","DOI":"10.1145\/1146381.1146421"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9018-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-007-9018-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9018-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-007-9018-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:37:59Z","timestamp":1586335079000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-007-9018-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,16]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9018"],"URL":"https:\/\/doi.org\/10.1007\/s00145-007-9018-2","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,16]]},"assertion":[{"value":"27 June 2005","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2007","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}