{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T12:03:53Z","timestamp":1730203433371,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/ccece.2018.8447762","type":"proceedings-article","created":{"date-parts":[[2018,8,30]],"date-time":"2018-08-30T21:54:56Z","timestamp":1535666096000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["A Theorem for Secrecy in Tagged Protocols Using the Theory of Witness-Functions"],"prefix":"10.1109","author":[{"given":"Jaouhar","family":"Fattahi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"363","author":"ramanujam","year":"2003","journal-title":"Tagging Makes Secrecy Decidable with Unbounded Nonces as Well"},{"key":"ref11","first-page":"67","volume":"333","author":"blanchet","year":"2005","journal-title":"Verification of cryptographic protocols tagging enforces termination"},{"key":"ref12","first-page":"86","article-title":"Using Horn Clauses for Analyzing Security Protocols","author":"blanchet","year":"2011","journal-title":"Formal Models and Techniques for Analyzing Security Protocols (V Cortier and S Kremer eds ) vol 5 of Cryptology and Information Security Series"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_9"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77050-3_29"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-662-49635-0_10","article-title":"Composing protocols with randomized actions","author":"bauer","year":"2016","journal-title":"Principles of Security and Trust"},{"key":"ref4","first-page":"34","article-title":"Secrecy by witness functions","volume":"1158","author":"fattahi","year":"2014","journal-title":"Proceedings of the Formal Methods for Security Workshop co-located with the PetriNets-2014 Conference Tunis Tunisia June 23rd 2014 (V Cortier and R Robbana eds )"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8123025"},{"journal-title":"From Type Theory to the Verification of Security Protocols","year":"2000","author":"mejri","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CSAC.1998.738652"},{"key":"ref8","article-title":"Relaxed conditions for secrecy in a role-based specification","volume":"abs 1801 8410","author":"fattahi","year":"2018","journal-title":"CoRR"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056650"},{"journal-title":"Analyse des Protocoles Cryptographiques par les Fonctions T&#x00E9;moins PhD thesis Universit&#x00E9; Laval Qu&#x00E9;bec Canada","year":"2016","author":"fattahi","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32525-5_1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2000.856942"}],"event":{"name":"2018 IEEE 31st Canadian Conference on Electrical & Computer Engineering (CCECE)","start":{"date-parts":[[2018,5,13]]},"location":"Quebec City, QC","end":{"date-parts":[[2018,5,16]]}},"container-title":["2018 IEEE Canadian Conference on Electrical &amp; Computer Engineering (CCECE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8426058\/8447529\/08447762.pdf?arnumber=8447762","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T15:40:51Z","timestamp":1643211651000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8447762\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ccece.2018.8447762","relation":{},"subject":[],"published":{"date-parts":[[2018,5]]}}}