{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:46Z","timestamp":1725566266548},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540226680"},{"type":"electronic","value":"9783540286288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28628-8_11","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:54:02Z","timestamp":1285016042000},"page":"179-200","source":"Crossref","is-referenced-by-count":7,"title":["How to Compress Rabin Ciphertexts and Signatures (and More)"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9910-0","volume-title":"Modular Functions and Dirichlet Series in Number Theory","author":"T.M. Apostol","year":"1976","unstructured":"Apostol, T.M.: Modular Functions and Dirichlet Series in Number Theory. Springer, Heidelberg (1976)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Barr, K., Asanovi\u0107, K.: Energy Aware Lossless Data Compression. In: Proc. of MobiSys 2003 (2003)","DOI":"10.1145\/1066116.1066123"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The Exact Security of Digital Signatures \u2013 How to Sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"11_CR4","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 \u2013 How to Encrypt with RSA. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol.\u00a0950, pp. 92\u2013111. Springer, Heidelberg (1995)"},{"key":"11_CR5","unstructured":"Bernstein, D.J.: A Secure Public-Key Signature System with Extremely Fast Verification (2000), Available at http:\/\/cr.yp.to\/djb.html"},{"key":"11_CR6","unstructured":"Bernstein, D.J.: Proving Tight Security for Standard Rabin-Williams Signatures (2003), Available at http:\/\/cr.yp.to\/djb.html"},{"key":"11_CR7","unstructured":"Bernstein, D.J.: Reducing Lattice Bases to Find Small-Height Values of Univariate Polynomials (2003), Available at http:\/\/cr.yp.to\/djb.html"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bleichenbacher, D.: Compressed Rabin Signatures. In: Proc. of CT-RSA 2004 (2004)","DOI":"10.1007\/978-3-540-24660-2_10"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-44647-8_17","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"D. Boneh","year":"2001","unstructured":"Boneh, D.: Simplified OAEP for the RSA and Rabin Functions. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 275\u2013291. Springer, Heidelberg (2001)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-39200-9_26","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Gentry, C., Lynn, B., Shacham, H.: Aggregate and Verifiably Encrypted Signatures from Bilinear Maps. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 416\u2013432. Springer, Heidelberg (2003)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1007\/3-540-48405-1_21","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"D. Boneh","year":"1999","unstructured":"Boneh, D., Durfee, G., Howgrave-Graham, N.: Factoring N = prq for Large r. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 326\u2013337. Springer, Heidelberg (1999)"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BFb0054117","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"D. Boneh","year":"1998","unstructured":"Boneh, D., Venkatesan, R.: Breaking RSA May Not Be Equivalent to Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 59\u201371. Springer, Heidelberg (1998)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-45325-3_32","volume-title":"Cryptography and Coding","author":"C. Cocks","year":"2001","unstructured":"Cocks, C.: An Identity Based Encryption Scheme Based on Quadratic Residues. In: Honary, B. (ed.) Cryptography and Coding 2001. LNCS, vol.\u00a02260, p. 360. Springer, Heidelberg (2001), http:\/\/www.cesg.gov.uk\/technology\/id-pkc\/media\/ciren.pdf"},{"key":"11_CR14","volume-title":"A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics","author":"H. Cohen","year":"2000","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory, Graduate Texts in Mathematics, 4th edn. Springer, Heidelberg (2000)","edition":"4"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"J.S. Coron","year":"2000","unstructured":"Coron, J.S.: On the Exact Security of Full Domain Hash. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 229\u2013235. Springer, Heidelberg (2000)"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/3-540-45708-9_39","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.-S. Coron","year":"2002","unstructured":"Coron, J.-S.: Security Proof for Partial-Domain Hash Signature Schemes. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 613\u2013626. Springer, Heidelberg (2002)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/3-540-68339-9_14","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"D. Coppersmith","year":"1996","unstructured":"Coppersmith, D.: Finding a Small Root of a Univariate Modular Equation. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 155\u2013165. Springer, Heidelberg (1996)"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"Feige, U., Fiat, A., Shamir, A.: Zero-Knowledge Proofs of Identity. Jour. of Cryptology\u00a01, 77\u201394 (1988)","journal-title":"Jour. of Cryptology"},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","first-page":"186","volume-title":"Advances in Cryptology - CRYPTO \u201986","author":"A. Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol.\u00a0263, pp. 186\u2013194. Springer, Heidelberg (1987)"},{"key":"11_CR20","unstructured":"Hardy, G.H., Wright, E.M.: An Introduction to the Theory of Numbers, 5th edn. Oxford Science Publications"},{"key":"11_CR21","unstructured":"Jonsson, J.: A OAEP Variant with a Tight Security Proof (2003), Available at http:\/\/www.math.kth.se\/~jakobj\/crypto.html"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44598-6_1","volume-title":"Advances in Cryptology - CRYPTO 2000","author":"A.K. Lenstra","year":"2000","unstructured":"Lenstra, A.K., Verheul, E.R.: The XTR Public Key System. In: Bellare, M. (ed.) CRYPTO 2000. LNCS, vol.\u00a01880, pp. 1\u201320. Springer, Heidelberg (2000)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-24676-3_5","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"A. Lysyanskaya","year":"2004","unstructured":"Lysyanskaya, A., Micali, S., Reyzin, L., Shacham, H.: Sequential Aggregate Signatures from Trapdoor Homomorphic Permutations. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 74\u201390. Springer, Heidelberg (2004)"},{"key":"11_CR24","unstructured":"Malone-Lee, J., Mao, W.: Two Birds One Stone: Signcryption Using RSA (2002), Available at http:\/\/www.hpl.hp.com\/techreports\/2002\/HPL-2002-293.html"},{"key":"11_CR25","doi-asserted-by":"publisher","DOI":"10.1201\/9781439821916","volume-title":"Handbook of Applied Cryptography","author":"A. Menezes","year":"1996","unstructured":"Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)"},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1007\/0-387-34799-2_18","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"S. Micali","year":"1990","unstructured":"Micali, S., Shamir, A.: An Improvement of the Fiat-Shamir Identification and Signature Scheme. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 244\u2013247. Springer, Heidelberg (1990)"},{"key":"11_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"432","DOI":"10.1007\/3-540-46877-3_38","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"H. Ong","year":"1991","unstructured":"Ong, H., Schnorr, C.P.: Fast Signature Generation with a Fiat Shamir - Like Scheme. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 432\u2013440. Springer, Heidelberg (1991)"},{"key":"11_CR28","unstructured":"Rabin, M.O.: Digitalized Signatures and Public-Key Functions as Intractable as Factorization, MIT\/LCS\/TR-212, MIT Laboratory for Computer Science (1979)"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/3-540-45682-1_32","volume-title":"Advances in Cryptology - ASIACRYPT 2001","author":"R.L. Rivest","year":"2001","unstructured":"Rivest, R.L., Shamir, A., Tauman, Y.: How to Leak a Secret. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol.\u00a02248, pp. 552\u2013565. Springer, Heidelberg (2001)"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-540-45146-4_21","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"K. Rubin","year":"2003","unstructured":"Rubin, K., Silverberg, A.: Torus-based Cryptography. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 349\u2013365. Springer, Heidelberg (2003)"},{"key":"11_CR31","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, pp. 239\u2013259. Springer, Heidelberg (2001)"},{"key":"11_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-36178-2_1","volume-title":"Advances in Cryptology - ASIACRYPT 2002","author":"A.K. Lenstra","year":"2002","unstructured":"Lenstra, A.K., Shamir, A., Tomlinson, J., Tromer, E.: Analysis of Bernstein\u2019s Factorization Circuit. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol.\u00a02501, pp. 1\u201326. Springer, Heidelberg (2002)"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Vall\u00e9e, B.: Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues. In: Proc. of STOC 1989, pp. 98\u2013106 (1989)","DOI":"10.1145\/73007.73016"},{"issue":"194","key":"11_CR34","doi-asserted-by":"publisher","first-page":"823","DOI":"10.2307\/2008412","volume":"56","author":"B. Vall\u00e9e","year":"1991","unstructured":"Vall\u00e9e, B.: Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms. Mathematics of Computation\u00a056(194), 823\u2013849 (1991)","journal-title":"Mathematics of Computation"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28628-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:25:32Z","timestamp":1605759932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28628-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226680","9783540286288"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28628-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}