Jump to content

Generalised ISISf

From Lattice Assumption Zoo
Revision as of 21:24, 19 August 2025 by Jnsiemer (talk | contribs) (Init)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

The Generalised ISISf assumption (GenISISf) was introduced by Dubois, Klooß, Lai, and Woo in 2025.[1] As the name suggests, it is a generalisation of the ISISf assumption introduced in 2023.[2] It removes two restrictions imposed by ISISf, which enables reducing to GenISISf. Furthermore, GenISISf inherits the ISISf framework to generically generate constructions for several primitives.

Formal Definition

GenISISf

TODO

Interactive GenISISf

TODO

Hardness of GenISISf and its interactive version

TODO

Constructions based on GenISISf

Bootle et al.[2] provide a framework to generically build the following constructions from any interactive ISISf instance. As any ISISf instance is also a GenISISf instance, GenISISf inherits this framework.

Related Assumptions

References

  1. Dubois, A., Klooß, M., Lai, R.W. and Woo, I.K. Lattice-based proof-friendly signatures from vanishing short integer solutions. IACR International Conference on Public-Key Cryptography. Cham: Springer Nature Switzerland, 2025.
  2. 2.0 2.1 2.2 2.3 2.4 2.5 Bootle, J., Lyubashevsky, V., Nguyen, N.K. and Sorniotti, A. A framework for practical anonymous credentials from lattices. Annual International Cryptology Conference. Cham: Springer Nature Switzerland, 2023.
  3. 3.0 3.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.