Explicit Constructions of Perfect Hash Families from Algebraic Curves over Finite Fields

Journal of Combinatorial Theory. Series A

Volumn 93, Issue 1, 2001, Pages 112-124

  Wang, Huaxiong ^a   Xing, Chaoping ^b  

^a UNIVERSITY OF WOLLONGONG   (Australia)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Algebraic curves; Cover free family; Perfect hash family

Indexed keywords

EID: 0042322434     PISSN: 00973165     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcta.2000.3068     Document Type: Article

References (22)

1. Alon N. Explicit construction of exponential sized families of k-independent sets. Discrete Math. 58:1986;191-193.
2. Alon N., Naor M. Derandomization, witnesses for Boolean matrix multiplication and construction of perfect hash functions. Algorithmica. 16:1996;434-449.
3. Atici M., Magliveras S. S., Stinson D. R., Wei W. D. Some recursive constructions for perfect hash families. J. Combin. Des. 4:1996;353-363.
4. Blackburn S. R. Combinatorics and threshold cryptology. Combinatorial Designs and Their Applications. CRC Research Notes in Mathematics. 1999;CRC Press, London. p. 49-70.
5. Blackburn S. R., Burmester M., Desmedt Y., Wild P. R. Efficient multiplicative sharing schemes. Advance in Cryptology-Eurocrypt '96. Lecture Notes in Comput. Sci. 1070:1996;Springer-Verlag, New York/Berlin. p. 107-118.
6. Blackburn S. R., Wild P. R. Optimal linear perfect hash families. J. Combin. Theory Ser. A. 83:1998;233-250.
7. E. F. Brickell, A problem in broadcast encryption, in, 5th Vermont Summer Workshop on Combinatorics and Graph Theory, June 1991.
8. Czech Z. J., Havas G., Majewski B. S. Perfect hashing. Theoret. Comput. Sci. 182:1997;1-143.
9. Dyer M., Fenner T., Frieze A., Thomason A. On key storage in secure networks. J. Cryptology. 8:1995;189-200.
10. Erdos P., Frankl P., Furedi Z. Families of finite sets in which no set is covered by the union of r others. Israel J. Math. 51:1985;79-89.
11. Fiat A., Naor M. Broadcast encryption. Advances in Cryptology-Crypto '93. 1994;Springer-Verlag, New York/Berlin. p. 480-491.
12. Fredman M. L., Komlòs J. On the size of separating systems and families of perfect hash functions. SIAM J. Algebraic Discrete Methods. 5:1984;61-68.
13. Garcia A., Stichtenoth H. On the asymptotic behavior of some towers of function fields over finite fields. J. Number Theory. 61:1996;248-273.
14. Gong L., Wheeler D. J. A matrix key-distribution scheme. J. Cryptology. 2:1990;51-59.
15. Kautz W. H., Singleton R. C. Nonrandom binary superimposed codes. IEEE Trans. Inform. Theory. 10:1964;363-377.
16. Mehlhorn K. Data Structures and Algorithms. 1984;Springer-Verlag, New York/Berlin.
17. Mitchell C. J., Piper F. C. Key storage in secure networks. Discrete Appl. Math. 21:1988;215-228.
18. J.-P. Serre, Rational points on curves over finite fields, lecture notes, Harvard University, 1985.
19. Stichtenoth H. Algebraic Function Fields and Codes. 1993;Springer-Verlag, Berlin.
20. D. R. Stinson, T. van Trung, and, R. Wei, Secure frameproof codes, key distribution patterns, group testing algorithms and related structures, J. Statist. Plann. Inference, in press.
21. D. S. Stinson, R. Wei, and, L. Zhu, New constructions for perfect hash families and related structures using combinatorial designs and codes, J. Combin. Des, in press.
22. Tsfasman M. A., Vladut S. G. Algebraic-Geometric Codes. 1991;Kluwer Academic, Dordrecht.