{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:18:45Z","timestamp":1725887925859},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596464"},{"type":"electronic","value":"9783319596471"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-59647-1_23","type":"book-chapter","created":{"date-parts":[[2017,5,12]],"date-time":"2017-05-12T22:53:30Z","timestamp":1494629610000},"page":"307-321","source":"Crossref","is-referenced-by-count":2,"title":["Monitorability Bounds via Expander, Sparsifier and Random Walks"],"prefix":"10.1007","author":[{"given":"Shlomi","family":"Dolev","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Khankin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,14]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: Proceedings of the Twentieth Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, NY, USA, pp. 119\u2013128. ACM, New York (2008)","DOI":"10.1145\/1378533.1378557"},{"key":"23_CR2","volume-title":"The Probabilistic Method","author":"N Alon","year":"2004","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method. Wiley, New York (2004)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Altshuler, Y., Dolev, S., Elovici, Y.: TTLed random walks for collaborative monitoring in mobile and social networks. In: Thai, M.T., Pardalos, P.M. (eds.) Handbook of Optimization in Complex Networks. Springer Optimization and Its Applications, vol. 57, pp. 507\u2013538. Springer, New York (2012)","DOI":"10.1007\/978-1-4614-0754-6_17"},{"issue":"1","key":"23_CR4","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s00145-002-0128-6","volume":"16","author":"D Beimel","year":"2002","unstructured":"Beimel, D.: Buses for anonymous message delivery. J. Cryptology 16(1), 25\u201339 (2002)","journal-title":"J. Cryptology"},{"issue":"1","key":"23_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/j.socnet.2004.11.008","volume":"27","author":"SP Borgatti","year":"2005","unstructured":"Borgatti, S.P.: Centrality and network flow. Soc. Netw. 27(1), 55\u201371 (2005)","journal-title":"Soc. Netw."},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Boubendir, A., Bertin, E., Simoni, N.: NaaS architecture through SDN-enabled NFV: network openness towards web communication service providers. In: NOMS 2016\u20132016 IEEE\/IFIP Network Operations and Management Symposium, pp. 722\u2013726 (2016)","DOI":"10.1109\/NOMS.2016.7502885"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Boubendir, A., Bertin, E., Simoni, N.: On-demand dynamic network service deployment over NaaS architecture. In: NOMS 2016\u20132016 IEEE\/IFIP Network Operations and Management Symposium, pp. 1023\u20131024. IEEE (2016)","DOI":"10.1109\/NOMS.2016.7502954"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Broder, A.: Generating random spanning trees. In: 30th Annual Symposium on Foundations of Computer Science 1989, pp. 442\u2013447. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63516"},{"key":"23_CR9","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: unconditional sender and recipient untraceability. J. Cryptology 1, 65\u201375 (1988)","journal-title":"J. Cryptology"},{"issue":"2","key":"23_CR10","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"23_CR11","series-title":"Series in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/cbms\/092","volume-title":"Spectral Graph Theory","author":"F Chung","year":"1996","unstructured":"Chung, F.: Spectral Graph Theory. Series in Mathematics, vol. 92. American Mathematical Society, Washington, DC (1996)"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-40956-4_1","volume-title":"Privacy Enhancing Technologies","author":"G Danezis","year":"2003","unstructured":"Danezis, G.: Mix-networks with restricted routes. In: Dingledine, R. (ed.) PET 2003. LNCS, vol. 2760, pp. 1\u201317. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-40956-4_1"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36467-6_5","volume-title":"Privacy Enhancing Technologies","author":"C D\u00edaz","year":"2003","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 54\u201368. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36467-6_5"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-14527-8_11","volume-title":"Privacy Enhancing Technologies","author":"C Diaz","year":"2010","unstructured":"Diaz, C., Murdoch, S.J., Troncoso, C.: Impact of network topology on anonymity and overhead in low-latency anonymity networks. In: Atallah, M.J., Hopper, N.J. (eds.) PETS 2010. LNCS, vol. 6205, pp. 184\u2013201. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-14527-8_11"},{"issue":"4","key":"23_CR15","doi-asserted-by":"crossref","first-page":"25:1","DOI":"10.1145\/1734213.1734219","volume":"57","author":"S Dolev","year":"2010","unstructured":"Dolev, S., Elovici, Y., Puzis, R.: Routing betweenness centrality. J. ACM 57(4), 25:1\u201325:27 (2010)","journal-title":"J. ACM"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Dolev, S., Khankin, D.: Monitorability bounds via expander, sparsifier and random walks. The interplay between on-demand monitoring and anonymity arXiv:1612.02569 [cs] (2016)","DOI":"10.1007\/978-3-319-59647-1_23"},{"issue":"2","key":"23_CR17","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1145\/354876.354877","volume":"3","author":"S Dolev","year":"2000","unstructured":"Dolev, S., Ostrobsky, R.: Xor-trees for efficient anonymous multicast and reception. ACM Trans. Inf. Syst. Secur. 3(2), 63\u201384 (2000)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Dolev, S., Tzachar, N.: Spanders: distributed spanning expanders. In: Proceedings of the 2010 ACM Symposium on Applied Computing, SAC 2010, NY, USA, pp. 1309\u20131314. ACM, New York (2010)","DOI":"10.1145\/1774088.1774369"},{"issue":"2","key":"23_CR19","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D Dubhashi","year":"1998","unstructured":"Dubhashi, D., Ranjan, D.: Balls and bins: a study in negative dependence. Random Struct. Algorithms 13(2), 99\u2013124 (1998)","journal-title":"Random Struct. Algorithms"},{"issue":"4","key":"23_CR20","doi-asserted-by":"crossref","first-page":"2296","DOI":"10.1109\/COMST.2015.2453434","volume":"17","author":"E Erdin","year":"2015","unstructured":"Erdin, E., Zachor, C., Gunes, M.H.: How to find hidden users: a survey of attacks on anonymity networks. IEEE Commun. Surv. Tutorials 17(4), 2296\u20132316 (2015)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"1","key":"23_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","volume":"40","author":"LC Freeman","year":"1977","unstructured":"Freeman, L.C.: A set of measures of centrality based on betweenness. Sociometry 40(1), 35\u201341 (1977)","journal-title":"Sociometry"},{"issue":"2","key":"23_CR22","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0378-8733(91)90017-N","volume":"13","author":"LC Freeman","year":"1991","unstructured":"Freeman, L.C., Borgatti, S.P., White, D.R.: Centrality in valued graphs: a measure of betweenness based on network flow. Soc. Netw. 13(2), 141\u2013154 (1991)","journal-title":"Soc. Netw."},{"key":"23_CR23","unstructured":"Fundation, O.N: Software-defined networking: the new norm for networks. ONF White Paper (2012)"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Fung, W.S., Hariharan, R., Harvey, N.J., Panigrahi, D.: A general framework for graph sparsification. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, STOC 2011, NY, USA, pp. 71\u201380. ACM, New York (2011)","DOI":"10.1145\/1993636.1993647"},{"issue":"27 Pt 1","key":"23_CR25","doi-asserted-by":"crossref","first-page":"278701","DOI":"10.1103\/PhysRevLett.87.278701","volume":"87","author":"KI Goh","year":"2001","unstructured":"Goh, K.I., Kahng, B., Kim, D.: Universal behavior of load distribution in scale-free networks. Phys. Rev. Lett. 87(27 Pt 1), 278701 (2001)","journal-title":"Phys. Rev. Lett."},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-22670-0_30","volume-title":"Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation","author":"O Goldreich","year":"2011","unstructured":"Goldreich, O.: Basic facts about expander graphs. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation. LNCS, vol. 6650, pp. 451\u2013464. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-22670-0_30"},{"key":"23_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information Hiding","author":"DM Goldschlag","year":"1996","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding routing information. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 137\u2013150. Springer, Heidelberg (1996). doi: 10.1007\/3-540-61996-8_37"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Goyal, N., Rademacher, L., Vempala, S.: Expanders via random spanning trees. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, pp. 576\u2013585. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (2009)","DOI":"10.1137\/1.9781611973068.64"},{"issue":"3","key":"23_CR29","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1007\/s12083-014-0254-6","volume":"8","author":"O Hermoni","year":"2014","unstructured":"Hermoni, O., Gilboa, N., Felstaine, E., Dolev, S.: Rendezvous tunnel for anonymous publishing. Peer-to-Peer Networking Appl. 8(3), 352\u2013366 (2014)","journal-title":"Peer-to-Peer Networking Appl."},{"issue":"4","key":"23_CR30","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(4), 439\u2013561 (2006)","journal-title":"Bull. Am. Math. Soc."},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Motiwala, M., Elmore, M., Feamster, N., Vempala, S.: Path splicing. In: Proceedings of the ACM SIGCOMM 2008 Conference on Data Communication, SIGCOMM 2008, NY, USA, pp. 27\u201338. ACM, New York (2008)","DOI":"10.1145\/1402958.1402963"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44702-4_1","volume-title":"Designing Privacy Enhancing Technologies","author":"A Pfitzmann","year":"2001","unstructured":"Pfitzmann, A., K\u00f6hntopp, M.: Anonymity, unobservability, and pseudonymity \u2014 a proposal for terminology. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, pp. 1\u20139. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44702-4_1"},{"key":"23_CR33","first-page":"H6","volume":"2","author":"SK Rao","year":"2014","unstructured":"Rao, S.K.: SDN and its use-cases-NV and NFV. Network 2, H6 (2014)","journal-title":"Network"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36467-6_4","volume-title":"Privacy Enhancing Technologies","author":"A Serjantov","year":"2003","unstructured":"Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P. (eds.) PET 2002. LNCS, vol. 2482, pp. 41\u201353. Springer, Heidelberg (2003). doi: 10.1007\/3-540-36467-6_4"},{"key":"23_CR35","volume-title":"Topics in Contemporary Probability and Its Applications","author":"JL Snell","year":"1995","unstructured":"Snell, J.L.: Topics in Contemporary Probability and Its Applications. CRC Press, Boca Raton (1995)"},{"key":"23_CR36","doi-asserted-by":"crossref","unstructured":"Troncoso, C., Danezis, G.: The bayesian traffic analysis of mix networks. In: Proceedings of the 16th ACM Conference on Computer and Communications Security, CCS 2009, NY, USA, pp. 369\u2013379. ACM, New York (2009)","DOI":"10.1145\/1653662.1653707"},{"issue":"2","key":"23_CR37","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1137\/0211027","volume":"11","author":"LG Valiant","year":"1982","unstructured":"Valiant, L.G.: A scheme for fast parallel communication. SIAM J. Comput. 11(2), 350\u2013361 (1982)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"23_CR38","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/1042031.1042032","volume":"7","author":"MK Wright","year":"2004","unstructured":"Wright, M.K., Adler, M., Levine, B.N., Shields, C.: The predecessor attack: an analysis of a threat to anonymous communications systems. ACM Trans. Inf. Syst. Secur. 7(4), 489\u2013522 (2004)","journal-title":"ACM Trans. Inf. Syst. Secur."}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59647-1_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,24]],"date-time":"2019-09-24T11:58:11Z","timestamp":1569326291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59647-1_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596464","9783319596471"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59647-1_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}