{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:47:50Z","timestamp":1725544070591},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540330455"},{"type":"electronic","value":"9783540330462"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11690634_27","type":"book-chapter","created":{"date-parts":[[2006,3,28]],"date-time":"2006-03-28T09:15:28Z","timestamp":1143537328000},"page":"398-412","source":"Crossref","is-referenced-by-count":24,"title":["Guessing Attacks and the Computational Soundness of Static Equivalence"],"prefix":"10.1007","author":[{"given":"Mart\u00edn","family":"Abadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Baudet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bogdan","family":"Warinschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Baudet, M., Warinschi, B.: Guessing attack and the computational soundness of static equivalence (extended version) (manuscript 2006)","DOI":"10.1007\/11690634_27"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-540-27836-8_7","volume-title":"Automata, Languages and Programming","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 46\u201358. Springer, Heidelberg (2004)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under (many more) equational theories. In: Proc. 18th IEEE Computer Security Foundations Workshop (CSFW 2005), pp. 62\u201376 (2005)","DOI":"10.1109\/CSFW.2005.14"},{"key":"27_CR4","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115 (2001)","DOI":"10.1145\/360204.360213"},{"issue":"4","key":"27_CR5","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nordic Journal of Computing\u00a05(4), 267\u2013303 (1998)","journal-title":"Nordic Journal of Computing"},{"issue":"2","key":"27_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (The computational soundness of formal encryption). Journal of Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"Journal of Cryptology"},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"664","DOI":"10.1007\/11523468_54","volume-title":"Automata, Languages and Programming","author":"M. Abadi","year":"2005","unstructured":"Abadi, M., Warinschi, B.: Password-based encryption analyzed. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 664\u2013676. Springer, Heidelberg (2005)"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Proc. 10th ACM Conference on Computer and Communications Security (CCS 2003), pp. 220\u2013330 (2003)","DOI":"10.1145\/948109.948140"},{"key":"27_CR9","unstructured":"Bana, G.: Soundness and completeness of formal logics of symmetric encryption. PhD thesis, University of Pensilvania (2004)"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proc. 12th ACM Conference on Computer and Communications Security (CCS 2005), Alexandria, Virginia, USA, November 2005, pp. 16\u201325 (2005)","DOI":"10.1145\/1102120.1102125"},{"key":"27_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1007\/11523468_53","volume-title":"Automata, Languages and Programming","author":"M. Baudet","year":"2005","unstructured":"Baudet, M., Cortier, V., Kremer, S.: Computationally sound implementations of equational theories against passive adversaries. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 652\u2013663. Springer, Heidelberg (2005)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-45539-6_11","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Pointcheval, D., Rogaway, P.: Authenticated key exchange secure against dictionary attacks. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 139\u2013155. Springer, Heidelberg (2000)"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merritt, M.: Encrypted key exchange: Password-based protocols secure against dictionary attacks. In: Proc. 1992 IEEE Symposium on Security and Privacy (SSP 1992), pp. 72\u201384 (1992)","DOI":"10.1109\/RISP.1992.213269"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. In: Proc. 20th IEEE Symposium on Logic in Computer Science (LICS 2005), pp. 331\u2013340 (2005)","DOI":"10.1109\/LICS.2005.8"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Boreale, M., De Nicola, R., Pugliese, R.: Proof techniques for cryptographic processes. In: Proc. 14th IEEE Symposium on Logic in Computer Science (LICS 1999), pp. 157\u2013166 (1999)","DOI":"10.1109\/LICS.1999.782608"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-45539-6_12","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Boyko","year":"2000","unstructured":"Boyko, V., MacKenzie, P., Patel, S.: Provably secure password-authenticated key exchange using Diffie-Hellman. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 156\u2013171. Springer, Heidelberg (2000)"},{"key":"27_CR17","unstructured":"Corin, R., Doumen, J.M., Etalle, S.: Analysing password protocol security against off-line dictionary attacks. Technical report TR-CTIT-03-52, Centre for Telematics and Information Technology, Univ. of Twente, The Netherlands (2003)"},{"key":"27_CR18","unstructured":"Corin, R., Malladi, S., Alves-Foss, J., Etalle, S.: Guess what? Here is a new tool that finds some new guessing attacks (extended abstract). In: IFIP WG 1.7 and ACM SIGPLAN Workshop on Issues in the Theory of Security (WITS 2003), pp. 62\u201371 (2003)"},{"key":"27_CR19","doi-asserted-by":"crossref","unstructured":"Delaune, S., Jacquemard, F.: A theory of dictionary attacks and its complexity. In: Proc. 17th IEEE Computer Security Foundations Workshop (CSFW 2004), pp. 2\u201315 (2004)","DOI":"10.1109\/CSFW.2004.1310728"},{"key":"27_CR20","unstructured":"Fournet, C.: Private communication (2002)"},{"key":"27_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/3-540-39200-9_33","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Lindell, Y.: A framework for password-based authenticated key exchange. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 524\u2013543. Springer, Heidelberg (2003)"},{"key":"27_CR22","series-title":"Lecture Notes in Computer Science","first-page":"403","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O., Lindell, Y.: Session key generation using human passwords only. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 403\u2013432. Springer, Heidelberg (2001)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Gong, L.: Verifiable-text attacks in cryptographic protocols. In: Proc. 9th IEEE Conference on Computer Communications (INFOCOM 1990), pp. 686\u2013693 (1990)","DOI":"10.1109\/INFCOM.1990.91310"},{"issue":"5","key":"27_CR24","doi-asserted-by":"publisher","first-page":"648","DOI":"10.1109\/49.223865","volume":"11","author":"L. Gong","year":"1993","unstructured":"Gong, L., Lomas, T.M.A., Needham, R.M., Saltzer, J.H.: Protecting poorly chosen secrets from guessing attacks. IEEE Journal on Selected Areas in Communications\u00a011(5), 648\u2013656 (1993)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"27_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/3-540-44987-6_29","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Katz","year":"2001","unstructured":"Katz, J., Ostrovsky, R., Yung, M.: Practical password-authenticated key exchange provably secure under standard assumptions. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 475\u2013494. Springer, Heidelberg (2001)"},{"key":"27_CR26","doi-asserted-by":"crossref","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: Proc. 2004 IEEE Symposium on Security and Privacy (SSP 2004), pp. 71\u201385 (2004)","DOI":"10.1109\/SECPRI.2004.1301316"},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"83","DOI":"10.3233\/JCS-2004-12104","volume":"12","author":"G. Lowe","year":"2004","unstructured":"Lowe, G.: Analysing protocols subject to guessing attacks. Journal of Computer Security\u00a012(1), 83\u201398 (2004)","journal-title":"Journal of Computer Security"},{"issue":"1","key":"27_CR28","doi-asserted-by":"publisher","first-page":"99","DOI":"10.3233\/JCS-2004-12105","volume":"12","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Completeness theorems for the Abadi-Rogaway logic of encrypted expressions. Journal of Computer Security\u00a012(1), 99\u2013129 (2004)","journal-title":"Journal of Computer Security"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-24638-1_8","volume-title":"Theory of Cryptography","author":"D. Micciancio","year":"2004","unstructured":"Micciancio, D., Warinschi, B.: Soundness of formal encryption in the presence of active adversaries. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 133\u2013151. Springer, Heidelberg (2004)"},{"key":"27_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-30564-4_13","volume-title":"Selected Areas in Cryptography","author":"D.H. Phan","year":"2004","unstructured":"Phan, D.H., Pointcheval, D.: About the security of ciphers (semantic security and pseudo-random permutations). In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol.\u00a03357, pp. 185\u2013200. Springer, Heidelberg (2004)"},{"issue":"3","key":"27_CR31","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/206826.206834","volume":"29","author":"M. Steiner","year":"1995","unstructured":"Steiner, M., Tsudik, G., Waidner, M.: Refinement and extension of encrypted key exchange. ACM SIGOPS Oper. Syst. Rev.\u00a029(3), 22\u201330 (1995)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Tsudik, G., Herreweghen, E.V.: Some remarks on protecting weak secrets and poorly-chosen keys from guessing attacks. In: Proc. 12th IEEE Symposium on Reliable Distributed Systems (SRDS 1993) (1993)","DOI":"10.1109\/RELDIS.1993.393465"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11690634_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T13:19:01Z","timestamp":1555507141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11690634_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540330455","9783540330462"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/11690634_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}