Universal classes of hash functions

Cites work

scientific article; zbMATH DE number 3709574 (Why is no real title available?)
scientific article; zbMATH DE number 3709575 (Why is no real title available?)
scientific article; zbMATH DE number 3473265 (Why is no real title available?)
scientific article; zbMATH DE number 3557236 (Why is no real title available?)
scientific article; zbMATH DE number 3596285 (Why is no real title available?)
scientific article; zbMATH DE number 3597592 (Why is no real title available?)
scientific article; zbMATH DE number 3449757 (Why is no real title available?)
A Fast Monte-Carlo Test for Primality

Cited in

(only showing first 100 items - show all)

Optimal Broadcast with Partial Knowledge
Sorting and searching revisted
On the relationships between perfect nonlinear functions and universal hash families
Approximation in (poly-) logarithmic space
Entanglement of the antisymmetric state
Quantum algorithms for the \(k\)-XOR problem
SECURITY OF QUANTUM KEY DISTRIBUTION
The circulant hash revisited
Randomness in interactive proofs
Device-independent oblivious transfer from the bounded-quantum-storage-model and computational assumptions
On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes
Коды аутентификации с секретностью (обзор)
Sparser Johnson-Lindenstrauss transforms
Improved behaviour of tries by adaptive branching
Evaluating Bernstein-Rabin-Winograd polynomials
The complexity of generating test instances
Attacks on quantum key distribution protocols that employ non-ITS authentication
Error correction in quantum cryptography based on artificial neural networks
Quantum key distribution using universal hash functions over finite fields
HalftimeHash: modern hashing without 64-bit multipliers or finite fields
Composable Security in the Bounded-Quantum-Storage Model
On the (im-)possibility of extending coin toss
MRD hashing.
New proofs for NMAC and HMAC: security without collision resistance
On the (Im-)Possibility of Extending Coin Toss
On ``the power of verification queries in unconditionally secure message authentication
Clocked adversaries for hashing
Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme
The universality of iterated hashing over variable-length strings
A practical protocol for three-party authenticated quantum key distribution
Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
MMH* with arbitrary modulus is always almost-universal
Optimizing the decoy-state BB84 QKD protocol parameters
Universal Hashing via Integer Arithmetic Without Primes, Revisited
One-way functions and the hardness of (probabilistic) time-bounded Kolmogorov complexity w.r.t. samplable distributions
A lattice-based certificateless public key encryption with equality test in standard model
Shannon entropy versus Renyi entropy from a cryptographic viewpoint
Asymmetric ``4+2 protocol for quantum key distribution with finite resources
Quantum readout of physical unclonable functions
Using multiset discrimination to solve language processing problems without hashing
On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
Weak-key and related-key analysis of hash-counter-hash tweakable enciphering schemes
On selectable collisionful hash functions
General constructions of fuzzy extractors for continuous sources
Variationally universal hashing
Fuzzy universal hashing and approximate authentication
On the construction of \((n,k)\)-schemes of visual cryptography using a class of linear hash functions over a binary field
Multi-partite squash operation and its application to device-independent quantum key distribution
Dynamic Routing and Location Services in Metrics of Low Doubling Dimension
Deterministic extractors for small-space sources
The generation of random permutations on the fly
Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security
Pseudorandom generators from regular one-way functions: new constructions with improved parameters
Pseudorandom generators for space-bounded computation
Contributory password-authenticated group key exchange with join capability
On the relationship between statistical zero-knowledge and statistical randomized encodings
Universal hash functions for an infinite universe and hash trees
On the relationship between statistical zero-knowledge and statistical randomized encodings
Optimal Broadcast with Partial Knowledge
On \(b\)-bit min-wise hashing for large-scale regression and classification with sparse data
\(\text{BP}_{\text{H}}\text{SPACE}(S) \subseteq \text{DSPACE}(S^{3/2})\)
Breaking symmetric cryptosystems using quantum period finding
Secret sharing schemes with partial broadcast channels
Privacy amplification with asymptotically optimal entropy loss
\texttt{Sample(x)=(a*x<=t)} is a distinguisher with probability \(1/8\)
Tweak-length extension for tweakable blockciphers
From non-adaptive to adaptive pseudorandom functions
\(\text{RL}\subseteq \text{SC}\)
New hash functions and their use in authentication and set equality
Recognizing Hamming graphs in linear time and space
Graphs, hypergraphs and hashing
The complexity of graph connectivity
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
The effect of side-information on smooth entropy.
Non-cryptographic primitive for pseudorandom permutation.
On the Circuit Complexity of Perfect Hashing
A derandomization using min-wise independent permutations
On rate-1 and beyond-the-birthday bound secure online ciphers using tweakable block ciphers
Quantum Key Distribution
Cryptanalysis and improvement in multi-party quantum key distribution protocol with new Bell states encoding mode
Low-contention data structures
Improved Explicit Hitting-Sets for ROABPs
A construction method for optimally universal hash families and its consequences for the existence of RBIBDs
Sharp lower bounds on the extractable randomness from non-uniform sources
Optimal proof systems imply complete sets for promise classes
Collision-free hashing from lattice problems
Optimal encoding of non-stationary sources
Related-key almost universal hash functions: definitions, constructions and applications
Simple fast parallel hashing
On privacy-preserving biometric authentication
A new multistage approach to detect subtle DDoS attacks
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
Linear hashing is awesome
Efficient beyond-birthday-bound-secure deterministic authenticated encryption with minimal stretch
Decoupling with unitary approximate two-designs
A statistical analysis of probabilistic counting algorithms
Improving compressed matrix multiplication using control variate method
Practically efficient private set intersection from trusted hardware with side-channels
A new authenticated encryption mode for arbitrary block cipher based on universal hash function
Three‐wise independent random walks can be slightly unbounded

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)