Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. Beaver, D.: Perfect privacy for two-party protocols. Technical Report TR-11-89, Computer Science, Harvard University (1989)
2. Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: The 28th Symp. on the Theory of Computing, pp. 479–488 (1996)
3. Lecture Notes in Computer Science;A. Beimel,1999
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: The 20th Symp. on the Theory of Computing, pp. 1–10 (1988)
5. Lecture Notes in Computer Science;G. Brassard,1997
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献