{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T15:03:42Z","timestamp":1747062222729},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642168246"},{"type":"electronic","value":"9783642168253"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16825-3_6","type":"book-chapter","created":{"date-parts":[[2010,11,2]],"date-time":"2010-11-02T13:30:44Z","timestamp":1288704644000},"page":"70-83","source":"Crossref","is-referenced-by-count":10,"title":["An Improvement of Key Generation Algorithm for Gentry\u2019s Homomorphic Encryption Scheme"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Ogura","sequence":"first","affiliation":[]},{"given":"Go","family":"Yamamoto","sequence":"additional","affiliation":[]},{"given":"Tetsutaro","family":"Kobayashi","sequence":"additional","affiliation":[]},{"given":"Shigenori","family":"Uchiyama","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A Sieve Algorithm for the Shortest Lattice Vector Problem. In: STOC 2001, pp. 266\u2013275 (2001)","key":"6_CR1","DOI":"10.1145\/380752.380857"},{"key":"6_CR2","volume-title":"GTM138","author":"H. Cohen","year":"1996","unstructured":"Cohen, H.: A Course in Computational Algebraic Number Theory. In: GTM138. Springer, Heidelberg (1996)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"ElGamal, T.: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms. IEEE Transactions on Information Theory\u00a0IT-31, 469\u2013472 (1985)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-540-78967-3_3","volume-title":"Eurocrypt 2008","author":"N. Gama","year":"2008","unstructured":"Gama, N., Nguyen, P.Q.: Predicting Lattice Reduction. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 31\u201351. Springer, Heidelberg (2008), http:\/\/www.di.ens.fr\/~pnguyen\/pub_GaNg08.htm"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully Homomorphic Encryption Using Ideal Lattices. In: STOC 2009, pp. 169\u2013178 (2009)","key":"6_CR5","DOI":"10.1145\/1536414.1536440"},{"doi-asserted-by":"crossref","unstructured":"Gentry, C.: A Fully Homomorphic Encryption Scheme. PhD thesis, Stanford University (2009), http:\/\/crypto.stanford.edu\/craig","key":"6_CR6","DOI":"10.1145\/1536414.1536440"},{"unstructured":"Gentry, C., Halevi, S.: A Working Implementation of Fully Homomorphic Encryption. In: EUROCRYPT 2010 rump session (2010), http:\/\/eurocrypt2010rump.cr.yp.to\/9854ad3cab48983f7c2c5a2258e27717.pdf","key":"6_CR7"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/BFb0052231","volume-title":"Crypto 1997","author":"O. Goldreich","year":"1997","unstructured":"Goldreich, O., Goldwasser, S., Halevi, S.: Public-Key Cryptosystems from Lattice Reduction Problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 112\u2013131. Springer, Heidelberg (1997)"},{"key":"6_CR9","volume-title":"Foundation and Trends in Communications and Information Theory","author":"R.M. Gray","year":"2006","unstructured":"Gray, R.M.: Toeplitz and Circulant Matrices: A Review. In: Foundation and Trends in Communications and Information Theory, vol.\u00a02(3), Now Publishers Inc., USA (2006)"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/BFb0054868","volume-title":"ANTS III","author":"J. Hoffstein","year":"1998","unstructured":"Hoffstein, J., Pipher, J., Silverman, J.: NTRU: A Ring Based Public Key Cryptosystem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 267\u2013288. Springer, Heidelberg (1998)"},{"key":"6_CR11","series-title":"Graduate Studies in Mathematics","doi-asserted-by":"crossref","DOI":"10.1090\/gsm\/047","volume-title":"Classical and Quantum Computation","author":"A.Y. Kitaev","year":"2002","unstructured":"Kitaev, A.Y., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol.\u00a047. AMS, Providence (2002)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra Jr., H.W., Lov\u2019asz, L.: Factoring Polynomials with Rational Coefficients. Mathematische Annalen\u00a0261, 513\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-44670-2_11","volume-title":"CALC 2001","author":"D. Micciancio","year":"2001","unstructured":"Micciancio, D.: Improving Lattice-based Cryptosystems Using the Hermite Normal Form. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 126\u2013145. Springer, Heidelberg (2001)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/BFb0054135","volume-title":"Eurocrypt 1998","author":"T. Okamoto","year":"1998","unstructured":"Okamoto, T., Uchiyama, S.: A New Public-Key Cryptosystem as Secure as Factoring. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 308\u2013318. Springer, Heidelberg (1998)"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","first-page":"223","volume-title":"Eurocrypt 1999","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)"},{"issue":"2","key":"6_CR16","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of ACM"},{"issue":"2-3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C.P. Schnorr","year":"1987","unstructured":"Schnorr, C.P.: A Hierarchy of Polynomial Time Lattice Basis Reduction Algorithms. Theoretical Computer Science\u00a053(2-3), 201\u2013224 (1987)","journal-title":"Theoretical Computer Science"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","volume-title":"PKC 2010","author":"N.P. Smart","year":"2010","unstructured":"Smart, N.P., Vercauteren, F.: Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 420\u2013443. Springer, Heidelberg (2010), http:\/\/eprint.iacr.org\/2009\/571"},{"unstructured":"Stehl\u2019e, D., Steinfeld, R.: Faster Fully Homomorphic Encryption. In: Cryptology ePrint archive (2010), http:\/\/eprint.iacr.org\/2010\/299","key":"6_CR19"},{"unstructured":"Turing Machines, http:\/\/www.math.ku.dk\/~wester\/turing.html","key":"6_CR20"},{"unstructured":"Magma, http:\/\/magma.maths.usyd.edu.au\/magma","key":"6_CR21"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16825-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T00:59:53Z","timestamp":1559782793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16825-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642168246","9783642168253"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16825-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}