Universal classes of hash functions
From MaRDI portal
Publication:1259907
DOI10.1016/0022-0000(79)90044-8zbMATH Open0412.68090OpenAlexW2052207834WikidataQ29542266 ScholiaQ29542266MaRDI QIDQ1259907FDOQ1259907
Authors: J. Lawrence Carter, Mark N. Wegman
Publication date: 1979
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-0000(79)90044-8
Information storage and retrieval of data (68P20) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)
Cites Work
Cited In (only showing first 100 items - show all)
- 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
- Breaking symmetric cryptosystems using quantum period finding
- Graphs, hypergraphs and hashing
- Universal hash functions for an infinite universe and hash trees
- The complexity of graph connectivity
- Secret sharing schemes with partial broadcast channels
- Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
- A derandomization using min-wise independent permutations
- 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
- Collision-free hashing from lattice problems
- Decoupling with unitary approximate two-designs
- A statistical analysis of probabilistic counting algorithms
- Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms
- New collapse consequences of NP having small circuits
- Measure-resend authenticated semi-quantum key distribution with single photons
- New techniques and tighter bounds for local computation algorithms
- Authenticating ad hoc networks by comparison of short digests
- A note on local randomness in polynomial random number and random function generators
- On the impossibility of highly-efficient blockcipher-based hash functions
- The optimal size of a signature
- Locating \(P\)/poly optimally in the extended low hierarchy
- Efficient bit sifting scheme of post-processing in quantum key distribution
- A caution on universal classes of hash functions
- Encryption modes with almost free message integrity
- Reducing complexity assumptions for statistically-hiding commitment
- Construction of a key-dependent message secure symmetric encryption scheme in the ideal cipher model
- Security Bounds for Quantum Cryptography with Finite Resources
- An improved version of cuckoo hashing: average case analysis of construction cost and search operations
- A note on universal classes of hash functions
- SAMPLING IN DYNAMIC DATA STREAMS AND APPLICATIONS
- An Improved Robust Fuzzy Extractor
- Parity graph-driven read-once branching programs and an exponential lower bound for integer multiplication
- Algorithms for parallel memory, I: Two-level memories
- On the complexity of counting in the polynomial hierarchy
- Bounds on the OBDD-size of integer multiplication via universal hashing
- Energy-efficient paths in radio networks
- Reliable communication over partially authenticated networks
- Boosting distinct random sampling for basic counting on the union of distributed streams
- On weak keys and forgery attacks against polynomial-based MAC schemes
- Sparser Johnson-Lindenstrauss transforms
- On the security of compressed encodings
- Efficient one-sided adaptively secure computation
- Approximation algorithms for multiple sequence alignment
- Sorting and searching revisted
- Fast rehashing in PRAM emulations
- Efficient robust secret sharing from expander graphs
- 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
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)