{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:19:08Z","timestamp":1743034748518,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642402029"},{"type":"electronic","value":"9783642402036"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-40203-6_21","type":"book-chapter","created":{"date-parts":[[2013,8,14]],"date-time":"2013-08-14T02:48:53Z","timestamp":1376448533000},"page":"363-380","source":"Crossref","is-referenced-by-count":1,"title":["Symbolic Probabilistic Analysis of Off-Line Guessing"],"prefix":"10.1007","author":[{"given":"Bruno","family":"Conchinha","sequence":"first","affiliation":[]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Caleiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. J. Comput. Secur.\u00a014, 1\u201343 (2006)","journal-title":"J. Comput. Secur."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1109\/CSFW.2001.930138","volume-title":"Proc. of the 14th IEEE Workshop on Computer Security Foundations, CSFW 2001","author":"B. Blanchet","year":"2001","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: Proc. of the 14th IEEE Workshop on Computer Security Foundations, CSFW 2001, pp. 82\u201396. IEEE Computer Society, Washington, DC (2001)"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Meier, S., Cremers, C.J.F., Basin, D.A.: Automated analysis of Diffie-Hellman protocols and advanced security properties. In: Chong, S. (ed.) CSF, pp. 78\u201394. IEEE (2012)","DOI":"10.1109\/CSF.2012.25"},{"issue":"2","key":"21_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. J. Comput. Syst. Sci.\u00a028(2), 270\u2013299 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-48329-2_21","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"M. Bellare","year":"1994","unstructured":"Bellare, M., Rogaway, P.: Entity authentication and key distribution. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 232\u2013249. Springer, Heidelberg (1994)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: Security protocol verification: Symbolic and computational models. In: Degano, Guttman (eds.) [30], pp. 3\u201329","DOI":"10.1007\/978-3-642-28641-4_2"},{"issue":"3","key":"21_CR7","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00145-007-0203-0","volume":"20","author":"M. Abadi","year":"2007","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. Cryptology\u00a020(3), 395 (2007)","journal-title":"J. Cryptology"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Backes, M., Malik, A., Unruh, D.: Computational soundness without protocol restrictions. In: Yu, T., Danezis, G., Gligor, V.D. (eds.) ACM Conference on Computer and Communications Security, pp. 699\u2013711. ACM (2012)","DOI":"10.1145\/2382196.2382270"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Jajodia, S., Atluri, V., Jaeger, T. (eds.) ACM Conference on Computer and Communications Security, pp. 220\u2013230. ACM (2003)","DOI":"10.1145\/948138.948140"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Cortier, V.: Computational soundness of observational equivalence. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM Conference on Computer and Communications Security, pp. 109\u2013118. ACM (2008)","DOI":"10.1145\/1455770.1455786"},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TDSC.2007.1005","volume":"5","author":"B. Blanchet","year":"2008","unstructured":"Blanchet, B.: A computationally sound mechanized prover for security protocols. IEEE Trans. Dependable Sec. Comput.\u00a05(4), 193\u2013207 (2008)","journal-title":"IEEE Trans. Dependable Sec. Comput."},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Barthe, G., Gr\u00e9goire, B., B\u00e9guelin, S.Z.: Formal certification of code-based cryptographic proofs. In: Shao, Z., Pierce, B.C. (eds.) POPL, pp. 90\u2013101. ACM (2009)","DOI":"10.1145\/1594834.1480894"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-32347-8_2","volume-title":"Interactive Theorem Proving","author":"G. Barthe","year":"2012","unstructured":"Barthe, G., Crespo, J.M., Gr\u00e9goire, B., Kunz, C., Zanella B\u00e9guelin, S.: Computer-aided cryptographic proofs. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol.\u00a07406, pp. 11\u201327. Springer, Heidelberg (2012)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Bana, G., Comon-Lundh, H.: Towards unconditional soundness: Computationally complete symbolic attacker. In: Degano, Guttman (eds.) [30], pp. 189\u2013208","DOI":"10.1007\/978-3-642-28641-4_11"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-642-38574-2_6","volume-title":"Automated Deduction \u2013 CADE-24","author":"H. Comon-Lundh","year":"2013","unstructured":"Comon-Lundh, H., Cortier, V., Scerri, G.: Tractable inference systems: An extension with a deducibility predicate. In: Bonacina, M.P. (ed.) CADE 2013. LNCS, vol.\u00a07898, pp. 91\u2013108. Springer, Heidelberg (2013)"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1102120.1102125","volume-title":"Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005","author":"M. Baudet","year":"2005","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: Proceedings of the 12th ACM Conference on Computer and Communications Security, CCS 2005, pp. 16\u201325. ACM, New York (2005)"},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.entcs.2004.10.007","volume":"121","author":"R. Corin","year":"2005","unstructured":"Corin, R., Doumen, J., Etalle, S.: Analysing password protocol security against off-line dictionary attacks. Electron. Notes Theor. Comput. Sci.\u00a0121, 47\u201363 (2005)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1145\/322510.322514","volume":"2","author":"S. Halevi","year":"1999","unstructured":"Halevi, S., Krawczyk, H.: Public-key cryptography and password protocols. ACM Trans. Inf. Syst. Secur.\u00a02(3), 230\u2013268 (1999)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"21_CR19","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":"21_CR20","doi-asserted-by":"crossref","unstructured":"Abadi, M., Baudet, M., Warinschi, B.: Guessing attacks and the computational soundness of static equivalence. Journal of Computer Security, 909\u2013968 (December 2010)","DOI":"10.3233\/JCS-2009-0386"},{"key":"21_CR21","unstructured":"Sectools.org: Top 125 network security tools (January 2013), \n                    \n                      http:\/\/sectools.org\/tag\/crackers\/"},{"key":"21_CR22","doi-asserted-by":"crossref","unstructured":"Bellovin, S.M., Merritt, M.: Encrypted Key Exchange: Password-based protocols secure against dictionary attacks. In: IEEE Symposium on Research in Security and Privacy, pp. 72\u201384 (1992)","DOI":"10.1145\/168588.168618"},{"issue":"1","key":"21_CR23","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.comcom.2006.07.012","volume":"30","author":"J. Munilla","year":"2006","unstructured":"Munilla, J., Peinado, A.: Off-line password-guessing attack to Peyravian-Jeffries\u2019s remote user authentication protocol. Computer Communications\u00a030(1), 52\u201354 (2006)","journal-title":"Computer Communications"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. In: CCS 2007, pp. 286\u2013296. ACM (2007)","DOI":"10.1145\/1315245.1315282"},{"key":"21_CR25","unstructured":"(2013), \n                    \n                      http:\/\/www.infsec.ethz.ch\/people\/brunoco\/infsec\/people\/brunoco\/esorics13_tech.pdf"},{"key":"21_CR26","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2006.08.032","volume":"367","author":"M. Abadi","year":"2006","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under equational theories. Theor. Comput. Sci.\u00a0367, 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR27","first-page":"104","volume-title":"POPL 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL 2001, pp. 104\u2013115. ACM, New York (2001)"},{"key":"21_CR28","unstructured":"(2013), \n                    \n                      http:\/\/www.infsec.ethz.ch\/people\/brunoco\/prob_rsa.tar.gz"},{"issue":"3","key":"21_CR29","first-page":"143","volume":"253","author":"B. Montalto","year":"2009","unstructured":"Montalto, B., Caleiro, C.: Modeling and reasoning about an attacker with cryptanalytical capabilities. ENTCS\u00a0253(3), 143\u2013165 (2009)","journal-title":"ENTCS"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","volume-title":"Principles of Security and Trust","year":"2012","unstructured":"Degano, P., Guttman, J.D. (eds.): POST 2012. LNCS, vol.\u00a07215. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40203-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:44:41Z","timestamp":1559508281000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40203-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642402029","9783642402036"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40203-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}