{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:10:07Z","timestamp":1743995407863,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642332715"},{"type":"electronic","value":"9783642332722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33272-2_7","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T13:45:33Z","timestamp":1345643133000},"page":"88-103","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Random Oracles"],"prefix":"10.1007","author":[{"given":"Margus","family":"Niitsoo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1137\/0210008","volume":"10","author":"C.H. Bennett","year":"1981","unstructured":"Bennett, C.H., Gill, J.: Relative to a random oracle A, P A !\u2009=\u2009NP A !\u2009=\u2009co\u2009\u2212\u2009NP A with probability 1. SIAM J. Comput.\u00a010(1), 96\u2013113 (1981)","journal-title":"SIAM J. Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62\u201373 (1993)","DOI":"10.1145\/168588.168596"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM\u00a051(4), 557\u2013594 (2004)","journal-title":"J. ACM"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-committing Encryption Case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-04642-1_19","volume-title":"Provable Security","author":"A. Buldas","year":"2009","unstructured":"Buldas, A., Laur, S., Niitsoo, M.: Oracle Separation in the Non-uniform Model. In: Pieprzyk, J., Zhang, F. (eds.) ProvSec 2009. LNCS, vol.\u00a05848, pp. 230\u2013244. Springer, Heidelberg (2009)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1007\/3-540-46885-4_51","volume-title":"Advances in Cryptology - EUROCRYPT \u201989","author":"T. Beth","year":"1990","unstructured":"Beth, T., Dai, Z.-D.: On the Complexity of Pseudo-random Sequences - or: If You Can Describe a Sequence It Can\u2019t Be Random. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol.\u00a0434, pp. 533\u2013543. Springer, Heidelberg (1990)"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Lutz, J.H.: Almost everywhere high nonuniform complexity. In: Structure in Complexity Theory, pp. 37\u201353 (1989)","DOI":"10.1109\/SCT.1989.41813"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jcss.1996.0065","volume":"53","author":"S.M. Kautz","year":"1996","unstructured":"Kautz, S.M., Miltersen, P.B.: Relative to a random oracle, NP is not small. Journal of Computer and System Sciences\u00a053(2), 235\u2013250 (1996)","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S.: Notions of Reducibility between Cryptographic Primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"7_CR10","first-page":"1","volume":"1","author":"A.N. Kolmogorov","year":"1965","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of \u2019information\u2019. Problems of Information Transmission\u00a01, 1\u20137 (1965)","journal-title":"Problems of Information Transmission"},{"issue":"4","key":"7_CR11","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1145\/321356.321363","volume":"13","author":"G.J. Chaitin","year":"1966","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences. Journal of the ACM\u00a013(4), 547\u2013569 (1966)","journal-title":"Journal of the ACM"},{"issue":"2,3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(64)90223-2","volume":"7","author":"R.J. Solomonoff","year":"1964","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference. Information and Control\u00a07(2,3), 1\u201322, 224\u2013254 (1964)","journal-title":"Information and Control"},{"issue":"3","key":"7_CR13","first-page":"30","volume":"10","author":"L.A. Levin","year":"1974","unstructured":"Levin, L.A.: Laws of information conservation (nongrowth) and aspects of the foundation of probability theory. Probl. Peredachi Inf.\u00a010(3), 30\u201335 (1974)","journal-title":"Probl. Peredachi Inf."},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1145\/321892.321894","volume":"22","author":"G.J. Chaitin","year":"1975","unstructured":"Chaitin, G.J.: A theory of program size formally identical to information theory. Journal of the ACM\u00a022(3), 329\u2013340 (1975)","journal-title":"Journal of the ACM"},{"key":"7_CR15","unstructured":"Claude, C.: Information and Randomness: An Algorithmic Perspective. Springer-Verlag New York, Inc. (1994)"},{"issue":"6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1016\/S0019-9958(66)80018-9","volume":"9","author":"P. Martin-L\u00f6f","year":"1966","unstructured":"Martin-L\u00f6f, P.: The definition of random sequences. Information and Control\u00a09(6), 602\u2013619 (1966)","journal-title":"Information and Control"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Solovay, R.M.: A version of omega for which ZFC can not predict a single bit. Technical report, CDMTCS (1999)","DOI":"10.1007\/978-1-4471-0751-4_21"},{"key":"7_CR18","unstructured":"Impagliazzo, R.: Very strong one-way functions and pseudo-random generators exist relative to a random oracle (1996) (manuscript)"},{"key":"7_CR19","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. Electronic Colloquium on Computational Complexity (ECCC)\u00a07(22) (2000)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of 21st Annual ACM Symposium on the Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/BFb0054137","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D.R. Simon","year":"1998","unstructured":"Simon, D.R.: Findings Collisions on a One-Way Street: Can Secure Hash Functions Be Based on General Assumptions? In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 334\u2013345. Springer, Heidelberg (1998)"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74143-5_12","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D. Unruh","year":"2007","unstructured":"Unruh, D.: Random Oracles and Auxiliary Input. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 205\u2013223. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33272-2_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T02:44:08Z","timestamp":1743993848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33272-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642332715","9783642332722"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33272-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}