{"status":"public","publication_status":"published","related_material":{"record":[{"status":"public","id":"1187","relation":"later_version"}]},"date_updated":"2023-09-20T11:20:57Z","oa_version":"None","volume":6632,"citation":{"apa":"Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., &#38; Venturi, D. (2011). Efficient authentication from hard learning problems (Vol. 6632, pp. 7–26). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>","mla":"Kiltz, Eike, et al. <i>Efficient Authentication from Hard Learning Problems</i>. Vol. 6632, Springer, 2011, pp. 7–26, doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>.","short":"E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.","ieee":"E. Kiltz, K. Z. Pietrzak, D. Cash, A. Jain, and D. Venturi, “Efficient authentication from hard learning problems,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Tallinn, Estonia, 2011, vol. 6632, pp. 7–26.","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, David Cash, Abhishek Jain, and Daniele Venturi. “Efficient Authentication from Hard Learning Problems,” 6632:7–26. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">https://doi.org/10.1007/978-3-642-20465-4_3</a>.","ama":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:<a href=\"https://doi.org/10.1007/978-3-642-20465-4_3\">10.1007/978-3-642-20465-4_3</a>","ista":"Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. 2011. Efficient authentication from hard learning problems. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 6632, 7–26."},"date_published":"2011-05-01T00:00:00Z","type":"conference","publist_id":"3442","year":"2011","extern":"1","acknowledgement":"The European Regional Development Fund (ERDF),Guardtime,Qualcomm,Swedbank","quality_controlled":"1","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Eike","full_name":"Kiltz, Eike","last_name":"Kiltz"},{"orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cash, David","last_name":"Cash","first_name":"David"},{"first_name":"Abhishek","full_name":"Jain, Abhishek","last_name":"Jain"},{"last_name":"Venturi","full_name":"Venturi, Daniele","first_name":"Daniele"}],"day":"01","intvolume":"      6632","month":"05","publisher":"Springer","page":"7 - 26","alternative_title":["LNCS"],"_id":"3238","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 HB 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 (MIM) attacks. A MAC implies such a (two-round) protocol. © 2011 International Association for Cryptologic Research"}],"date_created":"2018-12-11T12:02:11Z","doi":"10.1007/978-3-642-20465-4_3","language":[{"iso":"eng"}],"conference":{"start_date":"2011-05-15","name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","end_date":"2011-05-19","location":"Tallinn, Estonia"},"title":"Efficient authentication from hard learning problems"}