{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:50:27Z","timestamp":1757314227870,"version":"3.37.3"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961415"},{"type":"electronic","value":"9783319961422"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96142-2_10","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T15:55:08Z","timestamp":1532102108000},"page":"117-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Model Checking Indistinguishability of Randomized Security Protocols"],"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":"A.","family":"Prasad Sistla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"10_CR1","unstructured":"https:\/\/github.com\/bauer-matthews\/SPAN"},{"key":"10_CR2","unstructured":"http:\/\/www.apfloat.org\/"},{"key":"10_CR3","unstructured":"https:\/\/github.com\/bauer-matthews\/SPAN\/tree\/master\/src\/test\/resources\/examples\/indistinguishability"},{"issue":"1\u20132","key":"10_CR4","doi-asserted-by":"crossref","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. Theor. Comput. Sci. 367(1\u20132), 2\u201332 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: ACM SIGPLAN Notices, vol. 36, pp. 104\u2013115. ACM (2001)","DOI":"10.1145\/360204.360213"},{"key":"10_CR6","unstructured":"Adida, B.: Helios: web-based open-audit voting. In: USENIX Security Symposium, vol. 17, pp. 335\u2013348 (2008)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: Computer Security Foundations, pp. 107\u2013121 (2010)","DOI":"10.1109\/CSF.2010.15"},{"issue":"1","key":"10_CR8","doi-asserted-by":"crossref","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. Int. J. Inf. Secur. 7(1), 3\u201332 (2008)","journal-title":"Int. J. Inf. Secur."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Basin, D., Dreier, J., Sasse, R.: Automated symbolic proofs of observational equivalence. In: Computer and Communications Security, pp. 1144\u20131155 (2015)","DOI":"10.1145\/2810103.2813662"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-49635-0_10","volume-title":"Principles of Security and Trust","author":"MS Bauer","year":"2016","unstructured":"Bauer, M.S., Chadha, R., Viswanathan, M.: Composing protocols with randomized actions. In: Piessens, F., Vigan\u00f2, L. (eds.) POST 2016. LNCS, vol. 9635, pp. 189\u2013210. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49635-0_10"},{"issue":"1","key":"10_CR11","doi-asserted-by":"crossref","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"},{"issue":"1","key":"10_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jlap.2007.06.002","volume":"75","author":"B Blanchet","year":"2008","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. J. Log. Algebraic Program. 75(1), 3\u201351 (2008)","journal-title":"J. Log. Algebraic Program."},{"key":"10_CR13","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Task-structured probabilistic I\/O automata. In: Discrete Event Systems (2006)"},{"key":"10_CR14","unstructured":"Castro, P.S., Panangaden, P., Precup, D.: Equivalence relations in fully and partially observable Markov decision processes. In: International Joint Conference on Artificial Intelligence, vol. 9, pp. 1653\u20131658 (2009)"},{"issue":"4","key":"10_CR15","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/2926715","volume":"17","author":"R Chadha","year":"2016","unstructured":"Chadha, R., Cheval, V., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocol. ACM Trans. Comput. Log. 17(4), 23 (2016)","journal-title":"ACM Trans. Comput. Log."},{"key":"10_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-28869-2_6","volume-title":"Programming Languages and Systems","author":"R Chadha","year":"2012","unstructured":"Chadha, R., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 108\u2013127. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-28869-2_6"},{"key":"10_CR17","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Model checking concurrent programs with nondeterminism and randomization. In: Foundations of Software Technology and Theoretical Computer Science, pp. 364\u2013375 (2010)"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Verification of randomized security protocols. In: Logic in Computer Science, pp. 1\u201312. IEEE (2017)","DOI":"10.1109\/LICS.2017.8005126"},{"key":"10_CR19","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. 4703, pp. 42\u201358. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74407-8_4"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/11555827_8","volume-title":"Computer Security \u2013 ESORICS 2005","author":"D Chaum","year":"2005","unstructured":"Chaum, D., Ryan, P.Y.A., Schneider, S.: A practical voter-verifiable election scheme. In: di Vimercati, S.C., Syverson, P., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol. 3679, pp. 118\u2013139. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11555827_8"},{"issue":"2","key":"10_CR21","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"DL Chaum","year":"1981","unstructured":"Chaum, D.L.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1981)","journal-title":"Commun. ACM"},{"key":"10_CR22","unstructured":"Cheung, L.: Reconciling nondeterministic and probabilistic choices. Ph.D. thesis, Radboud University of Nijmegen (2006)"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-54862-8_50","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V Cheval","year":"2014","unstructured":"Cheval, V.: APTE: an algorithm for proving trace equivalence. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 587\u2013592. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54862-8_50"},{"issue":"2","key":"10_CR24","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u0131-Oliet, N., Meseguer, J., Quesada, J.F.: Maude: specification and programming in rewriting logic. Theor. Comput. Sci. 285(2), 187\u2013243 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Cortier, V., Delaune, S.: A method for proving observational equivalence. In: Computer Security Foundations, pp. 266\u2013276. IEEE (2009)","DOI":"10.1109\/CSF.2009.9"},{"key":"10_CR26","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial-information policies is hard. Technical report (1999)"},{"key":"10_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1007\/978-3-319-63390-9_31","volume-title":"Computer Aided Verification","author":"C Dehnert","year":"2017","unstructured":"Dehnert, C., Junges, S., Katoen, J.-P., Volk, M.: A storm is coming: a modern probabilistic model checker. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 592\u2013600. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_31"},{"issue":"4","key":"10_CR28","doi-asserted-by":"crossref","first-page":"435","DOI":"10.3233\/JCS-2009-0340","volume":"17","author":"S Delaune","year":"2009","unstructured":"Delaune, S., Kremer, S., Ryan, M.: Verifying privacy-type properties of electronic voting protocols. J. Comput. Secur. 17(4), 435\u2013487 (2009)","journal-title":"J. Comput. Secur."},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Dingledine, R., Mathewson, N., Syverson, P.: Tor: the second-generation onion router. Technical report, DTIC Document (2004)","DOI":"10.21236\/ADA465464"},{"issue":"2","key":"10_CR30","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Trans. Inf. Theory 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"03","key":"10_CR31","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1142\/S0129054108005814","volume":"19","author":"L Doyen","year":"2008","unstructured":"Doyen, L., Henzinger, T.A., Raskin, J.-F.: Equivalence of labeled Markov chains. Found. Comput. Sci. 19(03), 549\u2013563 (2008)","journal-title":"Found. Comput. Sci."},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-662-54455-6_6","volume-title":"Principles of Security and Trust","author":"J Dreier","year":"2017","unstructured":"Dreier, J., Dum\u00e9nil, C., Kremer, S., Sasse, R.: Beyond subterm-convergent equational theories in automated verification of stateful protocols. In: Maffei, M., Ryan, M. (eds.) POST 2017. LNCS, vol. 10204, pp. 117\u2013140. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-54455-6_6"},{"issue":"2","key":"10_CR33","doi-asserted-by":"crossref","first-page":"247","DOI":"10.3233\/JCS-2004-12203","volume":"12","author":"N Durgin","year":"2004","unstructured":"Durgin, N., Lincoln, P., Mitchell, J., Scedrov, A.: Multiset rewriting and the complexity of bounded security protocols. Comput. Secur. 12(2), 247\u2013311 (2004)","journal-title":"Comput. Secur."},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-03829-7_1","volume-title":"Foundations of Security Analysis and Design V","author":"S Escobar","year":"2009","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties. In: Aldini, A., Barthe, G., Gorrieri, R. (eds.) FOSAD 2007-2009. LNCS, vol. 5705, pp. 1\u201350. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03829-7_1"},{"issue":"6","key":"10_CR35","doi-asserted-by":"crossref","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_CR36","unstructured":"Garcia, F.D., Van Rossum, P., Sokolova, A.: Probabilistic anonymity and admissible schedulers. arXiv preprint \narXiv:0706.1019\n\n (2007)"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-61996-8_37","volume-title":"Information Hiding","author":"DM Goldschlag","year":"1996","unstructured":"Goldschlag, D.M., Reed, M.G., Syverson, P.F.: Hiding routing information. In: Anderson, R. (ed.) IH 1996. LNCS, vol. 1174, pp. 137\u2013150. Springer, Heidelberg (1996). \nhttps:\/\/doi.org\/10.1007\/3-540-61996-8_37"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-540-24676-3_27","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P Golle","year":"2004","unstructured":"Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 456\u2013473. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-24676-3_27"},{"key":"10_CR39","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). \nhttps:\/\/doi.org\/10.1007\/978-3-540-76637-7_12"},{"key":"10_CR40","unstructured":"Gunter, C.A., Khanna, S., Tan, K., Venkatesh, S.S.: DoS protection for reliably authenticated broadcast. In: Network and Distributed System Security (2004)"},{"key":"10_CR41","doi-asserted-by":"crossref","unstructured":"Hirschi, L., Baelde, D., Delaune, S.: A method for verifying privacy-type properties: the unbounded case. In: Security and Privacy, pp. 564\u2013581 (2016)","DOI":"10.1109\/SP.2016.40"},{"key":"10_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/978-3-642-31424-7_51","volume-title":"Computer Aided Verification","author":"S Kiefer","year":"2012","unstructured":"Kiefer, S., Murawski, A.S., Ouaknine, J., Wachter, B., Worrell, J.: APEX: an analyzer for open probabilistic programs. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol. 7358, pp. 693\u2013698. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-31424-7_51"},{"key":"10_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. 3444, pp. 186\u2013200. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/978-3-540-31987-0_14"},{"key":"10_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"10_CR45","unstructured":"Lenhardt, R.: Probabilistic automata with parameters. Master\u2019s thesis (2009)"},{"issue":"1","key":"10_CR46","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/JSAC.2002.806125","volume":"21","author":"C Meadows","year":"2003","unstructured":"Meadows, C.: Formal methods for cryptographic protocol analysis: emerging issues and trends. IEEE J. Sel. Areas Commun. 21(1), 44\u201354 (2003)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"10_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-319-23165-5_22","volume-title":"Logic, Rewriting, and Concurrency","author":"C Meadows","year":"2015","unstructured":"Meadows, C.: Emerging issues and trends in formal methods in cryptographic protocol analysis: twelve years later. In: Mart\u00ed-Oliet, N., \u00d6lveczky, P.C., Talcott, C. (eds.) Logic, Rewriting, and Concurrency. LNCS, vol. 9200, pp. 475\u2013492. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23165-5_22"},{"key":"10_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-39799-8_48"},{"issue":"1","key":"10_CR49","doi-asserted-by":"crossref","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."},{"key":"10_CR50","unstructured":"Rivest, R.L.: The threeballot voting system (2006)"},{"key":"10_CR51","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. Ph.D. thesis, INRIA (2001)"},{"issue":"4","key":"10_CR52","doi-asserted-by":"crossref","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. Inf. Forensics Secur. 4(4), 662\u2013673 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"10_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-319-66402-6_12","volume-title":"Computer Security \u2013 ESORICS 2017","author":"MS Bauer","year":"2017","unstructured":"Bauer, M.S., Chadha, R., Viswanathan, M.: Modular verification of protocol equivalence in the presence of randomness. In: Foley, S.N., Gollmann, D., Snekkenes, E. (eds.) ESORICS 2017. LNCS, vol. 10492, pp. 187\u2013205. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-66402-6_12"},{"issue":"3","key":"10_CR54","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/MSP.2008.56","volume":"6","author":"AO Santin","year":"2008","unstructured":"Santin, A.O., Costa, R.G., Maziero, C.A.: A three-ballot-based secure electronic voting system. Secur. Priv. 6(3), 14\u201321 (2008)","journal-title":"Secur. Priv."},{"key":"10_CR55","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Meier, S., Cremers, C., Basin, D.: Automated analysis of Diffie-Hellman protocols and advanced security properties. In: Computer Security Foundations, pp. 78\u201394 (2012)","DOI":"10.1109\/CSF.2012.25"},{"key":"10_CR56","doi-asserted-by":"crossref","unstructured":"Shmatikov, V.: Probabilistic analysis of anonymity. In: Computer Security Foundations, pp. 119\u2013128. IEEE (2002)","DOI":"10.1109\/CSFW.2002.1021811"},{"issue":"2","key":"10_CR57","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0221017","volume":"21","author":"W-G Tzeng","year":"1992","unstructured":"Tzeng, W.-G.: A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM J. Comput. 21(2), 216\u2013227 (1992)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96142-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T15:59:46Z","timestamp":1532102386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96142-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961415","9783319961422"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96142-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}