{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T16:05:41Z","timestamp":1790006741530,"version":"4.0.1"},"reference-count":35,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005126","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-12","source":"Crossref","is-referenced-by-count":9,"title":["Verification of randomized security protocols"],"prefix":"10.1109","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. Prasad","family":"Sistla","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0340"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2015.19"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2926715"},{"key":"ref30","first-page":"696","article-title":"The TAMARIN prover for the symbolic analysis of security protocols","author":"meier","year":"2013","journal-title":"25th InternationalConference on Computer Aided Verification"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1872-2_6"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1656242.1656244"},{"key":"ref10","article-title":"Probabilistic Anonymity and Admissible Schedulers","volume":"abs 706 1019","author":"garcia","year":"2007","journal-title":"CoRR"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2009.06.006"},{"key":"ref12","first-page":"364","article-title":"Model checking concurrent programs with nondeterminism and randomization","author":"chadha","year":"2010","journal-title":"Conference on Foundations of Software Technology and Theory of Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49635-0_10"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/360204.360213"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2001.930145"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90027-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2009.9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2017.8005126"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.7146\/brics.v9i25.21741"},{"key":"ref28","first-page":"281","article-title":"The AVISPA tool for the automated validation of internet security protocols and applications","author":"armando","year":"2005","journal-title":"17th International Conference on Computer Aided Verification ser Lecture Notes in Computer Science"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2009.2033233"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2005.8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/293411.293443"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2004-12203"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/978-3-540-70545-1_38","article-title":"The Scyther tool: Verification, falsification, and analysis of security protocols","author":"cremers","year":"2008","journal-title":"20th InternationalConference on Computer Aided Verification"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.42"},{"key":"ref8","author":"cheung","year":"2006","journal-title":"Reconciling nondeterministic and probabilistic choices"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.09.036"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/290163.290168"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2006.1678432"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00206326"},{"key":"ref20","first-page":"16","article-title":"Deciding security of protocols against off-line guessing attacks","author":"baudet","year":"2005","journal-title":"Proc 12th Conference on Computerand Communications Security"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14203-1_35"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CSF.2010.28"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-010-9199-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046744"},{"key":"ref26","first-page":"1","article-title":"Maude-NPA: Cryptographic protocol analysis modulo equational properties","volume":"5705","author":"escobar","year":"2009","journal-title":"Foundations of Security Analysis and Design V ser Lecture Notes in Computer Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.08.032"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005126.pdf?arnumber=8005126","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T07:39:18Z","timestamp":1570001958000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005126\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":35,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005126","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}