{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T23:58:10Z","timestamp":1768521490812,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153167","type":"print"},{"value":"9783642153174","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15317-4_18","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T02:46:58Z","timestamp":1284086818000},"page":"271-290","source":"Crossref","is-referenced-by-count":19,"title":["Kleptography from Standard Assumptions and Applications"],"prefix":"10.1007","author":[{"given":"Adam","family":"Young","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/11745853_27","volume-title":"Public Key Cryptography - PKC 2006","author":"O. Chevassut","year":"2006","unstructured":"Chevassut, O., Fouque, P., Gaudry, P., Pointcheval, D.: The Twist-AUgmented Technique for Key Exchange. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 410\u2013426. Springer, Heidelberg (2006)"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-68339-9_16","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a small root of a bivariate integer equation; factoring with high bits known. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 178\u2013189. Springer, Heidelberg (1996)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/3-540-36563-X_28","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"C. Cr\u00e9peau","year":"2003","unstructured":"Cr\u00e9peau, C., Slakmon, A.: Simple backdoors for rsa key generation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 403\u2013416. Springer, Heidelberg (2003)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/0-387-34799-2_29","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"Y. Desmedt","year":"1990","unstructured":"Desmedt, Y.: Abuses in cryptography and how to fight them. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 375\u2013389. Springer, Heidelberg (1990)"},{"issue":"6","key":"18_CR6","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.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a022(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1007\/978-3-540-28628-8_30","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"Y. Dodis","year":"2004","unstructured":"Dodis, Y., Gennaro, R., H\u00e5stad, J., Krawczyk, H., Rabin, T.: Randomness extraction and key derivation using the CBC, cascade and HMAC modes. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 494\u2013510. Springer, Heidelberg (2004)"},{"issue":"206","key":"18_CR8","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. of Computation\u00a062(206), 865\u2013874 (1994)","journal-title":"Math. of Computation"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-540-24676-3_22","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"R. Gennaro","year":"2004","unstructured":"Gennaro, R., Krawczyk, H., Rabin, T.: Secure hashed Diffie-Hellman over non-DDH groups. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 361\u2013381. Springer, Heidelberg (2004)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/10958513_13","volume-title":"Information Security","author":"E.-J. Goh","year":"2003","unstructured":"Goh, E.-J., Boneh, D., Pinkas, B., Golle, P.: The design and implementation of protocol-based hidden key recovery. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol.\u00a02851, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/11935070_13","volume-title":"Cryptology and Network Security","author":"Z. Golebiewski","year":"2006","unstructured":"Golebiewski, Z., Kutylowski, M., Zagorski, F.: Stealing secrets with SSL\/TLS and SSH\u2014kleptographic attacks. In: Pointcheval, D., Mu, Y., Chen, K. (eds.) CANS 2006. LNCS, vol.\u00a04301, pp. 191\u2013202. Springer, Heidelberg (2006)"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L., Luby, M.: Pseudo-random generation from one-way functions. In: Symp. on the Theory of Comput.\u2014STOC 1989, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"18_CR13","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","year":"1987","unstructured":"Kaliski, 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":"18_CR14","unstructured":"Kaliski, B.S.: Elliptic curves and cryptography: A pseudorandom bit generator and other tools. PhD Thesis. MIT (February 1988)"},{"issue":"3","key":"18_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF00196911","volume":"3","author":"B.S. Kaliski","year":"1991","unstructured":"Kaliski, B.S.: One-way permutations on elliptic curves. Journal of Cryptology\u00a03(3), 187\u2013199 (1991)","journal-title":"Journal of Cryptology"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49649-1_1","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A.K. Lenstra","year":"1998","unstructured":"Lenstra, A.K.: Generating RSA moduli with a predetermined portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 1\u201310. Springer, Heidelberg (1998)"},{"key":"18_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-30108-0_21","volume-title":"Computer Security \u2013 ESORICS 2004","author":"B. M\u00f6ller","year":"2004","unstructured":"M\u00f6ller, B.: A public-key encryption scheme with pseudo-random ciphertexts. In: Samarati, P., Ryan, P.Y.A., Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 335\u2013351. Springer, Heidelberg (2004)"},{"issue":"5","key":"18_CR18","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 Trans. on Info. Theory\u00a039(5), 1639\u20131646 (1993)","journal-title":"IEEE Trans. on Info. Theory"},{"key":"18_CR19","first-page":"81","volume":"47","author":"T. Satoh","year":"1998","unstructured":"Satoh, T., Araki, K.: Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves. Commentarii Mathematici Universitatis Sancti Pauli\u00a047, 81\u201392 (1998)","journal-title":"Commentarii Mathematici Universitatis Sancti Pauli"},{"issue":"221","key":"18_CR20","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1090\/S0025-5718-98-00887-4","volume":"67","author":"I. Semaev","year":"1998","unstructured":"Semaev, I.: Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p. Math. of Computation\u00a067(221), 353\u2013356 (1998)","journal-title":"Math. of Computation"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Simmons, G.J.: The prisoners\u2019 problem and the subliminal channel. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology\u2014Crypto 1983. LNCS, vol.\u00a01440, pp. 51\u201367. Springer, Heidelberg (1999)","DOI":"10.1007\/978-1-4684-4730-9_5"},{"issue":"4","key":"18_CR22","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1002\/ett.4460050408","volume":"5","author":"G.J. Simmons","year":"1994","unstructured":"Simmons, G.J.: Subliminal channels: past and present. European Transactions on Telecommunications\u00a05(4), 459\u2013473 (1994)","journal-title":"European Transactions on Telecommunications"},{"issue":"3","key":"18_CR23","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s001459900052","volume":"12","author":"N. Smart","year":"1999","unstructured":"Smart, N.: The discrete logarithm problem on elliptic curves of trace one. Journal of Cryptology\u00a012(3), 193\u2013196 (1999)","journal-title":"Journal of Cryptology"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-68697-5_8","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"A. Young","year":"1996","unstructured":"Young, A., Yung, M.: The dark side of black-box cryptography, or: Should we trust capstone? In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 89\u2013103. Springer, Heidelberg (1996)"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/3-540-69053-0_6","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"A. Young","year":"1997","unstructured":"Young, A., Yung, M.: Kleptography: Using cryptography against cryptography. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 62\u201374. Springer, Heidelberg (1997)"},{"key":"18_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11693383_9","volume-title":"Selected Areas in Cryptography","author":"A. Young","year":"2006","unstructured":"Young, A., Yung, M.: A space efficient backdoor in RSA and its applications. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 128\u2013143. Springer, Heidelberg (2006)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-540-77370-2_8","volume-title":"Information Hiding","author":"A. Young","year":"2008","unstructured":"Young, A., Yung, M.: Space-efficient kleptography without random oracles. In: Furon, T., Cayre, F., Do\u00ebrr, G., Bas, P. (eds.) IH 2007. LNCS, vol.\u00a04567, pp. 112\u2013129. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Security and Cryptography for Networks"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15317-4_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,11]],"date-time":"2020-06-11T12:33:28Z","timestamp":1591878808000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15317-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153167","9783642153174"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15317-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}