{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:50Z","timestamp":1772283650645,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642300561","type":"print"},{"value":"9783642300578","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_2","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T17:05:50Z","timestamp":1337360750000},"page":"17-33","source":"Crossref","is-referenced-by-count":5,"title":["Polly Cracker, Revisited, Revisited"],"prefix":"10.1007","author":[{"given":"Gottfried","family":"Herold","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","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 \u2014 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. (ed.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 179\u2013196. Springer, Heidelberg (2011); Cryptology ePrint Archive, Report 2011\/289, \n                    \n                      http:\/\/eprint.iacr.org\/"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/jsco.1994.1061","volume":"18","author":"B. Barkee","year":"1994","unstructured":"Barkee, B., Can, D.C., Ecks, J., Moriarty, T., Ree, R.F.: Why you cannot even hope to use Gr\u00f6bner bases in public key cryptography: An open letter to a scientist who failed and a challenge to those who have not yet failed. J. of Symbolic Computations\u00a018(6), 497\u2013501 (1994)","journal-title":"J. of Symbolic Computations"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Becker, T., Weispfenning, V.: Gr\u00f6bner bases: a computational approach to commutative algebra. Graduate Texts in Mathematics. Springer (1993)","DOI":"10.1007\/978-1-4612-0913-3"},{"key":"#cr-split#-2_CR4.1","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. To appear in FOCS 2011 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"key":"#cr-split#-2_CR4.2","unstructured":"Cryptology ePrint Archive, Report 2011\/344 (2011),     http:\/\/eprint.iacr.org\/"},{"key":"2_CR5","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenrings nach einem nulldimensionalen Polynomideal. PhD thesis, Universit\u00e4t Innsbruck (1965)"},{"key":"2_CR6","unstructured":"Cox, D., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Springer (2005)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"dit Vehel, F.L., Marinari, M.G., Perret, L., Traverso, C.: A survey on Polly Cracker systems. In: Gr\u00f6bner Bases. Coding and Cryptography, pp. 285\u2013305. Springer (2009)","DOI":"10.1007\/978-3-540-93806-4_16"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Fellows, M., Koblitz, N.: Combinatorial cryptosystems galore! In: Finite Fields: Theory, Applications, and Algorithms. Contemporary Mathematics, vol.\u00a0168, pp. 51\u201361. AMS (1994)","DOI":"10.1090\/conm\/168\/01688"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. PhD thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-13190-5_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"V. Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On Ideal Lattices and Learning with Errors over Rings. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 1\u201323. Springer, Heidelberg (2010)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A Framework for Efficient and Composable Oblivious Transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing (STOC 2005), pp. 84\u201393. ACM (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Regev, O.: The learning with errors problem (invited survey). In: IEEE Conference on Computational Complexity, pp. 191\u2013204. IEEE Computer Society Press (2010)","DOI":"10.1109\/CCC.2010.26"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-642-19571-6_14","volume-title":"Theory of Cryptography","author":"R. Rothblum","year":"2011","unstructured":"Rothblum, R.: Homomorphic Encryption: From Private-Key to Public-Key. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 219\u2013234. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:26:02Z","timestamp":1620127562000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}