[{"month":"05","intvolume":" 6632","alternative_title":[],"oa_version":"None","abstract":[{"lang":"eng"}],"related_material":{"record":[{"id":"1187","status":"public","relation":"later_version"}]},"volume":6632,"language":[{}],"publication_status":"published","status":"public","type":"conference","conference":{"name":"EUROCRYPT: Theory and Applications of Cryptographic Techniques","location":"Tallinn, Estonia","end_date":"2011-05-19","start_date":"2011-05-15"},"_id":"3238","extern":"1","creator":{"login":"kschuh","id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87"},"date_updated":"2023-09-20T11:20:57Z","quality_controlled":"1","acknowledgement":"The European Regional Development Fund (ERDF),Guardtime,Qualcomm,Swedbank","date_published":"2011-05-01T00:00:00Z","date_created":"2018-12-11T12:02:11Z","uri_base":"https://research-explorer.ista.ac.at","page":"7 - 26","day":"01","dc":{"title":["Efficient authentication from hard learning problems","LNCS"],"rights":["info:eu-repo/semantics/closedAccess"],"language":["eng"],"creator":["Kiltz, Eike","Pietrzak, Krzysztof Z","Cash, David","Jain, Abhishek","Venturi, Daniele"],"type":["info:eu-repo/semantics/conferenceObject","doc-type:conferenceObject","text","http://purl.org/coar/resource_type/c_5794"],"publisher":["Springer"],"date":["2011"],"description":["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"],"identifier":["https://research-explorer.ista.ac.at/record/3238"],"relation":["info:eu-repo/semantics/altIdentifier/doi/10.1007/978-3-642-20465-4_3"],"source":["Kiltz E, Pietrzak KZ, Cash D, Jain A, Venturi D. Efficient authentication from hard learning problems. In: Vol 6632. Springer; 2011:7-26. doi:10.1007/978-3-642-20465-4_3"]},"author":[{"last_name":"Kiltz","first_name":"Eike"},{"last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cash","first_name":"David"},{"first_name":"Abhishek","last_name":"Jain"},{"last_name":"Venturi","first_name":"Daniele"}],"publist_id":"3442","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kiltz, Eike, et al. Efficient Authentication from Hard Learning Problems. Vol. 6632, Springer, 2011, pp. 7–26, doi:10.1007/978-3-642-20465-4_3.","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.","short":"E. Kiltz, K.Z. Pietrzak, D. Cash, A. Jain, D. Venturi, in:, Springer, 2011, pp. 7–26.","apa":"Kiltz, E., Pietrzak, K. Z., Cash, D., Jain, A., & 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. https://doi.org/10.1007/978-3-642-20465-4_3","chicago":"Kiltz, Eike, Krzysztof Z Pietrzak, David Cash, Abhishek Jain, and Daniele Venturi. “Efficient Authentication from Hard Learning Problems,” 6632:7–26. Springer, 2011. https://doi.org/10.1007/978-3-642-20465-4_3.","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."},"dini_type":"doc-type:conferenceObject"}]