Author:
Desmedt Yvo,Safavi-Naini Rei,Wang Huaxiong,Batten Lynn,Charnes Chris,Pieprzyk Josef
Subject
Computer Networks and Communications
Reference28 articles.
1. Some recursive constructions for perfect hash families;Atici;Journal of Combinatorial Designs,1996
2. Derandomization witnesses for Boolean matrix multiplication and construction of perfect hash functions;Alon;Algorithmica,1996
3. Design Theory;Beth,1986
4. S.R. Blackburn, Combinatorics and threshold cryptology, in: Combinatorial Designs and their Applications, Chapman and Hall/CRC Research Notes in Mathematics, CRC Press, London, 1999, 49–70
5. S.R. Blackburn, M. Burmester, Y. Desmedt, P.R. Wild, Efficient multiplicative sharing schemes, in: Advances in Cryptology–Eurocrypt '96, Lecture Notes in Computer Science, vol. 1070, Springer, Berlin, 1996, pp. 107–118
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献