{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T07:06:35Z","timestamp":1763967995811,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120312"},{"type":"electronic","value":"9783642120329"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12032-9_20","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:07:56Z","timestamp":1268010476000},"page":"282-296","source":"Crossref","is-referenced-by-count":4,"title":["The Complexity of Synchronous Notions of Information Flow Security"],"prefix":"10.1007","author":[{"given":"Franck","family":"Cassez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ron","family":"van der Meyden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chenyi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Agat, J.: Transforming out timing leaks. In: Proc. ACM Symp. on Principles of Programming Languages, pp. 40\u201353 (2000)","DOI":"10.1145\/325694.325702"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bossi, A., Focardi, R., Piazza, C., Rossi, S.: Bisimulation and unwinding for verifying possibilistic security properties. In: Proc. Int. Conf. on Verication, Model Checking, and Abstract Interpretation, pp. 223\u2013237 (2003)","DOI":"10.1007\/3-540-36384-X_19"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-540-75227-1_17","volume-title":"Formal Aspects in Security and Trust","author":"D. Beauquier","year":"2007","unstructured":"Beauquier, D., Lanotte, R.: Hiding information in multi level security systems. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 250\u2013269. Springer, Heidelberg (2007)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"D\u2019Souza, D., Holla, R., Kulkarni, J., Ramesh, R.K., Sprick, B.: On the decidability of model-checking information flow properties. In: Proc. Int. Conf. on Information Systems Security, pp. 26\u201340 (2008)","DOI":"10.1007\/978-3-540-89862-7_2"},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R.: A classification of security properties for process algebras. Journal of Computer Security, 5\u201333 (1995)","DOI":"10.3233\/JCS-1994\/1995-3103"},{"key":"20_CR6","unstructured":"Focardi, R., Gorrieri, R.: The compositional security checker: A tool for the verification of information flow security properties. Technical Report UBLCS-96-14, Universit\u00e0 di Bologna (August 1996)"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R., Martinelli, F.: Information flow analysis in a discrete-time process algebra. In: Proc. Computer Security Foundation Workshop, pp. 170\u2013184 (2000)","DOI":"10.1109\/CSFW.2000.856935"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Unwinding and inference control. In: Proc. IEEE Symp. on Security and Privacy, p. 75 (1984)","DOI":"10.1109\/SP.1984.10019"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/11863908_16","volume-title":"Computer Security \u2013 ESORICS 2006","author":"B. K\u00f6pf","year":"2006","unstructured":"K\u00f6pf, B., Basin, D.A.: Timing-sensitive information flow analysis for synchronous systems. In: Gollmann, D., Meier, J., Sabelfeld, A. (eds.) ESORICS 2006. LNCS, vol.\u00a04189, pp. 243\u2013262. Springer, Heidelberg (2006)"},{"key":"20_CR10","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":"20_CR11","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. In: Proc. 2nd Annual ACM Symp. on Principles of Distributed Computing, New York, NY, pp. 228\u2013240 (1983)","DOI":"10.1145\/800221.806724"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Mantel, H.: Possiblistic definitions of security \u2013 an assembly kit. In: Proc. Computer Security Foundations Workshop, pp. 185\u2013199 (2000)","DOI":"10.1109\/CSFW.2000.856936"},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/10722599_15","volume-title":"Computer Security - ESORICS 2000","author":"H. Mantel","year":"2000","unstructured":"Mantel, H.: Unwinding security properties. In: Cuppens, F., Deswarte, Y., Gollmann, D., Waidner, M. (eds.) ESORICS 2000. LNCS, vol.\u00a01895, pp. 238\u2013254. Springer, Heidelberg (2000)"},{"key":"20_CR14","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 (1988)","DOI":"10.1109\/SECPRI.1988.8110"},{"issue":"2","key":"20_CR15","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(84)90034-5","volume":"29","author":"J.H. Reif","year":"1984","unstructured":"Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Science\u00a029(2), 274\u2013301 (1984)","journal-title":"Journal of Computer and System Science"},{"key":"20_CR16","unstructured":"Rushby, J.: Noninterference, transitivity, and channel-control security policies. Technical report, SRI international (December 1992)"},{"issue":"2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1137\/0208013","volume":"8","author":"L.J. Stockmeyer","year":"1979","unstructured":"Stockmeyer, L.J., Chandra, A.K.: Provably difficult combinatorial games. SIAM Journal of Computing\u00a08(2), 151\u2013174 (1979)","journal-title":"SIAM Journal of Computing"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: Proc. ACM Symp. on Theory of computing, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-75227-1_16","volume-title":"Formal Aspects in Security and Trust","author":"R. Meyden van der","year":"2007","unstructured":"van der Meyden, R., Zhang, C.: A comparison of semantic models for noninterference. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 235\u2013249. Springer, Heidelberg (2007)"},{"key":"20_CR20","first-page":"61","volume":"168","author":"R. Meyden van der","year":"2007","unstructured":"van der Meyden, R., Zhang, C.: Algorithmic verification on noninterference properties. ENTCS\u00a0168, 61\u201375 (2007)","journal-title":"ENTCS"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"van der Meyden, R., Zhang, C.: Information flow in systems with schedulers. In: Proc. Computer Security Foundation Symp., June 2008, pp. 301\u2013312 (2008)","DOI":"10.1109\/CSF.2008.13"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/BFb0030629","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"D.M. Volpano","year":"1997","unstructured":"Volpano, D.M., Smith, G.: A type-based approach to program security. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 607\u2013621. Springer, Heidelberg (1997)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Wittbold, J.T., Johnson, D.M.: Information flow in nondeterministic systems. In: Proc. IEEE Symp. on Security and Privacy, pp. 144\u2013161 (1990)","DOI":"10.1109\/RISP.1990.63846"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12032-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T01:38:42Z","timestamp":1739929122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12032-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120312","9783642120329"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12032-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}