{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:11:30Z","timestamp":1725563490435},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_33","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"359-373","source":"Crossref","is-referenced-by-count":2,"title":["Trusted Computing for Fault-Prone Wireless Networks"],"prefix":"10.1007","author":[{"given":"Seth","family":"Gilbert","sequence":"first","affiliation":[]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Alistarh, D., Gilbert, S., Guerraoui, R., Milosevic, Z., Newport, C.: Securing your every bit: Reliable broadcast in byzantine wireless networks. In: Proceedings of the Symp. on Parallel Algorithms and Architectures (SPAA). pp. 50\u201359 (2010)","DOI":"10.1145\/1810479.1810489"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Richa, A.W., Scheideler, C.: A jamming-resistant mac protocol for single-hop wireless networks. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 45\u201354 (2008)","DOI":"10.1145\/1400751.1400759"},{"issue":"1","key":"33_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization. J. of Computer and System Sciences 45(1), 104\u2013126 (1992)","journal-title":"J. of Computer and System Sciences"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 138\u2013147 (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network: A simplified characterization. Tech. rep., U. of Illinois at Urbana-Champaign (2005)","DOI":"10.1145\/1073814.1073841"},{"issue":"5","key":"33_CR6","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539703428002","volume":"34","author":"A.D. Bonis","year":"2005","unstructured":"Bonis, A.D., Gasieniec, L., Vaccaro, U.: Optimal two-stage algorithms for group testing problems. SIAM J. on Computing 34(5), 1253\u20131270 (2005)","journal-title":"SIAM J. on Computing"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D.R., Shvartsman, A.A.: Collective asynchronous reading with polylogarithmic worst-case overhead. In: Proceedings of the Symp. on Theory of Computing (STOC). pp. 321\u2013330 (2004)","DOI":"10.1145\/1007352.1007406"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Lingas, A.: The do-all problem in broadcast networks. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 117\u2013127 (2001)","DOI":"10.1145\/383962.384000"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/3-540-36136-7_29","volume-title":"Algorithms and Computation","author":"A. Clementi","year":"2002","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Optimal f-reliable protocols for the do-all problem on single-hop wireless networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 320\u2013331. Springer, Heidelberg (2002)"},{"issue":"1","key":"33_CR10","first-page":"89","volume":"64","author":"A. Clementi","year":"2004","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. JPDC 64(1), 89\u201396 (2004)","journal-title":"JPDC"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the twelfth annual ACM-SIAM Symp. on Discrete algorithms. pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-75142-7_18","volume-title":"Distributed Computing","author":"S. Dolev","year":"2007","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Gossiping in a multi-channel radio network: An oblivious approach to coping with malicious interference. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 208\u2013222. Springer, Heidelberg (2007)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.: Secure communication over radio channels. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 105\u2013114 (2008)","DOI":"10.1145\/1400751.1400767"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Kowalski, D.R., Newport, C., Kuhn, F., Lynch, N.: Reliable Distributed Computing on Unreliable Radio Channels. In: MobiHoc S 3 Workshop (2009)","DOI":"10.1145\/1540358.1540360"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Kuhn, F., Newport, C.: The Wireless Synchronization Problem. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 190\u2013199 (2009)","DOI":"10.1145\/1582716.1582749"},{"key":"33_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/11945529_16","volume-title":"Principles of Distributed Systems","author":"S. Gilbert","year":"2006","unstructured":"Gilbert, S., Guerraoui, R., Newport, C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. In: Shvartsman, M.M.A.A. (ed.) OPODIS 2006. LNCS, vol.\u00a04305, pp. 215\u2013229. Springer, Heidelberg (2006)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Gilbert, S., Guerraoui, R., Kowalski, D., Newport, C.: Interference-Resilient Information Exchange. In: INFOCOM. pp. 2249\u20132257 (2009)","DOI":"10.1109\/INFCOM.2009.5062150"},{"key":"33_CR18","doi-asserted-by":"crossref","unstructured":"Goussevskaia, O., Moscibroda, T., Wattenhofer, R.: Local broadcasting in the physical interference model. In: DIALM-POMC. pp. 35\u201344 (2008)","DOI":"10.1145\/1400863.1400873"},{"key":"33_CR19","doi-asserted-by":"crossref","unstructured":"Komlos, J., Greenberg, A.: An asymptotically fast non-adaptive algorithm for conflict resolution in multiple access channels. IEEE Trans. on Information Theory pp. 302\u2013306 (1985)","DOI":"10.1109\/TIT.1985.1057020"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 275\u2013282 (2004)","DOI":"10.1145\/1011767.1011807"},{"key":"33_CR21","doi-asserted-by":"crossref","unstructured":"Koo, C.Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: The bounded collision case. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 258\u2013264 (2006)","DOI":"10.1145\/1146381.1146420"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC). pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"issue":"3","key":"33_CR23","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.tcs.2004.04.017","volume":"333","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science 333(3), 355\u2013371 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"33_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. J. of Algorithms 39(1), 47\u201367 (2001)","journal-title":"J. of Algorithms"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Kuhn, F., Lynch, N., Newport, C., Oshman, R., Richa, A.: Broadcasting in radio networks with unreliable communication. In: Proceedings of the Symp. on Principles of Distributed Computing (PODC) (2010)","DOI":"10.1145\/1835698.1835779"},{"key":"33_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-02085-8_1","volume-title":"Distributed Computing in Sensor Systems","author":"D. Meier","year":"2009","unstructured":"Meier, D., Pignolet, Y.A., Schmid, S., Wattenhofer, R.: Speed Dating Despite Jammers. In: Proceedings of the International Conference on Distributed Computing in Sensor Systems (DCOSS). pp. 1\u201314 (2009)"},{"key":"33_CR27","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: The complexity of connectivity in wireless networks. In: INFOCOM (2006)","DOI":"10.1109\/INFOCOM.2006.23"},{"key":"33_CR28","unstructured":"Newport, C.: Distributed Computation on Unreliable Radio Channels. Ph.D. thesis, MIT (2009)"},{"key":"33_CR29","volume-title":"Trusted computing platforms: TCPA technology in context","author":"S. Pearson","year":"2002","unstructured":"Pearson, S., Balacheff, B.: Trusted computing platforms: TCPA technology in context. Prentice Hall (2002)"},{"key":"33_CR30","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1137\/0216066","volume":"16","author":"N. Pippenger","year":"1987","unstructured":"Pippenger, N.: Sorting and selecting in rounds. SIAM J. of Computing\u00a016, 1032\u20131038 (1987)","journal-title":"SIAM J. of Computing"},{"key":"33_CR31","doi-asserted-by":"crossref","unstructured":"Strasser, M., P\u00f6pper, C., Capkun, S.: Efficient Uncoordinated FHSS Anti-jamming Communication. In: Proceedings International Symp. on Mobile Ad Hoc Networking and Computing (MOBIHOC). pp. 207\u2013218 (2009)","DOI":"10.1145\/1530748.1530778"},{"key":"33_CR32","doi-asserted-by":"crossref","unstructured":"Strasser, M., P\u00f6pper, C., Capkun, S., Cagalj, M.: Jamming-resistant Key Establishment using Uncoordinated Frequency Hopping. In: Proceedings of the Symp. on Security and Privacy. pp. 64\u201378 (2008)","DOI":"10.1109\/SP.2008.9"},{"key":"33_CR33","unstructured":"Trusted Computing Group: Trusted platform module (tpm) specifications, http:\/\/www.trustedcomputinggroup.org\/resources\/tpm_main_specification"},{"issue":"2","key":"33_CR34","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. of Computing 15(2), 468\u2013477 (1986)","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:39:47Z","timestamp":1606185587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}