{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T04:25:32Z","timestamp":1778127932499,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210009","type":"print"},{"value":"9783540246381","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24638-1_3","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:15:28Z","timestamp":1280762128000},"page":"40-57","source":"Crossref","is-referenced-by-count":42,"title":["On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oded","family":"Goldreich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"62","volume-title":"1st Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: 1st Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993)"},{"issue":"2\/3","key":"3_CR2","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01185212","volume":"12","author":"M. Blum","year":"1994","unstructured":"Blum, M., Evans, W.S., Gemmell, P., Kannan, S., Naor, M.: Checking the Correctness of Memories. Algorithmica\u00a012(2\/3), 225\u2013244 (1994); Preliminary version in 32nd FOCS (1991)","journal-title":"Algorithmica"},{"key":"#cr-split#-3_CR3.1","doi-asserted-by":"crossref","unstructured":"Brassard, G., Chaum, D., Cr\u00e9peau, C.: Minimum Disclosure Proofs of Knowledge. JCSS\u00a037(2), 156\u2013189 (1988);","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"#cr-split#-3_CR3.2","unstructured":"Preliminary version by Brassard and Cr\u00e9peau in 27th FOCS (1986)"},{"issue":"4","key":"3_CR4","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(98)00116-1","volume":"67","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., H\u00e5stad, J.: On the complexity of interactive proofs with bounded communication. Information Processing Letters\u00a067(4), 205\u2013214 (1998)","journal-title":"Information Processing Letters"},{"key":"#cr-split#-3_CR5.1","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The Random Oracle Methodology, Revisited. Preliminary version in Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, May 1998. ACM, New York (1998);","DOI":"10.1145\/276698.276741"},{"key":"#cr-split#-3_CR5.2","unstructured":"TR version(s) available on-line from: http:\/\/eprint.iacr.org\/1998\/011, http:\/\/xxx.lanl.gov\/abs\/cs.CR\/0010019"},{"issue":"4","key":"3_CR6","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 210\u2013217 (1986)","journal-title":"Journal of the ACM"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1145\/233551.233553","volume":"43","author":"O. Goldreich","year":"1996","unstructured":"Goldreich, O., Ostrovsky, R.: Software Protection and Simulation on Oblivious RAMs. J. ACM\u00a043, 431\u2013473 (1996)","journal-title":"J. ACM"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/3-540-48224-5_28","volume-title":"Automata, Languages and Programming","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O., Vadhan, S.P., Wigderson, A.: On interactive proofs with a laconic prover. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 334\u2013345. Springer, Heidelberg (2001)"},{"key":"#cr-split#-3_CR9.1","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SICOMP\u00a018, 186\u2013208 (1989);","DOI":"10.1137\/0218012"},{"key":"#cr-split#-3_CR9.2","unstructured":"Preliminary version in 17th STOC (1985)"},{"key":"3_CR10","unstructured":"Holenstein, C., Maurer, U., Renner, R.: Indifferentiability, Impossibility Results on Reductions, and Applications to the Random Oracle Methodology. Appears in these proceedings, Also available at: http:\/\/eprint.iacr.org\/2003\/161\/"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A Note on Efficient Zero-Knowledge Proofs and Arguments. In: 24th STOC, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/0-387-34805-0_21","volume-title":"Advances in Cryptology - CRYPTO \u201989","author":"R.C. Merkle","year":"1990","unstructured":"Merkle, R.C.: A certified digital signature. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol.\u00a0435, pp. 218\u2013238. Springer, Heidelberg (1990)"},{"key":"#cr-split#-3_CR13.1","doi-asserted-by":"crossref","unstructured":"Micali, S.: Computationally Sound Proofs. SICOMP\u00a030(4), 1253\u20131298 (2000);","DOI":"10.1137\/S0097539795284959"},{"key":"#cr-split#-3_CR13.2","unstructured":"Preliminary version in 35th FOCS (1994)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 33\u201343 (1989)","DOI":"10.1145\/73007.73011"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24638-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:29:17Z","timestamp":1559359757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24638-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210009","9783540246381"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24638-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}