{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:30:41Z","timestamp":1761597041345},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678977"},{"type":"electronic","value":"9783540446187"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44618-4_27","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T10:38:51Z","timestamp":1188297531000},"page":"365-379","source":"Crossref","is-referenced-by-count":29,"title":["Secrecy and Group Creation"],"prefix":"10.1007","author":[{"given":"Luca","family":"Cardelli","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Ghelli","sequence":"additional","affiliation":[]},{"given":"Andrew D.","family":"Gordon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,21]]},"reference":[{"issue":"5","key":"27_CR1","doi-asserted-by":"crossref","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"M. Abadi. Secrecy by typing in security protocols. Journal of the ACM, 46(5):749\u2013786, September 1999.","journal-title":"Journal of the ACM"},{"key":"27_CR2","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proceedings FOSSACS\u201999","author":"M. Abadi","year":"1999","unstructured":"M. Abadi. Security protocols and specifications. In Proceedings FOSSACS\u201999, volume 1578 of LNCS, pages 1\u201313. Springer, 1999."},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"M. Abadi and A. D. Gordon. A calculus for cryptographic protocols: The spi calculus. Information and Computation, 148:1\u201370, 1999.","journal-title":"Information and Computation"},{"key":"27_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/BFb0055617","volume-title":"Proceedings Concur\u201998","author":"C. Bodei","year":"1998","unstructured":"C. Bodei, P. Degano, F. Nielson, and H. Nielson. Control flow analysis for the \u03c0-calculus. In Proceedings Concur\u201998, volume 1466 of LNCS, pages 84\u201398. Springer, 1998."},{"key":"27_CR5","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings TCS2000","author":"L. Cardelli","year":"2000","unstructured":"L. Cardelli, G. Ghelli, and A. D. Gordon. Ambient groups and mobility types. In Proceedings TCS2000, LNCS. Springer, 2000. To appear."},{"key":"27_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings MFCS2000","author":"S. D. Zilio","year":"2000","unstructured":"S. Dal Zilio and A. D. Gordon. Region analysis and a \u03c0-calculus with groups. In Proceedings MFCS2000, LNCS. Springer, 2000. To appear."},{"issue":"5","key":"27_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"D. Denning","year":"1976","unstructured":"D. Denning. A lattice model of secure information flow. Communications of the ACM, 19(5):236\u2013242, 1976.","journal-title":"Communications of the ACM"},{"issue":"12","key":"27_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"IC-29","author":"D. Dolev","year":"1983","unstructured":"D. Dolev and A. C. Yao. On the security of public key protocols. IEEE Transactions on Information Theory, IC-29(12):198\u2013208, 1983.","journal-title":"IEEE Transactions on Information Theory"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"S. J. Gay. A sort inference algorithm for the polyadic pi-calculus. In Proceedings POPL\u201993. ACM, 1993.","DOI":"10.1145\/158511.158701"},{"key":"27_CR10","unstructured":"R. Milner. Communicating and Mobile Systems: the \u03c0-Calculus. CUP, 1999."},{"key":"27_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Proc. FST & TCS","author":"M. Odersky","year":"1995","unstructured":"M. Odersky. Polarized name passing. In Proc. FST & TCS, LNCS. Springer, December 1995."},{"issue":"5","key":"27_CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1017\/S096012950007002X","volume":"6","author":"B. Pierce","year":"1996","unstructured":"B. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. Mathematical Structures in Computer Science, 6(5):409\u2013454, 1996.","journal-title":"Mathematical Structures in Computer Science"},{"key":"27_CR13","doi-asserted-by":"crossref","unstructured":"J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proceedings POPL\u201998, pages 378\u2013390. ACM, 1998.","DOI":"10.1145\/268946.268978"},{"key":"27_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/BFb0055094","volume-title":"Proceedings ICALP\u201998","author":"P. Sewell","year":"1998","unstructured":"P. Sewell. Global\/local subtyping and capability inference for a distributed \u03c0-calculus. In Proceedings ICALP\u201998, volume 1443 of LNCS, pages 695\u2013706. Springer, 1998."},{"issue":"2","key":"27_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1996.2613","volume":"132","author":"M. Tofte","year":"1997","unstructured":"M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109\u2013176, 1997.","journal-title":"Information and Computation"},{"key":"27_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1007\/3-540-57208-2_36","volume-title":"Proceedings Concur\u201993","author":"V. T. Vasconcelos","year":"1993","unstructured":"V. T. Vasconcelos and K. Honda. Principal typing-schemes in a polyadic \u03c0-calculus. In Proceedings Concur\u201993, volume 715 of LNCS, pages 524\u2013538. Springer, 1993."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2000 \u2014 Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44618-4_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,26]],"date-time":"2020-04-26T01:13:15Z","timestamp":1587863595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44618-4_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678977","9783540446187"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44618-4_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}