Author:
Beimel Amos,Tassa Tamir,Weinreb Enav
Publisher
Springer Berlin Heidelberg
Reference33 articles.
1. Beimel, A., Chor, B.: Universally ideal secret sharing schemes. IEEE Trans. on Information Theory 40(3), 786–794 (1994)
2. Beimel, A., Tassa, T., Weinreb, E.: Characterizing ideal weighted threshold secret sharing. Technical Report 04-05, Dept. of Computer Science, Ben-Gurion University (2004), Available at: www.cs.bgu.ac.il/~beimel/pub.html
3. Beimel, A., Weinreb, E.: Monotone circuits for weighted threshold functions (2004) (in preparation)
4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for noncryptographic fault-tolerant distributed computations. In: 20th STOC, pp. 1–10 (1988)
5. Lecture Notes in Computer Science;J.C. Benaloh,1990
Cited by
21 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献