{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:40:31Z","timestamp":1725518431478},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540710691"},{"type":"electronic","value":"9783540710707"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-71070-7_9","type":"book-chapter","created":{"date-parts":[[2008,8,29]],"date-time":"2008-08-29T05:56:30Z","timestamp":1219989390000},"page":"116-131","source":"Crossref","is-referenced-by-count":2,"title":["Proving Group Protocols Secure Against Eavesdroppers"],"prefix":"10.1007","author":[{"given":"Steve","family":"Kremer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Mercier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ralf","family":"Treinen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/3-540-36288-6_12","volume-title":"Public Key Cryptography - PKC 2003","author":"C. Boyd","year":"2002","unstructured":"Boyd, C., Gonz\u00e1lez Nieto, J.-M.: Round-optimal ciontributory conference key agreement. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 161\u2013174. Springer, Heidelberg (2002)"},{"issue":"17","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1730","DOI":"10.1016\/j.comcom.2004.05.023","volume":"27","author":"E. Bresson","year":"2004","unstructured":"Bresson, E., Chevassut, O., Essiari, A., Pointcheval, D.: Mutual authentication and group key agreement for low-power mobile devices. Computer Communications\u00a027(17), 1730\u20131737 (2004)","journal-title":"Computer Communications"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-71389-0_13","volume-title":"Foundations of Software Science and Computational Structures","author":"H. Comon-Lundh","year":"2007","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, vol.\u00a04423, pp. 168\u2013182. Springer, Heidelberg (2007)"},{"doi-asserted-by":"crossref","unstructured":"Comon-Lundh, H., Jacquemard, F., Perrin, N.: Visibly tree automata with memory and constraints. Research Report LSV-07-30, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France, Logical Methods in Computer Science (September 2007) (to appear)","key":"9_CR4","DOI":"10.2168\/LMCS-4(2:8)2008"},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/LICS.2003.1210067","volume-title":"Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003)","author":"H. Comon-Lundh","year":"2003","unstructured":"Comon-Lundh, H., Shmatikov, V.: Intruder deductions, constraint solving and insecurity decision in presence of exclusive or. In: Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), vol.\u00a0171, pp. 271\u2013280. IEEE Computer Society Press, Los Alamitos (2003)"},{"unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: The CiME Rewrite Tool (2000), \n                    \n                      http:\/\/cime.lri.fr","key":"9_CR6"},{"issue":"1-2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. Symb. Comput.\u00a03(1-2), 69\u2013116 (1987)","journal-title":"J. Symb. Comput."},{"issue":"2","key":"9_CR8","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.C.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1007\/3-540-45591-4_134","volume-title":"Parallel and Distributed Processing Symposium (IPDPS 2000)","author":"J. Goubault-Larrecq","year":"2000","unstructured":"Goubault-Larrecq, J.: A method for automatic cryptographic protocol verification (extended abstract). In: IPDPS-WS 2000. LNCS, vol.\u00a01800, pp. 977\u2013984. Springer, Heidelberg (2000)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1007\/978-3-540-45146-4_7","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Katz","year":"2003","unstructured":"Katz, J., Yung, M.: Scalable protocols for authenticated group key exchange. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 110\u2013125. Springer, Heidelberg (2003)"},{"unstructured":"Kremer, S., Mercier, A., Treinen, R.: Proving group protocols secure against eavesdroppers. Research Report LSV, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan, France (May 2008), \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/Publis\/RAPPORTS_LSV\/rapports.php?filename=lsv-2008","key":"9_CR11"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70918-3_55","volume-title":"STACS 2007","author":"R. K\u00fcsters","year":"2007","unstructured":"K\u00fcsters, R., Truderung, T.: On the Automatic Analysis of Recursive Security Protocols with XOR. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393. Springer, Heidelberg (2007)"},{"issue":"4","key":"9_CR13","doi-asserted-by":"crossref","first-page":"555","DOI":"10.3233\/JCS-2003-11404","volume":"11","author":"O. Pereira","year":"2003","unstructured":"Pereira, O., Quisquater, J.-J.: Some attacks upon authenticated group key agreement protocols. Journal of Computer Security\u00a011(4), 555\u2013580 (2003)","journal-title":"Journal of Computer Security"},{"issue":"2","key":"9_CR14","doi-asserted-by":"crossref","first-page":"197","DOI":"10.3233\/JCS-2006-14204","volume":"14","author":"O. Pereira","year":"2006","unstructured":"Pereira, O., Quisquater, J.-J.: On the impossibility of building secure cliques-type authenticated group key agreement protocols. Journal of Computer Security\u00a014(2), 197\u2013246 (2006)","journal-title":"Journal of Computer Security"},{"issue":"1-2","key":"9_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s10817-005-9016-8","volume":"36","author":"G. Steel","year":"2006","unstructured":"Steel, G., Bundy, A.: Attacking group protocols by refuting incorrect inductive conjectures. Journal of Automated Reasoning\u00a036(1-2), 149\u2013176 (2006)","journal-title":"Journal of Automated Reasoning"},{"doi-asserted-by":"crossref","unstructured":"Steiner, M., Tsudik, G., Waidner, M.: Diffie-Hellman key distribution extended to group communication. In: ACM Conference on Computer and Communications Security, pp. 31\u201337 (1996)","key":"9_CR16","DOI":"10.1145\/238168.238182"},{"key":"9_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/11539452_19","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"T. Truderung","year":"2005","unstructured":"Truderung, T.: Selecting theories and recursive protocols. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 217\u2013232. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71070-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:35:24Z","timestamp":1558265724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71070-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540710691","9783540710707"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71070-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}