{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:24Z","timestamp":1725575244964},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642181771"},{"type":"electronic","value":"9783642181788"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-18178-8_36","type":"book-chapter","created":{"date-parts":[[2011,1,15]],"date-time":"2011-01-15T11:09:47Z","timestamp":1295089787000},"page":"430-444","source":"Crossref","is-referenced-by-count":1,"title":["Indifferentiable Security Reconsidered: Role of Scheduling"],"prefix":"10.1007","author":[{"given":"Kazuki","family":"Yoneyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","volume-title":"Theory of Cryptography","author":"U.M. Maurer","year":"2004","unstructured":"Maurer, U.M., Renner, R., Holenstein, C.: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 21\u201339. Springer, Heidelberg (2004)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136\u2013145 (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"issue":"12","key":"36_CR3","doi-asserted-by":"publisher","first-page":"1685","DOI":"10.1016\/j.ic.2007.05.002","volume":"205","author":"M. Backes","year":"2007","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The Reactive Simulatability (RSIM) Framework for Asynchronous Systems. Inf. Comput.\u00a0205(12), 1685\u20131720 (2007)","journal-title":"Inf. Comput."},{"issue":"4","key":"36_CR4","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/s00145-008-9019-9","volume":"21","author":"A. Datta","year":"2008","unstructured":"Datta, A., K\u00fcsters, R., Mitchell, J.C., Ramanathan, A.: On the Relationships between Notions of Simulation-Based Security. J. Cryptology\u00a021(4), 492\u2013546 (2008)","journal-title":"J. Cryptology"},{"issue":"1","key":"36_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10626-007-0032-1","volume":"18","author":"R. Canetti","year":"2008","unstructured":"Canetti, R., Cheung, L., Kaynar, D.K., Liskov, M., Lynch, N.A., Pereira, O., Segala, R.: Analyzing Security Protocols Using Time-Bounded Task-PIOAs. Discrete Event Dynamic Systems\u00a018(1), 111\u2013159 (2008)","journal-title":"Discrete Event Dynamic Systems"},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.tcs.2005.10.044","volume":"353","author":"J.C. Mitchell","year":"2006","unstructured":"Mitchell, J.C., Ramanathan, A., Scedrov, A., Teague, V.: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols. Theor. Comput. Sci.\u00a0353, 118\u2013164 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR7","unstructured":"Canetti, R., Cheung, L., Lynch, N.A., Pereira, O.: On the Role of Scheduling in Simulation-Based Security. In: WITS 2007, pp. 22\u201337 (2007)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-88733-1_19","volume-title":"Provable Security","author":"W. Nagao","year":"2008","unstructured":"Nagao, W., Manabe, Y., Okamoto, T.: Relationship of Three Cryptographic Channels in the UC Framework. In: Baek, J., Bao, F., Chen, K., Lai, X. (eds.) ProvSec 2008. LNCS, vol.\u00a05324, pp. 268\u2013282. Springer, Heidelberg (2008)"},{"key":"36_CR9","unstructured":"Delaune, S., Kremer, S., Pereira, O.: Simulation based security in the applied pi calculus. In: FSTTCS 2009, pp. 169\u2013180 (2009)"},{"key":"36_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited (Preliminary Version). In: STOC 1998, pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276741"}],"container-title":["Lecture Notes in Computer Science","Information Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18178-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T18:11:20Z","timestamp":1559931080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18178-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642181771","9783642181788"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18178-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}