{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:13:58Z","timestamp":1794341638381,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540377566","type":"print"},{"value":"9783540377580","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11823230_23","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T09:46:30Z","timestamp":1155807990000},"page":"353-369","source":"Crossref","is-referenced-by-count":19,"title":["Cryptographically-Masked Flows"],"prefix":"10.1007","author":[{"given":"Aslan","family":"Askarov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Hedin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrei","family":"Sabelfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"5","key":"23_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"},{"issue":"2","key":"23_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s00145-001-0014-7","volume":"15","author":"M. Abadi","year":"2002","unstructured":"Abadi, M., Rogaway, P.: Reconciling two views of cryptography (the computational soundness of formal encryption). J. of Cryptology\u00a015(2), 103\u2013127 (2002)","journal-title":"J. of Cryptology"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Askarov, A., Hedin, D., Sabelfeld, A.: Cryptographically-masked flows. Technical report, Chalmers University of Technology (June 2006), located at: http:\/\/www.cs.chalmers.se\/~aaskarov\/sas06full.pdf","DOI":"10.1007\/11823230_23"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/11555827_12","volume-title":"Computer Security \u2013 ESORICS 2005","author":"A. Askarov","year":"2005","unstructured":"Askarov, A., Sabelfeld, A.: Security-typed languages for implementation of cryptographic protocols: A case study. In: di Vimercati, S.d.C., Syverson, P.F., Gollmann, D. (eds.) ESORICS 2005. LNCS, vol.\u00a03679, pp. 197\u2013221. Springer, Heidelberg (2005)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 26\u201346. Springer, Heidelberg (1998)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-44448-3_41","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Namprempre, C.: Authenticated encryption: Relations among notions and analysis of the generic composition paradigm. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 531\u2013545. Springer, Heidelberg (2000)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36492-7_6","volume-title":"Selected Areas in Cryptography","author":"J. Black","year":"2003","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 62\u201375. Springer, Heidelberg (2003)"},{"issue":"1","key":"23_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/77648.77649","volume":"8","author":"M. Burrows","year":"1990","unstructured":"Burrows, M., Abadi, M., Needham, R.: A logic of authentication. ACM Transactions on Computer Systems\u00a08(1), 18\u201336 (1990)","journal-title":"ACM Transactions on Computer Systems"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Chong, S., Myers, A.C.: Security policies for downgrading. In: ACM Conference on Computer and Communications Security, pp. 198\u2013209 (October 2004)","DOI":"10.1145\/1030083.1030110"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Chothia, T., Duggan, D., Vitek, J.: Type-based distributed access control. In: Proc. IEEE Computer Security Foundations Workshop, pp. 170\u2013186 (2003)","DOI":"10.1109\/CSFW.2003.1212712"},{"key":"23_CR11","first-page":"297","volume-title":"Foundations of Secure Computation","author":"E.S. Cohen","year":"1978","unstructured":"Cohen, E.S.: Information transmission in sequential programs. In: DeMillo, R.A., Dobkin, D.P., Jones, A.K., Lipton, R.J. (eds.) Foundations of Secure Computation, pp. 297\u2013335. Academic Press, London (1978)"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Dam, M., Giambiagi, P.: Confidentiality for mobile code: The case of a simple payment protocol. In: Proc. IEEE Computer Security Foundations Workshop, pp. 233\u2013244 (July 2000)","DOI":"10.1109\/CSFW.2000.856940"},{"issue":"7","key":"23_CR13","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1145\/359636.359712","volume":"20","author":"D.E. Denning","year":"1977","unstructured":"Denning, D.E., Denning, P.J.: Certification of programs for secure information flow. Comm. of the ACM\u00a020(7), 504\u2013513 (1977)","journal-title":"Comm. of the ACM"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Duggan, D.: Cryptographic types. In: Proc. IEEE Computer Security Foundations Workshop, pp. 238\u2013252 (June 2002)","DOI":"10.1109\/CSFW.2002.1021819"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-36575-3_11","volume-title":"Programming Languages and Systems","author":"P. Giambiagi","year":"2003","unstructured":"Giambiagi, P., Dam, M.: On the secure implementation of security protocols. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 144\u2013158. Springer, Heidelberg (2003)"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: Proc. IEEE Symp. on Security and Privacy, pp. 11\u201320 (April 1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/11539452_17","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"A. Gordon","year":"2005","unstructured":"Gordon, A., Jeffrey, A.: Secrecy despite compromise: Types, cryptography, and the pi-calculus. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 186\u2013201. Springer, Heidelberg (2005)"},{"key":"23_CR19","unstructured":"Hicks, B., King, D., McDaniel, P.: Declassification with cryptographic functions in a security-typed language. Technical Report NAS-TR-0004-2005, Network and Security Center, Department of Computer Science, Pennsylvania State University (May 2005)"},{"key":"23_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45309-1_6","volume-title":"Programming Languages and Systems","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":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/3-540-36575-3_12","volume-title":"Programming Languages and Systems","author":"P. Laud","year":"2003","unstructured":"Laud, P.: Handling encryption in an analysis for secure information flow. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"key":"23_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/11537311_32","volume-title":"Fundamentals of Computation Theory","author":"P. Laud","year":"2005","unstructured":"Laud, P., Vene, V.: A type system for computationally secure information flow. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 365\u2013377. Springer, Heidelberg (2005)"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"Lincoln, P., Mitchell, J.C., Mitchell, M., Scedrov, A.: A probabilistic poly-time framework for protocol analysis. In: ACM Conference on Computer and Communications Security, pp. 112\u2013121 (November 1998)","DOI":"10.1145\/288090.288117"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"McCullough, D.: Noninterference and the composability of security properties. In: Proc. IEEE Symp. on Security and Privacy, pp. 177\u2013186 (May 1988)","DOI":"10.1109\/SECPRI.1988.8110"},{"key":"23_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-45309-1_2","volume-title":"Programming Languages and Systems","author":"J.C. Mitchell","year":"2001","unstructured":"Mitchell, J.C.: Probabilistic polynomial-time process calculus and security protocol analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol.\u00a02028, pp. 23\u201329. Springer, Heidelberg (2001)"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Myers, A.C., Sabelfeld, A., Zdancewic, S.: Enforcing robust declassification and qualified robustness. J. Computer Security (to appear, 2006)","DOI":"10.3233\/JCS-2006-14203"},{"issue":"1","key":"23_CR27","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 J. Selected Areas in Communications\u00a021(1), 5\u201319 (2003)","journal-title":"IEEE J. Selected Areas in Communications"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-37621-7_9","volume-title":"Software Security - Theories and Systems","author":"A. Sabelfeld","year":"2004","unstructured":"Sabelfeld, A., Myers, A.C.: A model for delimited information release. In: Futatsugi, K., Mizoguchi, F., Yonezaki, N. (eds.) ISSS 2003. LNCS, vol.\u00a03233, pp. 174\u2013191. Springer, Heidelberg (2004)"},{"key":"23_CR29","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Dimensions and principles of declassification. In: Proc. IEEE Computer Security Foundations Workshop, pp. 255\u2013269 (June 2005)","DOI":"10.1109\/CSFW.2005.15"},{"key":"23_CR30","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1002\/j.1538-7305.1948.tb00917.x","volume":"27","author":"C.E. Shannon","year":"1948","unstructured":"Shannon, C.E.: A mathematical theory of communication. Bell System Tech. J.\u00a027, 623\u2013656 (1948)","journal-title":"Bell System Tech. J."},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Sumii, E., Pierce, B.: Logical relations for encryption. In: Proc. IEEE Computer Security Foundations Workshop, pp. 256\u2013269 (June 2001)","DOI":"10.1109\/CSFW.2001.930151"},{"key":"23_CR32","doi-asserted-by":"crossref","unstructured":"Volpano, D.: Secure introduction of one-way functions. In: Proc. IEEE Computer Security Foundations Workshop, pp. 246\u2013254 (July 2000)","DOI":"10.1109\/CSFW.2000.856941"},{"key":"23_CR33","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Verifying secrets and relative secrecy. In: Proc. ACM Symp. on Principles of Programming Languages, pp. 268\u2013276 (January 2000)","DOI":"10.1145\/325694.325729"},{"issue":"3","key":"23_CR34","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. J. Computer Security\u00a04(3), 167\u2013187 (1996)","journal-title":"J. Computer Security"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11823230_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:17:04Z","timestamp":1605626224000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11823230_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377566","9783540377580"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/11823230_23","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11823230","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}