{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:46:38Z","timestamp":1755035198724},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281931"},{"type":"electronic","value":"9783540318736"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11537311_32","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T14:00:06Z","timestamp":1127829606000},"page":"365-377","source":"Crossref","is-referenced-by-count":31,"title":["A Type System for Computationally Secure Information Flow"],"prefix":"10.1007","author":[{"given":"Peeter","family":"Laud","sequence":"first","affiliation":[]},{"given":"Varmo","family":"Vene","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_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. Journal of the ACM\u00a046, 749\u2013786 (1999)","journal-title":"Journal of the ACM"},{"key":"32_CR2","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 Computer Science\u00a0298, 387\u2013415 (2003)","journal-title":"Theoretical Computer Science"},{"key":"32_CR3","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.: A Calculus for Cryptographic Protocols: The Spi Calculus. Information and Computation\u00a0148, 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"32_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/3-540-45500-0_4","volume-title":"proc. of TACS 2001","author":"M. Abadi","year":"2001","unstructured":"Abadi, M., J\u00fcrjens, J.: Formal Eavesdropping and Its Computational Interpretation. In: Kobayashi, N., Pierce, B.C. (eds.) TACS 2001. LNCS, vol.\u00a02215, pp. 82\u201394. Springer, Heidelberg (2001)"},{"key":"32_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-44929-9_1","volume-title":"proc. of the International Conference IFIP TCS 2000","author":"M. Abadi","year":"2000","unstructured":"Abadi, M., Rogaway, P.: Reconciling Two Views of Cryptography (The Computational Soundness of Formal Encryption). In: Watanabe, O., Hagiya, M., Ito, T., van Leeuwen, J., Mosses, P.D. (eds.) TCS 2000. LNCS, vol.\u00a01872, pp. 3\u201322. Springer, Heidelberg (2000)"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B.: Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library. In: Proc. of CSFW 2004, pp. 204\u2013218 (2004)","DOI":"10.1109\/CSFW.2004.1310742"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: Proc. of FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"D. Denning","year":"1976","unstructured":"Denning, D.: A Lattice Model of Secure Information Flow. Communications of the ACM\u00a019, 236\u2013243 (1976)","journal-title":"Communications of the ACM"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D. Denning","year":"1977","unstructured":"Denning, D., Denning, P.: Certification of Programs for Secure Information Flow. Communications of the ACM\u00a020, 504\u2013513 (1977)","journal-title":"Communications of the ACM"},{"key":"32_CR10","doi-asserted-by":"crossref","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\u00a0IT-29, 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory IT-"},{"key":"32_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/3-540-45309-1_6","volume-title":"proc of. ESOP 2001","author":"P. Laud","year":"2001","unstructured":"Laud, P.: Semantics and Program Analysis of Computationally Secure Information Flow. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 77\u201391. Springer, Heidelberg (2001)"},{"key":"32_CR12","unstructured":"Laud, P.: Encryption Cycles and Two Views of Cryptography. In: Proc. of Nordsec 2002, pp. 85\u2013100 (2002)"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/3-540-36575-3_12","volume-title":"proc. of ESOP 2003","author":"P. Laud","year":"2003","unstructured":"Laud, P.: Handling Encryption in Analyses for Secure Information Flow. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Laud, P., Vene, V.: A Type System for Computationally Secure Information Flow. Tech. Report IT-LU-O-043-050307, Cybernetica AS, March 7th (2005)","DOI":"10.1007\/11537311_32"},{"key":"32_CR15","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: A Probabilistic Poly-Time Framework for Protocol Analysis. In: Proc. of ACM CCS 1998, pp. 112\u2013121 (1998)","DOI":"10.1145\/288090.288117"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"776","DOI":"10.1007\/3-540-48119-2_43","volume-title":"proc. of the World Congress on Formal Methods in the Development of Computing Systems 1999","author":"P. Lincoln","year":"1999","unstructured":"Lincoln, P., Mitchell, J., Mitchell, M., Scedrov, A.: Probabilistic Polynomial-Time Equivalence and Security Analysis. In: Wing, J.M., Woodcock, J.C.P., Davies, J. (eds.) FM 1999. LNCS, vol.\u00a01708, pp. 776\u2013793. Springer, Heidelberg (1999)"},{"key":"32_CR17","volume-title":"The Java Virtual Machine Specification","author":"T. Lindholm","year":"1999","unstructured":"Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1999)"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Myers, A.C.: JFlow: Practical Mostly-Static Information Flow Control. In: Proc. of POPL 1999, pp. 228\u2013241 (1999)","DOI":"10.1145\/292540.292561"},{"key":"32_CR19","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, 5\u201319 (2003)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Pfitzmann, B., Waidner, M.: A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission. In: Proc. of IEEE S&P 2001, pp. 184\u2013200 (2001)","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure Information Flow in a Multi-threaded Imperative Language. In: Proc. of POPL 1998, pp. 355\u2013364 (1998)","DOI":"10.1145\/268946.268975"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Volpano, D.: Secure Introduction of One-way Functions. In: Proc. of CSFW 2000, pp. 246\u2013254 (2000)","DOI":"10.1109\/CSFW.2000.856941"},{"key":"32_CR23","doi-asserted-by":"crossref","first-page":"167","DOI":"10.3233\/JCS-1996-42-304","volume":"4","author":"D. Volpano","year":"1996","unstructured":"Volpano, D., Smith, G., Irvine, C.: A Sound Type System for Secure Flow Analysis. Journal of Computer Security\u00a04, 167\u2013187 (1996)","journal-title":"Journal of Computer Security"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Volpano, D.M., Smith, G.: Eliminating Covert Flows with Minimum Typings. In: Proc. of CSFW 1997, pp. 156\u2013169 (1997)","DOI":"10.1109\/CSFW.1997.596807"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic Noninterference in a Concurrent Language. In: Proc. of CSFW 1998, pp. 34\u201343 (1998)","DOI":"10.1109\/CSFW.1998.683153"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Verifying Secrets and Relative Secrecy. In: Proc. of POPL 2000, pp. 268\u2013276 (2000)","DOI":"10.1145\/325694.325729"},{"key":"32_CR27","doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and applications of trapdoor functions (extended abstract). In: Proc. of FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11537311_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T19:41:29Z","timestamp":1683229289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11537311_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281931","9783540318736"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/11537311_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}