{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,5]],"date-time":"2025-12-05T12:09:28Z","timestamp":1764936568590,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642158971"},{"type":"electronic","value":"9783642158988"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-15898-8_13","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T09:43:47Z","timestamp":1284371027000},"page":"198-214","source":"Crossref","is-referenced-by-count":25,"title":["A Formal Model of Identity Mixer"],"prefix":"10.1007","author":[{"given":"Jan","family":"Camenisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"M\u00f6dersheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dieter","family":"Sommer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private authentication. Theoretical Computer Science\u00a0322(3), 427\u2013476 (2004)","journal-title":"Theoretical Computer Science"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44618-4_28","volume-title":"CONCUR 2000 - Concurrency Theory","author":"R. Amadio","year":"2000","unstructured":"Amadio, R., Lugiez, D.: On the reachability problem in cryptographic protocols. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 380\u2013394. Springer, Heidelberg (2000)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A. Armando","year":"2005","unstructured":"Armando, A., Basin, D.A., Boichut, Y., Chevalier, Y., Compagna, L., Cu\u00e9llar, J., Drielsma, P.H., H\u00e9am, P.-C., Kouchnarenko, O., Mantovani, J., M\u00f6dersheim, S., von Oheimb, D., Rusinowitch, M., Santiago, J., Turuani, M., Vigan\u00f2, L., Vigneron, L.: The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 281\u2013285. Springer, Heidelberg (2005)"},{"key":"13_CR4","volume-title":"FMSE 2008","author":"A. Armando","year":"2008","unstructured":"Armando, A., Carbone, R., Compagna, L., Cuellar, J., Abad, L.T.: Formal Analysis of SAML 2.0 Web Browser Single Sign-On: Breaking the SAML-based Single Sign-On for Google Apps. In: FMSE 2008. ACM Press, New York (2008)"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10207-007-0041-y","volume":"7","author":"A. Armando","year":"2008","unstructured":"Armando, A., Compagna, L.: SAT-based Model-Checking for Security Protocols Analysis. International Journal of Information Security\u00a07(1), 3\u201332 (2008)","journal-title":"International Journal of Information Security"},{"key":"13_CR6","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":"13_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 Symposium on Security and Privacy, pp. 202\u2013215 (2008)","DOI":"10.1109\/SP.2008.23"},{"key":"13_CR8","unstructured":"Bangerter, E., Camenisch, J., Krenn, S., Sadeghi, A.-R., Schneider, T.: Automatic generation of sound zero-knowledge protocols. Cryptology ePrint Archive (2008)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/11861386_5","volume-title":"Security Protocols","author":"E. Bangerter","year":"2006","unstructured":"Bangerter, E., Camenisch, J., Lysyanskaya, A.: A Cryptographic Framework for the Controlled Release Of Certified Data. In: Christianson, B., Crispo, B., Malcolm, J.A., Roe, M. (eds.) Security Protocols 2004. LNCS, vol.\u00a03957, pp. 43\u201350. Springer, Heidelberg (2006)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/3-540-48071-4_28","volume-title":"Advances in Cryptology - CRYPTO \u201992","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Goldreich, O.: On defining proofs of knowledge. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol.\u00a0740, pp. 390\u2013420. Springer, Heidelberg (1993)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on Prolog rules. In: CSFW 2001, pp. 82\u201396. IEEECOSO (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112 (1988)","DOI":"10.1145\/62212.62222"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-44987-6_7","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"J. Camenisch","year":"2001","unstructured":"Camenisch, J., Lysyanskaya, A.: An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, p. 93. Springer, Heidelberg (2001)"},{"key":"13_CR14","first-page":"119","volume-title":"SACMAT","author":"J. Camenisch","year":"2010","unstructured":"Camenisch, J., M\u00f6dersheim, S., Neven, G., Preiss, F.-S., Sommer, D.: A card requirements language enabling privacy-preserving access control. In: SACMAT, pp. 119\u2013128. ACM Press, New York (2010)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Camenisch, J., Sommer, D., Zimmermann, R.: A general certification framework with application to privacy-enhancing certificate infrastructures. In: SEC (2006)","DOI":"10.1007\/0-387-33406-8_3"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/BFb0052252","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"J. Camenisch","year":"1997","unstructured":"Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 410\u2013424. Springer, Heidelberg (1997)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Cervesato, I., Jaggard, A.D., Scedrov, A., Tsay, J.-K., Walstad, C.: Breaking and fixing public-key Kerberos. Information and Computation\u00a0206(2-4) (2008)","DOI":"10.1016\/j.ic.2007.05.005"},{"key":"13_CR18","first-page":"199","volume-title":"Advances in Cryptology - Crypto \u201982","author":"D. Chaum","year":"1983","unstructured":"Chaum, D.: Blind signatures for untraceable payments. In: Advances in Cryptology - Crypto \u201982, pp. 199\u2013203. Springer, Heidelberg (1983)"},{"key":"13_CR19","series-title":"LNAI","first-page":"412","volume-title":"IJCAR\u201910","author":"V. Cheval","year":"2010","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: Automating security analysis: symbolic equivalence of constraint systems. In: Giesl, J., H\u00e4hnle, R. (eds.) IJCAR\u201910. LNCS (LNAI), vol.\u00a06173, pp. 412\u2013426. Springer, Heidelberg (2010)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/11874683_20","volume-title":"Computer Science Logic","author":"V. Cortier","year":"2006","unstructured":"Cortier, V., Rusinowitch, M., Zalinescu, E.: Relating two standard notions of secrecy. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol.\u00a04207, pp. 303\u2013318. Springer, Heidelberg (2006)"},{"issue":"1-2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S. Escobar","year":"2006","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties. Theoretical Computer Science\u00a0367(1-2), 162\u2013202 (2006)","journal-title":"Theoretical Computer Science"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"K\u00fcsters, R., Truderung, T.: Using proverif to analyze protocols with diffie-hellman exponentiation. IEEE CSF, 157\u2013171 (2009)","DOI":"10.1109\/CSF.2009.17"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-10433-6_14","volume-title":"Cryptology and Network Security","author":"X. Li","year":"2009","unstructured":"Li, X., Zhang, Y., Deng, Y.: Verifying anonymous credential systems in applied pi calculus. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol.\u00a05888, pp. 209\u2013225. Springer, Heidelberg (2009)"},{"key":"13_CR24","doi-asserted-by":"crossref","first-page":"16","DOI":"10.26636\/jtit.2002.4.148","volume":"4","author":"J.K. Millen","year":"2002","unstructured":"Millen, J.K., Denker, G.: Capsl and mucapsl. Journal of Telecommunications and Information Technology\u00a04, 16\u201327 (2002)","journal-title":"Journal of Telecommunications and Information Technology"},{"key":"13_CR25","unstructured":"M\u00f6dersheim, S.: Models and Methods for the Automated Analysis of Security Protocols. PhD-thesis, ETH Z\u00fcrich (2007)"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","volume-title":"Fosad 2007\u20132008\u20132009","author":"S. M\u00f6dersheim","year":"2009","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: The open-source fixed-point model checker for symbolic analysis of security protocols. In: Fosad 2007\u20132008\u20132009. LNCS. Springer, Heidelberg (2009)"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-642-04444-1_21","volume-title":"Computer Security \u2013 ESORICS 2009","author":"S. M\u00f6dersheim","year":"2009","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: Secure Pseudonymous Channels. In: Backes, M., Ning, P. (eds.) ESORICS 2009. LNCS, vol.\u00a05789, pp. 337\u2013354. Springer, Heidelberg (2009)"},{"issue":"3","key":"13_CR28","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation for smart cards. Journal of Cryptology\u00a04(3), 239\u2013252 (1991)","journal-title":"Journal of Cryptology"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15898-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T18:51:36Z","timestamp":1740509496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15898-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642158971","9783642158988"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15898-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}