1. Attema, T., Cramer, R., Kohl, L.: A compressed $$\varsigma $$-protocol theory for lattices. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 549–579. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-84245-1_19
2. Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.K.: Lattice-based snarks: Publicly verifiable, preprocessing, and recursively composable. IACR Cryptol. ePrint Arch., p. 941 (2022)
3. Alkim, E., Ducas, L., Pöppelmann, T., Schwabe, P.: Post-quantum key exchange - a new hope. In: USENIX Security Symposium, pp. 327–343. USENIX Association (2016)
4. Attema, T., Fehr, S.: Parallel repetition of $$(k_1,\dots , k_{\mu })$$-special-sound multi-round interactive proofs. Cryptology ePrint Archive, Paper 2021/1259 (2021). https://eprint.iacr.org/2021/1259
5. Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS, pp. 2087–2104. ACM (2017)