{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:07:27Z","timestamp":1725894447196},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368295"},{"type":"electronic","value":"9783642368301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36830-1_1","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T14:35:47Z","timestamp":1361198147000},"page":"1-20","source":"Crossref","is-referenced-by-count":4,"title":["Formal Analysis of Privacy for Routing Protocols in Mobile Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"R\u00e9my","family":"Chr\u00e9tien","sequence":"first","affiliation":[]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. 28th Symposium on Principles of Programming Languages, POPL 2001, pp. 104\u2013115. ACM Press (2001)","DOI":"10.1145\/373243.360213"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Gordon, A.: A calculus for cryptographic protocols: The spi calculus. In: Proc. 4th Conference on Computer and Communications Security, CCS 1997, pp. 36\u201347. ACM Press (1997)","DOI":"10.1145\/266420.266432"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: Proc. 23rd Computer Security Foundations Symposium, CSF 2010, pp. 107\u2013121. IEEE Computer Society Press (2010)","DOI":"10.1109\/CSF.2010.15"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Armando, A., Carbone, R., Compagna, L., Cu\u00e9llar, J., Tobarra, M.L.: Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for google apps. In: Proc. of the 6th ACM Workshop on Formal Methods in Security Engineering, FMSE 2008, pp. 1\u201310. ACM (2008)","DOI":"10.1145\/1456396.1456397"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., Basin, D., Boichut, Y., Chevalier, Y., Compagna, L., Cuellar, J., Hankes Drielsma, P., He\u00e1m, P.C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Arnaud, M., Cortier, V., Delaune, S.: Modeling and verifying ad hoc routing protocols. In: Proc. 23rd IEEE Computer Security Foundations Symposium, CSF 2010, pp. 59\u201374. IEEE Computer Society Press (July 2010)","DOI":"10.1109\/CSF.2010.12"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., Hritcu, C., Maffei, M.: Automated verification of remote electronic voting protocols in the applied pi-calculus. IEEE Comp. Soc. Press (2008)","DOI":"10.1109\/CSF.2008.26"},{"key":"1_CR8","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Proc. 14th Computer Security Foundations Workshop, CSFW 2001. IEEE Comp. Soc. Press (2001)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Bruso, M., Chatzikokolakis, K., den Hartog, J.: Formal verification of privacy for RFID systems. In: Proc. 23rd Computer Security Foundations Symposium, CSF 2010, IEEE Computer Society Press (2010)","DOI":"10.1109\/CSF.2010.13"},{"key":"1_CR10","unstructured":"Chr\u00e9tien, R., Delaune, S.: Formal analysis of privacy for routing protocols in mobile ad hoc networks. Research Report LSV-12-21, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, 24 pages (December 2012)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-28641-4_3","volume-title":"Principles of Security and Trust","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.) Principles of Security and Trust. LNCS, vol.\u00a07215, pp. 30\u201350. Springer, Heidelberg (2012)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security\u00a0(4), 435\u2013487 (2008)","DOI":"10.3233\/JCS-2009-0340"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Garcia, F.D., Hasuo, I., Pieters, W., van Rossum, P.: Provable anonymity. In: Proc. ACM Workshop on Formal Methods in Security Engineering, FMSE 2005, pp. 63\u201372. ACM (2005)","DOI":"10.1145\/1103576.1103585"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11276-004-4744-y","volume":"11","author":"Y.-C. Hu","year":"2005","unstructured":"Hu, Y.-C., Perrig, A., Johnson, D.: Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks. Wireless Networks\u00a011, 21\u201338 (2005)","journal-title":"Wireless Networks"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Kong, J., Hong, X.: ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks. In: Proc. 4th ACM Interational Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2003. ACM (2003)","DOI":"10.1145\/778445.778449"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-540-30108-0_7","volume-title":"Computer Security \u2013 ESORICS 2004","author":"S. Mauw","year":"2004","unstructured":"Mauw, S., Verschuren, J.H.S., de Vink, E.P.: A Formalization of Anonymity and Onion Routing. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 109\u2013124. Springer, Heidelberg (2004)"},{"issue":"1","key":"1_CR17","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. Theoretical Computer Science\u00a0367(1), 203\u2013227 (2006)","journal-title":"Theoretical Computer Science"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Papadimitratos, P., Haas, Z.: Secure routing for mobile ad hoc networks. In: Proc. SCS Communication Networks and Distributed Systems Modelling Simulation Conference, CNDS (2002)","DOI":"10.1201\/9781420040401.ch31"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36467-6_4","volume-title":"Privacy Enhancing Technologies","author":"A. Serjantov","year":"2003","unstructured":"Serjantov, A., Danezis, G.: Towards an Information Theoretic Metric for Anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 41\u201353. Springer, Heidelberg (2003)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Song, R., Korba, L., Lee, G.: AnonDSR: Efficient anonymous dynamic source routing for mobile ad-hoc networks. In: Proc. ACM Workshop on Security of Ad Hoc and Sensor Networks, SASN 2005. ACM (2005)","DOI":"10.1145\/1102219.1102226"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Zapata, M.G., Asokan, N.: Securing ad hoc routing protocols. In: Proc. 1st ACM Workshop on Wireless SEcurity, WiSE 2002, pp. 1\u201310. ACM (2002)","DOI":"10.1145\/570681.570682"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36830-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,8]],"date-time":"2022-02-08T17:07:31Z","timestamp":1644340051000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36830-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368295","9783642368301"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36830-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}