Universal classes of hash functions

Cites Work

Title not available (Why is that?)
A Fast Monte-Carlo Test for Primality
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)

Cited In (only showing first 100 items - show all)

On the relationships between perfect nonlinear functions and universal hash families
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
Sparser Johnson-Lindenstrauss transforms
Randomness in interactive proofs
Attacks on quantum key distribution protocols that employ non-ITS authentication
The universality of iterated hashing over variable-length strings
A practical protocol for three-party authenticated quantum key distribution
MMH* with arbitrary modulus is always almost-universal
Quantum readout of physical unclonable functions
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Deterministic extractors for small-space sources
Pseudorandom generators from regular one-way functions: new constructions with improved parameters
Pseudorandom generators for space-bounded computation
\(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
\(\text{RL}\subseteq \text{SC}\)
New hash functions and their use in authentication and set equality
Recognizing Hamming graphs in linear time and space
Quantum Key Distribution
Low-contention data structures
Optimal encoding of non-stationary sources
Optimal proof systems imply complete sets for promise classes
Related-key almost universal hash functions: definitions, constructions and applications
A new multistage approach to detect subtle DDoS attacks
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
Fast Evaluation of Union-Intersection Expressions
Min-wise independent permutations
Structures and lower bounds for binary covering arrays
Hierarchical sampling from sketches: Estimating functions over data streams
How to emulate shared memory
Statistical zero-knowledge languages can be recognized in two rounds
A probabilistic distributed algorithm for set intersection and its analysis
Practical and provably-secure commitment schemes from collision-free hashing
Revisiting iterated attacks in the context of decorrelation theory
Secure two-party computation via cut-and-choose oblivious transfer
MMH: Software message authentication in the Gbit/second rates
Polynomial hash functions are reliable (extended abstract)
Finding extremal sets in less than quadratic time
The computational complexity of universal hashing
NP is as easy as detecting unique solutions
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
Exploiting storage redundancy to speed up randomized shared memory simulations
Approximate colored range and point enclosure queries
Approximating hyper-rectangles: Learning and pseudorandom sets
Cache-oblivious hashing
On the power of two-point based sampling
Efficient construction of a small hitting set for combinatorial rectangles in high dimension
Keyed hash functions
On a family of universal hash functions
Quantum blind signature with an offline repository
A trade-off between collision probability and key size in universal hashing using polynomials
Study on the security of the authentication scheme with key recycling in QKD
Error-bounded probabilistic computations between MA and AM
Sorting in linear time?
Index structures for fast similarity search for binary vectors
THE PHYSICS OF QUANTUM INFORMATION: COMPLEMENTARITY, UNCERTAINTY, AND ENTANGLEMENT
Approximation in (Poly-) Logarithmic Space
Quantum hashing via \(\epsilon\)-universal hashing constructions and classical fingerprinting
Using quantum key distribution for cryptographic purposes: a survey
Direct proof of security of Wegman-Carter authentication with partially known key
Efficient PRAM simulation on a distributed memory machine
A sample of samplers: a computational perspective on sampling
Model counting meets \(F_0\) estimation
Simulating BPP using a general weak random source
On the complexity of computational problems regarding distributions
On the state of strength-three covering arrays
RESPONSE TO "VULNERABILITY OF 'A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE-MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY'"
Modes of operations for encryption and authentication using stream ciphers supporting an initialisation vector
On quasilinear-time complexity theory
Optimal bounds for the predecessor problem and related problems
On hiding information from an oracle
Universal hashing and authentication codes
Combinatorial techniques for universal hashing
A new multi-linear universal hash family
Graph isomorphism is in the low hierarchy
One-way protocol for two-bit intrinsic random key distribution with entangled photon pairs
On weak keys and forgery attacks against polynomial-based MAC schemes
New approaches for deniable authentication
Protocols for asymmetric communication channels
On the theory of average case complexity
Perfect hashing
A NOVEL PROTOCOL-AUTHENTICATION ALGORITHM RULING OUT A MAN-IN-THE MIDDLE ATTACK IN QUANTUM CRYPTOGRAPHY
Quantum key evolution and its applications
Entanglement of the antisymmetric state
SECURITY OF QUANTUM KEY DISTRIBUTION
Approximation in (poly-) logarithmic space
Quantum algorithms for the \(k\)-XOR problem
Improved behaviour of tries by adaptive branching
Composable Security in the Bounded-Quantum-Storage Model
HalftimeHash: modern hashing without 64-bit multipliers or finite fields
On the (Im-)Possibility of Extending Coin Toss
New proofs for NMAC and HMAC: security without collision resistance
Clocked adversaries for hashing
Universal Hashing via Integer Arithmetic Without Primes, Revisited
On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
Using multiset discrimination to solve language processing problems without hashing
Variationally universal hashing
The generation of random permutations on the fly
On the relationship between statistical zero-knowledge and statistical randomized encodings
On the relationship between statistical zero-knowledge and statistical randomized encodings
Tweak-length extension for tweakable blockciphers

This page was built for publication: Universal classes of hash functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1259907)