ISISf
The ISISf assumption was introduced by Bootle, Lyubashevsky, Nguyen, and Sorniotti in 2023.[1] It introduces a function that removes the requirement of a static target vector and passes additional hints to the adversary.
Formal Definition
ISISf
Let be public parameters, matrix be chosen uniformly at random and be a specified function . The challenger generates hints in the following way.
Given the matrix , the function , and the set of hints , the adversary is asked to find a new tuple satisfying
Intuition. ISISf essentially expects the adversary to either successfully solve ISIS or compute a preimage of the function . Thus, the hardness of ISISf depends on the choice of . We list few examples for insecure choices of .
- Additively homomorphic functions imply trivial solutions by adding or subtracting two hints.
- Any efficiently invertible function using public information enables choosing short and finding a preimage of .
- Assume is a linear function and the domain of was mapped to . Then, any hint can be used to generate a valid ISISf solution .
Interactive ISISf
TODO
Hardness of ISISf and its interactive version
TODO
Constructions based on ISISf
Bootle et al.[1] provide a framework to generically build the following constructions from any ISISf instance.
Related Assumptions
- Generalised ISISf
- One-More-ISIS
- Randomised One-More-ISIS
References
- ↑ 1.0 1.1 1.2 1.3 1.4 1.5 Bootle, Jonathan, et al. A framework for practical anonymous credentials from lattices. Annual International Cryptology Conference. Cham: Springer Nature Switzerland, 2023.
- ↑ 2.0 2.1 Lyubashevsky, Vadim, Gregor Seiler, and Patrick Steuer. The LaZer library: Lattice-based zero knowledge and succinct proofs for quantum-safe privacy. Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. 2024.