{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T14:59:30Z","timestamp":1786978770451,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540283096","type":"print"},{"value":"9783540319344","type":"electronic"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"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":[[2005]]},"DOI":"10.1007\/11539452_17","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T09:54:50Z","timestamp":1127814890000},"page":"186-201","source":"Crossref","is-referenced-by-count":20,"title":["Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus"],"prefix":"10.1007","author":[{"given":"Andrew D.","family":"Gordon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Jeffrey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/324133.324266","volume":"46","author":"M. Abadi","year":"1999","unstructured":"Abadi, M.: Secrecy by typing in security protocols. J. ACM\u00a046(5), 749\u2013786 (1999)","journal-title":"J. ACM"},{"key":"17_CR2","first-page":"39","volume-title":"Foundations of Secure Computation","author":"M. Abadi","year":"2000","unstructured":"Abadi, M.: Security protocols and their properties. In: Foundations of Secure Computation, pp. 39\u201360. IOS Press, Amsterdam (2000)"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0304-3975(02)00863-0","volume":"298","author":"M. Abadi","year":"2003","unstructured":"Abadi, M., Blanchet, B.: Secrecy types for asymmetric communication. Theoretical Comput. Sci.\u00a0298(3), 387\u2013415 (2003)","journal-title":"Theoretical Comput. Sci."},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1145\/1044731.1044735","volume":"52","author":"M. Abadi","year":"2005","unstructured":"Abadi, M., Blanchet, B.: Analyzing Security Protocols with Secrecy Types and Logic Programs. Journal of the ACM\u00a052(1), 102\u2013146 (2005)","journal-title":"Journal of the ACM"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"242","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. 242\u2013259. Springer, Heidelberg (2002)"},{"key":"17_CR7","unstructured":"Boudol, G., Matos, A.: On declassification and the non-disclosure policy. In: 18th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2005) (to appear)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Bugliesi, M., Focardi, R., Maffei, M.: Authenticity by tagging and typing. In: Formal Methods in Security Engineering (FMSE 2004), pp. 1\u201312 (2004)","DOI":"10.1145\/1029133.1029135"},{"issue":"2","key":"17_CR9","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.ic.2004.08.003","volume":"196","author":"L. Cardelli","year":"2005","unstructured":"Cardelli, L., Ghelli, G., Gordon, A.D.: Secrecy and group creation. Information and Computation\u00a0196(2), 127\u2013155 (2005)","journal-title":"Information and Computation"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-31987-0_11","volume-title":"Programming Languages and Systems","author":"C. Fournet","year":"2005","unstructured":"Fournet, C., Gordon, A.D., Maffeis, S.: A type discipline for authorization policies. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 141\u2013156. Springer, Heidelberg (2005)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-36532-X_17","volume-title":"Software Security\u2014Theories and Systems","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Typing one-to-one and one-to-many correspondences in security protocols. In: Okada, M., Pierce, B.C., Scedrov, A., Tokuda, H., Yonezawa, A. (eds.) ISSS 2002. LNCS, vol.\u00a02609, pp. 270\u2013282. Springer, Heidelberg (2003)"},{"issue":"4","key":"17_CR12","doi-asserted-by":"crossref","first-page":"451","DOI":"10.3233\/JCS-2003-11402","volume":"11","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Authenticity by typing for security protocols. Journal of Computer Security\u00a011(4), 451\u2013521 (2003)","journal-title":"Journal of Computer Security"},{"issue":"3\/4","key":"17_CR13","first-page":"435","volume":"12","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Types and effects for asymmetric cryptographic protocols. Journal of Computer Security\u00a012(3\/4), 435\u2013484 (2003)","journal-title":"Journal of Computer Security"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0304-3975(02)00333-X","volume":"300","author":"A.D. Gordon","year":"2003","unstructured":"Gordon, A.D., Jeffrey, A.: Typing correspondence assertions for communication protocols. Theoretical Computer Science\u00a0300, 379\u2013409 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Gordon, A.D., Jeffrey, A.: Secrecy despite compromise: Types, cryptography, and the pi-calculus. Technical Report MSR\u2013TR\u20132005\u201376, Microsoft Research (2005)","DOI":"10.1007\/11539452_17"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45500-0_3","volume-title":"Theoretical Aspects of Computer Software","author":"D. Hoshina","year":"2001","unstructured":"Hoshina, D., Sumii, E., Yonezawa, A.: A typed process calculus for fine-grained resource access control in distributed computation. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 64\u201381. Springer, Heidelberg (2001)"},{"key":"17_CR17","unstructured":"Milner, R.: Communicating and Mobile Systems: the \u03c0-Calculus. CUP (1999)"},{"issue":"4","key":"17_CR18","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1145\/363516.363526","volume":"9","author":"A.C. Myers","year":"2000","unstructured":"Myers, A.C., Liskov, B.: Protecting privacy using the decentralized label model. ACM Transactions on Software Engineering and Methodology\u00a09(4), 410\u2013442 (2000)","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-60692-0_58","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Odersky","year":"1995","unstructured":"Odersky, M.: Polarized name passing. In: Thiagarajan, P.S. (ed.) FSTTCS 1995. LNCS, vol.\u00a01026, pp. 324\u2013335. Springer, Heidelberg (1995)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Riely, J., Hennessy, M.: Trust and partial typing in open systems of mobile agents. In: 26th ACM Symposium on Principles of Programming Languages, pp. 93\u2013104 (1999)","DOI":"10.1145\/292540.292551"},{"issue":"1","key":"17_CR21","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/JSAC.2002.806121","volume":"21","author":"A. Sabelfeld","year":"2003","unstructured":"Sabelfeld, A., Myers, A.C.: Language-based information-flow security. IEEE Journal on Selected Areas in Communications\u00a021(1), 5\u201319 (2003)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"17_CR22","unstructured":"Sabelfeld, A., Sands, D.: Dimensions and principles of declassification. In: 18th IEEE Computer Security Foundations Workshop. IEEE Computer Society Press, Los Alamitos (2005) (to appear)"},{"key":"17_CR23","unstructured":"Simonet, V.: The Flow Caml system: documentation and user\u2019s manual. Technical Report 0282, INRIA (2003)"},{"key":"17_CR24","unstructured":"Tse, S., Zdancewic, S.: Run-time principals in information-flow type systems. In: IEEE Computer Society Symposium on Research in Security and Privacy (2004)"}],"container-title":["Lecture Notes in Computer Science","CONCUR 2005 \u2013 Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11539452_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T16:35:09Z","timestamp":1558283709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11539452_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540283096","9783540319344"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11539452_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}