Author:
Lin Huijia,Tessaro Stefano
Publisher
Springer International Publishing
Reference65 articles.
1. Allen, S.R., O’Donnell, R., Witmer, D.: How to refute a random CSP. In: 56th FOCS, Berkeley, CA, USA, pp. 689–708, 17–20 October 2015
2. Lecture Notes in Computer Science;P Ananth,2015
3. Ananth, P., Jain, A., Sahai, A.: Achieving compactness generically: indistinguishability obfuscation from non-compact functional encryption. IACR Cryptology ePrint Archive, vol. 2015, p. 730 (2015)
4. Ananth, P., Sahai, A.: Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps. Cryptology ePrint Archive, Report 2016/1097 (2016).
http://eprint.iacr.org/2016/1097
5. Ananth, P.V., Gupta, D., Ishai, Y., Sahai, A.: Optimizing obfuscation: avoiding Barrington’s theorem. In: ACM CCS 2014, Scottsdale, AZ, USA, pp. 646–658, 3–7 November 2014
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献