{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:53:42Z","timestamp":1773237222870,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540851738","type":"print"},{"value":"9783540851745","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85174-5_19","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:32:02Z","timestamp":1219235522000},"page":"335-359","source":"Crossref","is-referenced-by-count":149,"title":["On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles"],"prefix":"10.1007","author":[{"given":"Alexandra","family":"Boldyreva","sequence":"first","affiliation":[]},{"given":"Serge","family":"Fehr","sequence":"additional","affiliation":[]},{"given":"Adam","family":"O\u2019Neill","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and efficiently searchable encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622. Springer, Heidelberg (2007)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M. Bellare","year":"2004","unstructured":"Bellare, M., Boldyreva, A., Palacio, A.: An uninstantiable random-oracle-model scheme for a hybrid-encryption problem. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027. Springer, Heidelberg (2004)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic encryption: Definitional equivalences and constructions without random oracles. In: CRYPTO 2008. LNCS. Springer, Heidelberg (2008)"},{"key":"19_CR4","volume-title":"CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: CCS 1993. ACM, New York (1993)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Rogaway, P.: Collision-resistant hashing: Towards making UOWHFs practical. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294. Springer, Heidelberg (1997)"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Bennett, C., Brassard, G., Crepeau, C., Maurer, U.: Generalized privacy amplification. Transactions on Information Theory\u00a041(6) (1995)","DOI":"10.1109\/18.476316"},{"key":"19_CR7","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On notions of security for deterministic encryption, and efficient constructions without random oracles. Full version of this paper (2008), http:\/\/eprint.iacr.org\/2008\/"},{"key":"19_CR8","volume-title":"STOC 1998","author":"R. Canetti","year":"1998","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. In: STOC 1998. ACM, New York (1998)"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: Universal classes of hash functions. Journal of Computer and System Sciences\u00a018 (1979)","DOI":"10.1016\/0022-0000(79)90044-8"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Carter, J.L., Wegman, M.N.: New hash functions and their use in authentication and set equality. Journal of Computer and System Sciences\u00a022 (1981)","DOI":"10.1016\/0022-0000(81)90033-7"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"D. Chaum","year":"1992","unstructured":"Chaum, D., van Heijst, E., Pfitzmann, B.: Cryptographically strong undeniable signatures, unconditionally secure for the signer. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576. Springer, Heidelberg (1992)"},{"key":"19_CR12","series-title":"Lecture Notes in Computer Science","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. Springer, Heidelberg (1998)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44586-2_9","volume-title":"Public Key Cryptography","author":"I. Damg\u00e5rd","year":"2001","unstructured":"Damg\u00e5rd, I., Jurik, M.: A generalisation, a simplification and some applications of paillier\u2019s probabilistic public-key system. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992. Springer, Heidelberg (2001)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45708-9_37","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"I. Damg\u00e5rd","year":"2002","unstructured":"Damg\u00e5rd, I., Nielsen, J.-B.: Perfect hiding and perfect binding universally composable commitment schemes with constant expansion factor. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442. Springer, Heidelberg (2002)"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"I. Damg\u00e5rd","year":"2003","unstructured":"Damg\u00e5rd, I., Nielsen, J.-B.: Universally composable efficient multiparty computation from threshold homomorphic encryption. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729. Springer, Heidelberg (2003)"},{"key":"19_CR16","unstructured":"Desrosiers, S.: Entropic security in quantum cryptography. ArXiv e-Print quant-ph\/0703046 (2007), http:\/\/arxiv.org\/abs\/quant-ph\/0703046"},{"key":"19_CR17","unstructured":"Desrosiers, S., Dupuis, F.: Quantum entropic security and approximate quantum encryption. arXiv e-Print quant-ph\/0707.0691 (2007), http:\/\/arxiv.org\/abs\/0707.0691"},{"key":"#cr-split#-19_CR18.1","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data, http:\/\/eprint.iacr.org\/2003\/235;","DOI":"10.1007\/978-3-540-24676-3_31"},{"key":"#cr-split#-19_CR18.2","unstructured":"Preliminary version appeared in: EUROCRYPT 2004. LNCS, vol. 3027. Springer, Heidelberg (2004)"},{"key":"19_CR19","volume-title":"STOC 2005","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: STOC 2005. ACM, New York (2005)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","author":"Y. Dodis","year":"2005","unstructured":"Dodis, Y., Smith, A.: Entropic security and the encryption of high entropy messages. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.\u00a03378. Springer, Heidelberg (2005)"},{"key":"19_CR21","volume-title":"Transactions on Information Theory","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and signature scheme based on discrete logarithms. In: Transactions on Information Theory, vol.\u00a031. IEEE, Los Alamitos (1985)"},{"key":"19_CR22","volume-title":"FOCS 2003","author":"S. Goldwasser","year":"2003","unstructured":"Goldwasser, S., Tauman Kalai, Y.: On the (in)security of the Fiat-Shamir paradigm. In: FOCS 2003. IEEE, Los Alamitos (2003)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Hastad, J., Impagliazzo, R., Levin, L., Luby, M.: A pseudorandom generator from any one-way function. Journal of Computing\u00a028(4) (1999)","DOI":"10.1137\/S0097539793244708"},{"key":"19_CR24","volume-title":"STOC 1989","author":"M. Naor","year":"1989","unstructured":"Naor, M., Yung, M.: Universal one-way hash functions and their cryptographic applications. In: STOC 1989. ACM, New York (1989)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"P. Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592. Springer, Heidelberg (1999)"},{"key":"19_CR26","volume-title":"STOC 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC 2008. ACM, New York (2008)"},{"key":"19_CR27","unstructured":"Rosen, A., Segev, G.: Efficient lossy trapdoor functions based on the composite residuosity assumption. In: Cryptology ePrint Archive: Report 2008\/134 (2008)"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46035-7_9","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"A. Russell","year":"2002","unstructured":"Russell, A., Wang, H.: How to fool an unbounded adversary with a short key. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332. Springer, Heidelberg (2002)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"V. Shoup","year":"2000","unstructured":"Shoup, V.: A composition theorem for universal one-way hash functions. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85174-5_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:22:28Z","timestamp":1606184548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85174-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}