{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:58:36Z","timestamp":1764997116851,"version":"3.37.3"},"reference-count":28,"publisher":"Walter de Gruyter GmbH","issue":"1","funder":[{"DOI":"10.13039\/501100002261","name":"Russian Foundation for Basic Research","doi-asserted-by":"publisher","award":["13-01-00183"],"award-info":[{"award-number":["13-01-00183"]}],"id":[{"id":"10.13039\/501100002261","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,1,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We initiate the study of (weakly) pseudo-free families of computational elementary abelian<\/jats:p>","DOI":"10.1515\/gcc-2017-0001","type":"journal-article","created":{"date-parts":[[2017,4,19]],"date-time":"2017-04-19T10:01:12Z","timestamp":1492596072000},"page":"1-18","source":"Crossref","is-referenced-by-count":3,"title":["Pseudo-free families of finite computational elementary abelian p-groups"],"prefix":"10.1515","volume":"9","author":[{"given":"Mikhail","family":"Anokhin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"374","reference":[{"key":"ref21","first-page":"361","article-title":"Public-key encryption schemes with auxiliary inputs","year":"2010","journal-title":"Proceedings of the 7th Theory of Cryptography Conference"},{"key":"ref181","first-page":"361","article-title":"Public-key encryption schemes with auxiliary inputs","year":"2010","journal-title":"Proceedings of the 7th Theory of Cryptography Conference"},{"key":"ref241","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00189260","article-title":"Efficient cryptographic schemes provably as secure as subset sum","volume":"9","year":"1996","journal-title":"J. Cryptology"},{"journal-title":"Pseudo-free groups and cryptographic assumptions","year":"2014","key":"ref31"},{"key":"ref261","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00145-009-9042-5","article-title":"The RSA group is pseudo-free","volume":"23","year":"2010","journal-title":"J. Cryptology"},{"journal-title":"Pseudorandomness and Cryptographic Applications","year":"1996","key":"ref251"},{"key":"ref81","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF00189260","article-title":"Efficient cryptographic schemes provably as secure as subset sum","volume":"9","year":"1996","journal-title":"J. Cryptology"},{"key":"ref111","first-page":"465","article-title":"Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions","year":"2011","journal-title":"Advances in Cryptology \u2013 Crypto 2011"},{"journal-title":"Foundations of Cryptography. Volume 1: Basic Tools","year":"2001","key":"ref41"},{"key":"ref161","first-page":"53","article-title":"Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption","volume":"5","year":"2013","journal-title":"Groups Complex. Cryptol."},{"journal-title":"Composite Diffie\u2013Hellman public-key generating systems are hard to break","year":"1985","key":"ref141"},{"journal-title":"Pseudo-free groups and cryptographic assumptions","year":"2014","key":"ref191"},{"key":"ref101","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00145-009-9042-5","article-title":"The RSA group is pseudo-free","volume":"23","year":"2010","journal-title":"J. Cryptology"},{"key":"ref221","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10207-009-0087-0","article-title":"On the pseudo-freeness and the CDH assumption","volume":"8","year":"2009","journal-title":"Int. J. Inf. Secur."},{"journal-title":"The cryptographic impact of groups with infeasible inversion","year":"2003","key":"ref71"},{"journal-title":"Breaking Diffie\u2013Hellman is no easier than root finding","year":"2005","key":"ref171"},{"journal-title":"The cryptographic impact of groups with infeasible inversion","year":"2003","key":"ref231"},{"key":"ref271","first-page":"465","article-title":"Pseudorandom knapsacks and the sample complexity of LWE search-to-decision reductions","year":"2011","journal-title":"Advances in Cryptology \u2013 Crypto 2011"},{"key":"ref01","first-page":"53","article-title":"Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption","volume":"5","year":"2013","journal-title":"Groups Complex. Cryptol."},{"journal-title":"Pseudorandomness and Cryptographic Applications","year":"1996","key":"ref91"},{"journal-title":"Composite Diffie\u2013Hellman public-key generating systems are hard to break","year":"1985","key":"ref301"},{"journal-title":"Breaking Diffie\u2013Hellman is no easier than root finding","year":"2005","key":"ref11"},{"key":"ref61","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10207-009-0087-0","article-title":"On the pseudo-freeness and the CDH assumption","volume":"8","year":"2009","journal-title":"Int. J. Inf. Secur."},{"journal-title":"A Computational Introduction to Number Theory and Algebra","year":"2008","key":"ref311"},{"journal-title":"A Computational Introduction to Number Theory and Algebra","year":"2008","key":"ref151"},{"journal-title":"Foundations of Cryptography. Volume 1: Basic Tools","year":"2001","key":"ref201"},{"key":"ref281","first-page":"505","article-title":"On the notion of pseudo-free groups","year":"2004","journal-title":"Proceedings of the 1st Theory of Cryptography Conference"},{"key":"ref121","first-page":"505","article-title":"On the notion of pseudo-free groups","year":"2004","journal-title":"Proceedings of the 1st Theory of Cryptography Conference"}],"container-title":["Groups Complexity Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/www.degruyter.com\/view\/j\/gcc.2017.9.issue-1\/gcc-2017-0001\/gcc-2017-0001.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.degruyter.com\/view\/j\/gcc.2017.9.issue-1\/gcc-2017-0001\/gcc-2017-0001.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,27]],"date-time":"2021-02-27T03:08:41Z","timestamp":1614395321000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.degruyter.com\/document\/doi\/10.1515\/gcc-2017-0001\/html"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1515\/gcc-2017-0001","relation":{},"ISSN":["1867-1144","1869-6104"],"issn-type":[{"type":"print","value":"1867-1144"},{"type":"electronic","value":"1869-6104"}],"subject":[],"published":{"date-parts":[[2017,1,1]]}}}