{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T07:46:54Z","timestamp":1746517614484},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540709350"},{"type":"electronic","value":"9783540709367"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70936-7_24","type":"book-chapter","created":{"date-parts":[[2007,5,16]],"date-time":"2007-05-16T07:43:44Z","timestamp":1179301424000},"page":"434-455","source":"Crossref","is-referenced-by-count":46,"title":["Towards a Separation of Semantic and CCA Security for Public Key Encryption"],"prefix":"10.1007","author":[{"given":"Yael","family":"Gertner","sequence":"first","affiliation":[]},{"given":"Tal","family":"Malkin","sequence":"additional","affiliation":[]},{"given":"Steven","family":"Myers","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/258533.258604","volume-title":"Proceedings of the twenty-ninth annual ACM Symposium on the Theory of Computing","author":"M. Ajtai","year":"1997","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: ACM (ed.) Proceedings of the twenty-ninth annual ACM Symposium on the Theory of Computing, El Paso, Texas, May 4\u20136, 1997, pp. 284\u2013293. ACM, New York (1997), ACM order no. 508970"},{"key":"24_CR2","first-page":"106","volume-title":"Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Silver Spring, USA, 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B.: How to go beyond the black-box simulation barrier. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Silver Spring, USA, 2001, pp. 106\u2013115. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"24_CR3","first-page":"345","volume-title":"FOCS","author":"B. Barak","year":"2002","unstructured":"Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: FOCS, pp. 345\u2013355. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"M. Bellare","year":"1998","unstructured":"Bellare, M., Desai, A., Pointcheval, D., Rogaway, P.: Relations among notions of security for public-key encryption schemes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, Springer, Heidelberg (1998)"},{"key":"24_CR5","unstructured":"Bellare, M., Goldreich, O., Petrank, E.: Uniform generation of np-witnesses using an np-oracle. Electronic Colloquium on Computational Complexity (ECCC)\u00a05(32) (1998)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Halevi, S., Sahai, A., Vadhan, S.: Many-to-one trapdoor functions and their relation to public-key cryptosystems. Cryptology ePrint Archive, Report, 1998\/019 (1998), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/BFb0055735"},{"key":"24_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","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":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/3-540-48405-1_33","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Bellare","year":"1999","unstructured":"Bellare, M., Sahai, A.: Non-malleable encryption: Equivalence between two notions, and an indistinguishability-based characterization. In: Wiener, M.J. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 519\u2013536. Springer, Heidelberg (1999)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M. Blum","year":"1985","unstructured":"Blum, M., Goldwasser, S.: An efficient probabilistic public-key encryption scheme which hides all partial information. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 19\u201322. Springer, Heidelberg (1985)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/BFb0055717","volume-title":"Advances in Cryptology - CRYPTO \u201998","author":"R. Cramer","year":"1998","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol.\u00a01462, pp. 13\u201325. Springer, Heidelberg (1998)"},{"key":"24_CR11","volume-title":"Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing","author":"D. Dolev","year":"1991","unstructured":"Dolev, D., Dwork, C., Naor, M.: Non-malleable cryptography (extended abstract). In: Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, New Orleans, Louisiana, 6\u20138 May, ACM Press, New York (1991)"},{"key":"24_CR12","unstructured":"Elkind, E., Sahai, A.: A unified methodology for constructing publickey encryption schemes secure against adaptive chosen-ciphertext attack (2004)"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-49162-7_5","volume-title":"Public Key Cryptography","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: How to enhance the security of public-key encryption at minimum cost. In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 53\u201368. Springer, Heidelberg (1999)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/SFCS.2000.892119","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"R. Gennaro","year":"2000","unstructured":"Gennaro, R., Trevisan, L.: Lower bounds on the efficiency of generic cryptographic constructions. In: 41st Annual Symposium on Foundations of Computer Science, pp. 305\u2013313. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"24_CR15","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1145\/780542.780604","volume-title":"Proceedings of the thirty-fifth ACM symposium on Theory of computing","author":"R. Gennaro","year":"2003","unstructured":"Gennaro, R., Gertner, Y., Katz, J.: Lower bounds on the efficiency of encryption and digital signature schemes. In: Proceedings of the thirty-fifth ACM symposium on Theory of computing, pp. 417\u2013425. ACM Press, New York (2003)"},{"key":"24_CR16","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/SFCS.2000.892121","volume-title":"41st Annual Symposium on Foundations of Computer Science","author":"Y. Gertner","year":"2000","unstructured":"Gertner, Y., Kannan, S., Malkin, T., Reingold, O., Viswanathan, M.: The relationship between public key encryption and oblivious transfer. In: IEEE (ed.) 41st Annual Symposium on Foundations of Computer Science, pp. 325\u2013335. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"24_CR17","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1109\/SFCS.2001.959887","volume-title":"42nd IEEE Symposium on Foundations of Computer Science","author":"Y. Gertner","year":"2001","unstructured":"Gertner, Y., Malkin, T., Reingold, O.: On the impossibility of basing trapdoor functions on trapdoor predicates. In: IEEE (ed.) 42nd IEEE Symposium on Foundations of Computer Science, pp. 126\u2013135. IEEE Computer Society Press, Los Alamitos (2001)"},{"key":"24_CR18","unstructured":"Gertner, Y., Malkin, T., Myers, S.: Towards a separation of semantic and cca security for public key encryption. Cryptology ePrint Archive (2006), http:\/\/eprint.iacr.org\/"},{"issue":"4","key":"24_CR19","doi-asserted-by":"publisher","first-page":"792","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), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"24_CR20","volume-title":"Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, Seattle, Washington, 15\u201317 May, ACM Press, New York (1989)"},{"issue":"2","key":"24_CR21","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"24_CR22","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1998","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: Construction of pseudorandom generator from any one-way function. SIAM Journal of Computing\u00a028(4), 1364\u20131396 (1998)","journal-title":"SIAM Journal of Computing"},{"key":"24_CR23","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":"24_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1109\/CCC.2000.856739","volume-title":"COCO \u201900: Proceedings of the 15th Annual IEEE Conference on Computational Complexity","author":"J. Kahn","year":"2000","unstructured":"Kahn, J., Saks, M., Smyth, C.: A dual version of reimer\u2019s inequality and a proof of rudich\u2019s conjecture. In: COCO \u201900: Proceedings of the 15th Annual IEEE Conference on Computational Complexity, p. 98. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"24_CR25","first-page":"535","volume-title":"40th Annual Symposium on Foundations of Computer Science","author":"J.H. Kim","year":"1999","unstructured":"Kim, J H, Simon, D.R., Tetali, P.: Limits on the efficiency of one-way permutation-based hash functions. In: 40th Annual Symposium on Foundations of Computer Science, pp. 535\u2013542. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"24_CR26","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/22145.22185","volume-title":"ACM Symposium on Theory of Computing (STOC \u201985)","author":"L.A. Levin","year":"1985","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. In: ACM Symposium on Theory of Computing (STOC \u201985), Baltimore, USA, May 1985, pp. 363\u2013365. ACM Press, New York (1985)"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39200-9_15","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"Lindell","year":"2003","unstructured":"Lindell: A simpler construction of CCA2-secure public-key encryption under general assumptions. In: Biham, E. (ed.) Advances in Cryptology \u2013 EUROCRPYT 2003. LNCS, vol.\u00a02656, Springer, Heidelberg (2003)"},{"key":"24_CR28","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing\u00a017, 373\u2013386 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"24_CR29","first-page":"427","volume-title":"Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key cryptosystems provably secure against chosen ciphertext attacks. In: Awerbuch, B. (ed.) Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MY, May 1990, pp. 427\u2013437. ACM Press, New York (1990)"},{"key":"24_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_16","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"R. Pass","year":"2006","unstructured":"Pass, R., Shelat, A., Vaikuntanathan, V.: Construction of a non-malleable encryption scheme from any semantically secure one. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, Springer, Heidelberg (2006)"},{"key":"24_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-46766-1_35","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"C. Rackoff","year":"1992","unstructured":"Rackoff, C., Simon, D R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 433\u2013444. Springer, Heidelberg (1992)"},{"key":"24_CR32","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory of Cryptography","author":"O. Reingold","year":"2004","unstructured":"Reingold, O., Trevisan, L., Vadhan, S P: Notions of reducibility between cryptographic primitives. In: Naor, M. (ed.) TCC 2004. LNCS, vol.\u00a02951, pp. 1\u201320. Springer, Heidelberg (2004)"},{"key":"24_CR33","first-page":"387","volume-title":"Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing","author":"J. Rompel","year":"1990","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: Awerbuch, B. (ed.) Proceedings of the 22nd Annual ACM Symposium on the Theory of Computing, Baltimore, MY, May 1990, pp. 387\u2013394. ACM Press, New York (1990)"},{"key":"24_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1007\/3-540-46766-1_19","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"S. Rudich","year":"1992","unstructured":"Rudich, S.: The use of interaction in public cryptosystems (extended abstract). In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 242\u2013251. Springer, Heidelberg (1992)"},{"key":"24_CR35","first-page":"543","volume-title":"40th Annual Symposium on Foundations of Computer Science","author":"A. Sahai","year":"1999","unstructured":"Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: 40th Annual Symposium on Foundations of Computer Science, pp. 543\u2013553. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"24_CR36","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.: Finding 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)"}],"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-70936-7_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:12:55Z","timestamp":1605744775000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70936-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540709350","9783540709367"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70936-7_24","relation":{},"subject":[]}}