{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:04:47Z","timestamp":1743059087509,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662496343"},{"type":"electronic","value":"9783662496350"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49635-0_10","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T12:03:52Z","timestamp":1458561832000},"page":"189-210","source":"Crossref","is-referenced-by-count":7,"title":["Composing Protocols with Randomized Actions"],"prefix":"10.1007","author":[{"given":"Matthew S.","family":"Bauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Chadha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115 (2001)","DOI":"10.1145\/373243.360213"},{"issue":"2\u20134","key":"10_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.ic.2007.07.002","volume":"206","author":"S Andova","year":"2008","unstructured":"Andova, S., Cremers, C.J.F., Gj\u00f8steen, K., Mauw, S., Mj\u00f8lsnes, S.F., Radomirovic, S.: A framework for compositional verification of security protocols. Inform. Comput. 206(2\u20134), 425\u2013459 (2008)","journal-title":"Inform. Comput."},{"key":"10_CR3","unstructured":"Arapinis, M., Cheval, V., Delaune, S.: Composing security protocols: from confidentiality to privacy. http:\/\/arxiv.org\/pdf\/1407.5444v3.pdf"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Cheval, V., Delaune, S.: Verifying privacy-type properties in a modular way. In: 25th IEEE Computer Security Foundations Symposium (CSF 2012), pp. 95\u2013109. IEEE Computer Society Press, Cambridge (2012)","DOI":"10.1109\/CSF.2012.16"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-540-89439-1_9","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M Arapinis","year":"2008","unstructured":"Arapinis, M., Delaune, S., Kremer, S.: From one session to many: dynamic tags for security protocols. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 128\u2013142. Springer, Heidelberg (2008)"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Bauer, M.S., Chadha, R., Viswanathan, M.: Composing Protocol with Randomized Actions. Technical report, University of Illinois at Urbana-Champaign, Department of Computer Science (2016)","DOI":"10.1007\/978-3-662-49635-0_10"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/18.50372","volume":"36","author":"M Ben-Or","year":"1990","unstructured":"Ben-Or, M., Goldreich, O., Micali, S., Rivest, R.L.: A fair protocol for signing contracts. IEEE Trans. Inf. Theory 36(1), 40\u201346 (1990)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR8","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, P., Segala, R.: Task-structured probabilistic I\/O automata. In: Workshop on Discrete Event Systems (2006)"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: Naor, M. (ed.) 42nd IEEE Symposium on Foundations of Computer Science (FOCS 2001), pp. 136\u2013145. IEEE Computer Society Press (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/11681878_20","volume-title":"Theory of Cryptography","author":"R Canetti","year":"2006","unstructured":"Canetti, R., Herzog, J.C.: Universally composable symbolic analysis of mutual authentication and key-exchange protocols. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 380\u2013403. Springer, Heidelberg (2006)"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-642-36830-1_14","volume-title":"Principles of Security and Trust","author":"M Carbone","year":"2013","unstructured":"Carbone, M., Guttman, J.D.: Sessions and separability in security protocols. In: Basin, D., Mitchell, J.C. (eds.) POST 2013 (ETAPS 2013). LNCS, vol. 7796, pp. 267\u2013286. Springer, Heidelberg (2013)"},{"key":"10_CR12","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Model checking concurrent programs with nondeterminism and randomization. In: the International Conference on Foundations of Software Technology and Theoretical Computer Science, pp. 364\u2013375 (2010)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. Information and Computation (2010) to appear","DOI":"10.1016\/j.ic.2009.06.006"},{"issue":"1","key":"10_CR14","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. J. Cryptology 1(1), 65\u201375 (1988)","journal-title":"J. Cryptology"},{"key":"10_CR15","unstructured":"Cheung, L.: Reconciling Nondeterministic and Probabilistic Choices. PhD thesis, Radboud University of Nijmegen (2006)"},{"key":"10_CR16","unstructured":"Chevalier, C., Delaune, S., Kremer, S.: Transforming password protocols to compose. In: 31st Conference on Foundations of Software Technology and Theoretical Computer Science, Leibniz International Proceedings in Informatics, pp. 204\u2013216. Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-77050-3_29","volume-title":"FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science","author":"V Cortier","year":"2007","unstructured":"Cortier, V., Delaitre, J., Delaune, S.: Safely composing security protocols. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 352\u2013363. Springer, Heidelberg (2007)"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10703-008-0059-4","volume":"34","author":"V Cortier","year":"2009","unstructured":"Cortier, V., Delaune, S.: Safely composing security protocols. Formal Methods in System Design 34(1), 1\u201336 (2009)","journal-title":"Formal Methods in System Design"},{"key":"10_CR19","unstructured":"Ciob\u00e2c\u0103, \u015e., Cortier, V.: Protocol composition for arbitrary primitives. In: Proceedings of the 23rd IEEE Computer Security Foundations Symposium, CSF, Edinburgh, July 17\u201319, 2010, pp. 322\u2013336 (2010)"},{"issue":"3","key":"10_CR20","doi-asserted-by":"publisher","first-page":"423","DOI":"10.3233\/JCS-2005-13304","volume":"13","author":"A Datta","year":"2005","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. J. Comput. Secur. 13(3), 423\u2013482 (2005)","journal-title":"J. Comput. Secur."},{"key":"10_CR21","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial information policies is hard. In: PROBMIV (1999)"},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Composition of password-based protocols. In: Proceedings of the 21st IEEE Computer Security Foundations Symposium (CSF 2008), pp. 239\u2013251. IEEE Computer Society Press, June 2008","DOI":"10.1109\/CSF.2008.6"},{"issue":"6","key":"10_CR23","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"10_CR24","unstructured":"Garcia, F.D., van Rossum, P., Sokolova, A.: Probabilistic Anonymity and Admissible Schedulers. CoRR, abs\/0706.1019 (2007)"},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/293411.293443","volume":"42","author":"DM Goldschlag","year":"1999","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Onion routing. Commun. ACM 42(2), 39\u201341 (1999)","journal-title":"Commun. ACM"},{"key":"10_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-76637-7_12","volume-title":"Programming Languages and Systems","author":"J Goubault-Larrecq","year":"2007","unstructured":"Goubault-Larrecq, J., Palamidessi, C., Troina, A.: A probabilistic applied pi\u2013calculus. In: Shao, Z. (ed.) APLAS 2007. LNCS, vol. 4807, pp. 175\u2013190. Springer, Heidelberg (2007)"},{"key":"10_CR27","unstructured":"Gunter, C.A., Khanna, S., Tan, K., Venkatesh, S.S.: Dos protection for reliably authenticated broadcast. In: NDSS (2004)"},{"issue":"3\u20134","key":"10_CR28","doi-asserted-by":"publisher","first-page":"409","DOI":"10.3233\/JCS-2004-123-405","volume":"12","author":"JD Guttman","year":"2004","unstructured":"Guttman, J.D.: Authentication tests and disjoint encryption: a design method for security protocols. J. Comput. Secur. 12(3\u20134), 409\u2013433 (2004)","journal-title":"J. Comput. Secur."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-642-00596-1_22","volume-title":"Foundations of Software Science and Computational Structures","author":"JD Guttman","year":"2009","unstructured":"Guttman, J.D.: Cryptographic protocol composition via the authentication tests. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol. 5504, pp. 303\u2013317. Springer, Heidelberg (2009)"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"He, C., Sundararajan, M., Datta, A., Derek, A., Mitchell, J.C.: A modular correctness proof of ieee 802.11i and TLS. In: Atluri, V., Meadows, C., Juels, A. (eds.) the 12th ACM Conference on Computer and Communications Security, (CCS ), pp. 2\u201315. ACM (2005)","DOI":"10.1145\/1102120.1102124"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: Sufficient conditions for vertical composition of security protocols. In: Proceedings of the 9th ACM Symposium on Information, Computer and Communications Security, ASIA CCS 2014, pp. 435\u2013446. ACM, New York (2014)","DOI":"10.1145\/2590296.2590330"},{"issue":"1","key":"10_CR32","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"MK Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transactions. ACM Trans. Inf. Syst. Secur. 1(1), 66\u201392 (1998)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"issue":"4","key":"10_CR33","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1109\/TIFS.2009.2033233","volume":"4","author":"PYA Ryan","year":"2009","unstructured":"Ryan, P.Y.A., Bismark, D., Heather, J., Schneider, S., Xia, Z.: Pr\u00eat \u00e0 voter: a voter-verifiable voting system. IEEE Trans. Inform. Forensics Secur. 4(4), 662\u2013673 (2009)","journal-title":"IEEE Trans. Inform. Forensics Secur."}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49635-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,15]],"date-time":"2022-06-15T19:43:49Z","timestamp":1655322229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49635-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662496343","9783662496350"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49635-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}