Author:
Ball Marshall,Dachman-Soled Dana,Kulkarni Mukul,Lin Huijia,Malkin Tal
Publisher
Springer International Publishing
Reference70 articles.
1. Applebaum, B., Artemenko, S., Shaltiel, R., Yang, G.: Incompressible functions, relative-error extractors, and the power of nondeterministic reductions. Comput. Complex. 25(2), 349–418 (2016).
https://doi.org/10.1007/s00037-016-0128-9
2. Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unlessexptime has publishable proofs. Comput. Complex. 3(4), 307–318 (1993).
https://doi.org/10.1007/BF01275486
3. Ball, M., Dachman-Soled, D., Guo, S., Malkin, T., Tan, L.Y.: Non-malleable codes for small-depth circuits. FOCS IEEE Computer Society Press, October 2018 (to appear).
https://eprint.iacr.org/2018/207
4. Ball, M., Dachman-Soled, D., Kulkarni, M., Lin, H., Malkin, T.: Non-malleablecodes against bounded polynomial time tampering. Cryptology ePrint Archive, Report 2018/1015 (2018).
https://eprint.iacr.org/2018/1015
5. Ball, M., Dachman-Soled, D., Kulkarni, M., Malkin, T.: Non-malleable codesfor bounded depth, bounded fan-in circuits. In: Fischlin and Coron [30], pp. 881–908
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献