{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T14:27:27Z","timestamp":1726064847637},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030384708"},{"type":"electronic","value":"9783030384715"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-38471-5_28","type":"book-chapter","created":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T17:04:42Z","timestamp":1578589482000},"page":"693-713","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Towards Practical GGM-Based PRF from (Module-)Learning-with-Rounding"],"prefix":"10.1007","author":[{"given":"Chitchanok","family":"Chuengsatiansup","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Damien","family":"Stehl\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,10]]},"reference":[{"key":"28_CR1","unstructured":"25th Annual Symposium on Foundations of Computer Science, West Palm Beach, Florida, USA, 24\u201326 October 1984. IEEE Computer Society (1984)"},{"key":"28_CR2","unstructured":"2018 IEEE European Symposium on Security and Privacy, EuroS&P 2018, London, United Kingdom, 24\u201326 April 2018. IEEE (2018)"},{"key":"28_CR3","unstructured":"Alkim, E., Ducas, L., P\u00f6ppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: USENIX 2016 [24], pp. 327\u2013343 (2016)"},{"key":"28_CR4","unstructured":"Alperin-Sheriff, J., Apon, D.: Dimension-preserving reductions from LWE to LWR. IACR Cryptology ePrint Archive 2016:589 (2016)"},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-40041-4_4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"Jo\u00ebl Alwen","year":"2013","unstructured":"Alwen, J., Krenn, S., Pietrzak, K., Wichs, D.: Learning with rounding, revisited. In: CRYPTO 2013 [14], pp. 57\u201374 (2013)"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-662-46706-0_3","volume-title":"Fast Software Encryption","author":"Abhishek Banerjee","year":"2015","unstructured":"Banerjee, A., Brenner, H., Leurent, G., Peikert, C., Rosen, A.: SPRING: fast pseudorandom functions from rounded ring products. In: FSE 2014 [17], pp. 38\u201357 (2014)"},{"key":"28_CR7","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/978-3-642-29011-4_42","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Abhishek Banerjee","year":"2012","unstructured":"Banerjee, A., Peikert, C., Rosen, A.: Pseudorandom functions and lattices. In: EUROCRYPT 2012 [42], pp. 719\u2013737 (2012)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Becker, A., Ducas, L., Gama, N., Laarhoven, T.: New directions in nearest neighbor searching with applications to lattice sieving. In: SODA 2016 [26], pp. 10\u201324 (2016)","DOI":"10.1137\/1.9781611974331.ch2"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/978-3-642-03356-8_19","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"Daniel J. Bernstein","year":"2009","unstructured":"Bernstein, D.J.: Batch binary edwards. In: CRYPTO [23], pp. 317\u2013336 (2009)"},{"key":"28_CR10","first-page":"209","volume-title":"Theory of Cryptography","author":"Andrej Bogdanov","year":"2015","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: TCC 2016 [27], pp. 209\u2013224 (2016)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Bos, J.W.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: EuroS&P 2018 [2], pp. 353\u2013367 (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/978-3-319-59879-6_8","volume-title":"Post-Quantum Cryptography","author":"Charles Bouillaguet","year":"2017","unstructured":"Bouillaguet, C., Delaplace, C., Fouque, P.-A., Kirchner, P.: Fast lattice-based encryption: stretching Spring. In: PQCrypto 2017 [31], pp. 125\u2013142 (2017)"},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (Leveled)fully homomorphic encryption without bootstrapping. TOCT 6(3), 13:1\u201313:36 (2014)","journal-title":"TOCT"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","year":"2013","unstructured":"Canetti, R., Garay, J.A. (eds.): CRYPTO 2013. LNCS, vol. 8042. Springer, Heidelberg (2013). \nhttps:\/\/doi.org\/10.1007\/978-3-642-40041-4"},{"key":"28_CR15","unstructured":"Charikar, M. (ed.): Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, 17\u201319 January 2010. SIAM (2010)"},{"key":"28_CR16","first-page":"1","volume-title":"Lecture Notes in Computer Science","author":"Yuanmi Chen","year":"2011","unstructured":"Chen, Y., Nguyen, P.Q.: BKZ 2.0: better lattice security estimates. In: ASIACRYPT 2011 [33], pp. 1\u201320 (2011)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46706-0","volume-title":"Fast Software Encryption","year":"2015","unstructured":"Cid, C., Rechberger, C. (eds.): FSE 2014. LNCS, vol. 8540. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46706-0"},{"key":"28_CR18","unstructured":"Ducas, L., Lepoint, T., Lyubashevsky, V., Schwabe, P., Seiler, G., Stehl\u00e9, D.: CRYSTALS - dilithium: digital signatures from module lattices. IACR Cryptology ePrint Archive 2017:633 (2017)"},{"key":"28_CR19","unstructured":"Gabow, H.N., Fagin, R. (eds.): Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Baltimore, MD, USA, 22\u201324 May 2005. ACM (2005)"},{"key":"28_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-47989-6","volume-title":"Advances in Cryptology \u2013 CRYPTO 2015","year":"2015","unstructured":"Gennaro, R., Robshaw, M. (eds.): CRYPTO 2015. LNCS, vol. 9215. Springer, Heidelberg (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-662-47989-6"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13190-5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","year":"2010","unstructured":"Gilbert, H. (ed.): EUROCRYPT 2010. LNCS, vol. 6110. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-13190-5"},{"key":"28_CR22","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions (extended abstract). In: FOCS 1984 [1], pp. 464\u2013479 (1984)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8","volume-title":"Advances in Cryptology - CRYPTO 2009","year":"2009","unstructured":"Halevi, S. (ed.): CRYPTO 2009. LNCS, vol. 5677. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03356-8"},{"key":"28_CR24","unstructured":"Holz, T., Savage, S. (eds.): 25th USENIX Security Symposium, USENIX Security 2016, Austin, TX, USA, 10\u201312 August 2016. USENIX Association (2016)"},{"key":"28_CR25","doi-asserted-by":"publisher","DOI":"10.1201\/9781420010756","volume-title":"Introduction to Modern Cryptography","author":"J Katz","year":"2007","unstructured":"Katz, J., Lindell, Y.: Introduction to Modern Cryptography. Chapman & Hall\/CRC, Boca Raton (2007)"},{"key":"28_CR26","unstructured":"Krauthgamer, R. (ed.): Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, 10\u201312 January 2016. SIAM (2016)"},{"key":"28_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49099-0","volume-title":"Theory of Cryptography","year":"2016","unstructured":"Kushilevitz, E., Malkin, T. (eds.): TCC 2016. LNCS, vol. 9563. Springer, Heidelberg (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-662-49099-0"},{"key":"28_CR28","unstructured":"Laarhoven, T.: Search problems in cryptography. Ph.D. thesis, Eindhoven University of Technology, The Netherlands (2015)"},{"key":"28_CR29","first-page":"3","volume-title":"Lecture Notes in Computer Science","author":"Thijs Laarhoven","year":"2015","unstructured":"Laarhoven, T.: Sieving for shortest vectors in lattices using angular locality-sensitive hashing. In: CRYPTO 2015 [20], pp. 3\u201322 (2015)"},{"issue":"2\u20133","key":"28_CR30","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(2\u20133), 375\u2013400 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59879-6","volume-title":"Post-Quantum Cryptography","year":"2017","unstructured":"Lange, T., Takagi, T. (eds.): PQCrypto 2017. LNCS, vol. 10346. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-59879-6"},{"issue":"3","key":"28_CR32","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","volume":"75","author":"A Langlois","year":"2015","unstructured":"Langlois, A., Stehl\u00e9, D.: Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75(3), 565\u2013599 (2015)","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","year":"2011","unstructured":"Lee, D.H., Wang, X. (eds.): ASIACRYPT 2011. LNCS, vol. 7073. Springer, Heidelberg (2011). \nhttps:\/\/doi.org\/10.1007\/978-3-642-25385-0"},{"key":"28_CR34","first-page":"1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"Vadim Lyubashevsky","year":"2010","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. In: EUROCRYPT 2010 [21], pp. 1\u201323 (2010)"},{"issue":"6","key":"28_CR35","doi-asserted-by":"publisher","first-page":"43:1","DOI":"10.1145\/2535925","volume":"60","author":"V Lyubashevsky","year":"2013","unstructured":"Lyubashevsky, V., Peikert, C., Regev, O.: On ideal lattices and learning with errors over rings. J. ACM 60(6), 43:1\u201343:35 (2013). Preliminary version in Eurocrypt 2010 [21]","journal-title":"J. ACM"},{"key":"28_CR36","doi-asserted-by":"crossref","unstructured":"Micciancio, D., Voulgaris, P.: Faster exponential time algorithms for the shortest vector problem. In: SODA 2010 [15], pp. 1468\u20131480 (2010)","DOI":"10.1137\/1.9781611973075.119"},{"issue":"2","key":"28_CR37","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(2), 336\u2013375 (1999). Preliminary version in FOCS 1995","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"28_CR38","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1145\/972639.972643","volume":"51","author":"M Naor","year":"2004","unstructured":"Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231\u2013262 (2004). Preliminary version in FOCS 1997","journal-title":"J. ACM"},{"issue":"5","key":"28_CR39","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1137\/S0097539701389257","volume":"31","author":"M Naor","year":"2002","unstructured":"Naor, M., Reingold, O., Rosen, A.: Pseudorandom functions and factoring. SIAM J. Comput. 31(5), 1383\u20131404 (2002). Preliminary version in STOC 2000","journal-title":"SIAM J. Comput."},{"issue":"2","key":"28_CR40","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1515\/JMC.2008.009","volume":"2","author":"PQ Nguyen","year":"2008","unstructured":"Nguyen, P.Q., Vidick, T.: Sieve algorithms for the shortest vector problem are practical. J. Math. Cryptol. 2(2), 181\u2013207 (2008)","journal-title":"J. Math. Cryptol."},{"key":"28_CR41","unstructured":"National Institute of Standards and Technology. SHA-3 standard: Permutation-based hash and extendable-output functions. FIPS PUB 202 (2015). \nhttp:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.202.pdf"},{"key":"28_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","year":"2012","unstructured":"Pointcheval, D., Johansson, T. (eds.): EUROCRYPT 2012. LNCS, vol. 7237. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-29011-4"},{"key":"28_CR43","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005 [19], pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"28_CR44","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01581144","volume":"66","author":"C-P Schnorr","year":"1994","unstructured":"Schnorr, C.-P., Euchner, M.: Lattice basis reduction: improved practical algorithms and solving subset sum problems. Math. Program. 66(2), 181\u2013199 (1994)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography \u2013 SAC 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-38471-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T17:06:50Z","timestamp":1578589610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-38471-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030384708","9783030384715"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-38471-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"10 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Selected Areas in Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Waterloo, ON","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sacrypt2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/uwaterloo.ca\/combinatorics-and-optimization\/news\/sac-2019-august-12-16-2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}