{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T05:51:38Z","timestamp":1759729898245},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540237242"},{"type":"electronic","value":"9783540304777"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30477-7_9","type":"book-chapter","created":{"date-parts":[[2010,2,28]],"date-time":"2010-02-28T18:53:29Z","timestamp":1267383209000},"page":"129-145","source":"Crossref","is-referenced-by-count":54,"title":["Controlled Declassification Based on Intransitive Noninterference"],"prefix":"10.1007","author":[{"given":"Heiko","family":"Mantel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Sands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Agat, J.: Transforming out Timing Leaks. In: Proceedings of the ACM Symposium on Principles of Programming Languages, pp. 40\u201353 (2000)","DOI":"10.1145\/325694.325702"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bell, D.E., LaPadula, L.: Secure Computer Systems: Unified Exposition and Multics Interpretation. Technical Report MTR-2997, MITRE (1976)","DOI":"10.21236\/ADA023588"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45853-0_1","volume-title":"Computer Security - ESORICS 2002","author":"M. Backes","year":"2002","unstructured":"Backes, M., Pfitzmann, B.: Computational Probabilistic Non-interference. In: Gollmann, D., Karjoth, G., Waidner, M. (eds.) ESORICS 2002. LNCS, vol.\u00a02502, pp. 1\u201323. Springer, Heidelberg (2002)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bossi, A., Piazza, C., Rossi, S.: Modelling Downgrading in Information Flow Security. In: Proc.\u00a0of IEEE CSFW (to appear, 2004)","DOI":"10.1109\/CSFW.2004.1310741"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative Analysis of the Leakage of Confidential Data. In: Quantitative Aspects of Programming Languages\u2014Selected papers from QAPL 2001. ENTCS, vol.\u00a059 (2002)","DOI":"10.1016\/S1571-0661(04)00290-7"},{"key":"9_CR6","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: Foundations of Secure Computation, pp. 297\u2013335. Academic Press, London (1978)"},{"issue":"5","key":"9_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/360051.360056","volume":"19","author":"D.E. Denning","year":"1976","unstructured":"Denning, D.E.: A Lattice Model of Secure Information Flow. Communications of the ACM\u00a019(5), 236\u2013243 (1976)","journal-title":"Communications of the ACM"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate Non-Interference. In: Proceedings of IEEE CSFW, pp. 1\u201317 (2002)","DOI":"10.1109\/CSFW.2002.1021803"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"9_CR10","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 and ETAPS 2003. LNCS, vol.\u00a02618, pp. 159\u2013173. Springer, Heidelberg (2003)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Quantifying Information Flow. In: Proceedings of IEEE CSFW, pp. 18\u201331 (2002)","DOI":"10.1109\/CSFW.2002.1021804"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-45251-6_9","volume-title":"FME 2001: Formal Methods for Increasing Software Productivity","author":"H. Mantel","year":"2001","unstructured":"Mantel, H.: Information Flow Control and Applications \u2013 Bridging a Gap. In: Oliveira, J.N., Zave, P. (eds.) FME 2001. LNCS, vol.\u00a02021, pp. 153\u2013172. Springer, Heidelberg (2001)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Mitchell, J., Ramanathan, A., Scedrov, A., Teague, V.: A Probabilistic Polynomial-Time Calculus for Analysis of Cryptographic Protocols (Preliminary report). In: Proc. of the Conf.\u00a0on the Math.\u00a0Foundations of Programming Semantics 1976. ENTCS, vol.\u00a045 (2001)","DOI":"10.1016\/S1571-0661(04)80968-X"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Myers, A.C., Sabelfeld, A., Zdancewic, S.: Enforcing Robust Declassification. In: Proc.\u00a0of IEEE CSFW (to appear, 2004)","DOI":"10.1109\/CSFW.2004.1310740"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-30108-0_14","volume-title":"Computer Security \u2013 ESORICS 2004","author":"D.. Oheimb von","year":"2004","unstructured":"von Oheimb, D.: Information Flow Control Revisited: Noninfluence = Noninterference + Nonleakage. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 225\u2013243. Springer, Heidelberg (2004)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Pinsky, S.: Absorbing Covers and Intransitive Non-Interference. In: Proceedings of the IEEE Symposium on Security and Privacy, Oakland, CA, USA, pp. 102\u2013113 (1995)","DOI":"10.1109\/SECPRI.1995.398926"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Roscoe, A.W., Goldsmith, M.H.: What is Intransitive Noninterference? In: Proceedings of IEEE CSFW, pp. 228\u2013238 (1999)","DOI":"10.1109\/CSFW.1999.779776"},{"key":"9_CR18","unstructured":"Rushby, J.M.: Noninterference, Transitivity, and Channel-Control Security Policies. Technical Report CSL-92-02, SRI International (1992)"},{"key":"9_CR19","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)"},{"issue":"1","key":"9_CR20","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":"9_CR21","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic Noninterference for Multi-threaded Programs. In: Proceedings of IEEE CSFW, pp. 200\u2013214 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"issue":"1","key":"9_CR22","first-page":"59","volume":"14","author":"A. Sabelfeld","year":"2001","unstructured":"Sabelfeld, A., Sands, D.: A Per Model of Secure Information Flow in Sequential Programs. HOSC\u00a014(1), 59\u201391 (2001)","journal-title":"HOSC"},{"key":"9_CR23","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Eliminating Covert Flows with Minimum Typings. In: Proceedings of IEEE CSFW, pp. 156\u2013168 (1997)","DOI":"10.1109\/CSFW.1997.596807"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Volpano, D.M., Smith, G.: Verifying Secrets and Relative Secrecy. In: Proceedings of POPL, pp. 268\u2013276 (2000)","DOI":"10.1145\/325694.325729"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Zdancewic, S.: A Type System for Robust Declassification. In: Proc.\u00a0of the Conf.\u00a0on the Math.\u00a0Foundations of Programming Semantics. ENTCS (2003)","DOI":"10.1016\/S1571-0661(03)50014-7"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Zdancewic, S., Myers, A.C.: Robust Declassification. In: Proceedings of IEEE CSFW, pp. 15\u201323 (2001)","DOI":"10.1109\/CSFW.2001.930133"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30477-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T09:17:29Z","timestamp":1558862249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30477-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540237242","9783540304777"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30477-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}