Author:
Rosen Alon,Segev Gil,Shahaf Ido
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference36 articles.
1. T. Abbot, D. Kane, P. Valiant, On algorithms for Nash equilibria. Unpublished manuscript. http://web.mit.edu/tabbott/Public/final.pdf (2004)
2. G. Asharov, G. Segev, Limits on the power of indistinguishability obfuscation and functional encryption, in Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science, pp. 191–209 (2015)
3. G. Asharov, G. Segev, On constructing one-way permutations from indistinguishability obfuscation, in Proceedings of the 13th Theory of Cryptography Conference, pp. 512–541 (2016)
4. P. Beame, S.A. Cook, J. Edmonds, R. Impagliazzo, T. Pitassi, The relative complexity of NP search problems, in Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 303–314 (1995)
5. Z. Brakerski, C. Gentry, S. Halevi, T. Lepoint, A. Sahai, M. Tibouchi, Cryptanalysis of the quadratic zero-testing of GGH. Cryptology ePrint Archive, Report 2015/845 (2015)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献