{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:33:48Z","timestamp":1780068828785,"version":"3.54.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540229872","type":"print"},{"value":"9783540301080","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30108-0_21","type":"book-chapter","created":{"date-parts":[[2010,9,16]],"date-time":"2010-09-16T18:15:03Z","timestamp":1284660903000},"page":"335-351","source":"Crossref","is-referenced-by-count":33,"title":["A Public-Key Encryption Scheme with Pseudo-random Ciphertexts"],"prefix":"10.1007","author":[{"given":"Bodo","family":"M\u00f6ller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: DHAES: An encryption scheme based on the Diffie-Hellman problem (1998) (submission to IEEE P1363a), http:\/\/grouper.ieee.org\/groups\/1363\/P1363a\/Encryption.html"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-45353-9_12","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Abdalla","year":"2001","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle Diffie-Hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 143\u2013158. Springer, Heidelberg (2001)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-540-24676-3_20","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"L. Ahn von","year":"2004","unstructured":"von Ahn, L., Hopper, N.: Public key steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 323\u2013341. Springer, Heidelberg (2004)"},{"key":"21_CR4","unstructured":"American National Standards Institute (ANSI). Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ECDSA). ANSI X9.62 (1998)"},{"key":"21_CR5","unstructured":"Backes, M., Cachin, C.: Public-key steganography with active attacks. Cryptology ePrint Archive Report 2003\/231 (revised Febraury 16, 2004) (2004), Available from http:\/\/eprint.iacr.org\/"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 1\u201315. Springer, Heidelberg (1996)"},{"key":"21_CR7","first-page":"394","volume-title":"38th Annual Symposium on Foundations of Computer Science (FOCS 1997)","author":"M. Bellare","year":"1997","unstructured":"Bellare, M., Desai, A., Jokipii, E., Rogaway, P.: A concrete security treatment of symmetric encryption. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 394\u2013403. IEEE Computer Society, Los Alamitos (1997)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0055718","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, pp. 26\u201346. Springer, Heidelberg (1998)"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"First Annual Conference on Computer and Communications Security","author":"M. Bellare","year":"1993","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: A paradigm for designing efficient protocols. In: First Annual Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Analogical and Inductive Inference","author":"I.F. Blake","year":"1987","unstructured":"Blake, I.F., Seroussi, G., Smart, N.P.: Elliptic Curves in Cryptography. In: Jantke, K.P. (ed.) AII 1986. LNCS, vol.\u00a0265, Springer, Heidelberg (1987)"},{"key":"21_CR11","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. E-print cs.CR\/0010019 (2000), Available from http:\/\/arXiv.org\/abs\/cs\/0010019"},{"key":"21_CR12","unstructured":"Certicom Research. Standards for efficient cryptography \u2013 SEC 1: Elliptic curve cryptography. Version 1.0 (2000), Available from http:\/\/www.secg.org\/"},{"key":"21_CR13","unstructured":"Certicom Research. Standards for efficient cryptography \u2013 SEC 2: Recommended elliptic curve cryptography domain parameters. Version 1.0 (2000), Available from http:\/\/www.secg.org\/"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM Journal on Computing. to appear (2003) (to appear), Available from http:\/\/shoup.net\/papers\/","DOI":"10.1137\/S0097539702403773"},{"issue":"6","key":"21_CR15","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-44987-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2001","author":"M. Fouquet","year":"2001","unstructured":"Fouquet, M., Gaudry, P., Harley, R.: Finding secure curves with the Satoh-FGH algorithm and an early-abort strategy. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol.\u00a02045, pp. 14\u201329. Springer, Heidelberg (2001)"},{"key":"21_CR17","unstructured":"Galbraith, S., McKee, J.: The probability that the number of points on an elliptic curve over a finite field is prime. CACR Technical Report CORR 99-51 (1999), Available from http:\/\/www.cacr.math.uwaterloo.ca\/techreports\/1999\/"},{"key":"21_CR18","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography \u2013 Vol. II: Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography \u2013 Vol. II: Basic Applications. Cambridge University Press, Cambridge (2004)"},{"key":"21_CR19","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, 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR20","unstructured":"Institute of Electrical and Electronics Engineers (IEEE). IEEE standard specifications for public-key cryptography. IEEE Std 1363-2000 (2000)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/3-540-47721-7_7","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"B.S. Kaliski Jr.","year":"1987","unstructured":"Kaliski Jr., B.S.: A pseudo-random bit generator based on elliptic logarithms. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 84\u2013103. Springer, Heidelberg (1987)"},{"key":"21_CR22","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00196911","volume":"3","author":"B.S. Kaliski Jr.","year":"1991","unstructured":"Kaliski Jr., B.S.: One-way permutations on elliptic curves. Journal of Cryptology\u00a03, 187\u2013199 (1991)","journal-title":"Journal of Cryptology"},{"key":"21_CR23","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048, 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Krawczyk, H., Bellare, M., Canetti, R.: HMAC: Keyed-hashing for message authentication. RFC 2104 (1997), Available from http:\/\/www.ietf.org\/rfc\/rfc2104.txt","DOI":"10.17487\/rfc2104"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/3-540-69053-0_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Lercier","year":"1997","unstructured":"Lercier, R.: Finding good random elliptic curves for cryptosystems defined over F2n. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 379\u2013392. Springer, Heidelberg (1997)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-39200-9_22","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"R. Lercier","year":"2003","unstructured":"Lercier, R., Lubicz, D.: Counting points on elliptic curves over finite fields of small characteristic in quasi quadratic time. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 360\u2013373. Springer, Heidelberg (2003)"},{"key":"21_CR27","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"Menezes, A., Okamoto, T., Vanstone, S.: Reducing elliptic curve logarithms to logarithms in a finite field. IEEE Transactions on Information Theory\u00a039, 1639\u20131646 (1993)","journal-title":"IEEE Transactions on Information Theory"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013428. Springer, Heidelberg (1986)"},{"key":"21_CR29","unstructured":"National Institute of Standards and Technology. Recommendation for block cipher modes of operation \u2013 methods and techniques. NIST Special Publication SP 800-38A (2001)"},{"key":"21_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"Public Key Cryptography","author":"T. Okamoto","year":"2001","unstructured":"Okamoto, T., Pointcheval, D.: A new class of problems for the security of cryptographic schemes. In: Kim, K.-c. (ed.) PKC 2001. LNCS, vol.\u00a01992, pp. 104\u2013118. Springer, Heidelberg (2001)"},{"key":"21_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.W. Rackoff","year":"1992","unstructured":"Rackoff, C.W., 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":"21_CR32","unstructured":"Shoup, V.: A proposal for an ISO standard for public key encryption. Version 2.1 (December 20, 2001), http:\/\/shoup.net\/papers\/"},{"key":"21_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/3-540-36288-6_6","volume-title":"Public Key Cryptography - PKC 2003","author":"Y. Watanabe","year":"2002","unstructured":"Watanabe, Y., Shikata, J., Imai, H.: Equivalence between semantic security and indistinguishability against chosen ciphertext attacks. In: Desmedt, Y.G. (ed.) PKC 2003. LNCS, vol.\u00a02567, pp. 71\u201384. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2004"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30108-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T20:52:03Z","timestamp":1591908723000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30108-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540229872","9783540301080"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30108-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}