{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T10:15:46Z","timestamp":1729678546998,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1109\/p2p.2009.5284520","type":"proceedings-article","created":{"date-parts":[[2009,10,12]],"date-time":"2009-10-12T15:42:06Z","timestamp":1255362126000},"page":"21-30","source":"Crossref","is-referenced-by-count":10,"title":["SyMon: Defending large structured P2P systems against Sybil attack"],"prefix":"10.1109","author":[{"given":"B S","family":"Jyothi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janakiram","family":"Dharanipragada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","article-title":"Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems","author":"rowstron","year":"2001","journal-title":"Middleware '01 Proceedings of the if IP\/ACM International Conference on Distributed Systems Platforms Heidelberg"},{"key":"17","article-title":"Controlling the cost of reliability in peer-to-peer overlays","author":"mahajan","year":"2003","journal-title":"IPTPS '03 2nd International Workshop on Peer-to-Peer Systems"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.328"},{"key":"15","article-title":"Pollution in p2p file sharing systems","author":"liang","year":"2005","journal-title":"INFOCOM 2005 24th IEEE International Conference on Computer Communications"},{"key":"16","article-title":"Efficient black-listing and pollution-level estimation in p2p file-sharing systems","author":"liang","year":"2005","journal-title":"The Proceedings of AI-2005"},{"key":"13","article-title":"Client puzzles: A cryptographic countermeasure against connection depletion attacks","author":"juels","year":"1999","journal-title":"ISOC '99 Proceedings of the 1999 ISOC Network and Distributed System Security Symposium"},{"key":"14","article-title":"Second preimages on n-bit hash functions for much less than 2n work","author":"kelsey","year":"2005","journal-title":"Advances in Cryptology-EUROCRYPT'93"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1162\/105864001300122476"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1145\/1315245.1315287"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.808407"},{"key":"20","first-page":"10","article-title":"On the cost of factoring rsa1024","volume":"6","author":"shamir","year":"2003","journal-title":"RSA CryptoBytes"},{"key":"22","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1145\/1278480.1278485","article-title":"side-channel attack pitfalls","author":"tiri","year":"2007","journal-title":"2007 44th ACM\/IEEE Design Automation Conference DAC"},{"key":"23","article-title":"Finding collisions in the full sha-1","author":"wang","year":"2005","journal-title":"CRYPTO'05"},{"key":"24","doi-asserted-by":"crossref","DOI":"10.1145\/1030083.1030117","article-title":"New client puzzle outsourcing techniques for dos resistance","author":"waters","year":"2004","journal-title":"CCS '04 Proceedings of the 11th ACM Conference on Computer and Communications Security"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/1460877.1460888"},{"key":"26","article-title":"Sybillimit: A near-optimal social network defense against sybil attacks","author":"yu","year":"2008","journal-title":"SP '08 Proceedings of the IEEE Symposium on Security and Privacy"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1060289.1060317"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/P2P.2006.10"},{"year":"0","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1080192.1080203"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ARES.2006.45"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jspi.2003.11.015"},{"key":"5","article-title":"Sybilinfer: Detecting sybil nodes using social networks","author":"danezis","year":"2009","journal-title":"NDSS '09 Proceedings of the 16th Annual Network and Distributed System Security Symposium"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1456508.1456518"},{"key":"9","article-title":"Spki certificate theory","volume":"2693","author":"ellison","year":"1999","journal-title":"RFC"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45748-8_24","article-title":"The sybil attack","author":"douceur","year":"2002","journal-title":"IPTPS '01 First Intl Workshop on Peer-to-Peer Systems"}],"event":{"name":"2009 IEEE Ninth International Conference on Peer-to-Peer Computing (P2P)","start":{"date-parts":[[2009,9,9]]},"location":"Seattle, WA, USA","end":{"date-parts":[[2009,9,11]]}},"container-title":["2009 IEEE Ninth International Conference on Peer-to-Peer Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5273785\/5284489\/05284520.pdf?arnumber=5284520","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T20:35:21Z","timestamp":1497818121000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5284520\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/p2p.2009.5284520","relation":{},"subject":[],"published":{"date-parts":[[2009,9]]}}}