{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:36:21Z","timestamp":1761251781640},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030236786"},{"type":"electronic","value":"9783030236793"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-23679-3_5","type":"book-chapter","created":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:02:38Z","timestamp":1562526158000},"page":"58-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Dolev-Yao Theory with Associative Blindpair Operators"],"prefix":"10.1007","author":[{"given":"A.","family":"Baskar","sequence":"first","affiliation":[]},{"given":"R.","family":"Ramanujam","sequence":"additional","affiliation":[]},{"given":"S. P.","family":"Suresh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,26]]},"reference":[{"issue":"1\u20132","key":"5_CR1","doi-asserted-by":"publisher","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). \n                      https:\/\/doi.org\/10.1016\/j.tcs.2006.08.032","journal-title":"Theor. Comput. Sci."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jsc.2016.07.009","volume":"80","author":"T Avanesov","year":"2017","unstructured":"Avanesov, T., Chevalier, Y., Rusinowitch, M., Turuani, M.: Satisfiability of general intruder constraints with and without a set constructor. J. Symbolic Comput. 80, 27\u201361 (2017). \n                      https:\/\/doi.org\/10.1016\/j.jsc.2016.07.009","journal-title":"J. Symbolic Comput."},{"key":"5_CR3","unstructured":"Baskar, A.: Decidability results for extended Dolev-Yao theories. Ph.D. thesis, Chennai Mathematical Institute (2011)"},{"key":"5_CR4","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.: Dolev-Yao theory with associative blindpair operators, Technical report (2019). \n                      http:\/\/www.cmi.ac.in\/~spsuresh\/pdfs\/ciaa19-tr.pdf"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: Knowledge-based modelling of voting protocols. In: Samet, D. (ed.) TARK 2007, pp. 62\u201371 (2007). \n                      https:\/\/doi.org\/10.1145\/1324249.1324261","DOI":"10.1145\/1324249.1324261"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-15155-2_11","volume-title":"Mathematical Foundations of Computer Science 2010","author":"A Baskar","year":"2010","unstructured":"Baskar, A., Ramanujam, R., Suresh, S.P.: A dexptime-complete Dolev-Yao theory with distributive encryption. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol. 6281, pp. 102\u2013113. Springer, Heidelberg (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-15155-2_11"},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10817-010-9197-7","volume":"48","author":"S Ciob\u00e2ca","year":"2012","unstructured":"Ciob\u00e2ca, S., Delaune, S., Kremer, S.: Computing knowledge in security protocols under convergent equational theories. J. Autom. Reason. 48(2), 219\u2013262 (2012). \n                      https:\/\/doi.org\/10.1007\/s10817-010-9197-7","journal-title":"J. Autom. Reason."},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: LICS 2003, pp. 271\u2013280. IEEE Computer Society (2003). \n                      https:\/\/doi.org\/10.1109\/LICS.2003.1210067","DOI":"10.1109\/LICS.2003.1210067"},{"issue":"4","key":"5_CR9","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10817-010-9208-8","volume":"48","author":"V Cortier","year":"2012","unstructured":"Cortier, V., Delaune, S.: Decidability and combination results for two notions of knowledge in security protocols. J. Autom. Reason. 48(4), 441\u2013487 (2012). \n                      https:\/\/doi.org\/10.1007\/s10817-010-9208-8","journal-title":"J. Autom. Reason."},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3233\/JCS-2006-14101","volume":"14","author":"V\u00e9ronique Cortier","year":"2006","unstructured":"Cortier, V., Delaune, S., Lafourcade, P.: A survey of algebraic properties used in cryptographic protocols. J. Comput. Secur. 14(1), 1\u201343 (2006). \n                      http:\/\/content.iospress.com\/articles\/journal-of-computer-security\/jcs244","journal-title":"Journal of Computer Security"},{"issue":"2","key":"5_CR11","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. Theory 29(2), 198\u2013207 (1983). \n                      https:\/\/doi.org\/10.1109\/TIT.1983.1056650","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"5_CR12","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1016\/j.ic.2006.10.008","volume":"205","author":"P Lafourcade","year":"2007","unstructured":"Lafourcade, P., Lugiez, D., Treinen, R.: Intruder deduction for the equational theory of Abelian groups with distributive encryption. Inf. Comput. 205(4), 581\u2013623 (2007). \n                      https:\/\/doi.org\/10.1016\/j.ic.2006.10.008","journal-title":"Inf. Comput."},{"issue":"1\u20133","key":"5_CR13","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"299","author":"M Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions and composed keys is NP-complete. Theor. Comput. Sci. 299(1\u20133), 451\u2013475 (2003). \n                      https:\/\/doi.org\/10.1016\/S0304-3975(02)00490-5","journal-title":"Theor. Comput. Sci."},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/11901914_13","volume-title":"Automated Technology for Verification and Analysis","author":"D Suwimonteerabuth","year":"2006","unstructured":"Suwimonteerabuth, D., Schwoon, S., Esparza, J.: Efficient algorithms for alternating pushdown systems with an application to the computation of certificate chains. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol. 4218, pp. 141\u2013153. Springer, Heidelberg (2006). \n                      https:\/\/doi.org\/10.1007\/11901914_13"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23679-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,7]],"date-time":"2019-07-07T19:11:11Z","timestamp":1562526671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-23679-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030236786","9783030236793"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23679-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ko\u0161ice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/im.saske.sk\/ciaa2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"61% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.89","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.625","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}