Bi-Homomorphic Lattice-Based PRFs and Unidirectional Updatable Encryption
Vipin Singh Sehrawat, Yvo Desmedt

TL;DR
This paper introduces a novel bi-homomorphic lattice-based PRF with variable input length and applies it to develop a quantum-safe, post-compromise secure unidirectional updatable encryption scheme, advancing cryptographic capabilities.
Contribution
It presents the first bi-homomorphic lattice-based PRF with variable input length and utilizes it to construct a quantum-safe, unidirectional updatable encryption scheme.
Findings
Constructed a new HVL-KIH-PRF family based on LWE.
Developed a quantum-safe, post-compromise secure updatable encryption scheme.
Achieved unidirectional ciphertext updates with new cryptographic primitives.
Abstract
We define a pseudorandom function (PRF) to be bi-homomorphic when it is fully Key homomorphic and partially Input Homomorphic (KIH), i.e., given and , there is an efficient algorithm to compute , where and are (binary) group operations. The homomorphism on the input is restricted to a fixed subset of the input bits, i.e., operates on some pre-decided -out-of- bits, where , and the remaining bits are identical in both inputs. In addition, the output length, , of the operator is not fixed and is defined as , hence leading to Homomorphically induced Variable input Length (HVL) as . We present a learning with errors (LWE) based construction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
