{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T13:37:20Z","timestamp":1725716240239},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360947"},{"type":"electronic","value":"9783642360954"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36095-4_24","type":"book-chapter","created":{"date-parts":[[2013,2,11]],"date-time":"2013-02-11T05:56:11Z","timestamp":1360562171000},"page":"375-388","source":"Crossref","is-referenced-by-count":3,"title":["A Fully Homomorphic Cryptosystem with Approximate Perfect Secrecy"],"prefix":"10.1007","author":[{"given":"Michal","family":"Hojs\u00edk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Veronika","family":"P\u016flp\u00e1nov\u00e1","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! In: Mullen, G.L., Shiue, P.J.-S. (eds.) Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol.\u00a0168, pp. 51\u201361. AMS (1994)","DOI":"10.1090\/conm\/168\/01688"},{"issue":"3","key":"24_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10207-002-0012-2","volume":"1","author":"R. Steinwandt","year":"2002","unstructured":"Steinwandt, R., Geiselmann, W., Endsuleit, R.: Attacking a polynomial-based cryptosystem: Polly cracker. International Journal of Information Security\u00a01(3), 143\u2013148 (2002)","journal-title":"International Journal of Information Security"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Caboara, M., Caruso, F., Traverso, C.: Lattice polly cracker cryptosystems. J. Symb. Comput., 534\u2013549 (2011)","DOI":"10.1016\/j.jsc.2010.10.004"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Mitzenmacher, M. (ed.) STOC, pp. 169\u2013178. ACM (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-29011-4_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"C. Gentry","year":"2012","unstructured":"Gentry, C., Halevi, S., Smart, N.P.: Fully Homomorphic Encryption with Polylog Overhead. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 465\u2013482. Springer, Heidelberg (2012)"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V. (leveled) fully homomorphic encryption without bootstrapping. In: Goldwasser, S. (ed.) ITCS, pp. 309\u2013325. ACM (2012)","DOI":"10.1145\/2090236.2090262"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. Journal of the ACM\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568324"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-25385-0_10","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"M.R. Albrecht","year":"2011","unstructured":"Albrecht, M.R., Farshim, P., Faug\u00e8re, J.-C., Perret, L.: Polly Cracker, Revisited. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 179\u2013196. Springer, Heidelberg (2011)"},{"key":"24_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-30057-8_2","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"G. Herold","year":"2012","unstructured":"Herold, G.: Polly Cracker, Revisited, Revisited. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 17\u201333. Springer, Heidelberg (2012)"},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra, 2nd edn. Undergraduate texts in mathematics, pp. 1\u2013536. Springer (1997)","DOI":"10.1007\/978-3-319-16721-3_11"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013 CT-RSA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36095-4_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T11:15:50Z","timestamp":1562670950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36095-4_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360947","9783642360954"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36095-4_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}