Author:
Applebaum Benny,Artemenko Sergei,Shaltiel Ronen,Yang Guang
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference61 articles.
1. Ajtai Miklós (1983) $${\Sigma_{1}^{1}}$$ Σ 1 1 -Formulae on finite structures. Annals of Pure and Applied Logic 24(1): 1–48
2. Benny Applebaum, Yuval Ishai, Eyal Kushilevitz (2010). From Secrecy to Soundness: Efficient Verification via Secure Computation. In ICALP (1), volume 6198 of Lecture Notes in Computer Science, 152–163. Springer.
3. Applebaum Benny, Ishai Yuval, Kushilevitz Eyal, Waters Brent (2015) Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys. SIAM J. Comput. 44(2): 433–466
4. Sergei Artemenko, Russell Impagliazzo, Valentine Kabanets & Ronen Shaltiel (2016). Pseudorandomness when the odds are against you. In Conference on Computational Complexity.
5. Sergei Artemenko & Ronen Shaltiel (2014a). Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification. Computational Complexity 23(1), 43–83.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献