Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
- 11 August 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 533-543
- https://doi.org/10.1007/3-540-44598-6_33
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- On Families of Hash Functions via Geometric Codes and ConcatenationPublished by Springer Science and Business Media LLC ,2001
- Universal Hashing and Geometric CodesDesigns, Codes and Cryptography, 1997
- Oblivious transfers and intersecting codesIEEE Transactions on Information Theory, 1996
- Subquadratic zero-knowledgeJournal of the ACM, 1995
- Intersecting codes and independent familiesIEEE Transactions on Information Theory, 1994
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- Group codes on certain algebraic curves with many rational pointsApplicable Algebra in Engineering, Communication and Computing, 1990
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979
- Class of constructive asymptotically good algebraic codesIEEE Transactions on Information Theory, 1972
- Bounds for exponential sumsDuke Mathematical Journal, 1957