{"ec_funded":1,"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"3238"}]},"status":"public","abstract":[{"lang":"eng","text":"We construct efficient authentication protocols and message authentication codes (MACs) whose security can be reduced to the learning parity with noise (LPN) problem. Despite a large body of work—starting with the (Formula presented.) protocol of Hopper and Blum in 2001—until now it was not even known how to construct an efficient authentication protocol from LPN which is secure against man-in-the-middle attacks. A MAC implies such a (two-round) protocol."}],"intvolume":"        30","date_updated":"2023-09-20T11:20:58Z","quality_controlled":"1","day":"01","external_id":{"isi":["000410788600007"]},"has_accepted_license":"1","article_type":"original","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"},{"name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","call_identifier":"FP7"}],"volume":30,"isi":1,"author":[{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Venturi, Daniele","first_name":"Daniele","last_name":"Venturi"},{"last_name":"Cash","first_name":"David","full_name":"Cash, David"},{"full_name":"Jain, Abhishek","first_name":"Abhishek","last_name":"Jain"}],"publist_id":"6166","file_date_updated":"2020-07-14T12:44:37Z","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"page":"1238 - 1275","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_created":"2018-12-11T11:50:37Z","publication":"Journal of Cryptology","article_processing_charge":"No","date_published":"2017-10-01T00:00:00Z","file":[{"file_id":"7843","access_level":"open_access","checksum":"c647520d115b772a1682fc06fa273eb1","creator":"dernst","date_updated":"2020-07-14T12:44:37Z","content_type":"application/pdf","file_size":516959,"date_created":"2020-05-14T16:30:17Z","file_name":"2017_JournalCrypto_Kiltz.pdf","relation":"main_file"}],"year":"2017","ddc":["000"],"month":"10","title":"Efficient authentication from hard learning problems","issue":"4","_id":"1187","doi":"10.1007/s00145-016-9247-3","type":"journal_article","citation":{"ama":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. 2017;30(4):1238-1275. doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>","ista":"Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>. Springer, 2017. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” <i>Journal of Cryptology</i>, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.","mla":"Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” <i>Journal of Cryptology</i>, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:<a href=\"https://doi.org/10.1007/s00145-016-9247-3\">10.1007/s00145-016-9247-3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Venturi, D. Cash, A. Jain, Journal of Cryptology 30 (2017) 1238–1275.","apa":"Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., &#38; Jain, A. (2017). Efficient authentication from hard learning problems. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-016-9247-3\">https://doi.org/10.1007/s00145-016-9247-3</a>"},"oa_version":"Submitted Version","publisher":"Springer","scopus_import":"1","oa":1,"publication_status":"published"}