{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T12:30:04Z","timestamp":1770813004806,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"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_20","type":"book-chapter","created":{"date-parts":[[2008,8,20]],"date-time":"2008-08-20T12:32:02Z","timestamp":1219235522000},"page":"360-378","source":"Crossref","is-referenced-by-count":104,"title":["Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles"],"prefix":"10.1007","author":[{"given":"Mihir","family":"Bellare","sequence":"first","affiliation":[]},{"given":"Marc","family":"Fischlin","sequence":"additional","affiliation":[]},{"given":"Adam","family":"O\u2019Neill","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Ristenpart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","unstructured":"Bellare, M.: The Goldreich-Levin Theorem (manuscript), http:\/\/www-cse.ucsd.edu\/users\/mihir\/papers\/gl.pdf"},{"key":"20_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45539-6_18","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"M. Bellare","year":"2000","unstructured":"Bellare, M., Boldyreva, A., Micali, S.: Public-key encryption in a multi-user setting: Security proofs and improvements. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 259\u2013274. Springer, Heidelberg (2000)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","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, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"20_CR4","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. Full version of this paper. IACR ePrint archive (2008) http:\/\/eprint.iacr.org\/"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Conference on Computer and Communications Security\u00a0\u2013 CCS 1993","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: Conference on Computer and Communications Security\u00a0\u2013 CCS 1993, pp. 62\u201373. ACM, New York (1993)"},{"key":"20_CR6","first-page":"172","volume-title":"Conference on Computer and Communications Security\u00a0\u2013 CCS 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: Conference on Computer and Communications Security\u00a0\u2013 CCS 2007, pp. 172\u2013184. ACM, New York (2007)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/11761679_25","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"M. Bellare","year":"2006","unstructured":"Bellare, M., Rogaway, P.: The security of triple encryption and a framework for code-based game-playing proofs. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol.\u00a04004, pp. 409\u2013426. Springer, Heidelberg (2006)"},{"key":"20_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. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 519\u2013536. Springer, Heidelberg (1999)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing\u00a015, 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology","author":"M. Blum","year":"1984","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. 289\u2013302. Springer, Heidelberg (1984)"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudorandom bits. SIAM Journal on Computing\u00a013, 850\u2013864 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR12","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":"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":"20_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/978-3-540-24676-3_30","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Di Crescenzo, G., Ostrovsky, R., Persiano, G.: Public key encryption with keyword search. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 506\u2013522. Springer, Heidelberg (2004)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","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, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions (Preliminary version). In: Symposium on the Theory of Computation\u00a0\u2013 STOC 1998, pp. 131\u2013141 (1998)","DOI":"10.1145\/276698.276721"},{"key":"20_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-79263-5_15","volume-title":"Topics in Cryptology \u2013 CT-RSA 2008","author":"I. Damgaard","year":"2008","unstructured":"Damgaard, I., Hofheinz, D., Kiltz, E., Thorbek, R.: Public-key encryption with non-interactive opening. In: Malkin, T. (ed.) CT-RSA 2008. LNCS, vol.\u00a04964, pp. 239\u2013255. Springer, Heidelberg (2008)"},{"key":"20_CR17","unstructured":"Desrosiers, S.: Entropic security in quantum cryptography. arXiv e-Print quant-ph\/0703046 (2007), http:\/\/arxiv.org\/abs\/quant-ph\/0703046"},{"key":"20_CR18","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":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/978-3-540-30576-7_30","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, pp. 556\u2013577. Springer, Heidelberg (2005)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/3-540-39568-7_2","volume-title":"Advances in Cryptology","author":"T. Gamal El","year":"1985","unstructured":"El Gamal, T.: A public-key cryptosystem and a signature scheme based on discrete logarithms. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 10\u201318. Springer, Heidelberg (1985)"},{"key":"20_CR21","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF02620230","volume":"6","author":"O. Goldreich","year":"1993","unstructured":"Goldreich, O.: A uniform complexity treatment of encryption and zero-knowledge. Journal of Cryptology\u00a06, 21\u201353 (1993)","journal-title":"Journal of Cryptology"},{"key":"20_CR22","first-page":"25","volume-title":"Symposium on the Theory of Computation\u00a0\u2013 STOC 1989","author":"O. Goldreich","year":"1989","unstructured":"Goldreich, O., Levin, L.: A hard-core predicate for all one-way functions. In: Symposium on the Theory of Computation\u00a0\u2013 STOC 1989, pp. 25\u201332. ACM, New York (1989)"},{"issue":"2","key":"20_CR23","doi-asserted-by":"publisher","first-page":"412","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 Systems Sciences\u00a028(2), 412\u2013426 (1984)","journal-title":"Journal of Computer and Systems Sciences"},{"issue":"2","key":"20_CR24","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"Micali, S., Rackoff, C., Sloan, R.: The notion of security for probabilistic cryptosystems. SIAM Journal on Computing\u00a017(2), 412\u2013426 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"20_CR25","first-page":"187","volume-title":"Symposium on the Theory of Computing\u00a0\u2013 STOC 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Symposium on the Theory of Computing\u00a0\u2013 STOC 2008, pp. 187\u2013196. ACM, New York (2008)"},{"key":"20_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","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, pp. 133\u2013148. Springer, Heidelberg (2002)"},{"key":"20_CR27","first-page":"44","volume-title":"Symposium on Security and Privacy","author":"D. Song","year":"2000","unstructured":"Song, D., Wagner, D., Perrig, A.: Practical techniques for searches on encrypted data. In: Symposium on Security and Privacy, pp. 44\u201355. IEEE, Los Alamitos (2000)"},{"key":"20_CR28","first-page":"80","volume-title":"Symposium on Foundations of Computer Science\u00a0\u2013 FOCS 1982","author":"A. Yao","year":"1982","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: Symposium on Foundations of Computer Science\u00a0\u2013 FOCS 1982, pp. 80\u201391. IEEE, Los Alamitos (1982)"}],"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_20.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_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540851738","9783540851745"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85174-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}