{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:40:02Z","timestamp":1736084402997,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602743"},{"type":"electronic","value":"9783540447832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022145","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:19:52Z","timestamp":1131862792000},"page":"160-167","source":"Crossref","is-referenced-by-count":1,"title":["Distributed protocols against mobile eavesdroppers"],"prefix":"10.1007","author":[{"given":"P.","family":"Spirakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Tampakas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Antonopoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, C. Rackoff, \u201cRandom walks, universal traversal sequences and the complexity of maze problems\u201d, 20th ACM FOCS, pp. 218\u2013223.","key":"11_CR1","DOI":"10.1109\/SFCS.1979.34"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1002\/rsa.3240010303","volume":"3","author":"G. Brightwell","year":"1990","unstructured":"G. Brightwell and P. Winkler, \u201cMaximum hitting time for random walks on graphs\u201d, J. Random Structures and Algorithms, No. 3 (1990), pp. 263\u2013276.","journal-title":"J. Random Structures and Algorithms"},{"doi-asserted-by":"crossref","unstructured":"M. Franklin, Z. Galil and M. Yung, \u201cEavesdropping Games: A Graph-Theoretic Approach to Privacy in Distributed Systems\u201d, ACM FOCS 1993, 670\u2013679.","key":"11_CR3","DOI":"10.1109\/SFCS.1993.366820"},{"doi-asserted-by":"crossref","unstructured":"D. Gillman, A Chernoff bound for random walks on expander graphs\u201d, ACM FOCS 93, pp. 680\u2013691.","key":"11_CR4","DOI":"10.1109\/SFCS.1993.366819"},{"doi-asserted-by":"crossref","unstructured":"G. Kortsarz, D. Peleg, \u201c On Choosing a Dense Subgraph\u201d ACM FOCS 93, pp. 692\u2013701.","key":"11_CR5","DOI":"10.1109\/SFCS.1993.366818"},{"key":"11_CR6","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/42267.42268","volume":"35","author":"N. Megiddo","year":"1988","unstructured":"N. Megiddo, S. Hakimi, M. Garey, D. Johnson and C. Papadimitriou, \u201cThe Complexity of Searching a Graph\u201d, J ACM 35 (1988), 18\u201344.","journal-title":"J ACM"},{"doi-asserted-by":"crossref","unstructured":"R. Ostrovsky and M. Yung, \u201cRobust Computation in the presence of mobile viruses\u201d, ACM PODC 1991, 51\u201359.","key":"11_CR7","DOI":"10.1145\/112600.112605"},{"key":"11_CR8","first-page":"288","volume":"11","author":"J.H. Reif","year":"1979","unstructured":"J.H. Reif, \u201cUniversal Games of Incomplete Information\u201d, ACM STOC 11 (1979) pp. 288\u2013308.","journal-title":"ACM STOC"},{"unstructured":"CEC RACE II Programme SECURENET (R 2057) \u201cNetwork Security and Protection\u201d, Final Report, 1992.","key":"11_CR9"},{"unstructured":"P.Spirakis and B. Tampakas, \u201cDistributed Pursuit-Evation: Some aspects of Privacy and Security in Distributed Computing\u201d, short paper, ACM PODC 94.","key":"11_CR10"},{"doi-asserted-by":"crossref","unstructured":"P. Tetali and P. Winkler, \u201c On a Random Walk problem arising in Self-stabilizing Token Management\u201d, ACM PODC 91, pp. 273\u2013280.","key":"11_CR11","DOI":"10.1145\/112600.112623"}],"container-title":["Lecture Notes in Computer Science","Distributed Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:01:26Z","timestamp":1736082086000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602743","9783540447832"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0022145","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}