{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:21:32Z","timestamp":1759638092190,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130120"},{"type":"electronic","value":"9783642130137"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13013-7_18","type":"book-chapter","created":{"date-parts":[[2010,5,14]],"date-time":"2010-05-14T06:18:57Z","timestamp":1273817937000},"page":"296-311","source":"Crossref","is-referenced-by-count":35,"title":["Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions"],"prefix":"10.1007","author":[{"given":"Petros","family":"Mol","sequence":"first","affiliation":[]},{"given":"Scott","family":"Yilek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 1\u201335. Springer, Heidelberg (2009)"},{"key":"18_CR2","first-page":"103","volume-title":"STOC","author":"M. Blum","year":"1988","unstructured":"Blum, M., Feldman, P., Micali, S.: Non-interactive zero-knowledge and its applications (extended abstract). In: STOC, pp. 103\u2013112. ACM, New York (1988)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C. Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.: Computationally Private Information Retrieval with Polylogarithmic Communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y. Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data. SIAM J. Comput.\u00a038(1), 97\u2013139 (2008); Cachin, C., Camenisch, J.L. (eds.): EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 523\u2013540. Springer, Heidelberg (2004)","journal-title":"SIAM J. Comput."},{"key":"18_CR6","volume-title":"PKC 2010","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: Number-theoretic constructions of lossy and correlation-secure trapdoor functions. In: PKC 2010. Springer, Heidelberg (to appear, 2010)"},{"key":"18_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/73007.73010","volume-title":"Proceedings of the 21st Annual ACM Symposium on Theory of Computing \u2013 STOC 1989","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proceedings of the 21st Annual ACM Symposium on Theory of Computing \u2013 STOC 1989, pp. 25\u201332. ACM, New York (1989)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"EUROCRYPT 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical Chosen Ciphertext Secure Encryption from Factoring. In: Joux, A. (ed.) EUROCRYPT 2009, vol.\u00a05479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"key":"18_CR9","unstructured":"Kiltz, E., O\u2019Neill, A., Smith, A.: Lossiness of RSA and the Chosen-Ciphertext Security of OAEP without Random Oracles (2009) (manuscript)"},{"key":"18_CR10","volume-title":"The Theory of Error-Correcting Codes","author":"F. Macwilliams","year":"1983","unstructured":"Macwilliams, F., Sloane, N.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (January 1983)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Mol, P., Yilek, S.: Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions. Cryptology ePrint Archive, Report 2009\/524 (2009), http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-642-13013-7_18"},{"key":"18_CR12","first-page":"607","volume-title":"FOCS","author":"S. Myers","year":"2009","unstructured":"Myers, S., Shelat, A.: Bit Encryption Is Complete. In: FOCS, pp. 607\u2013616. IEEE Computer Society, Los Alamitos (2009)"},{"key":"18_CR13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/100216.100273","volume-title":"STOC","author":"M. Naor","year":"1990","unstructured":"Naor, M., Yung, M.: Public-key Cryptosystems Provably Secure against Chosen Ciphertext Attacks. In: STOC, pp. 427\u2013437. ACM, New York (1990)"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy Trapdoor Functions and Their Applications (October 5, 2009), Latest Version availbale at http:\/\/www.cc.gatech.edu\/~cpeikert\/","DOI":"10.1145\/1374376.1374406"},{"key":"18_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/1374376.1374406","volume-title":"STOC 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy Trapdoor Functions and Their Applications. In: STOC 2008, pp. 187\u2013196. ACM, New York (2008)"},{"key":"18_CR16","unstructured":"Rabin, M.O.: Digitalized Signatures and Public-Key Functions as Intractable as Factorization. Technical report, Massachusetts Institute of Technology (1979)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","first-page":"433","volume-title":"CRYPTO \u201991","author":"C. Rackoff","year":"1991","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 (1991)"},{"issue":"2","key":"18_CR18","first-page":"300","volume":"8","author":"I.S. Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial Codes Over Certain Finite Fields. SIAM J. Comput.\u00a08(2), 300\u2013304 (1960)","journal-title":"SIAM J. Comput."},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. IACR ePrint Archive, Report 2008\/116","DOI":"10.1007\/978-3-642-00457-5_25"},{"key":"18_CR20","unstructured":"Rosen, A., Segev, G.: Efficient lossy trapdoor functions based on the composite residuosity assumption. IACR ePrint Archive, Report 2008\/134"},{"key":"18_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"TCC 2009","author":"A. Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"issue":"11","key":"18_CR22","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to Share a Secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1109\/TIT.1964.1053661","volume":"10","author":"R.C. Singleton","year":"1964","unstructured":"Singleton, R.C.: Maximum Distance q-nary Codes. IEEE Transactions on Information Theory\u00a010, 116\u2013118 (1964)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13013-7_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T21:41:40Z","timestamp":1740087700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13013-7_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130120","9783642130137"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13013-7_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}