Author:
Chavez-Saab Jorge,Rodríguez-Henríquez Francisco,Tibouchi Mehdi
Publisher
Springer International Publishing
Reference34 articles.
1. Adj, G., Ahmadi, O., Menezes, A.: On isogeny graphs of supersingular elliptic curves over finite fields. Finite Fields Appl. 55, 268–283 (2019). https://doi.org/10.1016/j.ffa.2018.10.002
2. Arora, S., Safra, S.: Probabilistic checking of proofs: a new characterization of NP. J. ACM 45(1), 70–122 (1998). https://doi.org/10.1145/273865.273901
3. Babai, L., Fortnow, L., Levin, L.A., Szegedy, M.: Checking computations in polylogarithmic time. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, STOC 1991, 21–32. Association for Computing Machinery, New York (1991). https://doi.org/10.1145/103418.103428
4. Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018, 46 (2018). http://eprint.iacr.org/2018/046
5. Lecture Notes in Computer Science;E Ben-Sasson,2013
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献