{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:12:17Z","timestamp":1725516737666},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705826"},{"type":"electronic","value":"9783540705833"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70583-3_37","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"449-460","source":"Crossref","is-referenced-by-count":34,"title":["Extractable Perfectly One-Way Functions"],"prefix":"10.1007","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronny Ramzi","family":"Dakdouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139. Springer, Heidelberg (2001)"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Cryptography and Coding","author":"B. Barak","year":"2007","unstructured":"Barak, B., Ong, S., Vadhan, S.: Derandomization in cryptography. In: Galbraith, S.D. (ed.) Cryptography and Coding 2007. LNCS, vol.\u00a04887. Springer, Heidelberg (2007)"},{"key":"37_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Palacio, A.: The knowledge-of-exponent assumptions and 3-round zero-knowledge protocols. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152. Springer, Heidelberg (2004)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical:a paradigm for designing efficient protocols. In: CCS 1993 (1993)","DOI":"10.1145\/168588.168596"},{"key":"37_CR5","unstructured":"Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians (1986)"},{"key":"37_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11935230_14","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2006","author":"A. Boldyreva","year":"2006","unstructured":"Boldyreva, A., Fischlin, M.: On the security of OAEP. In: Lai, X., Chen, K. (eds.) ASIACRYPT 2006. LNCS, vol.\u00a04284. Springer, Heidelberg (2006)"},{"key":"37_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201997","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. Springer, Heidelberg (1997)"},{"key":"37_CR8","unstructured":"Canetti, R., Dakdouk, R.R.: Extractable perfectly one-way functions. eprint (2008)"},{"key":"37_CR9","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: STOIC 1998 (1998)","DOI":"10.1145\/276698.276741"},{"key":"37_CR10","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions. In: STOIC 1998 (1998)","DOI":"10.1145\/276698.276721"},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44987-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"R. Cramer","year":"2001","unstructured":"Cramer, R., Damgard, I., Nielsen, J.B.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045. Springer, Heidelberg (2001)"},{"key":"37_CR12","doi-asserted-by":"crossref","unstructured":"Damgard, I.: Towards practical public key systems secure against chosen ciphertext attacks. In: Crypto 1992 (1992)","DOI":"10.1007\/3-540-46766-1_36"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11761679_18","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"A. Dent","year":"2006","unstructured":"Dent, A.: The cramer-shoup encryption scheme is plaintext aware in the standard model. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004. Springer, Heidelberg (2006)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Dolev, D., Dwork, C., Naor, M.: Nonmalleable cryptography. SIAM Journal on Computing\u00a030 (2000)","DOI":"10.1137\/S0097539795291562"},{"key":"37_CR15","unstructured":"Fiat, A., Shamir, A.: How to prove yourself:practical solutions to identification and signature problems. In: Crypto 1986 (1986)"},{"key":"37_CR16","unstructured":"Federal Information Processing\u00a0Standard (FIPS). Secure hash standard. NIST, FIPS publication 180 (1993)"},{"key":"37_CR17","unstructured":"Goldwasser, S., Kalai, Y.T.: On the (in)security of the fiat-shamir paradigm. In: FOCS 2003 (2003)"},{"key":"37_CR18","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS 2005 (2005)","DOI":"10.1109\/SFCS.2005.60"},{"key":"37_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_6","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"J. Groth","year":"2006","unstructured":"Groth, J., Ostrovsky, R., Sahai, A.: Non-interactive zaps and new techniques for NIZK. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117. Springer, Heidelberg (2006)"},{"key":"37_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"S. Hada","year":"1998","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462. Springer, Heidelberg (1998)"},{"key":"37_CR21","doi-asserted-by":"crossref","unstructured":"Hada, S., Tanaka, T.: On the existence of 3-round zero-knowledge protocols (eprint) (1999)","DOI":"10.1007\/BFb0055744"},{"key":"37_CR22","doi-asserted-by":"crossref","unstructured":"Katz, J.: Efficient and non-malleable proofs of plaintext knowledge and applications. In: Eurocrypt 2003 (2003)","DOI":"10.1007\/3-540-39200-9_13"},{"key":"37_CR23","unstructured":"Lepinski, M.: On the existence of 3-round zero-knowledge proofs. M.S. Thesis (2002)"},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"U. Maurer","year":"2004","unstructured":"Maurer, U., 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. Springer, Heidelberg (2004)"},{"key":"37_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45931-6","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J. Nielsen","year":"2002","unstructured":"Nielsen, J.: Separating random oracle proofs from complexity theoretic proofs:the non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442. Springer, Heidelberg (2002)"},{"key":"37_CR26","doi-asserted-by":"crossref","unstructured":"Rivest, R.: The MD5 message-digest algorithm. IETF Network Working Group, RFC 1321 (1992)","DOI":"10.17487\/rfc1321"},{"key":"37_CR27","doi-asserted-by":"crossref","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: FOCS 1999 (1999)","DOI":"10.1109\/SFFCS.1999.814628"},{"key":"37_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_33","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"A. Santis De","year":"2001","unstructured":"De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust non-interactive zero knowledge. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139. Springer, Heidelberg (2001)"},{"key":"37_CR29","doi-asserted-by":"crossref","unstructured":"De Santis, A., Persiano, G.: Zero knowledge proofs of knowledge without interaction. In: FOCS 1992 (1992)","DOI":"10.1109\/SFCS.1992.267809"},{"key":"37_CR30","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: STOIC 2005 (2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70583-3_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:08:00Z","timestamp":1605744480000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70583-3_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705826","9783540705833"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70583-3_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}