Author:
Damgård Ivan,Thorbek Rune
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Lecture Notes in Computer Science;J.C. Benaloh,1988
2. Boppana, R.B.: Amplification of Probabilistic Boolean Formulas. Advances in Computing Research 5, 27–45 (1989)
3. Radhakrishnan, J.: Better Lower Bounds for Monotone Threshold Formulas. J. Comput. Syst. Sci. 54(2), 221–226 (1997)
4. Canetti, R.: Universally Composable Security: A New Paradigm for Cryptographic Protocols. In: FOCS 2001, pp. 136–145 (2001)
5. Chor, B., Kushilevitz, E.: Secret Sharing Over Infinite Domains. J. Cryptology 6(2), 87–95 (1993)
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献