Publisher
Springer International Publishing
Reference30 articles.
1. Agrawal, S., Kirshanova, E., Stehlé, D., Yadav, A.: Can round-optimal lattice-based blind signatures be practical? Cryptology ePrint Archive, Report 2021/1565 (2021). https://ia.cr/2021/1565
2. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, New York, NY, USA, pp. 99–108. Association for Computing Machinery (1996)
3. Lecture Notes in Computer Science;N Alkeilani Alkadri,2020
4. Lecture Notes in Computer Science;N Alkeilani Alkadri,2020
5. Attema, T., Fehr, S.: Parallel repetition of $$(k_1,\dots , k_{\mu })$$-special-sound multi-round interactive proofs. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022. LNCS, vol. 13507, pp. 415–443. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-15802-5_15