{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:33:19Z","timestamp":1725672799202},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291005"},{"type":"electronic","value":"9783642291012"}],"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-29101-2_5","type":"book-chapter","created":{"date-parts":[[2012,4,2]],"date-time":"2012-04-02T04:10:23Z","timestamp":1333339823000},"page":"63-79","source":"Crossref","is-referenced-by-count":5,"title":["Computational Soundness of Indistinguishability Properties without Computable Parsing"],"prefix":"10.1007","author":[{"given":"Hubert","family":"Comon-Lundh","sequence":"first","affiliation":[]},{"given":"Masami","family":"Hagiya","sequence":"additional","affiliation":[]},{"given":"Yusuke","family":"Kawamoto","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Sakurada","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proc. of the 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","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":"5_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Hofheinz, D., Unruh, D.: CoSP: A general framework for computational soundness proofs. Cryptology ePrint Archive, Report 2009\/080 (2009), \n                    \n                      http:\/\/eprint.iacr.org\/","DOI":"10.1145\/1653662.1653672"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable cryptographic library with nested operations. In: Proc. of the 10th ACM Concerence on Computer and Communications Security (CCS 2003), pp. 220\u2013230 (2003)","DOI":"10.1145\/948109.948140"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/11863908_25","volume-title":"Computer Security \u2013 ESORICS 2006","author":"M. Backes","year":"2006","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: Limits of the BRSIM\/UC Soundness of Dolev-Yao Models with Hashes. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 404\u2013423. Springer, Heidelberg (2006)"},{"issue":"12","key":"5_CR6","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M. Backes","year":"2007","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The reactive simulatability (RSIM) framework for asynchronous systems. Information and Computation\u00a0205(12), 1685\u20131720 (2007)","journal-title":"Information and Computation"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Cortier, V.: Computational soundness of observational equivalence. In: Proc. of the 15th ACM Conference on Computer and Communications Security (CCS 2008), pp. 109\u2013118 (2008)","DOI":"10.1145\/1455770.1455786"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/11944836_18","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Kremer, S., K\u00fcsters, R., Warinschi, B.: Computationally Sound Symbolic Secrecy in the Presence of Hash Functions. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 176\u2013187. Springer, Heidelberg (2006)"},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-540-31987-0_12","volume-title":"Programming Languages and Systems","author":"V. Cortier","year":"2005","unstructured":"Cortier, V., Warinschi, B.: Computationally Sound, Automated Proofs for Security Protocols. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 157\u2013171. Springer, Heidelberg (2005)"},{"issue":"1-2","key":"5_CR10","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.tcs.2007.11.011","volume":"394","author":"F.D. Garcia","year":"2008","unstructured":"Garcia, F.D., van Rossum, P.: Sound and complete computational interpretation of symbolic hashes in the standard model. Theor. Comput. Sci.\u00a0394(1-2), 112\u2013133 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.entcs.2007.01.066","volume":"186","author":"R. Janvier","year":"2007","unstructured":"Janvier, R., Lakhnech, Y., Mazar\u00e9, L.: Computational soundness of symbolic analysis for protocols using hash functions. Electr. Notes Theor. Comput. Sci.\u00a0186, 121\u2013139 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"5_CR12","unstructured":"Kawamoto, Y., Sakurada, H., Hagiya, M.: Computationally sound symbolic anonymity of a ring signature. In: Proc. of Joint Workshop on Foundations of Computer Security, Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security (FCS-ARSPA-WITS 2008), pp. 161\u2013175 (2008)"},{"key":"5_CR13","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":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-540-25937-4_24","volume-title":"Fast Software Encryption","author":"P. Rogaway","year":"2004","unstructured":"Rogaway, P., Shrimpton, T.: Cryptographic Hash-Function Basics: Definitions, Implications, and Separations for Preimage Resistance, Second-Preimage Resistance, and Collision Resistance. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol.\u00a03017, pp. 371\u2013388. Springer, Heidelberg (2004)"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Unruh, D.: Termination-insensitive computational indistinguishability (and applications to computational soundness). In: Proc. of the 24th IEEE Computer Security Foundations Symposium (CSF 2011). IEEE Computer Society (June 2011)","DOI":"10.1109\/CSF.2011.24"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29101-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T00:28:47Z","timestamp":1558312127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29101-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291005","9783642291012"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29101-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}