{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:05:17Z","timestamp":1761977117039,"version":"build-2065373602"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,10,26]],"date-time":"2013-10-26T00:00:00Z","timestamp":1382745600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10623-013-9892-6","type":"journal-article","created":{"date-parts":[[2013,10,25]],"date-time":"2013-10-25T18:17:41Z","timestamp":1382725061000},"page":"59-70","source":"Crossref","is-referenced-by-count":4,"title":["Hardness of learning problems over Burnside groups of exponent 3"],"prefix":"10.1007","volume":"75","author":[{"given":"Nelly","family":"Fazio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Iga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio R.","family":"Nicolosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"III","given":"William E.","family":"Skeith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,10,26]]},"reference":[{"issue":"1","key":"9892_CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","volume":"39","author":"M. Abadi","year":"1989","unstructured":"Abadi M., Feigenbaum J., Kilian J.: On hiding information from an oracle. J. Comput. Syst. Sci. 39(1), 21\u201350 (1989).","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"9892_CR2","first-page":"343","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin D., Laird P.: Learning from noisy examples. Mach. Learn. 2(4), 343\u2013370 (1988).","journal-title":"Mach. Learn."},{"key":"9892_CR3","unstructured":"Arora S., Ge R.: New algorithms for learning in presence of errors. In: International Colloquium on Automata, Languages and Programming\u2013ICALP, pp. 403\u2013415 (2011)."},{"issue":"1","key":"9892_CR4","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0190(87)90036-6","volume":"26","author":"L. Babai","year":"1987","unstructured":"Babai L.: Random oracles separate pspace from the polynomial-time hierarchy. Inf. Process. Lett. 26(1), 51\u201353 (1987).","journal-title":"Inf. Process. Lett."},{"key":"9892_CR5","unstructured":"Baumslag G., Fazio N., Nicolosi A. R., Shpilrain V., Skeith III, W.E.: Generalized learning problems and applications to non-commutative cryptography. In: International Conference on Provable Security\u2013ProvSec, LNCS, pp. 324\u2013339. Springer, Heidelberg (2011)."},{"key":"9892_CR6","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. Full version of [5]. http:\/\/eprint.iacr.org\/2011\/357 ."},{"key":"9892_CR7","unstructured":"Beaver D., Feigenbaum J.: Hiding instances in multioracle queries. In: Symposium on Theoretical Aspects of Computer Science\u2013STACS, Lecture Notes in Computer Science, Vol. 415, pp. 37\u201348. Springer, Berlin (1990)."},{"key":"9892_CR8","unstructured":"Beaver D., Feigenbaum J., Kilian J., Rogaway P.: Security with low communication overhead. In: Advances in Cryptology\u2013CRYPTO, Lecture Notes in Computer Science, Vol. 537, pp. 62\u201376. Springer, Berlin (1990)."},{"issue":"4","key":"9892_CR9","first-page":"506","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. Altern. Complement. Med. 50(4), 506\u2013519 (2003).","journal-title":"J. Altern. Complement. Med."},{"issue":"1","key":"9892_CR10","first-page":"269","volume":"42","author":"M. Blum","year":"1995","unstructured":"Blum M., Kannan S.: Designing programs that check their work. J. Altern. Complement. Med. 42(1), 269\u2013291 (1995).","journal-title":"J. Altern. Complement. Med."},{"key":"9892_CR11","doi-asserted-by":"crossref","unstructured":"Feigenbaum J., Fortnow L.: On the random-self-reducibility of complete sets. In: Structure in Complexity Theory Conference, pp. 124\u2013132 (1991).","DOI":"10.1109\/SCT.1991.160252"},{"key":"9892_CR12","unstructured":"Goldreich O., Levin L. A.: A hard-core predicate for all one-way functions. In: Symposium on Theory of Computing Conference\u2013STOC, pp. 25\u201332. ACM Press, New York (1989)."},{"issue":"1","key":"9892_CR13","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser S., Micali S., Rackoff C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989).","journal-title":"SIAM J. Comput."},{"key":"9892_CR14","unstructured":"Hall M.: The Theory of Groups. Macmillan Company, New York (1959)."},{"key":"9892_CR15","unstructured":"Kearns M.: Efficient noise-tolerant learning from statistical queries. In: Symposium on Theory of Computing Conference\u2013STOC, pp. 392\u2013401. ACM Press, New York (1993)."},{"key":"9892_CR16","unstructured":"Lyubashevsky V., Peikert C., Regev O.: On ideal lattices and learning with errors over rings. In: Advances in Cryptology\u2013EUROCRYPT, Lecture Notes in Computer Science, Vol. 6110, pp. 1\u201323. Springer, Berlin (2010)."},{"key":"9892_CR17","unstructured":"Magnus W., Karrass A., Solitar D.: Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations. Interscience, New York (1966)."},{"key":"9892_CR18","unstructured":"Peikert C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Symposium on Theory of Computing Conference\u2013STOC, pp. 333\u2013342. ACM Press, New York (2009)."},{"key":"9892_CR19","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Symposium on Theory of Computing Conference\u2013STOC, pp. 84\u201393. ACM Press, New York (2005)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9892-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-013-9892-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9892-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-013-9892-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T18:23:06Z","timestamp":1746037386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-013-9892-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,26]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9892"],"URL":"https:\/\/doi.org\/10.1007\/s10623-013-9892-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2013,10,26]]}}}