{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T18:11:25Z","timestamp":1791137485066,"version":"4.1.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319053011","type":"print"},{"value":"9783319053028","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-05302-8_19","type":"book-chapter","created":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T14:31:24Z","timestamp":1395325884000},"page":"306-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A More Realistic Model for Verifying Route Validity in Ad-Hoc Networks"],"prefix":"10.1007","author":[{"given":"Ali","family":"Kassem","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"Lafourcade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yassine","family":"Lakhnech","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,3,21]]},"reference":[{"issue":"9","key":"19_CR1","doi-asserted-by":"publisher","first-page":"2032","DOI":"10.1016\/j.simpat.2011.05.008","volume":"19","author":"TR Andel","year":"2011","unstructured":"Andel, T.R., Back, G., Yasinsac, A.: Automating the security analysis process of secure ad hoc routing protocols. Simul. Model. Pract. Theor. 19(9), 2032\u20132049 (2011)","journal-title":"Simul. Model. Pract. Theor."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"Arnaud, M., Cortier, V., Delaune, S.: Modeling and verifying ad hoc routing protocols. In: CSF, pp. 59\u201374. IEEE Computer Society (2010)","DOI":"10.1109\/CSF.2010.12"},{"key":"19_CR3","doi-asserted-by":"crossref","unstructured":"Avanesov, T., Chevalier, Y., Rusinowitch, M., Turuani, M.: Satisfiability of general intruder constraints with and without a set constructor. CoRR abs\/1103.0220 (2011)","DOI":"10.1109\/CRISIS.2010.5764919"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Buttyn, L., Vajda, I.: Towards provable security for ad hoc routing protocols. In: Proceedings of the ACM Workshop on Security in Ad Hoc and Sensor Networks (SASN), pp. 94\u2013105. ACM Press (2004)","DOI":"10.1145\/1029102.1029119"},{"key":"19_CR5","series-title":"LNCS","first-page":"30","volume-title":"POST 2012","author":"V Cortier","year":"2012","unstructured":"Cortier, V., Degrieck, J., Delaune, S.: Analysing routing protocols: four nodes topologies are sufficient. In: Degano, P., Guttman, J.D. (eds.) POST 2012. LNCS, vol. 7215, pp. 30\u201350. Springer, Heidelberg (2012)"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1109\/JSAC.2005.861394","volume":"24","author":"YC Hu","year":"2006","unstructured":"Hu, Y.C., Perrig, A., Johnson, D.B.: Wormhole attacks in wireless networks. IEEE J. Sel. Areas Commun. 24, 370\u2013380 (2006)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"19_CR7","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Trans. Inf. Theor. 29(2), 198\u2013207 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1\u20132","key":"19_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11276-004-4744-y","volume":"11","author":"YC Hu","year":"2005","unstructured":"Hu, Y.C., Perrig, A., Johnson, D.B.: Aariadne: a secure on-demand routing protocol for ad hoc networks. Wireless Netw. 11(1\u20132), 21\u201338 (2005)","journal-title":"Wireless Netw."},{"key":"19_CR9","first-page":"139","volume-title":"Ad Hoc Networking, Chapter 5","author":"DB Johnson","year":"2001","unstructured":"Johnson, D.B., Maltz, D.A., Broch, J.: Dsr: the dynamic source routing protocol for multi-hop wireless ad hoc networks. In: Perkins, C.E. (ed.) Ad Hoc Networking, Chapter 5, pp. 139\u2013172. Addison-Wesley, Boston (2001)"},{"key":"19_CR10","unstructured":"Kassem, A., Lafourcade, P., Lakhnech, Y.: A more realistic model for verifying route validity in ad-hoc networks. Technical report TR-2013-10, Verimag, September 2013. http:\/\/www-verimag.imag.fr\/TR\/TR-2013-10.pdf"},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lazos, L., Poovendran, R., Meadows, C., Syverson, P., Chang, L.W.: Preventing wormhole attacks on wireless ad hoc networks: a graph theoretic approach. In: IEEE Wireless Communications and Networking Conference WCNC, pp. 1193\u20131199 (2005)","DOI":"10.1109\/WCNC.2005.1424678"},{"issue":"1","key":"19_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2004.05.022","volume":"125","author":"L Mazar\u00e9","year":"2005","unstructured":"Mazar\u00e9, L.: Satisfiability of dolev-yao constraints. Electr. Notes Theor. Comput. Sci. 125(1), 109\u2013124 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2006.08.036","volume":"367","author":"S Nanz","year":"2006","unstructured":"Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theoret. Comput. Sci. 367, 203\u2013227 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"Papadimitratos, P., Haas, Z.: Secure routing for mobile ad hoc networks. In: SCS Communication Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002) (2002)","DOI":"10.1201\/9781420040401.ch31"},{"key":"19_CR15","unstructured":"Sanzgiri, K., Dahill, B., Levine, B.N., Shields, C., Belding-Royer, E.M.: A secure routing protocol for ad hoc networks. In: ICNP, pp. 78\u201389. IEEE Computer Society (2002)"}],"container-title":["Lecture Notes in Computer Science","Foundations and Practice of Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-05302-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:30:18Z","timestamp":1746156618000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-05302-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319053011","9783319053028"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-05302-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"21 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}