Author:
Applebaum Benny,Ishai Yuval,Kushilevitz Eyal
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference28 articles.
1. M. Ajtai. Secure computation with information leaking to an adversary, in Proceedings of 43rd STOC (2011), pp. 715–724.
2. B. Applebaum. The cryptographic hardness of random local functions. Comput. Complex., 25(3):667–722, 2015. doi:
10.1007/s00037-015-0121-8
.
3. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography in
$${{\rm NC}}^0$$
NC
0
. SIAM J. Comput., 36(4):845–888, 2006. Preliminary version in Proc. 45th FOCS, 2004.
4. B. Applebaum, Y. Ishai, and E. Kushilevitz. Cryptography by cellular automata or how fast can complexity emerge in nature? in Proceedings of 1st ICS (2010), pp. 1–19.
5. M. Ben-Or, S. Goldwasser, and A. Wigderson. Completeness theorems for non-cryptographic fault-tolerant distributed computation, in Proceedings of 20th STOC (1988), pp. 1–10.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献