Efficient authentication from hard learning problems

Kiltz, Eike; Pietrzak, Krzysztof Z; Venturi, Daniele; Cash, David; Jain, Abhishek

Efficient authentication from hard learning problems

Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.

Download

2017_JournalCrypto_Kiltz.pdf 516.96 KB [Submitted Version]

DOI

10.1007/s00145-016-9247-3

Journal Article | Published | English

Scopus indexed

Author

Kiltz, Eike; Pietrzak, Krzysztof Z^ISTA ; Venturi, Daniele; Cash, David; Jain, Abhishek

Department

Pietrzak Group

Grant

Teaching Old Crypto New Tricks
Provable Security for Physical Cryptography

Abstract

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.

Publishing Year

2017

Date Published

2017-10-01

Journal Title

Journal of Cryptology

Publisher

Springer

Volume

Issue

Page

1238 - 1275

IST-REx-ID

1187

Cite this

Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. Efficient authentication from hard learning problems. Journal of Cryptology. 2017;30(4):1238-1275. doi:10.1007/s00145-016-9247-3

Kiltz, E., Pietrzak, K. Z., Venturi, D., Cash, D., & Jain, A. (2017). Efficient authentication from hard learning problems. Journal of Cryptology. Springer. https://doi.org/10.1007/s00145-016-9247-3

Kiltz, Eike, Krzysztof Z Pietrzak, Daniele Venturi, David Cash, and Abhishek Jain. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology. Springer, 2017. https://doi.org/10.1007/s00145-016-9247-3.

E. Kiltz, K. Z. Pietrzak, D. Venturi, D. Cash, and A. Jain, “Efficient authentication from hard learning problems,” Journal of Cryptology, vol. 30, no. 4. Springer, pp. 1238–1275, 2017.

Kiltz E, Pietrzak KZ, Venturi D, Cash D, Jain A. 2017. Efficient authentication from hard learning problems. Journal of Cryptology. 30(4), 1238–1275.

Kiltz, Eike, et al. “Efficient Authentication from Hard Learning Problems.” Journal of Cryptology, vol. 30, no. 4, Springer, 2017, pp. 1238–75, doi:10.1007/s00145-016-9247-3.

All files available under the following license(s):

Copyright Statement: