{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T22:40:02Z","timestamp":1750804802115,"version":"3.41.0"},"publisher-location":"Cham","reference-count":56,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319664019"},{"type":"electronic","value":"9783319664026"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66402-6_12","type":"book-chapter","created":{"date-parts":[[2017,8,11]],"date-time":"2017-08-11T13:44:11Z","timestamp":1502459051000},"page":"187-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modular Verification of Protocol Equivalence in the Presence of Randomness"],"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","published-online":{"date-parts":[[2017,8,12]]},"reference":[{"issue":"3","key":"12_CR1","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1145\/373243.360213","volume":"36","author":"M Abadi","year":"2001","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. ACM SIGPLAN Not. 36(3), 104\u2013115 (2001)","journal-title":"ACM SIGPLAN Not."},{"issue":"2\u20134","key":"12_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. Inf. Comput. 206(2\u20134), 425\u2013459 (2008)","journal-title":"Inf. Comput."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Cheval, V., Delaune, S.: Verifying privacy-type properties in a modular way. In: CSF, pp. 95\u2013109 (2012)","DOI":"10.1109\/CSF.2012.16"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/978-3-662-46666-7_17","volume-title":"Principles of Security and Trust","author":"M Arapinis","year":"2015","unstructured":"Arapinis, M., Cheval, V., Delaune, S.: Composing security protocols: from confidentiality to privacy. In: Focardi, R., Myers, A. (eds.) POST 2015. LNCS, vol. 9036, pp. 324\u2013343. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46666-7_17"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: CSF, pp. 107\u2013121 (2010)","DOI":"10.1109\/CSF.2010.15"},{"key":"12_CR6","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). doi:10.1007\/978-3-540-89439-1_9"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Basin, D., Dreier, J., Sasse, R.: Automated symbolic proofs of observational equivalence. In: CCS, pp. 1144\u20131155 (2015)","DOI":"10.1145\/2810103.2813662"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Baudet, M.: Deciding security of protocols against off-line guessing attacks. In: CCS, pp. 16\u201325 (2005)","DOI":"10.1145\/1102120.1102125"},{"key":"12_CR9","unstructured":"Bauer, M.S., Chadha, R., Viswanathan, M.: Modular verification of protocol equivalence in the presence of randomness. http:\/\/hdl.handle.net\/2142\/96261"},{"key":"12_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). doi:10.1007\/978-3-662-49635-0_10"},{"issue":"1","key":"12_CR11","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. Theor. 36(1), 40\u201346 (1990)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. In: LICS, pp. 331\u2013340 (2005)","DOI":"10.1109\/LICS.2005.8"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"12_CR14","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":"12_CR15","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.: 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). doi:10.1007\/11681878_20"},{"key":"12_CR16","unstructured":"Chadha, R., Sistla, A., Viswanathan, M.: Model checking concurrent programs with nondeterminism and randomization. In: FSTTCS, pp. 364\u2013375 (2010)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Chadha, R., Sistla, A.P., Viswanathan, M.: Verification of randomized security protocols. In: LICS (2017)","DOI":"10.1109\/LICS.2017.8005126"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ic.2009.06.006","volume":"208","author":"K Chatzikokolakis","year":"2010","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. Inf. Comput. 208, 694\u2013715 (2010)","journal-title":"Inf. Comput."},{"issue":"1","key":"12_CR19","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"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","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":"12_CR21","unstructured":"Cheung, L.: Reconciling nondeterministic and probabilistic choices. Ph.D. thesis, Radboud University of Nijmegen (2006)"},{"key":"12_CR22","unstructured":"Chevalier, C., Delaune, S., Kremer, S.: Transforming password protocols to compose. In: FSTTCS, pp. 204\u2013216 (2011)"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10817-010-9199-5","volume":"48","author":"Y Chevalier","year":"2010","unstructured":"Chevalier, Y., Rusinowitch, M.: Decidability of equivalence of symbolic derivations. J. Autom. Reasoning 48, 263\u2013292 (2010)","journal-title":"J. Autom. Reasoning"},{"key":"12_CR24","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). doi:10.1007\/978-3-540-77050-3_29"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Cortier, V., Delaune, S.: A method for proving observational equivalence. In: CSF, pp. 266\u2013276 (2009)","DOI":"10.1109\/CSF.2009.9"},{"issue":"1","key":"12_CR26","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 Syst. Des. 34(1), 1\u201336 (2009)","journal-title":"Formal Methods Syst. Des."},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Ciob\u00e2c\u0103, \u015e., Cortier, V.: Protocol composition for arbitrary primitives. In: CSF, pp. 322\u2013336 (2010)","DOI":"10.1109\/CSF.2010.29"},{"issue":"3","key":"12_CR28","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":"12_CR29","unstructured":"de Alfaro, L.: The verification of probabilistic systems under memoryless partial information policies is hard. In: PROBMIV (1999)"},{"issue":"4","key":"12_CR30","doi-asserted-by":"publisher","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":"12_CR31","doi-asserted-by":"crossref","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Composition of password-based protocols. In: CSF, pp. 239\u2013251 (2008)","DOI":"10.1109\/CSF.2008.6"},{"key":"12_CR32","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":"12_CR33","doi-asserted-by":"publisher","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. Theor. 29(2), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR34","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). doi:10.1007\/978-3-662-54455-6_6"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: Maude-NPA: cryptographic protocol analysis modulo equational properties, pp. 1\u201350 (2009)","DOI":"10.1007\/978-3-642-03829-7_1"},{"issue":"6","key":"12_CR36","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":"12_CR37","unstructured":"Garcia, F., van Rossum, P., Sokolova, A.: Probabilistic Anonymity and Admissible Schedulers. CoRR, abs\/0706.1019 (2007)"},{"key":"12_CR38","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). doi:10.1007\/3-540-61996-8_37"},{"key":"12_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). doi:10.1007\/978-3-540-76637-7_12"},{"key":"12_CR40","unstructured":"Gunter, C.A., Khanna, S., Tan, K., Venkatesh, S.S.: Dos protection for reliably authenticated broadcast. In: NDSS (2004)"},{"issue":"3\u20134","key":"12_CR41","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":"12_CR42","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: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 303\u2013317. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-00596-1_22"},{"key":"12_CR43","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: CCS, pp. 2\u201315 (2005)","DOI":"10.1145\/1102120.1102124"},{"key":"12_CR44","doi-asserted-by":"crossref","unstructured":"Hirschi, L., Baelde, D., Delaune, S.: A method for verifying privacy-type properties: the unbounded case. In: SP, pp. 564\u2013581 (2016)","DOI":"10.1109\/SP.2016.40"},{"key":"12_CR45","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes, vol. 178 (1985)"},{"key":"12_CR46","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Prism: probabilistic symbolic model checker. In: International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pp. 200\u2013204 (2002)","DOI":"10.1007\/3-540-46029-2_13"},{"issue":"1","key":"12_CR47","doi-asserted-by":"publisher","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":"12_CR48","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). doi:10.1007\/978-3-319-23165-5_22"},{"key":"12_CR49","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L.: Sufficient conditions for vertical composition of security protocols. In: CCS, pp. 435\u2013446 (2014)","DOI":"10.1145\/2590296.2590330"},{"key":"12_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-46885-4_37","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"B Pfitzmann","year":"1990","unstructured":"Pfitzmann, B., Pfitzmann, A.: How to break the direct RSA-implementation of mixes. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 373\u2013381. Springer, Heidelberg (1990). doi:10.1007\/3-540-46885-4_37"},{"issue":"1","key":"12_CR51","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. TISSEC 1(1), 66\u201392 (1998)","journal-title":"TISSEC"},{"key":"12_CR52","doi-asserted-by":"crossref","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with finite number of sessions is NP-complete. In: CSFW, pp. 174\u2013190 (2001)","DOI":"10.1109\/CSFW.2001.930145"},{"issue":"4","key":"12_CR53","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. Inf. Forensics Secur. 4(4), 662\u2013673 (2009)","journal-title":"IEEE Trans. Inf. Forensics Secur."},{"key":"12_CR54","doi-asserted-by":"crossref","unstructured":"Schmidt, B., Meier, S., Cremers, C., Basin, D.: Automated analysis of diffie-hellman protocols and advanced security properties. In: CSF, pp. 78\u201394 (2012)","DOI":"10.1109\/CSF.2012.25"},{"key":"12_CR55","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 \u2014 ESORICS 96","author":"S Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: Bertino, E., Kurth, H., Martella, G., Montolivo, E. (eds.) ESORICS 1996. LNCS, vol. 1146, pp. 198\u2013218. Springer, Heidelberg (1996). doi:10.1007\/3-540-61770-1_38"},{"issue":"3\u20134","key":"12_CR56","doi-asserted-by":"publisher","first-page":"355","DOI":"10.3233\/JCS-2004-123-403","volume":"12","author":"V Shmatikov","year":"2004","unstructured":"Shmatikov, V.: Probabilistic analysis of an anonymity system. J. Comput. Secur. 12(3\u20134), 355\u2013377 (2004)","journal-title":"J. Comput. Secur."}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66402-6_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T21:59:52Z","timestamp":1750802392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66402-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319664019","9783319664026"],"references-count":56,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66402-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"12 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Oslo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Norway","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/deic.uab.cat\/conferences\/dpm\/dpm2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}