{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,2]],"date-time":"2026-10-02T11:02:18Z","timestamp":1790938938337,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642368295","type":"print"},{"value":"9783642368301","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36830-1_11","type":"book-chapter","created":{"date-parts":[[2013,2,18]],"date-time":"2013-02-18T19:35:47Z","timestamp":1361216147000},"page":"206-225","source":"Crossref","is-referenced-by-count":6,"title":["Computational Soundness of Symbolic Zero-Knowledge Proofs: Weaker Assumptions and Mechanized Verification"],"prefix":"10.1007","author":[{"given":"Michael","family":"Backes","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Bendun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. In: ACM CCS (1997)","DOI":"10.1145\/266420.266432"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). Journal of Cryptology\u00a015(2) (2002)","DOI":"10.1007\/s00145-001-0014-7"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Hofheinz, D., Unruh, D.: Cosp: A general framework for computational soundness proofs. In: ACM CCS (2009)","DOI":"10.1145\/1653662.1653672"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Backes, M., Hri\u0163cu, C., Maffei, M.: Type-checking zero-knowledge. In: ACM CCS (2008)","DOI":"10.1145\/1455770.1455816"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-642-14527-8_8","volume-title":"Privacy Enhancing Technologies","author":"M. Backes","year":"2010","unstructured":"Backes, M., Lorenz, S., Maffei, M., Pecina, K.: Anonymous Webs of Trust. In: Atallah, M.J., Hopper, N.J. (eds.) PETS 2010. LNCS, vol.\u00a06205, pp. 130\u2013148. Springer, Heidelberg (2010)"},{"key":"11_CR6","unstructured":"Backes, M., Maffei, M., Mohammadi, E.: Computationally sound abstraction and verification of secure multi-party computations. In: FSTTCS (2010)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Backes, M., Maffei, M., Unruh, D.: Zero-knowledge in the applied pi-calculus and automated verification of the direct anonymous attestation protocol. In: IEEE S&P (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Backes, M., Maffei, M., Unruh, D.: Computationally sound verification of source code. In: ACM CCS (2010)","DOI":"10.1145\/1866307.1866351"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Symmetric encryption in a simulatable Dolev-Yao style cryptographic library. In: IEEE CSFW (2004)","DOI":"10.1007\/s10207-004-0056-6"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Backes, M., Unruh, D.: Computational soundness of symbolic zero-knowledge proofs. Journal of Computer Security 18(6) (2010)","DOI":"10.3233\/JCS-2009-0392"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Basin, D., M\u00f6dersheim, S., Vigan\u00f2, L.: OFMC: A symbolic model checker for security protocols. International Journal of Information Security (2004)","DOI":"10.1007\/s10207-004-0055-7"},{"key":"11_CR12","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: 14th IEEE CSFW (2001)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Brickell, E.F., Camenisch, J., Chen, L.: Direct anonymous attestation. In: ACM CCS (2004)","DOI":"10.1145\/1030083.1030103"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11681878_20","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2006","unstructured":"Canetti, R., Herzog, J.: Universally Composable Symbolic Analysis of Mutual Authentication and Key-Exchange Protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 380\u2013403. Springer, Heidelberg (2006)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Clarkson, M.R., Chong, S., Myers, A.C.: Civitas: Toward a Secure Voting System. In: IEEE S&P (2008)","DOI":"10.1109\/SP.2008.32"},{"key":"11_CR16","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)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Cortier, V., Warinschi, B.: A composable computational soundness notion. In: Proc. 18th ACM CCS (2011)","DOI":"10.1145\/2046707.2046717"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. IEEE Transactions on Information Theory 29(2) (1983)","DOI":"10.1109\/TIT.1983.1056650"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Even, S., Goldreich, O.: On the security of multi-party ping-pong protocols. In: IEEE CSF (1983)","DOI":"10.1007\/978-1-4757-0602-4_31"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1) (1989)","DOI":"10.1137\/0218012"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/11935230_29","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J.: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284, pp. 444\u2013459. Springer, Heidelberg (2006)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-74143-5_18","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"J. Groth","year":"2007","unstructured":"Groth, J., Ostrovsky, R.: Cryptography in the Multi-string Model. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 323\u2013341. Springer, Heidelberg (2007)"},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"Kemmerer, R., Meadows, C., Millen, J.: Three systems for cryptographic protocol analysis. Journal of Cryptology 7(2) (1994)","DOI":"10.1007\/BF00197942"},{"key":"11_CR24","unstructured":"Laud, P.: Symmetric encryption in automatic analyses for confidentiality against active adversaries. In: IEEE S&P (2004)"},{"key":"11_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11599548_18","volume-title":"Information Security and Cryptology","author":"H. Li","year":"2005","unstructured":"Li, H., Li, B.: An Unbounded Simulation-Sound Non-interactive Zero-Knowledge Proof System for NP. In: Feng, D., Lin, D., Yung, M. (eds.) CISC 2005. LNCS, vol.\u00a03822, pp. 210\u2013220. Springer, Heidelberg (2005)"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"11_CR27","unstructured":"Lu, L., Han, J., Liu, Y., Hu, L., Huai, J.-P., Ni, L., Ma, J.: Pseudo trust: Zero-knowledge authentication in anonymous p2ps. IEEE Trans. Parallel Distrib. Syst. (2008)"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Maffei, M., Pecina, K.: Position paper: Privacy-aware proof-carrying authorization. In: PLAS (2011)","DOI":"10.1145\/2166956.2166963"},{"key":"11_CR29","unstructured":"Merritt, M.: Cryptographic Protocols. PhD thesis, Georgia Tech (1983)"},{"key":"11_CR30","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":"11_CR31","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS (1999)"},{"key":"11_CR32","unstructured":"Sahai, A.: Simulation-sound non-interactive zero knowledge. Technical report, IBM Research Report RZ 3076 (2001)"},{"key":"11_CR33","unstructured":"Schneider, S.: Security properties and CSP. In: IEEE S&P (1996)"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T08:15:08Z","timestamp":1557562508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36830-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368295","9783642368301"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36830-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}