{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:43:58Z","timestamp":1770983038983,"version":"3.50.1"},"reference-count":32,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T00:00:00Z","timestamp":1141171200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,3,1]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>To provide mutual anonymity over traditionally un\u2010anonymous Distributed Hash Tables (DHT) based Peer\u2010to\u2010Peer overlay networks, while maintaining the desired scalability and guaranteed lookup properties of the DHTs.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>Agyaat uses a novel hybrid\u2010overlay design, a fully decentralized topology without any trusted proxies. It anonymizes both the querying and responding peers through the use of unstructured topologies, called <jats:italic>clouds<\/jats:italic>, which are added <jats:italic>onto<\/jats:italic> the structured overlays. In addition, it regulates the cloud topologies to ensure the guaranteed location of data and scalability of routing. A unique characteristic of the design is the ability of users to tradeoff between desired anonymity and performance. The paper presents a thorough performance and anonymity analysis of the system, and also analyzes few anonymity compromising attacks and countermeasures.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>The results indicate that Agyaat is able to provide mutual anonymity while maintaining the scalability of lookups, affecting the costs only by a constant factor.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Research limitations\/implications<\/jats:title><jats:p>While Agyaat is able to meet its mutual anonymity and performance goals, there exist other security vulnerabilities like possible Denial\u2010of\u2010Service (DoS) attacks, both due to its design and the underlying DHT overlay. This is fertile ground for future work.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>Agyaat uses a novel topology architecture and associated protocols that are conducive to providing mutually anonymous services.<\/jats:p><\/jats:sec>","DOI":"10.1108\/10662240610656519","type":"journal-article","created":{"date-parts":[[2006,7,3]],"date-time":"2006-07-03T23:48:36Z","timestamp":1151970516000},"page":"189-212","source":"Crossref","is-referenced-by-count":7,"title":["Agyaat: mutual anonymity over structured P2P networks"],"prefix":"10.1108","volume":"16","author":[{"given":"Aameek","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bugra","family":"Gedik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"key":"key2022020620423038700_b1","doi-asserted-by":"crossref","unstructured":"Castro, M., Druschel, P., Kermarrec, A. and Rowstron, A. (2002), \u201cSCRIBE: A large\u2010scale and decentralized application level multicast infrastructure\u201d, IEEE Journal on Selected Areas in Communication, Vol. 20 No. 8, pp. 1489\u201099.","DOI":"10.1109\/JSAC.2002.803069"},{"key":"key2022020620423038700_b3","doi-asserted-by":"crossref","unstructured":"Chaum, D. (1981), \u201cUntraceable electronic mail return addresses, and digital pseudonyms\u201d, Communications of ACM, Vol. 24 No. 2.","DOI":"10.1145\/358549.358563"},{"key":"key2022020620423038700_b4","doi-asserted-by":"crossref","unstructured":"Clarke, I., Sandberg, O., Wiley, B. and Hong, T. (2001), \u201cFreenet: a distributed anonymous information storage and retrieval system\u201d, Springer Lecture Notes in Computer Science.","DOI":"10.1007\/3-540-44702-4_4"},{"key":"key2022020620423038700_b5","unstructured":"Crespo, A. and Garcia\u2010Molina, H. (2002), \u201cSemantic overlay networks for p2p systems\u201d, Stanford Technical Report, Stanford University, Stanford, CA."},{"key":"key2022020620423038700_b6","doi-asserted-by":"crossref","unstructured":"Freedman, M.J., Sit, E., Cates, J. and Morris, R. (2002), \u201cIntroducing tarzan, a peer\u2010to\u2010peer anonymizing network layer\u201d, International Workshop on Peer\u2010to\u2010Peer Systems, Cambridge, MA, March 7\u20108.","DOI":"10.1007\/3-540-45748-8_12"},{"key":"key2022020620423038700_b7","unstructured":"Freedom (2003), available at: www.freedom.net\/."},{"key":"key2022020620423038700_b8","unstructured":"Ganesan, P., Gummadi, K. and Garcia\u2010Molina, H. (2004), \u201cCanon in G major: designing DHTs with hierarchical structure\u201d, International Conference on Distributed Computing Systems, Tokyo, March 23\u201026."},{"key":"key2022020620423038700_b9","unstructured":"Gnutella (2002), available at: http:\/\/gnutella.wego.com\/."},{"key":"key2022020620423038700_b10","unstructured":"Harvey, N., Jones, M., Saroiu, S., Theimer, M. and Wolman, A. (2003), \u201cSkipnet: a scalable overlay network with practical locality properties\u201d, USENIX Symposium on Internet Technologies and Systems, Seattle, WA, March 26\u201028."},{"key":"key2022020620423038700_b11","unstructured":"Hazel, S. and Wiley, B. (2002), \u201cAchord: a variant of the chord lookup service for use in censorship resistant peer\u2010to\u2010peer publishing systems\u201d, International Workshop on Peer\u2010to\u2010Peer Systems, Cambridge, MA, March 7\u20108."},{"key":"key2022020620423038700_b12","doi-asserted-by":"crossref","unstructured":"Karger, D., Lehman, E., Leighton, T., Panigrahy, R., Levine, M. and Lewin, D. (1997), \u201cConsistent hashing and random trees: distributed caching protocols for relieving hot spots on the world wide web\u201d, Symposium on Theory of Computing, El Paso, TX, May 4\u20106.","DOI":"10.1145\/258533.258660"},{"key":"key2022020620423038700_b13","doi-asserted-by":"crossref","unstructured":"Kazaa (2002), available at: www.kazaa.com\/.","DOI":"10.1145\/504689.504690"},{"key":"key2022020620423038700_b14","unstructured":"O'Donnell, C. and Vaikuntanathan, V. (2004), \u201cInformation leak in the chord lookup protocol\u201d, IEEE International Conference on P2P Computing, Zurich, August 25\u201027."},{"key":"key2022020620423038700_b15","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R. and Shenker, S. (2001), \u201cA scalable content\u2010addressable network\u201d, ACM SIGCOMM, San Diego, CA, August 27\u201031.","DOI":"10.1145\/964723.383072"},{"key":"key2022020620423038700_b17","doi-asserted-by":"crossref","unstructured":"Reiter, M. and Rubin, A. (1998), \u201cCrowds: anonymity for web transactions\u201d, ACM Transactions on Information and System Security, Vol. 1, pp. 66\u201092.","DOI":"10.1145\/290163.290168"},{"key":"key2022020620423038700_b18","doi-asserted-by":"crossref","unstructured":"Rowstron, A. and Druschel, P. (2001), \u201cPastry: scalable, distributed object location and routing for large\u2010scale peer\u2010to\u2010peer systems\u201d, International Conference on Distributed Systems Platforms, Heidelberg, November.","DOI":"10.1007\/3-540-45518-3_18"},{"key":"key2022020620423038700_b19","unstructured":"Scarlata, V., Levine, B. and Shields, C. (2001), \u201cResponder anonymity and anonymous peer\u2010to\u2010peer file sharing\u201d, International Conference on Network Protocols, Riverside, CA, November 11\u201014."},{"key":"key2022020620423038700_b20","unstructured":"Sherwood, R., Battacharjee, B. and Srinivasan, A. (2002), \u201cP5: A protocol for scalable anonymous communication\u201d, IEEE Symposium on Security and Privacy, Oakland, CA, May 12\u201015."},{"key":"key2022020620423038700_b21","unstructured":"Singh, A. and Liu, L. (2004), Agyaat: Providing Mutually Anonymous Services over Structured P2P Networks, GIT\u2010CERCS\u201004\u201012."},{"key":"key2022020620423038700_b22","doi-asserted-by":"crossref","unstructured":"Singh, A., Srivatsa, M., Liu, L. and Miller, T. (2004), \u201cApoidea: a decentralized peer\u2010to\u2010peer architecture for crawling the world wide web\u201d, Springer Lecture Notes in Computer Science 2924.","DOI":"10.1007\/978-3-540-24610-7_10"},{"key":"key2022020620423038700_b23","doi-asserted-by":"crossref","unstructured":"Sit, E. and Morris, R. (2002), \u201cSecurity considerations for peer\u2010to\u2010peer distributed hash tables\u201d, International Workshop on Peer\u2010to\u2010Peer Systems, Cambridge, MA, March 7\u20108.","DOI":"10.1007\/3-540-45748-8_25"},{"key":"key2022020620423038700_b24","doi-asserted-by":"crossref","unstructured":"Stoica, I., Morris, R., Karger, D., Kaashoek, F. and Balakrishnan, H. (2001), \u201cChord: a scalable peer\u2010to\u2010peer lookup service for internet applications\u201d, ACM SIGCOMM, San Diego, CA, August 27\u201031.","DOI":"10.1145\/964723.383071"},{"key":"key2022020620423038700_b25","unstructured":"Syverson, P., Goldschlag, D. and Reed, M. (1997), \u201cAnonymous connections and onion routing\u201d, IEEE Symposium on Security and Privacy, Oakland, CA, pp. 44\u201053."},{"key":"key2022020620423038700_b26","doi-asserted-by":"crossref","unstructured":"Syverson, P., Tsudik, G., Reed, M. and Landwehr, C. (2000), \u201cTowards an analysis of onion routing security\u201d, Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, July 25\u201026.","DOI":"10.21236\/ADA465255"},{"key":"key2022020620423038700_b27","unstructured":"von Ahn, L., Bortz, A. and Hopper, N. (2003), \u201ck\u2010anonymous message transmission\u201d, ACM Conference on Computer and Communications Security, Washington DC, October 27\u201030, pp. 120\u2010130."},{"key":"key2022020620423038700_b28","unstructured":"Wright, M., Adler, M., Levine, B. and Shields, C. (2002), \u201cAn analysis of the degradation of anonymous protocols\u201d, Symposium on Network and Distributed System Security, San Diego, CA, February 6\u20108."},{"key":"key2022020620423038700_b29","doi-asserted-by":"crossref","unstructured":"Xiao, L., Xu, Z. and Zhang, X. (2003), \u201cLow\u2010cost and reliable mutual anonymity protocols in peer\u2010to\u2010peer networks\u201d, Transactions on Parallel & Distributed Systems, Vol. 14 No. 9, pp. 829\u201040.","DOI":"10.1109\/TPDS.2003.1233706"},{"key":"key2022020620423038700_b30","unstructured":"Zhang, Z., Mahalingam, M., Xu, Z. and Tang, W. (2004), \u201cScalable, structured data placement over p2p storage utilities\u201d, International Workshop on Future Trends in Distributed Computing, Suzhou, May 26\u201028."},{"key":"key2022020620423038700_b31","doi-asserted-by":"crossref","unstructured":"Zhao, B., Huang, L., Stribling, J., Rhea, S., Joseph, A. and Kubiatowicz, J. (2004), \u201cTapestry: a resilient global\u2010scale overlay for service deployment\u201d, IEEE Journal on Selected Areas in Communication, Vol. 22 No. 1, pp. 41\u201053.","DOI":"10.1109\/JSAC.2003.818784"},{"key":"key2022020620423038700_b32","doi-asserted-by":"crossref","unstructured":"Zhu, Y. and Hu, Y. (2004), \u201cA novel tunneling approach for anonymity in structured P2P systems\u201d, International Conference on Parallel Processing, Montreal, August 15\u201018.","DOI":"10.1109\/ICPP.2004.1327900"},{"key":"key2022020620423038700_frg1","doi-asserted-by":"crossref","unstructured":"Castro, M., Drushel, P., Ganesh, A., Rowstron, A. and Wallach, D. (2002), \u201cSecure routing for structured peer\u2010to\u2010peer overlay networks\u201d, Symposium on Operating Systems and Implementation, OSDI'02, Boston, MA, December.","DOI":"10.1145\/1060289.1060317"},{"key":"key2022020620423038700_frg2","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Handley, M., Karp, R. and Shenker, S. (2001), \u201cApplication\u2010level multicast using content\u2010addressable networks\u201d, Lecture Notes in Computer Science, 2233.","DOI":"10.1007\/3-540-45546-9_2"}],"container-title":["Internet Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.emeraldinsight.com\/doi\/full-xml\/10.1108\/10662240610656519","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240610656519\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/10662240610656519\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:40:08Z","timestamp":1753400408000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/intr\/article\/16\/2\/189-212\/181239"}},"subtitle":[],"editor":[{"given":"Stefanos","family":"Gritzalis","sequence":"first","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2006,3,1]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,3,1]]}},"alternative-id":["10.1108\/10662240610656519"],"URL":"https:\/\/doi.org\/10.1108\/10662240610656519","relation":{},"ISSN":["1066-2243"],"issn-type":[{"value":"1066-2243","type":"print"}],"subject":[],"published":{"date-parts":[[2006,3,1]]}}}