{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T18:10:09Z","timestamp":1739729409473,"version":"3.37.1"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642106217"},{"type":"electronic","value":"9783642106224"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10622-4_11","type":"book-chapter","created":{"date-parts":[[2010,1,13]],"date-time":"2010-01-13T02:36:26Z","timestamp":1263350186000},"page":"137-146","source":"Crossref","is-referenced-by-count":3,"title":["A Dolev-Yao Model for Zero Knowledge"],"prefix":"10.1007","author":[{"given":"Anguraj","family":"Baskar","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","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":"11_CR2","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1145\/1102120.1102125","volume-title":"CCS 2005: Proceedings of the 12th ACM conference on Computer and communications security","author":"M. Baudet","year":"2005","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: CCS 2005: Proceedings of the 12th ACM conference on Computer and communications security, pp. 16\u201325. ACM Press, New York (2005)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Backes, M., Hritcu, C., Maffei, M.: Type-checking zero-knowledge. In: ACM Conference on Computer and Communications Security, pp. 357\u2013370 (2008)","DOI":"10.1145\/1455770.1455816"},{"key":"11_CR4","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 Symposium on Security and Privacy, pp. 202\u2013215 (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: A Dolev-Yao model for Zero Knowledge. CMI Technical Report (2009), http:\/\/www.cmi.ac.in\/~spsuresh\/content\/pdffiles\/zero-know-jun09.pdf","DOI":"10.1007\/978-3-642-10622-4_11"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Backes, M., Unruh, D.: Computational Soundness of Symbolic Zero-Knowledge Proofs Against Active Attackers. In: Proceedings of the 21st IEEE Computer Security Foundations Symposium, pp. 255\u2013269 (2008)","DOI":"10.1109\/CSF.2008.20"},{"issue":"1","key":"11_CR7","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. Journal of Computer Security\u00a014(1), 1\u201343 (2006)","journal-title":"Journal of Computer Security"},{"key":"11_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":"11_CR9","unstructured":"Clausen, A.: Logical composition of zero-knowledge proofs, http:\/\/www.cis.upenn.edu\/~mkearns\/teaching\/Crypto\/zkp-disj.pdf"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder Deductions, Constraint Solving and Insecurity Decisions in Presence of Exclusive or. In: Proceedings of the 18th IEEE Synposium on Logic in Computer Science (LICS), June 2003, pp. 271\u2013280 (2003)","DOI":"10.1109\/LICS.2003.1210067"},{"key":"11_CR11","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)"},{"issue":"4","key":"11_CR12","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S. Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. Journal of Computer Security\u00a017(4), 435\u2013487 (2009)","journal-title":"Journal of Computer Security"},{"key":"11_CR13","series-title":"Cambridge Tracts in Theoretical Computer Science","volume-title":"Proofs and Types","author":"J.-Y. Girard","year":"1989","unstructured":"Girard, J.-Y., Lafont, Y., Taylor, P.: Proofs and Types. Cambridge Tracts in Theoretical Computer Science, vol.\u00a07. Cambridge University Press, Cambridge (1989)"},{"issue":"1","key":"11_CR14","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal of Computing\u00a018(1), 186\u2013208 (1989)","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"11_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2005.03.003","volume":"340","author":"J. Herzog","year":"2005","unstructured":"Herzog, J.: A computational interpretation of dolev-yao adversaries. Theoretical Computer Science\u00a0340(1), 57\u201381 (2005)","journal-title":"Theoretical Computer Science"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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_CR17","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\/502006.502007"},{"issue":"1","key":"11_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/JCS-2005-13106","volume":"13","author":"R. Ramanujam","year":"2005","unstructured":"Ramanujam, R., Suresh, S.P.: Decidability of context-explicit security protocols. Journal of Computer Security\u00a013(1), 135\u2013165 (2005)","journal-title":"Journal of Computer Security"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1016\/j.tcs.2006.08.037","volume":"367","author":"R. Ramanujam","year":"2006","unstructured":"Ramanujam, R., Suresh, S.P.: A (restricted) quantifier elimination for security protocols. Theoretical Computer Science\u00a0367, 228\u2013256 (2006)","journal-title":"Theoretical Computer Science"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M. Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol Insecurity with Finite Number of Sessions and Composed Keys is NP-complete. Theoretical Computer Science\u00a0299, 451\u2013475 (2003)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Science - ASIAN 2009. Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10622-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,16]],"date-time":"2025-02-16T17:49:27Z","timestamp":1739728167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10622-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642106217","9783642106224"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10622-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}