Publisher
Springer Nature Switzerland
Reference39 articles.
1. Barenghi, A., Biasse, J., Ngo, T., Persichetti, E., Santini, P.: Advanced signature functionalities from the code equivalence problem. Int. J. Comput. Math. Comput. Syst. Theory 7(2), 112–128 (2022)
2. Bellare, M., Neven, G.: Multi-signatures in the plain public-key model and a general forking lemma. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, pp. 390–399 (2006)
3. Lecture Notes in Computer Science;E Bellini,2022
4. Bennett, H., Ganju, A., Peetathawatchai, P., Stephens-Davidowitz, N.: Just how hard are rotations of $$\mathbb{Z} ^n$$? algorithms and cryptography with the simplest lattice. Cryptology ePrint Archive, Paper 2021/1548, to appear at EUROCRYPT2023 (2021). https://eprint.iacr.org/2021/1548
5. Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. In: 2007 IEEE Symposium on Security and Privacy (SP 2007), pp. 321–334. IEEE (2007)