{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:45:50Z","timestamp":1768517150909,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540773696","type":"print"},{"value":"9783540773702","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-77370-2_8","type":"book-chapter","created":{"date-parts":[[2008,1,3]],"date-time":"2008-01-03T07:14:38Z","timestamp":1199344478000},"page":"112-129","source":"Crossref","is-referenced-by-count":10,"title":["Space-Efficient Kleptography Without Random Oracles"],"prefix":"10.1007","author":[{"given":"Adam L.","family":"Young","sequence":"first","affiliation":[]},{"given":"Moti M.","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","first-page":"175","volume-title":"IEEE Foundations of Computer Science\u2014FOCS 1977","author":"L.M. Adleman","year":"1977","unstructured":"Adleman, L.M., Manders, K., Miller, G.: On Taking Roots in Finite Fields. In: IEEE Foundations of Computer Science\u2014FOCS 1977, pp. 175\u2013177. IEEE Computer Society Press, Los Alamitos (1977)"},{"key":"8_CR2","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.J.: Public-Key Steganography. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 323\u2013341. Springer, Heidelberg (2004)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Anderson, R.J.: A Practical RSA Trapdoor. Elec. Letters\u00a029(11) (1993)","DOI":"10.1049\/el:19930662"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Anderson, R., Vaudenay, S., Preneel, B., Nyberg, K.: The Newton Channel. In: Workshop on Information Hiding, pp. 151\u2013156 (1996)","DOI":"10.1007\/3-540-61996-8_38"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D.: The Decision Diffie-Hellman Problem. In: Third Algorithmic Number Theory Symposium\u2014ANTS III, pp. 48\u201363 (1998)","DOI":"10.1007\/BFb0054851"},{"key":"8_CR6","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":"8_CR7","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 1996","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":"8_CR8","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., Slakmon, A.: Simple Backdoors for RSA Key Generation. In: The Cryptographers Track at the RSA Conference, pp. 403\u2013416 (2003)","DOI":"10.1007\/3-540-36563-X_28"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"8_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory\u00a0IT-22(6), 644\u2013654 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"203","key":"8_CR11","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1090\/S0025-5718-1993-1189518-9","volume":"61","author":"I. Damg\u00e5rd","year":"1993","unstructured":"Damg\u00e5rd, I., Landrock, P., Pomerance, C.: Average Case Error Estimates for the Strong Probable Prime Test. Math. of Comput.\u00a061(203), 177\u2013194 (1993)","journal-title":"Math. of Comput."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"8_CR13","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":"8_CR14","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":"8_CR15","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":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45708-9_6","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"N.J. Hopper","year":"2002","unstructured":"Hopper, N.J., Langford, J., von Ahn, L.: Provably Secure Steganography. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 77\u201392. Springer, Heidelberg (2002)"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L., Luby, M.: Pseudo-Random Generation from One-Way Functions. In: Symp. on the Th. of Comp.\u2014STOC 1989, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"key":"8_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"8_CR19","unstructured":"Kaliski, B.S.: Elliptic Curves and Cryptography: A Pseudorandom Bit Generator and Other Tools. PhD Thesis, MIT (February 1988)"},{"issue":"3","key":"8_CR20","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":"8_CR21","doi-asserted-by":"crossref","unstructured":"Kaliski, B.S.: Anderson\u2019s RSA trapdoor can be broken. Elec. Letters\u00a029(15) (1993)","DOI":"10.1049\/el:19930929"},{"key":"8_CR22","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":"8_CR23","doi-asserted-by":"crossref","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications. Princeton Computer Science Notes (1996)","DOI":"10.1515\/9780691206844"},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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)"},{"key":"8_CR25","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. Rabin","year":"1980","unstructured":"Rabin, M.: Probabilistic Algorithms in Finite Fields. SIAM Journal on Computing\u00a09, 273\u2013280 (1980)","journal-title":"SIAM Journal on Computing"},{"key":"8_CR26","first-page":"51","volume-title":"Advances in Cryptology\u2014Crypto 1983","author":"G.J. Simmons","year":"1984","unstructured":"Simmons, G.J.: The Prisoners\u2019 Problem and the Subliminal Channel. In: Advances in Cryptology\u2014Crypto 1983, pp. 51\u201367. Plenum Press, New York (1984)"},{"key":"8_CR27","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 Tra. on Telecommunications\u00a05, 459\u2013473 (1994)","journal-title":"European Tra. on Telecommunications"},{"key":"8_CR28","unstructured":"Weis, R., Lucks, S.: All your key bit are belong to us\u2014the true story of black box cryptography. In: Proc. of SANE, pp. 27\u201331 (2002)"},{"key":"8_CR29","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 1996","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":"8_CR30","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 1997","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":"8_CR31","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":"8_CR32","doi-asserted-by":"crossref","unstructured":"Young, A., Yung, M.: An Elliptic Curve Backdoor Algorithm for RSASSA. In: Information Hiding\u2014IH 2006 (2006)","DOI":"10.1007\/978-3-540-74124-4_24"}],"container-title":["Lecture Notes in Computer Science","Information Hiding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77370-2_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,30]],"date-time":"2020-04-30T08:56:46Z","timestamp":1588237006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77370-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540773696","9783540773702"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77370-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}