{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:27:21Z","timestamp":1758266841210,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642243158"},{"type":"electronic","value":"9783642243165"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-24316-5_23","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T06:35:22Z","timestamp":1315636522000},"page":"324-339","source":"Crossref","is-referenced-by-count":6,"title":["Generalized Learning Problems and Applications to Non-commutative Cryptography"],"prefix":"10.1007","author":[{"given":"Gilbert","family":"Baumslag","sequence":"first","affiliation":[]},{"given":"Nelly","family":"Fazio","sequence":"additional","affiliation":[]},{"given":"Antonio R.","family":"Nicolosi","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Shpilrain","sequence":"additional","affiliation":[]},{"suffix":"III","given":"William E.","family":"Skeith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","first-page":"99","volume-title":"Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing","author":"M. Ajtai","year":"1996","unstructured":"Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pp. 99\u2013108. ACM, New York (1996)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Dwork, C.: A public-key cryptosystem with worst-case\/average-case equivalence. In: STOC 1997, pp. 284\u2013293 (1997)","DOI":"10.1145\/258533.258604"},{"issue":"4","key":"23_CR3","first-page":"343","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D., Laird, P.: Learning from noisy examples. Machine Learning\u00a02(4), 343\u2013370 (1988)","journal-title":"Machine Learning"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(02)00585-1","volume":"130","author":"I. Anshel","year":"2003","unstructured":"Anshel, I., Anshel, M., Goldfeld, D.: Non-abelian key agreement protocols. Discrete Applied Mathematics\u00a0130(1), 3\u201312 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-642-03356-8_35","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B. Applebaum","year":"2009","unstructured":"Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 595\u2013618. Springer, Heidelberg (2009)"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Arora, S., Ge, R.: New algorithms for learning in presence of errors (2011) (manuscript)","DOI":"10.1007\/978-3-642-22006-7_34"},{"key":"23_CR7","unstructured":"Baumslag, G., Fazio, N., Nicolosi, A.R., Shpilrain, V., Skeith, III, W. E.: Generalized learning problems and applications to non-commutative cryptography. Cryptology ePrint Archive, Report 2011\/357 (2011), http:\/\/eprint.iacr.org\/2011\/357"},{"key":"23_CR8","first-page":"137","volume":"33","author":"J.C. Birget","year":"2006","unstructured":"Birget, J.C., Magliveras, S.S., Sramka, M.: On public-key cryptosystems based on combinatorial group theory. Tatra Mountains Mathematical Publications\u00a033, 137\u2013148 (2006)","journal-title":"Tatra Mountains Mathematical Publications"},{"issue":"1","key":"23_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/S0097539792232070","volume":"24","author":"A. Blass","year":"1995","unstructured":"Blass, A., Gurevich, Y.: Matrix transformation is complete for the average case. SIAM Journal on Computing\u00a024(1), 3\u201329 (1995)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"2003","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. J. ACM\u00a050, 2003 (2003)","journal-title":"J. ACM"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. SIAM J. of Computing\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. of Computing"},{"key":"23_CR12","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, pp. 360\u2013363. Springer, Heidelberg (2001)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.aam.2005.03.002","volume":"35","author":"D. Garber","year":"2005","unstructured":"Garber, D., Kaplan, S., Teicher, M., Tsaban, B., Vishne, U.: Probabilistic solutions of equations in the braid group. Advances in Applied Mathematics\u00a035, 323\u2013334 (2005)","journal-title":"Advances in Applied Mathematics"},{"key":"23_CR14","first-page":"169","volume-title":"STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C. Gentry","year":"2009","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 169\u2013178. ACM, New York (2009)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-642-14623-7_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C.: Toward basing fully homomorphic encryption on worst-case hardness. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 116\u2013137. Springer, Heidelberg (2010)"},{"key":"23_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-642-14623-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"C. Gentry","year":"2010","unstructured":"Gentry, C., Halevi, S., Vaikuntanathan, V.: i-hop homomorphic encryption and rerandomizable yao circuits. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 155\u2013172. Springer, Heidelberg (2010)"},{"key":"23_CR17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2001","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a01. Cambridge Univ. Press, Cambridge (2001)"},{"key":"23_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography, vol.\u00a02. Cambridge Univ. Press, Cambridge (2004)"},{"issue":"2","key":"23_CR19","first-page":"270","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. JCSS\u00a028(2), 270\u2013299 (1984)","journal-title":"JCSS"},{"key":"23_CR20","volume-title":"Group Theoretic Cryptography","author":"M.I. Gonzalez-Vasco","year":"2012","unstructured":"Gonzalez-Vasco, M.I., Magliveras, S., Steinwandt, R.: Group Theoretic Cryptography. Chapman and Hall\/CRC, United States (to appear, 2012)"},{"issue":"5","key":"23_CR21","first-page":"335","volume":"14","author":"M.I. Gonzalez-Vasco","year":"2002","unstructured":"Gonzalez-Vasco, M.I., Steinwandt, R.: Reaction attacks on public key cryptosystems based on the word problem. Applicable Algebra in Engineering, Communication and Computing\u00a014(5), 335\u2013340 (2002)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"297","DOI":"10.2307\/2324085","volume":"96","author":"N. Gupta","year":"1989","unstructured":"Gupta, N.: On groups in which every element has finite order. Amer. Math. Month.\u00a096, 297\u2013308 (1989)","journal-title":"Amer. Math. Month."},{"key":"23_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-47942-0_2","volume-title":"Information and Communication Security","author":"C. Hall","year":"1999","unstructured":"Hall, C., Goldberg, I., Schneier, B.: Reaction attacks against several public-key cryptosystem. In: Varadharajan, V., Mu, Y. (eds.) ICICS 1999. LNCS, vol.\u00a01726, pp. 2\u201312. Springer, Heidelberg (1999)"},{"key":"23_CR24","volume-title":"The Theory of Groups","author":"M. Hall","year":"1959","unstructured":"Hall, M.: The Theory of Groups. Macmillan Company, New York (1959)"},{"issue":"1-2","key":"23_CR25","first-page":"308","volume":"4","author":"S.V. Ivanov","year":"1994","unstructured":"Ivanov, S.V.: The free Burnside groups of sufficiently large exponents. Internat. J. Algebra Comput.\u00a04(1-2), ii+308 (1994)","journal-title":"Internat. J. Algebra Comput."},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. Journal of the ACM, 392\u2013401 (1993)","DOI":"10.1145\/167088.167200"},{"issue":"177","key":"23_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation\u00a048(177), 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"key":"23_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-30539-2_9","volume-title":"Advances in Cryptology - ASIACRYPT 2004","author":"E. Lee","year":"2004","unstructured":"Lee, E.: Right-invariance: A property for probabilistic analysis of cryptography based on infinite groups. In: Lee, P.J. (ed.) ASIACRYPT 2004. LNCS, vol.\u00a03329, pp. 103\u2013118. Springer, Heidelberg (2004)"},{"key":"23_CR29","series-title":"Classics in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-61896-3","volume-title":"Combinatorial Group Theory","author":"R. Lyndon","year":"2001","unstructured":"Lyndon, R., Schupp, P.: Combinatorial Group Theory. Classics in Mathematics. Springer, Heidelberg (2001)"},{"key":"23_CR30","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":"23_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"23_CR32","doi-asserted-by":"publisher","first-page":"4655","DOI":"10.1090\/S0002-9947-10-04959-7","volume":"362","author":"A. Myasnikov","year":"2010","unstructured":"Myasnikov, A., Roman\u2019kov, V., Ushakov, A., Vershik, A.: The word and geodesic problems in free solvable groups. Trans. Amer. Math. Soc.\u00a0362, 4655\u20134682 (2010)","journal-title":"Trans. Amer. Math. Soc."},{"key":"23_CR33","volume-title":"Group-Based Cryptography","author":"A. Myasnikov","year":"2008","unstructured":"Myasnikov, A., Shpilrain, V., Ushakov, A.: Group-Based Cryptography. Birkh\u00e4user Verlag, Switzerland (2008)"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":"23_CR35","doi-asserted-by":"crossref","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC, pp. 333\u2013342 (2009)","DOI":"10.1145\/1536414.1536461"},{"key":"23_CR36","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1145\/1060590.1060603","volume-title":"STOC","author":"O. Regev","year":"2005","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393. ACM Press, New York (2005)"},{"key":"23_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"23_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-13190-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"M. Dijk van","year":"2010","unstructured":"van Dijk, M., Gentry, C., Halevi, S., Vaikuntanathan, V.: Fully homomorphic encryption over the integers. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 24\u201343. Springer, Heidelberg (2010)"},{"key":"23_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-39568-7_3","volume-title":"Advances in Cryptology","author":"N.R. Wagner","year":"1985","unstructured":"Wagner, N.R., Magyarik, M.R.: A public key cryptosystem based on the word problem. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 19\u201336. Springer, Heidelberg (1985)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24316-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T10:30:48Z","timestamp":1686306648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24316-5_23"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642243158","9783642243165"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24316-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}