{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:17:44Z","timestamp":1725470264788},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540380801"},{"type":"electronic","value":"9783540380818"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11832072_1","type":"book-chapter","created":{"date-parts":[[2006,8,30]],"date-time":"2006-08-30T00:43:49Z","timestamp":1156898629000},"page":"1-17","source":"Crossref","is-referenced-by-count":1,"title":["Edge Eavesdropping Games"],"prefix":"10.1007","author":[{"given":"Amos","family":"Beimel","sequence":"first","affiliation":[]},{"given":"Matthew","family":"Franklin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Beimel, A., Franklin, M.: Edge eavesdropping games (2006), http:\/\/www.cs.bgu.ac.il\/~beimel\/Papers\/","DOI":"10.1007\/11832072_1"},{"issue":"2","key":"1_CR2","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0196-6774(91)90003-H","volume":"12","author":"D. Bienstock","year":"1991","unstructured":"Bienstock, D., Seymour, P.: Monotonicity in graph searching. J. of Algorithms\u00a012(2), 239\u2013245 (1991)","journal-title":"J. of Algorithms"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Buhrman, H., Garay, J.A., Hoepman, J.H.: Optimal resiliency against mobile faults. In: 25th International Symp. on Fault-Tolerant Computing, pp. 83\u201388 (1995)","DOI":"10.1109\/FTCS.1995.466995"},{"key":"1_CR4","unstructured":"Cai, N., Yeung, R.W.: Secure network coding. In: International Symposium on Information Theory (2002)"},{"key":"1_CR5","unstructured":"Feldman, J., Malkin, T., Stein, C., Servedio, R.A.: On the capacity of secure network coding. In: Proc. 42nd Annual Allerton Conference on Communication, Control, and Computing (2004)"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1145\/333979.333980","volume":"47","author":"M. Franklin","year":"2000","unstructured":"Franklin, M., Galil, Z., Yung, M.: Eavesdropping games: a graph-theoretic approach to privacy in distributed systems. J. of the ACM\u00a047(2), 225\u2013243 (2000)","journal-title":"J. of the ACM"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BFb0020438","volume-title":"Distributed Algorithms","author":"J.A. Garay","year":"1994","unstructured":"Garay, J.A.: Reaching (and maintaining) agreement in the presence of mobile faults. In: Tel, G., Vit\u00e1nyi, P.M.B. (eds.) WDAG 1994. LNCS, vol.\u00a0857, pp. 253\u2013264. Springer, Heidelberg (1994)"},{"issue":"1-2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0304-3975(98)00263-1","volume":"243","author":"J.A. Garay","year":"2000","unstructured":"Garay, J.A., Gennaro, R., Jutla, C.S., Rabin, T.: Secure distributed storage and retrieval. Theoretical Computer Science\u00a0243(1-2), 363\u2013389 (2000)","journal-title":"Theoretical Computer Science"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-44750-4_27","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"A. Herzberg","year":"1995","unstructured":"Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 339\u2013352. Springer, Heidelberg (1995)"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Jain, K.: Security based on network topology against the wiretapping attack. IEEE Magazine, Special issue on Topics in Wireless Security (2004)","DOI":"10.1109\/MWC.2004.1269720"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0304-3975(86)90146-5","volume":"47","author":"L.M. Kirousis","year":"1986","unstructured":"Kirousis, L.M., Papadimitriou, C.H.: Searching and pebbling. Theoretical Computer Science\u00a047, 205\u2013218 (1986)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1145\/151261.151263","volume":"40","author":"A. LaPaugh","year":"1993","unstructured":"LaPaugh, A.: Recontamination does not help to search a graph. J. of the ACM\u00a040(2), 224\u2013245 (1993)","journal-title":"J. of the ACM"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Ostrovsky, R., Yung, M.: How to withstand mobile virus attacks. In: Proc. of the 10th ACM Symp. on Principles of Distributed Computing, pp. 51\u201359 (1991)","DOI":"10.1145\/112600.112605"},{"key":"1_CR14","first-page":"426","volume-title":"Theory and Application of Graphs","author":"T.D. Parsons","year":"1976","unstructured":"Parsons, T.D.: Pursuit evasion in a graph. In: Theory and Application of Graphs, pp. 426\u2013441. Springer, Heidelberg (1976)"},{"issue":"4","key":"1_CR15","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication theory of secrecy systems. Bell System Technical Journal\u00a028(4), 656\u2013715 (1949)","journal-title":"Bell System Technical Journal"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11832072_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T19:50:35Z","timestamp":1555789835000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11832072_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540380801","9783540380818"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11832072_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}