Abstract
Pseudorandom Functions (PRF) is a basic primitive in cryptography. In this paper, we study related key attacks (RKA) with which the adversary is able to choose function and observe the behavior of the PRF under the modified secret key. We focus on the PRF from the Learning with Errors (LWE) assumption by Banerjee and Peikert in CRYPTO 2014. We prove that the PRF is secure against unique-input key shift attacks and restricted affine attacks. After that, we use this RKA-secure PRF to construct a robustly reusable fuzzy extractor, which enjoys higher efficiency and better error correction rate.
Author supplied keywords
Cite
CITATION STYLE
Cui, N., Liu, S., Wen, Y., & Gu, D. (2019). Pseudorandom Functions from LWE: RKA Security and Application. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11547 LNCS, pp. 229–250). Springer Verlag. https://doi.org/10.1007/978-3-030-21548-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
