Reference15 articles.
1. D. Beaver, and S. Goldwasser, “Multiparty Computation with Faulty Majority”, Advances in Cryptology — CRYPTO’ 89 Proc, these proceedings.
2. M. Blum., “How to Exchange (Secret) Keys”, Proc. 15th Ann. ACM Symp. on Theory of Computing, 1983, pp. 440–447.
3. M. Blum, and S. Micali, “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, Proc. 23th Ann. IEEE Symp. on Foundations of Computer Science, 1982, pp. 112–117.
4. G. Brassard, C. Crépeau, and J.-M. Robert, “Information Theoretic Reductions Among Disclosure Problems”, Proc. 27th Ann. IEEE Symp. on Foundations of Computer Science, 1986, pp. 168–173.
5. Lect Notes Comput Sci;E. F. Brickell,1988
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献