{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:20:10Z","timestamp":1742998810346,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727378"},{"type":"electronic","value":"9783540727385"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"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":[[2007]]},"DOI":"10.1007\/978-3-540-72738-5_6","type":"book-chapter","created":{"date-parts":[[2007,6,23]],"date-time":"2007-06-23T00:36:01Z","timestamp":1182558961000},"page":"87-103","source":"Crossref","is-referenced-by-count":8,"title":["Analyzing an Electronic Cash Protocol Using Applied Pi Calculus"],"prefix":"10.1007","author":[{"given":"Zhengqin","family":"Luo","sequence":"first","affiliation":[]},{"given":"Xiaojuan","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Yuxin","family":"Deng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_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, 427\u2013476 (2004)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/978-3-540-24725-8_24","volume-title":"Programming Languages and Systems","author":"M. Abadi","year":"2004","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: Just Fast Keying in the Pi Calculus. In: Schmidt, D. (ed.) ESOP 2004. LNCS, vol.\u00a02986, pp. 340\u2013354. Springer, Heidelberg (2004)"},{"key":"6_CR3","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. Theoretical Computer Science\u00a0367, 2\u201332 (2006)","journal-title":"Theoretical Computer Science"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile Values, New Names, and Secure Communication. In: Proceedings of POPL 2001, pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/3-540-63141-0_5","volume-title":"CONCUR\u201997: Concurrency Theory","author":"M. Abadi","year":"1997","unstructured":"Abadi, M., Gordon, A.D.: Reasoning about Cryptographic Protocols in the Spi Calculus. In: Mazurkiewicz, A., Winkowski, J. (eds.) CONCUR 1997. LNCS, vol.\u00a01243, pp. 59\u201373. Springer, Heidelberg (1997)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An Efficient Cryptographic Protocol Verifier Based on Prolog Rules. In: Proceedings of CSFW 2001, pp. 82\u201396 (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated Verification of Selected Equivalences for Security Protocols. In: Proceedings of LICS 2005, pp. 331\u2013340 (2005)","DOI":"10.1109\/LICS.2005.8"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S. Blom","year":"2001","unstructured":"Blom, S., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.: \u03bcCRL: A Toolset for Analysing Algebraic Specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/3-540-48329-2_26","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"S. Brands","year":"1994","unstructured":"Brands, S.: Untraceable Off-Line Cash in Wallets with Observers. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 302\u2013318. Springer, Heidelberg (1994)"},{"key":"6_CR12","unstructured":"Brands, S.A.: An Efficient Off-line Electronic Cash System Based On The Representation Problem. CWI Technical Report, CS-R9323 (1993)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/0-387-34799-2_25","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"D. Chaum","year":"1990","unstructured":"Chaum, D., Fiat, A., Naor, M.: Untraceable Electronic Cash. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 319\u2013327. Springer, Heidelberg (1990)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11888116_9","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"T. Chothia","year":"2006","unstructured":"Chothia, T.: Analysing the MUTE Anonymous File-Sharing System Using the Pi-Calculus. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol.\u00a04229, pp. 115\u2013130. Springer, Heidelberg (2006)"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75336-0_19","volume-title":"Trustworthy Global Computing","author":"T. Chothia","year":"2007","unstructured":"Chothia, T., Orzan, S., Pang, J., Dashti, M.T.: A Framework for Automatically Checking Anonymity with \u03bcCRL. In: Montanari, U., Sannella, D., Bruni, R. (eds.) TGC 2007. LNCS, vol.\u00a04661, Springer, Heidelberg (2007)"},{"key":"6_CR17","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak Probabilistic Anonymity. In: Proceedings of SECCO 2005, Electronic Notes in Theoretical Computer Science, to appear (2005)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-75227-1_5","volume-title":"Formal Aspects in Security and Trust","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., Pang, J., Wu, P.: Measuring anonymity with relative entropy. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 65\u201379. Springer, Heidelberg (2007)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-48285-7_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"N. Ferguson","year":"1994","unstructured":"Ferguson, N.: Single Term Off-Line Coins. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 318\u2013328. Springer, Heidelberg (1994)"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/3-540-56939-1_78","volume-title":"Automata, Languages and Programming","author":"M.K. Franklin","year":"1993","unstructured":"Franklin, M.K., Yung, M.: Secure and Efficient Off-Line Digital Money (Extended Abstract). In: Lingas, A., Carlsson, S., Karlsson, R. (eds.) ICALP 1993. LNCS, vol.\u00a0700, pp. 265\u2013276. Springer, Heidelberg (1993)"},{"key":"6_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/11691372_29","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Hinton","year":"2006","unstructured":"Hinton, A., Kwiatkowska, M., Norman, G., Parker, D.: PRISM: A Tool for Automatic Verification of Probabilistic Systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.\u00a03920, pp. 441\u2013444. Springer, Heidelberg (2006)"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1145\/359576.359585","volume":"21","author":"T. Hoare","year":"1978","unstructured":"Hoare, T.: Communicating Sequential Processes. Communications of the ACM\u00a021, 666\u2013677 (1978)","journal-title":"Communications of the ACM"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S. Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.: Analysis of an Electronic Voting Protocol in the Applied Pi Calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 186\u2013200. Springer, Heidelberg (2005)"},{"key":"6_CR24","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. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol.\u00a01055, pp. 147\u2013166. Springer, Heidelberg (1996)"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-46432-8_10","volume-title":"Foundation of Software Science and Computation Structures","author":"O.M. Herescu","year":"2000","unstructured":"Herescu, O.M., Palamidessi, C.: Probabilistic Asynchronous \u03c0-Calculus. In: Tiuryn, J. (ed.) ETAPS 2000 and FOSSACS 2000. LNCS, vol.\u00a01784, pp. 146\u2013160. Springer, Heidelberg (2000)"},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Information and Computation\u00a0100, 1\u201340 (1992)","journal-title":"Information and Computation"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/0890-5401(92)90009-5","volume":"100","author":"R. Milner","year":"1992","unstructured":"Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, II. Information and Computation\u00a0100, 41\u201377 (1992)","journal-title":"Information and Computation"},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-61770-1_38","volume-title":"Computer Security - ESORICS 96","author":"S. Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and Anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) ESORICS 1996. LNCS, vol.\u00a01146, pp. 198\u2013218. Springer, Heidelberg (1996)"},{"key":"6_CR29","unstructured":"Tsiounis, Y.: Efficient Electronic Cash: New Notions and Techniques. PhD Thesis, Northeastern University (1997)"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72738-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T13:42:57Z","timestamp":1737121377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72738-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540727378","9783540727385"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72738-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}