{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:51:53Z","timestamp":1725490313752},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738138"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73814-5_18","type":"book-chapter","created":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T05:31:44Z","timestamp":1188624704000},"page":"191-203","source":"Crossref","is-referenced-by-count":1,"title":["Constraints Solution for Time Sensitive Security Protocols"],"prefix":"10.1007","author":[{"given":"Zhoujun","family":"Li","sequence":"first","affiliation":[]},{"given":"Ti","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Mengjun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Huowang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"Suppl.2","key":"18_CR1","first-page":"534","volume":"43","author":"T. Zhou","year":"2006","unstructured":"Zhou, T., Li, M.: 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":"18_CR2","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":"18_CR3","doi-asserted-by":"crossref","unstructured":"Lowe, G.: A hierarchy of authentication specifications. In: 10th IEEE Computer Security Foundations Workshop (CSFW-10)","DOI":"10.1109\/CSFW.1997.596782"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/10722599_14","volume-title":"Computer Security - ESORICS 2000","author":"N. Evans","year":"2000","unstructured":"Evans, N., Schneider, S.: Analysing time dependent security properties in csp using pvs. In: Cuppens, F., Deswarte, Y., Gollmann, D., Waidner, M. (eds.) ESORICS 2000. LNCS, vol.\u00a01895, pp. 222\u2013237. Springer, Heidelberg (2000)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 crypto- graphic protocol analysis. In: Degano, P. (ed.) ESOP 2003 and ETAPS 2003. LNCS, vol.\u00a02618, pp. 114\u2013128. Springer, Heidelberg (2003)"},{"issue":"1-3","key":"18_CR6","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 proto- col analysis with compositional proof rules. Sci. Comput. Program.\u00a050(1-3), 23\u201349 (2004)","journal-title":"Sci. Comput. Program."},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/1029133.1029137","volume-title":"FMSE 2004","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, USA (2004)"},{"key":"18_CR8","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":"18_CR9","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 (extended abstract). In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 177\u2013192. Springer, Heidelberg (2004)"},{"key":"18_CR10","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":"18_CR11","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":"18_CR12","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":"4","key":"18_CR13","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1360\/jos170898","volume":"17","author":"M. Li","year":"2006","unstructured":"Li, M., Li, Z., H.C.: Spvt: An efficient verification tool for security protocol. Chinese Journal of Software\u00a017(4), 898\u2013906 (2006)","journal-title":"Chinese Journal of Software"},{"issue":"9","key":"18_CR14","first-page":"1667","volume":"29","author":"M. Li","year":"2006","unstructured":"Li, M., Li, Z., H.C.: 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"},{"key":"18_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley and Sons, Chichester (1986)"},{"key":"18_CR16","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge, Massachusetts (2001)","edition":"2"},{"issue":"6","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1313","DOI":"10.1137\/S0097539791256325","volume":"23","author":"E. Cohen","year":"1994","unstructured":"Cohen, E., Megiddo, N.: Improved algorithms for linear inequalities with two variables per inequality. SIAM J. Comput.\u00a023(6), 1313\u20131347 (1994)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"18_CR18","doi-asserted-by":"publisher","first-page":"1179","DOI":"10.1137\/S0097539793251876","volume":"23","author":"D.S. Hochbaum","year":"1994","unstructured":"Hochbaum, D.S., Naor, J.: Simple and fast algorithms for linear and integer pro- grams with two variables per inequality. SIAM J. Comput.\u00a023(6), 1179\u20131192 (1994)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"18_CR19","first-page":"41","volume":"17","author":"B. Shuang-yan","year":"1999","unstructured":"Shuang-yan, B., Jin-mei, G., Q.M.: An algorithm and example of solution to primary oriented circuits in a digraph. Journal of Changchun post and telecom- munication institute\u00a017(2), 41\u201345 (1999)","journal-title":"Journal of Changchun post and telecom- munication institute"},{"key":"18_CR20","unstructured":"Sewell, P.: Applied \u03c0\u2013 a brief tutorial. Technical Report UCAM-CL-TR-498, Computer Laboratory, University of Cambridge, p. 65 (2000)"}],"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-73814-5_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:00:21Z","timestamp":1619517621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73814-5_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738138"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73814-5_18","relation":{},"subject":[]}}