{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:37:14Z","timestamp":1725514634332},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540693109"},{"type":"electronic","value":"9783540693116"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69311-6_27","type":"book-chapter","created":{"date-parts":[[2008,6,6]],"date-time":"2008-06-06T11:17:46Z","timestamp":1212751066000},"page":"252-263","source":"Crossref","is-referenced-by-count":0,"title":["Constraint Abstraction in Verification of Security Protocols"],"prefix":"10.1007","author":[{"given":"Ti","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhoujun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mengjun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/BFb0015258","volume-title":"Computer Science Today","author":"R.J. Anderson","year":"1995","unstructured":"Anderson, R.J., Needham, R.M.: Programming Satan\u2019s computer. In: van Leeuwen, J. (ed.) Computer Science Today. LNCS, vol.\u00a01000, pp. 426\u2013440. Springer, Heidelberg (1995)"},{"key":"27_CR2","unstructured":"Clark, J.A., Jacob, J.L.: A survey of authentication protocol literature. Technical Report 1.0 (1997)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Dolev, D., Yao, A.C.: On the security of public key protocols. Technical report, Stanford, CA, USA (1981)","DOI":"10.1109\/SFCS.1981.32"},{"issue":"2","key":"27_CR4","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 Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"suppl.2","key":"27_CR5","first-page":"534","volume":"43","author":"T. Zhou","year":"2006","unstructured":"Zhou, T., Li, M., Li, Z., Chen, H.: Verification of time sensitive security protocols based on the extended horn logic model. Chinese Journal of Computer Research and Development\u00a043(suppl.2), 534\u2013540 (2006)","journal-title":"Chinese Journal of Computer Research and Development"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Casper: A compiler for the analysis of security protocols. In: 10th IEEE Computer Security Foundations Workshop (CSFW-10), pp. 18\u201330 (1997)","DOI":"10.1109\/CSFW.1997.596779"},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: 10th IEEE Computer Security Foundations Workshop (CSFW-10), pp. 31\u201344 (1997)","DOI":"10.1109\/CSFW.1997.596782"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"Evans, N., Schneider, S.: Analysing time dependent security properties in CSP using PVS. In: ESORICS, pp. 222\u2013237 (2000)","DOI":"10.1007\/10722599_14"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-36575-3_9","volume-title":"Programming Languages and Systems","author":"R. Gorrieri","year":"2003","unstructured":"Gorrieri, R., Locatelli, E., Martinelli, F.: A Simple Language for Real-Time Cryptographic Protocol Analysis. In: Degano, P. (ed.) ESOP 2003 and ETAPS 2003. LNCS, vol.\u00a02618, pp. 114\u2013128. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"27_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.scico.2004.01.001","volume":"50","author":"R. Gorrieri","year":"2004","unstructured":"Gorrieri, R., Martinelli, F.: A simple framework for real-time cryptographic protocol analysis with compositional proof rules. Sci. Comput. Program.\u00a050(1-3), 23\u201349 (2004)","journal-title":"Sci. Comput. Program."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1029133.1029137","volume-title":"FMSE 2004: Proceedings of the 2004 ACM workshop on Formal methods in security engineering","author":"R. Corin","year":"2004","unstructured":"Corin, R., Etalle, S., Hartel, P.H., Mader, A.: Timed model checking of security protocols. In: FMSE 2004: Proceedings of the 2004 ACM workshop on Formal methods in security engineering, pp. 23\u201332. ACM Press, New York (2004)"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/978-3-540-24730-2_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G. Delzanno","year":"2004","unstructured":"Delzanno, G., Ganty, P.: Automatic Verification of Time Sensitive Cryptographic Protocols. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 342\u2013356. Springer, Heidelberg (2004)"},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/978-3-540-28644-8_12","volume-title":"CONCUR 2004 - Concurrency Theory","author":"L. Bozga","year":"2004","unstructured":"Bozga, L., Ene, C., Lakhnech, Y.: A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 177\u2013192. Springer, Heidelberg (2004)"},{"key":"27_CR14","doi-asserted-by":"crossref","unstructured":"Abadi, M., Blanchet, B.: Analyzing security protocols with secrecy types and logic programs. In: Symposium on Principles of Programming Languages, pp. 33\u201344 (2002)","DOI":"10.1145\/503272.503277"},{"key":"27_CR15","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: 14th IEEE Computer Security Foundations Workshop (CSFW-14), pp. 82\u201396 (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"key":"27_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/3-540-45789-5_25","volume-title":"Static Analysis","author":"B. Blanchet","year":"2002","unstructured":"Blanchet, B.: From Secrecy to Authenticity in Security Protocols. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 342\u2013359. Springer, Heidelberg (2002)"},{"issue":"9","key":"27_CR17","first-page":"1667","volume":"29","author":"M. Li","year":"2006","unstructured":"Li, M., Li, Z., Chen, H.: Security protocol\u2019s extended horn logic model and its verification method. Chinese Journal of Computers\u00a029(9), 1667\u20131678 (2006)","journal-title":"Chinese Journal of Computers"},{"issue":"4","key":"27_CR18","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1360\/jos170898","volume":"17","author":"M. Li","year":"2006","unstructured":"Li, M., Li, Z., Chen, H.: Spvt: An efficient verification tool for security protocol. Chinese Journal of Software\u00a017(4), 898\u2013906 (2006)","journal-title":"Chinese Journal of Software"},{"key":"27_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-540-73814-5_18","volume-title":"Frontiers in Algorithmics","author":"Z. Li","year":"2007","unstructured":"Li, Z., Zhou, T., Li, M., Chen, H.: Constraints Solution for Time Sensitive Security Protocols. In: Preparata, F.P., Fang, Q. (eds.) FAW 2007. LNCS, vol.\u00a04613, pp. 191\u2013203. Springer, Heidelberg (2007)"},{"key":"27_CR20","unstructured":"Delzanno, G.: Automatic of secrecy and authentication in unbound models of cryptographic protocols with fresh nonce generation and time-stamps(draft) (2003)"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69311-6_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:34:54Z","timestamp":1620016494000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69311-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540693109","9783540693116"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69311-6_27","relation":{},"subject":[]}}