{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T23:58:04Z","timestamp":1740095884859,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160738"},{"type":"electronic","value":"9783642160745"}],"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-16074-5_2","type":"book-chapter","created":{"date-parts":[[2010,10,5]],"date-time":"2010-10-05T06:11:51Z","timestamp":1286259111000},"page":"2-22","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning about Probabilistic Security Using Task-PIOAs"],"prefix":"10.1007","author":[{"given":"Aaron D.","family":"Jaggard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catherine","family":"Meadows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Mislove","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Segala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"2_CR2","first-page":"1","volume-title":"Handbook of Logic in Computer Science","author":"S. Abramsky","year":"1994","unstructured":"Abramsky, S., Jung, A.: Domain theory. In: Abramsky, S., Gabbay, D.M., Maibaum, T.S.E. (eds.) Handbook of Logic in Computer Science, vol.\u00a03, pp. 1\u2013168. Clarendon Press, Oxford (1994)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/3-540-44685-0_24","volume-title":"CONCUR 2001 - Concurrency Theory","author":"L. Alfaro de","year":"2001","unstructured":"de Alfaro, L., Henzinger, T., Jhala, R.: Compositional methods for probabilistic systems. In: Larsen, K.G., Nielsen, M. (eds.) CONCUR 2001. LNCS, vol.\u00a02154, pp. 351\u2013365. Springer, Heidelberg (2001)"},{"key":"2_CR4","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":"2_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols, http:\/\/eprint.iacr.org\/2000\/067","DOI":"10.1109\/SFCS.2001.959888"},{"key":"2_CR6","unstructured":"Canetti, R., Lynch, N., et al.: Using Probabilistic I\/O Automata to Analyze an Oblivious Transfer Protocol (preprint), http:\/\/hdl.handle.net\/1721.1\/33154"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-74407-8_4","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making Random Choices Invisible to the Scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 42\u201358. Springer, Heidelberg (2007)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.ic.2007.07.003","volume":"206","author":"K. Chatzikokalakis","year":"2008","unstructured":"Chatzikokalakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation\u00a0206, 378\u2013401 (2008)","journal-title":"Information and Computation"},{"key":"2_CR9","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"},{"issue":"1","key":"2_CR10","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/S0890-5401(03)00051-8","volume":"184","author":"J. Desharnais","year":"2003","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Approximating Labeled Markov Processes. Information and Computation\u00a0184(1), 160\u2013200 (2003)","journal-title":"Information and Computation"},{"key":"2_CR11","unstructured":"Garcia, F., van Rossum, P., Sokolova, A.: Probabilistic anonymity and admissible schedulers, June 2 (2007) arXiv:0706.1019, http:\/\/eprintweb.org\/S\/authors\/All\/so\/Sokolova"},{"key":"2_CR12","unstructured":"Goldreich, O.: Secure Multi-party Computation, http:\/\/www.wisdom.weizmann.ac.il\/~oded\/pp.html"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity, or All languages in NP have Zero-knowledge proofs. JACM\u00a038, 691\u2013729 (1991)","journal-title":"JACM"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-71316-6_26","volume-title":"Programming Languages and Systems","author":"I. Hasuo","year":"2007","unstructured":"Hasuo, I., Kawabe, Y.: Probabilistic anonymity via coalgebraic simulations. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol.\u00a04421, pp. 379\u2013394. Springer, Heidelberg (2007)"},{"key":"2_CR15","volume-title":"Probabilistic non-determinism","author":"C. Jones","year":"1992","unstructured":"Jones, C.: Probabilistic non-determinism. University of Edinburgh, Edinburgh (1992)"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through Probabilistic Testing. Information and Computation\u00a094(1), 1\u201328 (1991)","journal-title":"Information and Computation"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Lincoln, Mitchell, P.J.C., Mitchell, M., Scedrov, A.: A Probabilistic Poly-Time Framework for Protocol Analysis. In: ACM Conference on Computer and Communications Security, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-44618-4_26","volume-title":"CONCUR 2000 - Concurrency Theory","author":"M.. Mislove","year":"2000","unstructured":"Mislove, M.: Nondeterminism and probabilistic choice: obeying the laws. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 350\u2013364. Springer, Heidelberg (2000)"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Mislove, M., Pavlovic, D., Worrell, J.: Labelled Markov Processes as Generalized Stochastic Relations. Electronic Notes Theoretical Computer Science, vol.\u00a0172, pp. 459\u2013478 (2007)","DOI":"10.1016\/j.entcs.2007.02.015"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.10.044","volume":"353","author":"J. Mitchell","year":"2006","unstructured":"Mitchell, J., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theoretical Computer Science\u00a0353, 118\u2013164 (2006)","journal-title":"Theoretical Computer Science"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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), http:\/\/dx.doi.org\/10.1007\/3-540-61770-1_38"},{"key":"2_CR22","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-time Systems, PhD Thesis, MIT Technical Report MIT\/LCS\/TR-676 (1995)"},{"key":"2_CR23","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nordic Journal of Computing\u00a02, 250\u2013273 (1995)","journal-title":"Nordic Journal of Computing"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning for Security Protocol Analysis and Issues in the Theory of Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16074-5_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T02:58:26Z","timestamp":1559703506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16074-5_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160738","9783642160745"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16074-5_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}