{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:27:05Z","timestamp":1729636025888,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1109\/ipdps.2008.4536556","type":"proceedings-article","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T12:44:52Z","timestamp":1212756292000},"page":"1-7","source":"Crossref","is-referenced-by-count":0,"title":["What is the best way to prove a cryptographic protocol correct?"],"prefix":"10.1109","author":[{"given":"Sreekanth","family":"Malladi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gurdeep S.","family":"Hura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24597-1_31"},{"key":"17","article-title":"extending constraint solving for cryptographic protocol analysis with non-standard attacker inference rules","author":"malladi","year":"2005","journal-title":"IASTED International Conference on Communication Network and Information Security (CNIS"},{"journal-title":"A simple constraint solving procedure for protocols with exclusive-or","year":"2004","author":"chevalier","key":"18"},{"key":"15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.3233\/JCS-2005-13106","article-title":"decidability of context-explicit security protocols","volume":"13","author":"ramanujam","year":"2005","journal-title":"Computers & Security"},{"journal-title":"Decidability of real-world context-explicit security protocols","year":"2007","author":"malladi","key":"16"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2003.1210066"},{"key":"14","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/CSFW.1999.779773","article-title":"athena: a new efficient automatic checker for security protocol analysis","author":"song","year":"1999","journal-title":"Proc 12th IEEE Computer Security Foundations Workshop"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1998.683158"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2000.856942"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00211-4"},{"key":"20","article-title":"the sizes of skeletons: security goals are decidable","author":"guttman","year":"2006","journal-title":"Mitre Technical Report"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028390"},{"key":"1","first-page":"85128","article-title":"the inductive approach to verifying cryptographic protocols","volume":"6","author":"paulson","year":"1998","journal-title":"Computers & Security"},{"key":"10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-68339-9_1","article-title":"low-exponent rsa with related messages","volume":"1070","author":"coppersmith","year":"1996","journal-title":"Lecture Notes in Computer Science"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.2000.856934"},{"key":"6","first-page":"160","article-title":"strand spaces: why is a security protocol correct?","author":"thayer","year":"1998","journal-title":"Proc IEEE Symposium on Research in Security and Privacy"},{"key":"5","first-page":"162","article-title":"equal to the task?","author":"heather","year":"2002","journal-title":"Proc European Symp Research in Computer Security (ESORICS)"},{"key":"4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.3233\/JCS-2003-11203","article-title":"first-order verification of cryptographic protocols","volume":"11","author":"cohen","year":"2003","journal-title":"Computers & Security"},{"year":"0","key":"9"},{"key":"8","first-page":"166","article-title":"constraint solving for bounded-process cryptographic protocol analysis","author":"millen","year":"2001","journal-title":"Proc ACM Conference on Computer and Communication Security"}],"event":{"name":"Distributed Processing Symposium (IPDPS)","start":{"date-parts":[[2008,4,14]]},"location":"Miami, FL, USA","end":{"date-parts":[[2008,4,18]]}},"container-title":["2008 IEEE International Symposium on Parallel and Distributed Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4519061\/4536075\/04536556.pdf?arnumber=4536556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T04:55:18Z","timestamp":1497761718000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4536556\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,4]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/ipdps.2008.4536556","relation":{},"ISSN":["1530-2075"],"issn-type":[{"type":"print","value":"1530-2075"}],"subject":[],"published":{"date-parts":[[2008,4]]}}}