{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:52:56Z","timestamp":1725562376210},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540209966"},{"type":"electronic","value":"9783540246602"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24660-2_11","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:18:44Z","timestamp":1280762324000},"page":"129-142","source":"Crossref","is-referenced-by-count":0,"title":["A Key Recovery System as Secure as Factoring"],"prefix":"10.1007","author":[{"given":"Adam","family":"Young","sequence":"first","affiliation":[]},{"given":"Moti","family":"Yung","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Boyar, J., Friedl, K., Lund, C.: Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies. Journal of Cryptology (1991)","DOI":"10.1007\/BF00196727"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1145\/168588.168596","volume-title":"Proc. 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: Proc. First Annual Conference on Computer and Communications Security, pp. 62\u201373. ACM, New York (1993) (on-line version dated October 20, 1995)"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/BFb0053428","volume-title":"Advances in Cryptology - EUROCRYPT \u201994","author":"M. Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: Optimal Asymmetric Encryption- How to Encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01228507","volume":"9","author":"E. Bach","year":"1993","unstructured":"Bach, E., Sorenson, J.: Sive Algorithms for Perfect Power Testing. Algorithmica\u00a09, 313\u2013328 (1993)","journal-title":"Algorithmica"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-44448-3_25","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"J. Camenisch","year":"2000","unstructured":"Camenisch, J., Damgaard, I.: Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, p. 331. Springer, Heidelberg (2000)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-48910-X_8","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"J. Camenisch","year":"1999","unstructured":"Camenisch, J., Michels, M.: Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol.\u00a01592, p. 107. Springer, Heidelberg (1999)"},{"key":"11_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-45146-4_8","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"J. Camenisch","year":"2003","unstructured":"Camenisch, J., Shoup, V.: Practical Verifiable Encryption and Decryption of Discrete Logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 126\u2013144. Springer, Heidelberg (2003)"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/BFb0054115","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"E. Fujisaki","year":"1998","unstructured":"Fujisaki, E., Okamoto, T.: A Practical and Provably Secure Scheme for Publicly Verifiable Secret Sharing and Its Applications. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 32\u201346. Springer, Heidelberg (1998)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/3-540-44647-8_16","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"E. Fujisaki","year":"2001","unstructured":"Fujisaki, E., Okamoto, T., Pointcheval, D., Stern, J.: RSA-OAEP is Secure under the RSA Assumption. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 260\u2013274. Springer, Heidelberg (2001)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing\u00a018, 186\u2013208 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Micciancio, D., Rabin, T.: An Efficient Non-Interactive Statistical Zero-Knowledge Proof System for Quasi-Safe Prime Products. In: The 5th ACM Conference on Computer and Communications Security (1998)","DOI":"10.1145\/288090.288108"},{"key":"11_CR12","unstructured":"Goldreich, O.: Introduction to Complexity Theory: Non-Uniform Polynomial Time - P\/poly. Lecture number 8, Goldreich\u2019s web page at http:\/\/www.wisdom.weizmann.ac.il\/~oded\/PS\/CC\/l8.ps"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/978-3-662-12521-2","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Appendix A.2","author":"O. Goldreich","year":"1999","unstructured":"Goldreich, O.: Modern Cryptography, Probabilistic Proofs and Pseudo-randomness. Appendix A.2, p. 113. Springer, Heidelberg (1999)"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Introduction. In: Foundations of Cryptography, ch. 1, February 27 (1998)","DOI":"10.1017\/CBO9780511546891.002"},{"key":"11_CR15","unstructured":"Goldreich, O.: Fragments of a chapter on Encryption Schemes, ch. 5, sec. 2, February 10 (2002)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/3-540-48184-2_9","volume-title":"Advances in Cryptology - CRYPTO \u201987","author":"J. Graaf van de","year":"1988","unstructured":"van de Graaf, J., Peralta, R.: A simple and secure way to show the validity of your public key. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 128\u2013134. Springer, Heidelberg (1988)"},{"key":"11_CR17","unstructured":"Liskov, M., Silverman, R.: A Statistical Limited-Knowledge Proof for Secure RSA Keys. Submitted to IEEE P1363 working group"},{"key":"11_CR18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and Cryptographic Applications","author":"M. Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and Cryptographic Applications, p. 4. Princeton University Press, Princeton (1996)"},{"key":"11_CR19","first-page":"89","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1997","unstructured":"Menezes, A., Orschoot, P., Vanstone, S.: Handbook of Applied Cryptography, p. 89. CRC Press, Boca Raton (1997)"},{"key":"11_CR20","unstructured":"Naccache, D., Stern, J.: A new candidate trapdoor function. In: 5th ACM Symposium on Computer and Communications Security (1998)"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: An efficient public-key cryptosystem. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"11_CR22","unstructured":"PKCS #1-RSA Cryptography Standard, version 2.1, available from http:\/\/www.rsa.com\/rsalabs\/pkcs"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","first-page":"223","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, pp. 223\u2013238. Springer, Heidelberg (1999)"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-45539-6_13","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"G. Poupard","year":"2000","unstructured":"Poupard, G., Stern, J.: Fair Encryption of RSA Keys. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, p. 172. Springer, Heidelberg (2000)"},{"key":"11_CR25","unstructured":"Rabin, M.: Digitalized signatures and public-key functions as intractable as factorization, TR-212, MIT Laboratory for Computer Science (January 1979)"},{"key":"11_CR26","first-page":"126","volume-title":"A First Course in Probability Theory","author":"S. Ross","year":"1994","unstructured":"Ross, S.: A First Course in Probability Theory, 4th edn., p. 126. Prentice-Hall, Englewood Cliffs (1994)","edition":"4"},{"issue":"2","key":"11_CR27","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"11_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-44647-8_15","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"V. Shoup","year":"2001","unstructured":"Shoup, V.: OAEP Reconsidered. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 239. Springer, Heidelberg (2001)"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Young, A., Yung, M.: Auto-Recoverable and Auto-certifiable cryptosystems with RSA or factoring based keys. United States Patent 6,389,136. Filed September 17 (1997) (Issued May 14, 2002)","DOI":"10.1007\/BFb0054114"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0054114","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"A. Young","year":"1998","unstructured":"Young, A., Yung, M.: Auto-Recoverable Auto-Certifiable Cryptosystems. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 17\u201331. Springer, Heidelberg (1998)"},{"key":"11_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/3-540-46701-7_18","volume-title":"Secure Networking - CQRE (Secure) \u201999","author":"A. Young","year":"1999","unstructured":"Young, A., Yung, M.: Auto-Recoverable Auto-Certifiable Cryptosystems (a survey). In: Baumgart, R. (ed.) CQRE 1999. LNCS, vol.\u00a01740, p. 204. Springer, Heidelberg (1999)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-46588-1_22","volume-title":"Public Key Cryptography","author":"A. Young","year":"2000","unstructured":"Young, A., Yung, M.: RSA Based Auto-Recoverable Cryptosystems. In: Imai, H., Zheng, Y. (eds.) PKC 2000. LNCS, vol.\u00a01751, pp. 326\u2013341. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24660-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T18:21:14Z","timestamp":1635877274000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24660-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540209966","9783540246602"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24660-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}