{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:48:34Z","timestamp":1742384914665},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,1,14]],"date-time":"2011-01-14T00:00:00Z","timestamp":1294963200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s11276-010-0319-2","type":"journal-article","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T01:28:19Z","timestamp":1294882099000},"page":"843-859","source":"Crossref","is-referenced-by-count":8,"title":["AOS: an anonymous overlay system for mobile ad hoc networks"],"prefix":"10.1007","volume":"17","author":[{"given":"Rui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yanchao","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuguang","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,14]]},"reference":[{"key":"319_CR1","unstructured":"Raymond, J.-F. (2000). Traffic analysis: Protocols, attacks, design issues, and open problems. In: International workshop on design issues in anonymity and unobservability (pp. 10\u201329). Berkeley, CA."},{"key":"319_CR2","unstructured":"Jiang, S., Vaidya, N., & Zhao, W. (2001). Prevent traffic analysis in packet radio networks. In: Proceedings of DISCEX II, Anaheim, California."},{"key":"319_CR3","unstructured":"Defense Advanced Research Projects Agency (DARPA). (1998). Research challenges in high confidence networking, White paper, Arlington, VA, July 1998."},{"issue":"2","key":"319_CR4","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D. Chaum","year":"1981","unstructured":"Chaum, D. (1981). Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2), 84\u201390.","journal-title":"Communications of the ACM"},{"issue":"2","key":"319_CR5","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0167-4048(87)90087-3","volume":"6","author":"A. Pfitzmann","year":"1987","unstructured":"Pfitzmann, A., & Waidner, M. (1987). Networks without user observability. Computers & Security, 6(2), 158\u2013166.","journal-title":"Computers & Security"},{"issue":"1","key":"319_CR6","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M. Reiter","year":"1998","unstructured":"Reiter, M., & Rubin, A. (1998). Crowds: Anonymity for web transactions. ACM TISSEC, 1(1):66\u201392.","journal-title":"ACM TISSEC"},{"key":"319_CR7","unstructured":"Pfitzmann, A., & Hansen, M. (2005). Anonymity, unobservability, and pseudonymity: A consolidated proposal for terminology. Draft v0.25, Dec. 2005."},{"key":"319_CR8","unstructured":"Kong, J., & Hong, X. (2003). ANODR: Anonymous on demand routing with untraceable routes for mobile ad-hoc networks. In: ACM MobiHoc\u201903 (pp. 291 \u2013 302). Annapolis, MD."},{"key":"319_CR9","unstructured":"Jiang, S., Vaidya, N. H., & Zhao, W. (2004). A mix route algorithm for mix-net in wireless mobile ad hoc networks. In: MASS\u201904 (pp. 406\u2013415). Fort Lauderdale, FL."},{"key":"319_CR10","unstructured":"Zhu, B., Wan, Z., Kankanhalli, M. S., Bao, F., & Deng, R. H. (2004). Anonymous secure routing in mobile ad-hoc networks. In LCN\u201904 (pp. 102\u2013108). Dublin, Ireland."},{"key":"319_CR11","unstructured":"Wu, X., & Bhargava, B. (2005). AO2P: Ad hoc on-demand position-based private routing protocol. 4(4), 335\u2013348."},{"key":"319_CR12","unstructured":"Zhang, Y., Liu, W., & Lou, W. (2005). Anonymous communications in mobile ad hoc networks. In IEEE INFOCOM\u201905 (pp. 1940\u20131951). Miami, FL."},{"issue":"9","key":"319_CR13","doi-asserted-by":"crossref","first-page":"2376","DOI":"10.1109\/TWC.2006.1687761","volume":"5","author":"Y. Zhang","year":"2006","unstructured":"Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006). MASK: Anonymous on-demand routing in mobile ad hoc networks. IEEE Transactions On Wireless Communications, 5(9), 2376\u20132385.","journal-title":"IEEE Transactions On Wireless Communications"},{"key":"319_CR14","doi-asserted-by":"crossref","unstructured":"Choi, H., McDaniel, P., & La Porta, T. F. (2007). Privacy preserving communication in MANETs. In IEEE SECON\u201907 (pp. 233\u2013242). San Diego, CA.","DOI":"10.1109\/SAHCN.2007.4292835"},{"key":"319_CR15","doi-asserted-by":"crossref","unstructured":"Aad, I., Castelluccia, C., & Hubaux, J.-P. (2006). Packet coding for strong anonymity in ad hoc networks. In SecureComm\u201906, Baltimore, MD.","DOI":"10.1109\/SECCOMW.2006.359571"},{"issue":"1","key":"319_CR16","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/JSAC.2007.070119","volume":"25","author":"C.-C. Chou","year":"2007","unstructured":"Chou, C.-C., Wei, D. S., Kuo, C.-C. J., & Naik, K. (2007). An efficient anonymous communication protocol for peer-to-peer applications over mobile ad-hoc networks. IEEE Journal on Selected Areas in Communications, 25(1), 192\u2013203.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"8","key":"319_CR17","doi-asserted-by":"crossref","first-page":"1536","DOI":"10.1016\/j.adhoc.2009.04.010","volume":"7","author":"Y. Dong","year":"2009","unstructured":"Dong, Y., Chim, T. W., Li, V. O., Yiu, S., & Hui, C. (2009). ARMR: Anonymous routing protocol with multiple routes for communications in mobile ad hoc networks. Ad Hoc Networks, 7(8), 1536\u20131550.","journal-title":"Ad Hoc Networks"},{"key":"319_CR18","unstructured":"El Defrawy, K., & Tsudik, G. (2007). ALARM: Anonymous location-aided routing in suspicious MANETs. In: ICNP\u201907 (pp. 304\u2013313). Beijing, China."},{"key":"319_CR19","doi-asserted-by":"crossref","unstructured":"Kao, J.-C., & Marculescu, R. (2007). Real-time anonymous routing for mobile ad hoc networks. In WCNC\u201907 (pp. 4139\u20134144). Hongkong, China.","DOI":"10.1109\/WCNC.2007.756"},{"key":"319_CR20","doi-asserted-by":"crossref","unstructured":"El Defrawy, K., & Tsudik, G. (2008). PRISM: Privacy-friendly routing in suspicious MANETs (and VANETs). In ICNP\u201908 (pp. 258\u2013267). Orlando, FL.","DOI":"10.1109\/ICNP.2008.4697044"},{"issue":"10","key":"319_CR21","doi-asserted-by":"crossref","first-page":"1297","DOI":"10.1109\/TPDS.2008.28","volume":"19","author":"X. Wu","year":"2008","unstructured":"Wu, X., Liu, J., Hong, X., & Bertino, E. (2008). Anonymous geo-forwarding in MANETs through location cloaking. IEEE Transactions on Parallel and Distributed Systems, 19(10), 1297\u20131309.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"319_CR22","unstructured":"Hu, Y.-C., Perrig, A., & Johnson, D. B. (1986). Packet leashes: A defense against wormhole attacks in wireless ad hoc networks. In IEEE INFOCOM\u201903 (pp. 1976\u20131986). San Francisco, CA."},{"key":"319_CR23","doi-asserted-by":"crossref","unstructured":"Hu, Y.-C., Perrig, A., & Johnson, D. B. (2003). Rushing attacks and defense in wireless ad hoc network routing protocols. In WiSe\u201903 (pp. 30\u201340). San Diego, CA.","DOI":"10.1145\/941311.941317"},{"key":"319_CR24","unstructured":"Hu, Y.-C., Perrig, A., & Johnson, D. B. (2002). Ariadne: A secure on-demand routing protocol for ad hoc networks. In: ACM MobiCom\u201902 (pp. 12\u201323). Atlanta, GA."},{"issue":"1","key":"319_CR25","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S1570-8705(03)00019-2","volume":"1","author":"Y.-C. Hu","year":"2003","unstructured":"Hu, Y.-C., Johnson, D. B., & Perrig, A. (2003). SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks. Ad Hoc Networks, 1(1), 175\u2013192.","journal-title":"Ad Hoc Networks"},{"issue":"3","key":"319_CR26","doi-asserted-by":"crossref","first-page":"598","DOI":"10.1109\/JSAC.2004.842547","volume":"23","author":"K. Sanzgiri","year":"2005","unstructured":"Sanzgiri, K., LaFlamme, D., Dahill, B., Levine, B., Shields, C., & Belding-Royer, E. (2005). Authenticated routing for ad hoc networks. IEEE Journal on Selected Areas in Communications, 23(3), 598\u2013610.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"4","key":"319_CR27","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/49.668972","volume":"16","author":"M. Reed","year":"1998","unstructured":"Reed, M., Syverson, P., & Goldschlag, D. (1998). Anonymous connections and onion routing. IEEE Journal on Selected Areas in Communications, 16(4), 482\u2013494.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"319_CR28","unstructured":"Camenisch J., & Lysyanskaya, A. (2005). A formal treatment of onion routing. In: Advances in Cryptology\u2014CRYPTO 2005 (pp. 169\u2013187). Santa Barbara, California, USA."},{"issue":"5","key":"319_CR29","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s11276-006-6220-3","volume":"13","author":"Y. Zhang","year":"2007","unstructured":"Zhang, Y., Lou, W., & Fang, Y. (2007). A secure incentive protocol for mobile ad hoc networks. Wireless Networks, 13(5): 569\u2013582.","journal-title":"Wireless Networks"},{"issue":"4","key":"319_CR30","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TDSC.2006.58","volume":"3","author":"Y. Zhang","year":"2006","unstructured":"Zhang, Y., Liu, W., Lou, W., & Fang, Y. (2006). Securing mobile ad hoc networks with certificateless public keys. IEEE Transactions on Dependable and Secure Computing, 3(4), 386\u2013399","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"319_CR31","unstructured":"Boneh, D., & Franklin, M. (2001). Identity-based encryption from the weil pairing. In: CRYPTO\u201901, Santa Barbara (pp. 213\u2013229). CA."},{"key":"319_CR32","doi-asserted-by":"crossref","unstructured":"Barreto, P., Kim, H., Bynn, B., & Scott, M. (2002). Efficient algorithms for pairing-based cryptosystems. In CRYPTO\u201902 (pp. 354\u2013368). Santa Barbara, CA.","DOI":"10.1007\/3-540-45708-9_23"},{"key":"319_CR33","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G., & Goldberg, I. (2007). Pairing-based onion routing. In PETS\u201907, Ottawa, Canada.","DOI":"10.1007\/978-3-540-75551-7_7"},{"issue":"4","key":"319_CR34","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/1042031.1042032","volume":"7","author":"M. K. Wright","year":"2004","unstructured":"Wright, M. K., Adler, M., Levine, B. N., & Shields, C. (2004). The predecessor attack: An analysis of a threat to anonymous communications systems. ACM Transactions on Information and System Security, 7(4), 489\u2013522.","journal-title":"ACM Transactions on Information and System Security"},{"key":"319_CR35","doi-asserted-by":"crossref","unstructured":"Danezis, G., Diaz, C., Kasper, E., & Troncoso, C. (2009). The wisdom of Crowds: Attacks and optimal constructions. In ESORICS\u201909, St Malo, France.","DOI":"10.1007\/978-3-642-04444-1_25"},{"key":"319_CR36","doi-asserted-by":"crossref","unstructured":"Scott, M. (2005). Computing the tate pairing. In CT-RSA\u201905 (pp. 293\u2013304). San Francisco, CA.","DOI":"10.1007\/978-3-540-30574-3_20"},{"key":"319_CR37","unstructured":"Serjantov, A., & Danezis, G. (2002). Towards an information theoretic metric for anonymity. In PET\u201902, ser. LNCS vol. 2482, (pp. 41\u201353). Berlin: Springer."},{"key":"319_CR38","volume-title":"Elements of information theory","author":"T. M. Cover","year":"2006","unstructured":"Cover, T. M., & Thomas, J. A. (2006). Elements of information theory (2nd edn.). London: Wiley.","edition":"2"},{"key":"319_CR39","unstructured":"D\u00edaz C., Seys, S., Claessens, J., & Preneel, B. (2002). Towards measuring anonymity. In: PET\u201902, ser. LNCS, vol. 2482. (pp. 54\u201368). Berlin: Springer."}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-010-0319-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-010-0319-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-010-0319-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T16:17:09Z","timestamp":1559924229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-010-0319-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,14]]},"references-count":39,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["319"],"URL":"https:\/\/doi.org\/10.1007\/s11276-010-0319-2","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,14]]}}}