{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:46:52Z","timestamp":1743137212453,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022944"},{"type":"electronic","value":"9783642022951"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02295-1_12","type":"book-chapter","created":{"date-parts":[[2009,11,18]],"date-time":"2009-11-18T18:20:09Z","timestamp":1258568409000},"page":"391-426","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Geometry of Provable Security: Some Proofs of Security in Which Lattices Make a Surprise Appearance"],"prefix":"10.1007","author":[{"given":"Craig","family":"Gentry","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,7]]},"reference":[{"key":"12_CR1_12","doi-asserted-by":"crossref","unstructured":"P. Kocher. Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS and Other Systems. In Proc. of Crypto 1996, LNCS 1109, pages 104\u2013113. Springer, 1996","DOI":"10.1007\/3-540-68697-5_9"},{"key":"12_CR2_12","doi-asserted-by":"crossref","unstructured":"P. Kocher, J. Jaffe, and B. Jun. Differential Power Analysis. In Proc. of Crypto 1999, LNCS 1666, pages 388-397. Springer, 1999","DOI":"10.1007\/3-540-48405-1_25"},{"key":"12_CR3_12","doi-asserted-by":"crossref","unstructured":"Y. Ishai, A. Sahai and D. Wagner. Private Circuits: Securing Hardware Against Probing Attacks. In Proc. of Crypto 2003, LNCS 2729, pages 463\u2013481. Springer, 2003","DOI":"10.1007\/978-3-540-45146-4_27"},{"key":"12_CR4_12","doi-asserted-by":"crossref","unstructured":"S. Micali and L. Reyzin. A Model for Physically Observable Cryptography. In Proc. of TCC, LNCS 2951, pages 278\u2013296. Springer, 2004","DOI":"10.1007\/978-3-540-24638-1_16"},{"key":"12_CR5_12","doi-asserted-by":"crossref","unstructured":"C. Rackoff and D. Simon. Noninteractive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack. In Proc. of Crypto 1991, pages 433\u2013444, 1991","DOI":"10.1007\/3-540-46766-1_35"},{"key":"12_CR6_12","doi-asserted-by":"crossref","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. In Proc. of STOC, 542\u2013552, 1991","DOI":"10.1145\/103418.103474"},{"issue":"2","key":"12_CR7_12","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, and M. Naor. Non-malleable Cryptography. SIAM J. Computing, 30(2):391\u2013437, 2000","journal-title":"SIAM J. Computing"},{"issue":"6","key":"12_CR8_12","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"W. Diffie and M. Hellman. New Directions in Cryptography. IEEE Transactions on Information Theory, 22(6):644\u2013654, 1976","journal-title":"IEEE Transactions on Information Theory"},{"issue":"4","key":"12_CR9_12","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"T. ElGamal. A Public Key Cryptosystem and a Signature Scheme Based on the Discrete Logarithm. IEEE Transactions on Information Theory, 31(4):469\u2013472, 1985","journal-title":"IEEE Transactions on Information Theory"},{"key":"12_CR10_12","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, A. Shamir, and L.M. Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. In Comm. of the ACM, pages 120\u2013126, 1978","DOI":"10.1145\/359340.359342"},{"key":"12_CR11_12","unstructured":"M.O. Rabin. Digitalized Signatures and Public-Key Functions as Intractable as Factorization. MIT\/LCS\/TR-212, MIT Laboratory for Computer Science, 1979"},{"key":"12_CR12_12","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Random Oracles are Practical: A Paradigm for Designing Efficient Protocols. In Proc. of ACM CCS, pages 62\u201373, 1993","DOI":"10.1145\/168588.168596"},{"issue":"4","key":"12_CR13_12","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1145\/1008731.1008734","volume":"51","author":"R Canetti","year":"2004","unstructured":"R. Canetti, O. Goldreich, and S. Halevi. The Random Oracle Model, Revisited. J. ACM 51(4): 557\u2013594, 2004","journal-title":"Revisited. J. ACM"},{"key":"12_CR14_12","doi-asserted-by":"crossref","unstructured":"E.-J. Goh and S. Jarecki. A Signature Scheme as Secure as the Diffie Hellman Problem. In Proc. of Eurocrypt 2003, LNCS 2656, pages 401\u2013415. Springer, 2003","DOI":"10.1007\/3-540-39200-9_25"},{"key":"12_CR15_12","doi-asserted-by":"crossref","unstructured":"M. Bellare. Practice-Oriented Provable Security. In Proc. of International Workshop on Information Security (ISW) 1997, LNCS 1396, pages 221\u2013231. Springer, 1998","DOI":"10.1007\/BFb0030423"},{"key":"12_CR16_12","doi-asserted-by":"crossref","unstructured":"D. Coppersmith. Finding a Small Root of a Univariate Modular Equation. In Proc. of Eurocrypt 1996, pages 155\u2013165, 1996","DOI":"10.1007\/3-540-68339-9_14"},{"key":"12_CR17_12","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway. Optimal Asymmetric Encryption. In Proc. of Eurocrypt 1994, pages 92\u2013111. Springer, 1994","DOI":"10.1007\/BFb0053428"},{"key":"12_CR18_12","doi-asserted-by":"crossref","unstructured":"V. Shoup. OAEP Reconsidered. In Proc. of Crypto 2001, pages 239\u2013259. Springer, 2003","DOI":"10.1007\/3-540-44647-8_15"},{"key":"12_CR19_12","doi-asserted-by":"crossref","unstructured":"D. Boneh. Simplified OAEP for the RSA and Rabin Functions. In Proc. of Crypto 2001, LNCS 2139, pages 275\u2013291. Springer, 2001","DOI":"10.1007\/3-540-44647-8_17"},{"key":"12_CR20_12","doi-asserted-by":"crossref","unstructured":"E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern. RSA-OAEP Is Secure under the RSA Assumption. In J. Cryptology, 17(2): 81\u2013104 (2004)","DOI":"10.1007\/s00145-002-0204-y"},{"key":"12_CR21_12","unstructured":"D.J. Bernstein. Reducing Lattice Bases to Find Small-Height Values of Univariate Polynomials. 2003. Available at http:\/\/cr.yp.to\/djb.html"},{"key":"12_CR22_12","doi-asserted-by":"crossref","unstructured":"D. Bleichenbacher. Compressing Rabin Signatures. In Proc. of CT-RSA 2004, LNCS 2964, pages 126\u2013128. Springer, 2004","DOI":"10.1007\/978-3-540-24660-2_10"},{"key":"12_CR23_12","doi-asserted-by":"crossref","unstructured":"B. Vall\u00e9e. Provably Fast Integer Factoring with Quasi-Uniform Small Quadratic Residues. In Proc. of STOC 1989, pages 98\u2013106","DOI":"10.1145\/73007.73016"},{"key":"12_CR24_12","doi-asserted-by":"crossref","unstructured":"B. Vall\u00e9e. Generation of Elements with Small Modular Squares and Provably Fast Integer Factoring Algorithms. In Mathematics of Computation, 56(194): 823\u2013849, 1991","DOI":"10.1090\/S0025-5718-1991-1068808-2"},{"key":"12_CR25_12","unstructured":"G.H. Hardy and E.M. Wright, An Introduction to the Theory of Numbers, Oxford Science Publications (5th edition)"},{"key":"12_CR26_12","doi-asserted-by":"crossref","unstructured":"J.-S. Coron. Security Proof for Partial-Domain Hash Signature Schemes. In Proc. of Crypto 2002, LNCS 2442, pages 613\u2013626. Springer, 2002","DOI":"10.1007\/3-540-45708-9_39"},{"key":"12_CR27_12","doi-asserted-by":"crossref","unstructured":"C. Gentry. How to Compress Rabin Ciphertexts and Signatures (and More). In Proc. of Crypto 2004, LNCS 3152, pages 179\u2013200. Springer, 2004","DOI":"10.1007\/978-3-540-28628-8_11"},{"key":"12_CR28_12","doi-asserted-by":"crossref","unstructured":"A. Lysyanskaya, S. Micali, L. Reyzin, and H. Shacham. Sequential Aggregate Signatures from Trapdoor Homomorphic Permutations. In Proc. of Eurocrypt 2004, LNCS 3027, pages 74\u201390. Springer, 2004","DOI":"10.1007\/978-3-540-24676-3_5"},{"key":"12_CR29_12","doi-asserted-by":"crossref","unstructured":"D. Catalano, P.Q. Nguyen, and J. Stern. The Hardness of Hensel Lifting: The Case of RSA and Discrete Logarithm. In Proc. of Asiacrypt 2002, pages 299\u2013310. Springer, 2002","DOI":"10.1007\/3-540-36178-2_19"},{"key":"12_CR30_12","doi-asserted-by":"crossref","unstructured":"K. Sakurai and T. Takagi. New Semantically Secure Public Key Cryptosystems from the RSA Primitive. In Proc. of Public Key Cryptography, pages 1\u201316, 2002","DOI":"10.1007\/3-540-45664-3_1"},{"key":"12_CR31_12","doi-asserted-by":"crossref","unstructured":"P. Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In Proc. of Eurocrypt 1999, pages 223\u2013238, 1999","DOI":"10.1007\/3-540-48910-X_16"},{"key":"12_CR32_12","doi-asserted-by":"crossref","unstructured":"D. Catalano, R. Gennaro, N. Howgrave-Graham, and P.Q. Nguyen. Paillier\u2019s Cryptosystem Revisited. In Proc. of ACM CCS 2001, pages 206\u2013214, 2001","DOI":"10.1145\/501983.502012"},{"key":"12_CR33_12","doi-asserted-by":"crossref","unstructured":"N. Koblitz. A Course in Number Theory and Cryptography. Springer, 1987","DOI":"10.1007\/978-1-4684-0310-7"},{"key":"12_CR34_12","unstructured":"T. Okamoto. Encryption and Authentication Schemes Based on Public Key Systems. Ph.D. Thesis, University of Tokyo, 1988"},{"key":"12_CR35_12","doi-asserted-by":"crossref","unstructured":"D. Boneh and R. Venkatesan. Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In Proc. of Crypto 1996, LNCS 1109, pages 129\u2013142. Springer, 1996","DOI":"10.1007\/3-540-68697-5_11"},{"key":"12_CR36_12","doi-asserted-by":"crossref","unstructured":"M.I. Gonz\u00e1les Vasco, M. Naslund, and I.E. Shparlinski. The hidden number problem in extension fields and its applications. In Proc. of LATIN 2002, LNCS 2286, pages 105\u2013117. Springer, 2002","DOI":"10.1007\/3-540-45995-2_14"},{"key":"12_CR37_12","doi-asserted-by":"crossref","unstructured":"S.D. Galbraith, H.J. Hopkins, and I.E. Shparlinski. Secure Bilinear Diffie-Hellman Bits. In Proc. of ACISP 2004, LNCS 3108, pages 370\u2013378. Springer, 2004","DOI":"10.1007\/978-3-540-27800-9_32"},{"key":"12_CR38_12","doi-asserted-by":"crossref","unstructured":"D. Boneh and I. Shparlinski. On the Unpredictability of Bits of the Elliptic Curve Diffie\u2013Hellman Scheme. In Proc. of Crypto 2001, LNCS 2139, pages 201\u2013212. Springer, 2001","DOI":"10.1007\/3-540-44647-8_12"},{"key":"12_CR39_12","doi-asserted-by":"crossref","unstructured":"W.-C.W. Li, M. Naslund, and I.E. Shparlinski. The Hidden Number Problem with the Trace and Bit Security of XTR and LUC. In Proc. of Crypto 2002, LNCS 2442, pages 433\u2013448. Springer, 2002","DOI":"10.1007\/3-540-45708-9_28"},{"key":"12_CR40_12","unstructured":"M.I. Gonz\u00e1les Vasco and I.E. Shparlinski. On the security of Diffie-Hellman bits. In Proc. of Workshop on Cryptography and Computational Number Theory, 1999"},{"key":"12_CR41_12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C-P Schnorr","year":"1987","unstructured":"C.-P. Schnorr. A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science, 53:201\u2013224, 1987","journal-title":"Theoretical Computer Science"},{"key":"12_CR42_12","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A. Lenstra","year":"1982","unstructured":"A. Lenstra, H. Lenstra, and L. Lovasz. Factoring Polynomials with Rational Coefficients. Math. Ann. 261, pages 515\u2013534, 1982","journal-title":"Math. Ann."},{"key":"12_CR43_12","doi-asserted-by":"crossref","unstructured":"R. Kannan. Algorithmic geometry of numbers. In Annual Review of Computer Science, vol. 2, pages 231\u2013267, 1987","DOI":"10.1146\/annurev.cs.02.060187.001311"},{"key":"12_CR44_12","doi-asserted-by":"crossref","unstructured":"I.E. Shparlinski. Exponential Sums and Lattice Reduction: Applications to Cryptography. In Finite Fields with Applications to Coding Theory, Cryptography and Related Areas, pages 286\u2013298. Springer, 2002","DOI":"10.1007\/978-3-642-59435-9_23"},{"key":"12_CR45_12","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup. A Practical Public Key Cryptosystem Provably Secure against Adaptive Chosen Ciphertext Attack. In Proc. of Crypto 1998, LNCS 1462, pages 13\u201325. Springer, 1998","DOI":"10.1007\/BFb0055717"}],"container-title":["Information Security and Cryptography","The LLL Algorithm"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02295-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T20:04:00Z","timestamp":1676059440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-02295-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022944","9783642022951"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02295-1_12","relation":{},"ISSN":["1619-7100"],"issn-type":[{"type":"print","value":"1619-7100"}],"subject":[],"published":{"date-parts":[[2009]]},"assertion":[{"value":"7 October 2009","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}