{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:48:20Z","timestamp":1725504500102},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540785231"},{"type":"electronic","value":"9783540785248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78524-8_2","type":"book-chapter","created":{"date-parts":[[2008,2,25]],"date-time":"2008-02-25T09:18:12Z","timestamp":1203931092000},"page":"19-36","source":"Crossref","is-referenced-by-count":13,"title":["On Seed-Incompressible Functions"],"prefix":"10.1007","author":[{"given":"Shai","family":"Halevi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Myers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Rackoff","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/j.jcss.2005.06.010","volume":"72","author":"B. Barak","year":"2006","unstructured":"Barak, B., Lindell, Y., Vadhan, S.: Lower Bounds for Non-Black-Box Zero-Knowledge. The Journal of Computer and System Sciences\u00a072(2), 321\u2013391 (2006) (JCSS FOCS 2003 Special Issue)","journal-title":"The Journal of Computer and System Sciences"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","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)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT 1994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal asymmetric encryption. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO 1997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/3-540-45539-6_33","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"R. Canetti","year":"2000","unstructured":"Canetti, R., Dodis, Y., Halevi, S., Kushilevitz, E., Sahai, A.: Exposure-Resilient Functions and All-or-Nothing Transforms. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 453\u2013469. Springer, Heidelberg (2000)"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R. Canetti","year":"2004","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. Journal of the ACM\u00a051(4), 209\u2013218 (2004) Preliminary version in STOC 1998, pp. 209\u2013218.","journal-title":"Journal of the ACM"},{"key":"2_CR7","first-page":"131","volume-title":"Proceedings of the 30th Annual ACM Symposium on the Theory of Computing","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hashing. In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing, Dallas, TX, May 1998, pp. 131\u2013140. ACM Press, New York (1998)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/978-3-540-70936-7_26","volume-title":"Theory of Cryptography","author":"D. Cash","year":"2007","unstructured":"Cash, D., Ding, Y.Z., Dodis, Y., Lee, W., Lipton, R.J., Walfish, S.: Intrusion-Resilient Key Exchange in the Bounded Retrieval Model. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 479\u2013498. Springer, Heidelberg (2007)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1007\/11535218_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"J. Coron","year":"2005","unstructured":"Coron, J., Dodis, Y., Malinaud, C., Puniya, P.: Merkle-Damgrd Revisited: How to Construct a Hash Function. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol.\u00a03621, pp. 430\u2013448. Springer, Heidelberg (2005)"},{"key":"2_CR10","unstructured":"Damgard, I.: On \u03a3-Protocols. Lecture notes for Cryptologic Protocol Theory course, Aarhus University (2005), \n                    \n                      http:\/\/www.daimi.au.dk\/%7Eivan\/Sigma.pdf"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/11681878_12","volume-title":"Theory of Cryptography","author":"G. DiCrescenzo","year":"2006","unstructured":"DiCrescenzo, G., Lipton, R.J., Walfish, S.: Perfectly Secure Password Protocols in the Bounded Retrieval Model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 225\u2013244. Springer, Heidelberg (2006)"},{"key":"2_CR12","unstructured":"Dierks, T., Allen, C.: RFC2246:The TLS Protocol. RFC 2246, The Internet Society, Network Working Group (1999)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11681878_11","volume-title":"Theory of Cryptography","author":"S. Dziembowski","year":"2006","unstructured":"Dziembowski, S.: Intrusion-Resilience Via the Bounded-Storage Model. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol.\u00a03876, pp. 207\u2013224. Springer, Heidelberg (2006)"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO 1986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself. practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013189. Springer, Heidelberg (1987)"},{"key":"2_CR15","series-title":"Algorithms and Combinatorics","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol.\u00a017. Springer, Heidelberg (1998)"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/SFCS.2003.1238185","volume-title":"44th Symposium on Foundations of Computer Science (FOCS 2003)","author":"S. Goldwasser","year":"2003","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (In)security of the Fiat-Shamir Paradigm. In: 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 102\u2013115. IEEE Computer Society Press, Los Alamitos (2003)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1109\/FOCS.2006.54","volume-title":"47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006)","author":"D. Harnik","year":"2006","unstructured":"Harnik, D., Naor, M.: On the Compressibility of NP Instances and Cryptographic Applications. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), pp. 719\u2013728. IEEE Computer Society Press, Los Alamitos (2006)"},{"key":"2_CR18","first-page":"44","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing","author":"R. Impagliazzo","year":"1989","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing, pp. 44\u201361. ACM Press, New York (1989)"},{"key":"2_CR19","first-page":"723","volume-title":"Proceedings of the 24th Annual ACM Symposium on the Theory of Computing","author":"J. Kilian","year":"1992","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on the Theory of Computing, May 1992, pp. 723\u2013732. ACM Press, New York (1992)"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1109\/SFCS.1994.365746","volume-title":"35th Annual Symposium on Foundations of Computer Science (FOCS 1994)","author":"S. Micali","year":"1994","unstructured":"Micali, S.: CS proofs. In: 35th Annual Symposium on Foundations of Computer Science (FOCS 1994), pp. 436\u2013453. IEEE Computer Society Press, Los Alamitos (1994)"},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S. Micali","year":"2000","unstructured":"Micali, S.: Computationally Sound Proofs. SIAM Journal on Computing\u00a030(4), 1253\u20131298 (2000)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR22","unstructured":"Naor, M., Nissim, K.: Computationally sound proofs: Reducing the number of random oracle calls (manuscript, 1999)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78524-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:12:05Z","timestamp":1619521925000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78524-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540785231","9783540785248"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78524-8_2","relation":{},"subject":[]}}