{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:17Z","timestamp":1750694777718,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T00:00:00Z","timestamp":1634688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61925207","61925207"],"award-info":[{"award-number":["61925207","61925207"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["2019B030302008","2019B030302008"],"award-info":[{"award-number":["2019B030302008","2019B030302008"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62002223"],"award-info":[{"award-number":["62002223"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shanghai Sailing Program"},{"name":"Guangdong Major Project of Basic and Applied Basic Research","award":["61932014"],"award-info":[{"award-number":["61932014"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2021,12]]},"DOI":"10.1007\/s10623-021-00955-8","type":"journal-article","created":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T18:39:20Z","timestamp":1634755160000},"page":"2807-2839","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Pseudorandom functions in NC class from the standard LWE assumption"],"prefix":"10.1007","volume":"89","author":[{"given":"Yiming","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1366-8256","authenticated-orcid":false,"given":"Shengli","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuai","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dawu","family":"Gu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,20]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Ajtai M., Kumar R., Sivakumar D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings on 33rd Annual ACM Symposium on Theory of Computing (2001).","key":"955_CR1","DOI":"10.1145\/380752.380857"},{"doi-asserted-by":"crossref","unstructured":"Alwen J., Krenn S., Pietrzak K., Wichs D.: Learning with rounding, revisited\u2014new reduction, properties and applications. In: Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Part I.","key":"955_CR2","DOI":"10.1007\/978-3-642-40041-4_4"},{"unstructured":"Banerjee A.: New constructions of cryptographic pseudorandom functions. Ph.D. thesis, Georgia Institute of Technology, Atlanta, GA, USA (2015). http:\/\/hdl.handle.net\/1853\/53916.","key":"955_CR3"},{"doi-asserted-by":"crossref","unstructured":"Banerjee A., Peikert C.: New and improved key-homomorphic pseudorandom functions. In: Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Part I.","key":"955_CR4","DOI":"10.1007\/978-3-662-44371-2_20"},{"doi-asserted-by":"crossref","unstructured":"Banerjee A., Peikert C., Rosen A.: Pseudorandom functions and lattices. In: Advances in Cryptology - EUROCRYPT 2012\u201431st Annual International Conference on the Theory and Applications of Cryptographic Techniques.","key":"955_CR5","DOI":"10.1007\/978-3-642-29011-4_42"},{"doi-asserted-by":"crossref","unstructured":"Boneh D., Kim S., Montgomery H.W.: Private puncturable prfs from standard lattice assumptions. In: Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International, Part I.","key":"955_CR6","DOI":"10.1007\/978-3-319-56620-7_15"},{"doi-asserted-by":"crossref","unstructured":"Boneh D., Lewi K., Montgomery H.W., Raghunathan A.: Key homomorphic prfs and their applications. In: Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Part I.","key":"955_CR7","DOI":"10.1007\/978-3-642-40041-4_23"},{"doi-asserted-by":"crossref","unstructured":"Brakerski Z., Tsabary R., Vaikuntanathan V., Wee H.: Private constrained prfs (and more) from LWE. In: Theory of Cryptography\u201415th International Conference, TCC 2017, Part I (2017).","key":"955_CR8","DOI":"10.1007\/978-3-319-70500-2_10"},{"doi-asserted-by":"crossref","unstructured":"Brakerski Z., Vaikuntanathan V.: Constrained key-homomorphic prfs from standard lattice assumptions\u2014or: How to secretly embed a circuit in your PRF. In: Theory of Cryptography\u201412th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23\u201325, 2015, Proceedings, Part II. Lecture Notes in Computer Science.","key":"955_CR9","DOI":"10.1007\/978-3-662-46497-7_1"},{"doi-asserted-by":"crossref","unstructured":"Canetti R., Chen Y.: Constraint-hiding constrained prfs for nc$${}^{\\text{1}}$$ from LWE. In: Advances in Cryptology\u2014EUROCRYPT 2017\u201436th Annual International.","key":"955_CR10","DOI":"10.1007\/978-3-319-56620-7_16"},{"doi-asserted-by":"crossref","unstructured":"Dodis Y., Reyzin L., Smith, A.: Fuzzy extractors: How to generate strong keys from biometrics and other noisy data. In: Advances in Cryptology\u2014EUROCRYPT (2004).","key":"955_CR11","DOI":"10.1007\/978-3-540-24676-3_31"},{"doi-asserted-by":"crossref","unstructured":"D\u00f6ttling N., Schr\u00f6der D.: Efficient pseudorandom functions via on-the-fly adaptation. In: Advances in Cryptology\u2014CRYPTO 2015\u201435th Annual Cryptology Conference, Part I (2015).","key":"955_CR12","DOI":"10.1007\/978-3-662-47989-6_16"},{"doi-asserted-by":"crossref","unstructured":"Goldreich O., Silvio Micali S.G.: How to construct random functions. J. ACM (1986).","key":"955_CR13","DOI":"10.1145\/6490.6503"},{"doi-asserted-by":"crossref","unstructured":"Jager T., Kurek R., Pan J.: Simple and more efficient prfs with tight security from LWE and matrix-ddh. In: Advances in Cryptology\u2014ASIACRYPT 2018\u201424th International Conference, Part III.","key":"955_CR14","DOI":"10.1007\/978-3-030-03332-3_18"},{"doi-asserted-by":"crossref","unstructured":"Kim S.: Key-homomorphic pseudorandom functions from LWE with small modulus. In: Advances in Cryptology\u2014EUROCRYPT 2020\u201439th Annual International, Part II.","key":"955_CR15","DOI":"10.1007\/978-3-030-45724-2_20"},{"key":"955_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10623-015-0067-5","volume":"77","author":"T Laarhoven","year":"2015","unstructured":"Laarhoven T., Mosca M., van de Pol J.: Finding shortest lattice vectors faster using quantum search. Des. Codes Cryptogr. 77, 375\u2013400 (2015).","journal-title":"Des. Codes Cryptogr."},{"doi-asserted-by":"crossref","unstructured":"Lai Q., Liu F., Wang Z.: Almost tight security in lattices with polynomial moduli - prf, ibe, all-but-many ltf, and more. In: Public-Key Cryptography\u2014PKC 2020\u201423rd.","key":"955_CR17","DOI":"10.1007\/978-3-030-45374-9_22"},{"doi-asserted-by":"crossref","unstructured":"Montgomery H.: More efficient lattice prfs from keyed pseudorandom synthesizers. In: Progress in Cryptology\u2014INDOCRYPT 2018\u201419th International Conference on Cryptology in India, New Delhi, India, December 9\u201312, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11356, pp. 190\u2013211 (2018).","key":"955_CR18","DOI":"10.1007\/978-3-030-05378-9_11"},{"key":"955_CR19","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1998.1618","volume":"58","author":"M Naor","year":"1999","unstructured":"Naor M., Reingold O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58, 336\u2013375 (1999).","journal-title":"J. Comput. Syst. Sci."},{"doi-asserted-by":"crossref","unstructured":"Peikert C.: A decade of lattice cryptography. Foundations and Trends in Theoretical Computer Science (2016).","key":"955_CR20","DOI":"10.1561\/9781680831139"},{"doi-asserted-by":"crossref","unstructured":"Regev O.: On lattices, learning with errors, random linear codes, and cryptography. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, May 22\u201324 (2005).","key":"955_CR21","DOI":"10.1145\/1060590.1060603"},{"volume-title":"Computational Complexity Theory, IAS \/ Park City Mathematics Series","year":"2004","unstructured":"Rudich S., Wigderson A. (eds.): Computational Complexity Theory, IAS \/ Park City Mathematics Series, vol. 10. AMS Chelsea Publishing, New York (2004).","key":"955_CR22"},{"key":"955_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(87)90064-8","volume":"53","author":"C Schnorr","year":"1987","unstructured":"Schnorr C.: A hierarchy of polynomial time lattice basis reduction algorithms. Theor. Comput. Sci. 53, 201\u2013224 (1987).","journal-title":"Theor. Comput. Sci."},{"key":"955_CR24","volume-title":"A Computational Introduction to Number Theory and Algebra","author":"V Shoup","year":"2006","unstructured":"Shoup V.: A Computational Introduction to Number Theory and Algebra. Cambridge University Press, Cambridge (2006)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00955-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-021-00955-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-021-00955-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,3]],"date-time":"2021-11-03T19:19:06Z","timestamp":1635967146000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-021-00955-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10,20]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2021,12]]}},"alternative-id":["955"],"URL":"https:\/\/doi.org\/10.1007\/s10623-021-00955-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2021,10,20]]},"assertion":[{"value":"10 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 October 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}