{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:27:43Z","timestamp":1761488863037,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540617709"},{"type":"electronic","value":"9783540706755"}],"license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61770-1_38","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:22:27Z","timestamp":1330294947000},"page":"198-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":79,"title":["CSP and anonymity"],"prefix":"10.1007","author":[{"given":"Steve","family":"Schneider","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham","family":"Sidiropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"D. Chaum, Security without Identification: Card Computers to make Big Brother Obsolete, CACM 28(10), 1985.","DOI":"10.1145\/4372.4373"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"D. Chaum, The dining cryptographers problem: unconditional sender and recipient untraceability, J. Cryptology (1), 1988.","DOI":"10.1007\/BF00206326"},{"key":"15_CR3","unstructured":"Formal Systems (Europe) Ltd, Failures Divergences Refinement User Manual and Tutorial, 1994."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"C.A.R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.","DOI":"10.1007\/978-3-642-82921-5_4"},{"key":"15_CR5","unstructured":"G. Lowe, Probabilities and priorities in timed CSP, D.Phil thesis, Oxford, 1993."},{"key":"15_CR6","unstructured":"B. Pfitzmann and M. Waidner, A general framework for formal notions of \u201csecure\u201d system, Hildesheimer Informatik-Berichte 11\/94, Institut f\u00fcr Informatik, Universit\u00e4t Hildesheim, 1994."},{"key":"15_CR7","unstructured":"A.W. Roscoe, CSP and determinism in security modelling, Submitted for publication, 1994."},{"key":"15_CR8","unstructured":"S.A. Schneider, Security properties and CSP, IEEE Symposium on Security and Privacy, 1996."},{"key":"15_CR9","unstructured":"K. Seidel, Probabilistic Communicating Processes, D.Phil Thesis, Oxford, 1992."},{"key":"15_CR10","unstructured":"M. Waidner, Unconditional sender and recipient untraceability in spite of active attacks, Eurocrypt'89, LNCS 434, Springer, 1990."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2014 ESORICS 96"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61770-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:02:07Z","timestamp":1640948527000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61770-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540617709","9783540706755"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-61770-1_38","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]},"assertion":[{"value":"2 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}