{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:34:04Z","timestamp":1758274444285},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1109\/dsn.2010.5545006","type":"proceedings-article","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T16:44:07Z","timestamp":1281458647000},"page":"31-40","source":"Crossref","is-referenced-by-count":5,"title":["Observable non-Sybil quorums construction in one-hop wireless ad hoc networks"],"prefix":"10.1109","author":[{"given":"Diogo","family":"Monica","sequence":"first","affiliation":[]},{"given":"Joao","family":"Leitao","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Rodrigues","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"21f","article-title":"On the use of radio reconf-name tests in wireless ad hoc networks","author":"m\u00f3nica","year":"2009","journal-title":"Proc 3rd WRAITS"},{"key":"ref11","article-title":"Statistically Unique and Cryptographically Verifiable (SUCV) identifiers and addresses","author":"montenegro","year":"2002","journal-title":"NDSS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984660"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s001450010003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.923723"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_10"},{"key":"ref3","first-page":"251","article-title":"The sybil attack","author":"douceur","year":"2002","journal-title":"IPTPS '01"},{"key":"ref6","first-page":"3","article-title":"Sybil-limit: A near-optimal social network defense against sybil attacks","author":"haifeng","year":"2008","journal-title":"S&P'2008"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/215530.215559"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1146381.1146420"},{"journal-title":"Hashcash - a denial of service counter-measure Technical report","year":"2002","author":"back","key":"ref2"},{"key":"ref1","article-title":"Exposing computationally-challenged Byzantine impostors","author":"aspnes","year":"2005","journal-title":"Technical Report YALEU\/DCS\/TR-1332"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"}],"event":{"name":"Networks (DSN)","start":{"date-parts":[[2010,6,28]]},"location":"Chicago, IL, USA","end":{"date-parts":[[2010,7,1]]}},"container-title":["2010 IEEE\/IFIP International Conference on Dependable Systems & Networks (DSN)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5532324\/5544245\/05545006.pdf?arnumber=5545006","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T01:25:09Z","timestamp":1489886709000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5545006\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/dsn.2010.5545006","relation":{},"subject":[],"published":{"date-parts":[[2010,6]]}}}