{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,3]],"date-time":"2026-05-03T02:35:38Z","timestamp":1777775738886,"version":"3.51.4"},"reference-count":44,"publisher":"Emerald","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,8,24]]},"abstract":"<jats:p>The design of secure protocols for wireless ad-hoc networks is an important problem in communication systems research. A seemingly fundamental limitation of the design process is that any new protocol only addresses the vulnerabilities detected in its predecessors, leaving the remaining vulnerabilities unaffected. Hence, the design process amounts to an arms race between more sophisticated attacks and protocol fixes. To change this situation, a framework is needed for secure protocol design that offers provable performance and security guarantees against all possible attacks on the network.<\/jats:p>\n                  <jats:p>This monograph proposes such a framework, contingent on some underlying model assumptions. The framework consists of a game defined between protocols and adversarial strategies in which the adversarial strategy is selected after the protocol has been revealed to all of the nodes. Each choice of protocol and adversarial strategy results in a payoff that corresponds to the functionality retained by the network, despite the adversarial activity. The design imperative is to choose the protocol that maximizes this payoff.<\/jats:p>\n                  <jats:p>Two scenarios are considered: networks in which the nodes are initially synchronized and unsynchronized respectively. In each scenario, a protocol is described and three results are proved. First, the protocol is max-min optimal with respect to the payoff. The max-min payoff is the best that can be achieved because the protocol is always known to the adversarial nodes before the adversarial strategy is chosen. Second, the protocol is min-max optimal; there is a Nash equilibrium in the space of protocols and adversarial strategies. By implication, the adversarial nodes gain no strategic advantage from knowing protocol a priori. Finally, the adversarial nodes are effectively confined to one of two behavior modes: either jam or conform to the protocol, neither of which can be prevented by any protocol.<\/jats:p>","DOI":"10.1561\/1300000037","type":"journal-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T03:59:01Z","timestamp":1440388741000},"page":"1-105","source":"Crossref","is-referenced-by-count":8,"title":["A Clean Slate Approach to Secure Wireless Networking"],"prefix":"10.1108","volume":"9","author":[{"given":"Jonathan","family":"Ponniah","sequence":"first","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yih-Chun","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Illionis at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. R.","family":"Kumar","sequence":"additional","affiliation":[{"name":"Texas A&M University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2015,8,24]]},"reference":[{"key":"2026032900520875000_ref001","first-page":"34","article-title":"Feasibility of a serverless distributed file system deployed on an existing set of desktop pcs","author":"Bolosky","year":"2000"},{"key":"2026032900520875000_ref002","first-page":"173","article-title":"Practical byzantine fault tolerance","author":"Castro","year":"1999"},{"issue":"2","key":"2026032900520875000_ref003","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","article-title":"Untraceable electronic mail, return addresses, and digital pseudonyms","volume":"24","author":"Chaum","year":"1981","journal-title":"Commun. ACM"},{"key":"2026032900520875000_ref004","first-page":"90","article-title":"An efficient message authentication scheme for link state routing","author":"Cheung","year":"1997"},{"issue":"6","key":"2026032900520875000_ref005","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1145\/293347.293350","article-title":"Private information retrieval","volume":"45","author":"Chor","year":"1998","journal-title":"J. ACM"},{"key":"2026032900520875000_ref006","doi-asserted-by":"crossref","first-page":"370","DOI":"10.1109\/JSAC.2005.861394","article-title":"Wormhole attacks in wireless networks","volume":"24","author":"Hu","year":"2006","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032900520875000_ref007","first-page":"46","article-title":"Freenet: A distributed anonymous information storage and retrieval system","author":"Clarke","year":"2001"},{"key":"2026032900520875000_ref008","first-page":"202","article-title":"Wide-area cooperative storage with cfs","author":"Dabek","year":"2001"},{"key":"2026032900520875000_ref009","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44702-4_5","article-title":"The Free Haven Project: Distributed Anonymous Storage Service","author":"Dingledine","year":"2001"},{"key":"2026032900520875000_ref010","first-page":"504","article-title":"On the possibility and impossibility of achieving clock synchronization","author":"Dolev","year":"1984"},{"issue":"4","key":"2026032900520875000_ref011","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00446-005-0135-6","article-title":"Gradient clock synchronization","volume":"18","author":"Fan","year":"2006","journal-title":"Distrib. Comput."},{"issue":"6","key":"2026032900520875000_ref012","doi-asserted-by":"crossref","first-page":"1352","DOI":"10.1109\/TAC.2010.2089210","article-title":"Fundamental limits on synchronizing clocks over networks","volume":"56","author":"Freris","year":"2011","journal-title":"IEEE Trans. Automat. Contr."},{"key":"2026032900520875000_ref013","first-page":"200","article-title":"A random server model for private information retrieval or how to achieve information theoretic pir avoiding database replication","author":"Gertner","year":"1998"},{"key":"2026032900520875000_ref014","first-page":"147","volume-title":"ADL","author":"Goldberg","year":"1998"},{"key":"2026032900520875000_ref015","first-page":"74","article-title":"The swarm scalable storage system","author":"Hartman","year":"1999"},{"key":"2026032900520875000_ref016","first-page":"93","article-title":"Reducing the cost of security in link-state routing","author":"Hauser","year":"1997"},{"key":"2026032900520875000_ref017","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2385","article-title":"Protection of bgp sessions via the tcp md5 signature option","author":"Heffernan","year":"1998"},{"key":"2026032900520875000_ref018","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S1570-8705(03)00019-2","article-title":"Sead: secure efficient distance vector routing for mobile wireless ad hoc networks","volume":"1","author":"Hu","year":"2003","journal-title":"Ad Hoc Networks"},{"key":"2026032900520875000_ref019","first-page":"30","article-title":"Rushing attacks and defense in wireless ad hoc network routing protocols","author":"Hu","year":"2003"},{"issue":"1-2","key":"2026032900520875000_ref020","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11276-004-4744-y","article-title":"Ariadne: A secure on-demand routing protocol for ad hoc networks","volume":"11","author":"Hu","year":"2005","journal-title":"Wireless Networks"},{"key":"2026032900520875000_ref021","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/49.839934","article-title":"Secure border gateway protocol (s-bgp","volume":"18","author":"Kent","year":"2000","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"2026032900520875000_ref022","first-page":"430","article-title":"Optimal gradient clock synchronization in dynamic networks","author":"Kuhn","year":"2010"},{"issue":"2","key":"2026032900520875000_ref023","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1145\/153949.153953","article-title":"Integration of security in network routing protocols","volume":"11","author":"Kumar","year":"1993","journal-title":"SIGSAC Rev."},{"key":"2026032900520875000_ref024","first-page":"68","article-title":"Byzantine clock synchronization","author":"Lamport","year":"1984"},{"issue":"3","key":"2026032900520875000_ref025","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1145\/357172.357176","article-title":"The byzantine generals problem","volume":"4","author":"Lamport","year":"1982","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2026032900520875000_ref026","first-page":"509","article-title":"Clock synchronization with bounded global and local skew","author":"Lenzen","year":"2008"},{"key":"2026032900520875000_ref027","first-page":"520","article-title":"Oblivious gradient clock synchronization","author":"Locher","year":"2006"},{"issue":"2\/3","key":"2026032900520875000_ref028","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(84)80033-9","article-title":"An upper and lower bound for clock synchronization","volume":"62","author":"Lundelius","year":"1984","journal-title":"Information and Control"},{"key":"2026032900520875000_ref029","first-page":"255","article-title":"Mitigating routing misbehavior in mobile ad hoc networks","author":"Marti","year":"2000"},{"key":"2026032900520875000_ref030","volume-title":"Interconnections: Bridges and Routers","author":"Perlman","year":"1992"},{"key":"2026032900520875000_ref031","article-title":"The tesla broadcast authentication protocol","volume":"5","author":"Perrig","year":"2002","journal-title":"RSA CryptoBytes"},{"issue":"5","key":"2026032900520875000_ref032","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1023\/A:1016598314198","article-title":"Spins: Security protocols for sensor networks","volume":"8","author":"Perrig","year":"2002","journal-title":"Wirel. Netw."},{"key":"2026032900520875000_ref033","article-title":"A system-theoretic clean slate approach to provably secure ad hoc wireless networking","author":"Ponniah","journal-title":"IEEE Transactions on Control of Network Systems"},{"issue":"1","key":"2026032900520875000_ref034","doi-asserted-by":"crossref","first-page":"41","DOI":"10.4310\/CIS.2012.v12.n1.a3","article-title":"An orthogonal multiple access coding scheme","volume":"12","author":"Ponniah","year":"2012","journal-title":"Communications in Information and Systems"},{"issue":"2","key":"2026032900520875000_ref035","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/293411.293778","article-title":"Anonymous web transactions with crowds","volume":"42","author":"Reiter","year":"1999","journal-title":"Commun. ACM"},{"key":"2026032900520875000_ref036","first-page":"1","article-title":"Secure topology discovery through network-wide clock synchronization","author":"Robles","year":"2010"},{"key":"2026032900520875000_ref037","first-page":"188","article-title":"Storage management and caching in past, a large-scale, persistent peer-to-peer storage utility","author":"Rowstron","year":"2001"},{"key":"2026032900520875000_ref038","first-page":"78","article-title":"A secure routing protocol for ad hoc networks","author":"Sanzgiri","year":"2002"},{"key":"2026032900520875000_ref039","first-page":"85","article-title":"Securing distancevector routing protocols","author":"Smith","year":"1997"},{"key":"2026032900520875000_ref040","first-page":"5","article-title":"Publius: A robust, tamper-evident, censorship-resistant web publishing system","author":"Waldman","year":"2000"},{"issue":"8","key":"2026032900520875000_ref041","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/2.863969","article-title":"Survivable information storage systems","volume":"33","author":"Wylie","year":"2000","journal-title":"Computer"},{"issue":"3","key":"2026032900520875000_ref042","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1145\/581291.581312","article-title":"Secure ad hoc on-demand distance vector routing","volume":"6","author":"Zapata","year":"2002","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"key":"2026032900520875000_ref043","article-title":"Efficient protocols for signing routing messages","author":"Zhang","year":"1998"},{"issue":"6","key":"2026032900520875000_ref044","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/65.806983","article-title":"Securing ad hoc networks","volume":"13","author":"Zhou","year":"1999","journal-title":"Network, IEEE"}],"container-title":["Foundations and Trends\u00ae in Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/9\/1\/1\/11156054\/1300000037en.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/www.emerald.com\/ftnet\/article-pdf\/9\/1\/1\/11156054\/1300000037en.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T18:13:45Z","timestamp":1777486425000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.emerald.com\/ftnet\/article\/9\/1\/1\/1332429\/A-Clean-Slate-Approach-to-Secure-Wireless"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,24]]},"references-count":44,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,8,24]]}},"URL":"https:\/\/doi.org\/10.1561\/1300000037","relation":{},"ISSN":["1554-057X","1554-0588"],"issn-type":[{"value":"1554-057X","type":"print"},{"value":"1554-0588","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,24]]}}}