Author:
Blundo Carlo,D'Arco Paolo,Daza Vanessa,Padró Carles
Subject
General Computer Science,Theoretical Computer Science
Reference42 articles.
1. A. Beimel, Secure schemes for secret sharing and key distribution, Ph.D. Thesis, Department of Computer Science, Technion, 1996.
2. A. Beimel, A. Gal, M. Paterson, Lower bounds for monotone span programs, Proc. 35th IEEE Symp. on Foundations of Computer Science, 1995, pp. 674–681.
3. M. Bellare, P. Rogaway, Provably secure session key distribution: the three party case, Proc. 27th Annu. Symposium on the Theory of Computing, ACM, 1995, pp. 57–66.
4. J. Benaloh, J. Leichter, Generalized secret sharing and monotone functions, Lecture Notes in Computer Science, Vol. 403, Springer, Berlin, 1990, pp. 27–35.
5. G.R. Blakley. Safeguarding cryptographic keys, Proc. AFIPS 1979 National Computer Conference, Vol. 48, 1979, pp. 313–317.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献