{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T06:12:34Z","timestamp":1747807954728},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642294198"},{"type":"electronic","value":"9783642294204"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29420-4_14","type":"book-chapter","created":{"date-parts":[[2012,6,25]],"date-time":"2012-06-25T09:12:33Z","timestamp":1340615553000},"page":"214-229","source":"Crossref","is-referenced-by-count":6,"title":["Diffie-Hellman without Difficulty"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"M\u00f6dersheim","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/32.481513","volume":"22","author":"M. Abadi","year":"1996","unstructured":"Abadi, M., Needham, R.M.: Prudent engineering practice for cryptographic protocols. IEEE Trans. Software Eng.\u00a022(1), 6\u201315 (1996)","journal-title":"IEEE Trans. Software Eng."},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-540-77050-3_31","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"M. Arapinis","year":"2007","unstructured":"Arapinis, M., Duflot, M.: Bounding Messages for Free in Security Protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol.\u00a04855, pp. 376\u2013387. Springer, Heidelberg (2007)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10207-007-0041-y","volume":"6","author":"A. Armando","year":"2007","unstructured":"Armando, A., Compagna, L.: SAT-based Model-Checking for Security Protocols Analysis. Int. J. of Information Security\u00a06(1), 3\u201332 (2007)","journal-title":"Int. J. of Information Security"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10207-004-0055-7","volume":"4","author":"D.A. Basin","year":"2005","unstructured":"Basin, D.A., M\u00f6dersheim, S., Vigan\u00f2, L.: OFMC: A symbolic model checker for security protocols. Int. J. Inf. Sec.\u00a04(3), 181\u2013208 (2005)","journal-title":"Int. J. Inf. Sec."},{"key":"14_CR5","first-page":"82","volume-title":"14th IEEE Computer Security Foundations Workshop (CSFW-14)","author":"B. Blanchet","year":"2001","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14), pp. 82\u201396. IEEE Computer Society, Cape Breton (2001)"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-540-24597-1_11","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"Y. Chevalier","year":"2003","unstructured":"Chevalier, Y., K\u00fcsters, R., Rusinowitch, M., Turuani, M.: Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents. In: Pandya, P.K., Radhakrishnan, J. (eds.) FSTTCS 2003. LNCS, vol.\u00a02914, pp. 124\u2013135. Springer, Heidelberg (2003)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-70545-1_38","volume-title":"Computer Aided Verification","author":"C.J.F. Cremers","year":"2008","unstructured":"Cremers, C.J.F.: The Scyther Tool: Verification, Falsification, and Analysis of Security Protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 414\u2013418. Springer, Heidelberg (2008)"},{"key":"14_CR8","unstructured":"Denker, G., Millen, J.: CAPSL and CIL Language Design. Technical Report SRI-CSL-99-02, SRI (1999)"},{"issue":"6","key":"14_CR9","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"14_CR10","series-title":"LNCS","first-page":"1","volume-title":"FOSAD","author":"S. Escobar","year":"2007","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: Cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD. LNCS, vol.\u00a05705, pp. 1\u201350. Springer, Heidelberg (2007)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Harkins, D., Carrel, D.: The Internet Key Exchange (IKE), IETF, RFC 2409 (1998)","DOI":"10.17487\/rfc2409"},{"issue":"2","key":"14_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.3233\/JCS-2003-11204","volume":"11","author":"J. Heather","year":"2003","unstructured":"Heather, J., Lowe, G., Schneider, S.: How to prevent type flaw attacks on security protocols. Journal of Computer Security\u00a011(2), 217\u2013244 (2003)","journal-title":"Journal of Computer Security"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: Using ProVerif to analyze protocols with Diffie-Hellman exponentiation. In: CSF, pp. 157\u2013171 (2009)","DOI":"10.1109\/CSF.2009.17"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-540-30191-2_21","volume-title":"Information and Communications Security","author":"C. Lynch","year":"2004","unstructured":"Lynch, C., Meadows, C.: Sound Approximations to Diffie-Hellman using Rewrite Rules. In: L\u00f3pez, J., Qing, S., Okamoto, E. (eds.) ICICS 2004. LNCS, vol.\u00a03269, pp. 262\u2013277. Springer, Heidelberg (2004)"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.entcs.2004.05.018","volume":"125","author":"C. Lynch","year":"2005","unstructured":"Lynch, C., Meadows, C.: On the relative soundness of the free algebra model for public key encryption. Electr. Notes Theor. Comput. Sci.\u00a0125(1), 43\u201354 (2005)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"14_CR16","unstructured":"Malladi, S.: Protocol indepedence through disjoint encryption under exclusive-or. In: Proc. Workshop of Foundation of Computer Security and Privacy (FCS-PrivMod) (March 2010)"},{"key":"14_CR17","unstructured":"Millen, J., Muller, F.: Cryptographic Protocol Generation From CAPSL. Technical Report SRI-CSL-01-07, SRI (2001)"},{"issue":"6","key":"14_CR18","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0020-0190(03)00211-4","volume":"86","author":"J.K. Millen","year":"2003","unstructured":"Millen, J.K.: On the freedom of decryption. Inf. Process. Lett.\u00a086(6), 329\u2013333 (2003)","journal-title":"Inf. Process. Lett."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Millen, J.K., Shmatikov, V.: Constraint solving for bounded-process cryptographic protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 166\u2013175 (2001)","DOI":"10.1145\/501983.502007"},{"key":"14_CR20","unstructured":"M\u00f6dersheim, S.: Diffie-Hellman without difficulty (extended version). Technical Report IMM-TR-2011-13, DTU Informatics (2011), \n                  \n                    imm.dtu.dk\/~samo"},{"issue":"299","key":"14_CR21","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1-3","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theor. Comput. Sci.\u00a01-3(299), 451\u2013475 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11805618_21","volume-title":"Term Rewriting and Applications","author":"M. Turuani","year":"2006","unstructured":"Turuani, M.: The CL-Atse Protocol Analyser. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 277\u2013286. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects of Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29420-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:33:11Z","timestamp":1558297991000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29420-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642294198","9783642294204"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29420-4_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}