The computational complexity of universal hashing
Theoretical Computer Science - Special issue on structure in complexity theory
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
On families of hash functions via geometric codes and concatenation
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Universal Hashing and Authentication Codes
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
LFSR-based Hashing and Authentication
CRYPTO '94 Proceedings of the 14th Annual International Cryptology Conference on Advances in Cryptology
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
Simple construction of almost k-wise independent random variables
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
SQUARE HASH: Fast Message Authenication via Optimized Universal Hash Functions
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Universal Hashing and Multiple Authentication
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Cryptographic Primitives for Information Authentication - State of the Art
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Designs, Codes and Cryptography
Energy Scalable Universal Hashing
IEEE Transactions on Computers
Efficient reliable communication over partially authenticated networks
Distributed Computing - Special issue: PODC 02
Theoretical Computer Science - Computing and combinatorics
Authenticating ad hoc networks by comparison of short digests
Information and Computation
A fast real-time memory authentication protocol
Proceedings of the 3rd ACM workshop on Scalable trusted computing
A new hardware efficient stream cipher based on hash functions
International Journal of Communication Networks and Distributed Systems
Almost k-wise independent sample spaces and their cryptologic applications
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Software performance of universal hash functions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Square hash with a small key size
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
HB#: increasing the security and efficiency of HB+
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Authentication protocols based on low-bandwidth unspoofable channels: A comparative survey
Journal of Computer Security
E-MACs: towards more secure and more efficient constructions of secure channels
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Grain-128a: a new version of Grain-128 with optional authentication
International Journal of Wireless and Mobile Computing
The universality of iterated hashing over variable-length strings
Discrete Applied Mathematics
Error correction in the bounded storage model
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
New constructions of universal hash functions based on function sums
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
WEWoRC'11 Proceedings of the 4th Western European conference on Research in Cryptology
Short-Output universal hash functions and their use in fast and secure data authentication
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
On security of universal hash function based multiple authentication
ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Tree-LSHB+: An LPN-Based Lightweight Mutual Authentication RFID Protocol
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We show that Toeplitz matrices generated by sequences drawn from small biased distributions provide hashing schemes applicable to secure message authentication. This work extends our previous results from Crypto'94 [4] where an authentication scheme based on Toeplitz matrices generated by linear feedback shift registers was presented. Our new results have as special case the LFSR-based construction but extend to a much wider and general family of sequences, including several simple and efficient constructions with close to optimal security. Examples of the new constructions include Toeplitz matrices generated by the Legendre symbols of consecutive integers modulo a prime (of size significantly shorter than required by public-key modular arithmetic) as well as other algebraic constructions. The interest of these schemes extends beyond the proposed cryptographic applications to other uses of universal hashing (including other cryptographic applications).