Author:
Sha Jinrui,Liu Shengli,Han Shuai
Funder
National Key R$\&$D Program of China
National Natural Science Foundation of China
Guangdong Major Project of Basic and Applied Basic Research
Publisher
Springer Science and Business Media LLC
Reference33 articles.
1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Vitter, J.S., Spirakis, P.G., Yannakakis, M. (eds.) Proceedings on 33rd Annual ACM Symposium on Theory of Computing, July 6-8, 2001, Heraklion, Crete, Greece, pp. 601–610. ACM, ??? (2001). https://doi.org/10.1145/380752.380857 .
2. Ajtai M.: Generating hard instances of lattice problems. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, pp. 99–108 (1996).
3. Albrecht, M.R., Cini, V., Lai, R.W., Malavolta, G., Thyagarajan, S.A.: Lattice-based snarks: Publicly verifiable, preprocessing, and recursively composable. In: Annual International Cryptology Conference, pp. 102–132 (2022). Springer
4. Balbás, D., Catalano, D., Fiore, D., Lai, R.W.: Functional commitments for circuits from falsifiable assumptions. Cryptology ePrint Archive (2022)
5. Boneh, D., Drake, J., Fisch, B., Gabizon, A.: Halo infinite: Proof-carrying data from additive polynomial commitments. In: Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I 41, pp. 649–680 (2021). Springer